%0 Conference Paper %1 Palou2012g %A Palou, Guillem %A Salembier, Philippe %B IEEE ICIP %D 2012 %K imported %P 1217--1220 %R 10.1109/ICIP.2012.6467085 %T Depth ordering on image sequences using motion occlusions %U http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6467085&contentType=Conference+Publications&matchBoolean=true&searchField=Search\_All&queryText=(palou+frames) %X 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. %@ 978-1-4673-2533-2

@inproceedings{Palou2012g, 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.}, added-at = {2013-09-29T14:16:50.000+0200}, author = {Palou, Guillem and Salembier, Philippe}, biburl = {https://www.bibsonomy.org/bibtex/26d1f069864e5e1a61da4a690a1464c6a/guillem.palou}, booktitle = {IEEE ICIP}, doi = {10.1109/ICIP.2012.6467085}, file = {:Users/guillem/Documents/Doctorat/Docs/Publications/ICIP 2012/icip2012.pdf:pdf}, interhash = {890b09852c889b25f676339c1ec23409}, intrahash = {6d1f069864e5e1a61da4a690a1464c6a}, isbn = {978-1-4673-2533-2}, keywords = {imported}, pages = {1217--1220}, timestamp = {2013-09-29T14:16:50.000+0200}, title = {{Depth ordering on image sequences using motion occlusions}}, url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=\&arnumber=6467085\&contentType=Conference+Publications\&matchBoolean=true\&searchField=Search\_All\&queryText=(palou+frames)}, year = 2012 }