A new level-set based algorithm for bimodal depth segmentation

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

A new level-set based algorithm for bimodal depth segmentation

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

A new level-set based algorithm for bimodal depth segmentation

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2012

Kód důvěrnosti údajů

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

Název statě ve sborníku

Lecture Notes in Computer Science. Volume 7517

ISBN

978-3-642-33139-8

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

12

Strana od-do

225-236

Název nakladatele

Springer

Místo vydání

Berlin

Místo konání akce

Brno

Datum konání akce

4. 9. 2012

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—