Paper Info
Title
Depth ordering on image sequences using motion occlusions
Abstract
This paper proposes a system to obtain the depth order of frames in image sequences using motion occlusion cues. The system first computes the forward and backward flows with the previous and next frames and estimates the occluded points. To obtain a region representation of the image, a Binary Partition Tree (BPT) is created for each frame. To estimate occlusion relations in the image, projective flow models are fitted to all regions in the image. The depth order solution is obtained by minimizing over the tree structure a cost function based on occlusion relations and the number of regions. Results show that optical flow algorithms can be used directly to estimate occlusion points. Promising results are obtained combining motion occlusions and region information by means of a BPT. Evaluation is performed comparing current state-of-the-art algorithms on figure/ground assignments, showing that the performance of the proposed system is comparable to current algorithms.
Year
DOI
Venue
2012
10.1109/ICIP.2012.6467085
Image Processing
Keywords
DocType
ISSN
computer graphics,image motion analysis,image representation,image sequences,trees (mathematics),BPT,backward flows,binary partition tree,cost function minimization,depth ordering,figure assignments,forward flows,ground assignments,image region representation,image sequences,motion occlusion cues,occluded point estimation,optical flow algorithms,projective flow models,Optical flow,binary partition tree,depth ordering,occlusion
Conference
1522-4880 E-ISBN : 978-1-4673-2532-5
ISBN
Citations 
PageRank 
978-1-4673-2532-5
2
0.37
References 
Authors
9
2
Name
Order
Citations
PageRank
Guillem Palou1141.72
Philippe Salembier260387.65