Abstract
This paper proposes a system to depth order regions of a frame belonging to a monocular image sequence. For a given frame, regions are ordered according to their relative depth using the previous and following frames. The algorithm estimates occluded and disoccluded pixels belonging to the central frame. Afterwards, a Binary Partition Tree (BPT) is constructed to obtain a hierarchical, region based representation of the image. The final depth partition is obtained by means of energy minimization on the BPT. To achieve a global depth ordering from local occlusion cues, a depth order graph is constructed and used to eliminate contradictory local cues. Results of the system are evaluated and compared with state of the art figure/ground labeling systems on several datasets, showing promising results. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Palou, G., & Salembier, P. (2012). 2.1 Depth estimation of frames in image sequences using motion occlusions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7585 LNCS, pp. 516–525). Springer Verlag. https://doi.org/10.1007/978-3-642-33885-4_52
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.