Occlusion-based depth ordering on monocular images with binary partition tree
Tipus de documentText en actes de congrés
Condicions d'accésAccés restringit per política de l'editorial
This paper proposes a system to relate objects in an image using occlusion cues and arrange them according to depth. The system does not rely on any a priori knowledge of the scene structure and focuses on detecting specific points, such as T-junctions, to infer the depth relationships between objects in the scene. The system makes extensive use of the Binary Partition Tree (BPT) as the segmentation tool jointly with a new approach for T-junction estimation. Following a bottom-up strategy, regions (initially individual pixels) are iteratively merged until only one region is left. At each merging step, the system estimates the probability of observing a T-junction which is a cue of occlusion when three regions meet. When the BPT is constructed and the pruning is performed, this information is used for depth ordering. Although the proposed system only relies on one low-level depth cue and does not involve any learning process, it shows similar performances than the state of the art.
CitacióPalou, G.; Salembier, P. Occlusion-based depth ordering on monocular images with binary partition tree. A: IEEE International Conference on Acoustics, Speech and Signal Processing. "Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on". 2011, p. 1093-1096.
Versió de l'editorhttp://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5946598&tag=1