A new level-set based algorithm for bimodal depth segmentation

  • Authors:
  • Michal Krumnikl;Eduard Sojka;Jan Gaura

  • Affiliations:
  • Faculty of Electrical Engineering and Computer Science, VŠB - Technical University of Ostrava, Ostrava, Poruba, Czech Republic;Faculty of Electrical Engineering and Computer Science, VŠB - Technical University of Ostrava, Ostrava, Poruba, Czech Republic;Faculty of Electrical Engineering and Computer Science, VŠB - Technical University of Ostrava, Ostrava, Poruba, Czech Republic

  • Venue:
  • ACIVS'12 Proceedings of the 14th international conference on Advanced Concepts for Intelligent Vision Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a new algorithm for bimodal depth segmentation is presented. The method separates the background and the planar objects of arbitrary shapes lying in a certain height above the background using the information from the stereo image pair (more exactly, the background and the objects may lie on two distinct general planes). The problem is solved as a problem of minimising a functional. A new functional is proposed for this purpose that is based on evaluating the mismatches between the images, which contrasts with the usual approaches that evaluate the matches. We explain the motivation for such an approach. The minimisation is carried out by making use of the Euler-Lagrange equation and the level-set function. The experiments show the promising results on noisy synthetic images as well as on real-life images. An example of the practical application of the method is also presented.