Depth ordering on image sequences using motion occlusions
Document typeConference report
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Rights accessRestricted access - publisher's policy
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.
CitationPalou, G.; Salembier, P. Depth ordering on image sequences using motion occlusions. A: IEEE International Conference on Image Processing. "Proceedings ICIP'2012: IEEE International Conference on Image Proceesing: September 30-October 3, 2012, Lake Buena Vista, Florida, USA". Olrando, Florida: Institute of Electrical and Electronics Engineers (IEEE), 2012, p. 1217-1220.
|ICIP2012_Palou_Salembier.pdf||Article principal||5,419Mb||Restricted access|