A new level-set based algorithm for bimodal depth segmentation

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F12%3A86084672" target="_blank" >RIV/61989100:27240/12:86084672 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-642-33140-4_20" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-642-33140-4_20</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-33140-4_20" target="_blank" >10.1007/978-3-642-33140-4_20</a>

Result language
angličtina
Original language name
A new level-set based algorithm for bimodal depth segmentation
Original language description
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.
Czech name
—
Czech description
—

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)