Welcome to the UPF Digital Repository

Monocular depth ordering using perceptual occlusion cues

Show simple item record

dc.contributor.author Rezaeirowshan, Babak
dc.contributor.author Ballester, Coloma
dc.contributor.author Haro Ortega, Gloria
dc.date.accessioned 2018-11-22T09:50:48Z
dc.date.available 2018-11-22T09:50:48Z
dc.date.issued 2016
dc.identifier.citation Rezaeirowshan B, Ballester C, Haro G. Monocular depth ordering using perceptual occlusion cues. In: Proceedings of the 11th Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISAPP) - Volume 4; 2016 Feb 27-29; Rome, Italy. Setúbal: Scitepress; 2016. p. 431-41. DOI: 10.5220/0005726404310441
dc.identifier.isbn 978-989-758-175-5
dc.identifier.uri http://hdl.handle.net/10230/35824
dc.description Comunicació presentada al congrés International Conference on Computer Vision Theory and Applications celebrat del 27 al 29 de febrer de 2016 a Roma, Itàlia.
dc.description.abstract In this paper we propose a method to estimate a global depth order between the objects of a scene using information from a single image coming from an uncalibrated camera. The method we present stems from early vision cues such as occlusion and convexity and uses them to infer both a local and a global depth order. Monocular occlusion cues, namely, T-junctions and convexities, contain information suggesting a local depth order between neighbouring objects. A combination of these cues is more suitable, because, while information conveyed by T-junctions is perceptually stronger, they are not as prevalent as convexity cues in natural images. We propose a novel convexity detector that also establishes a local depth order. The partial order is extracted in T-junctions by using a curvature-based multi-scale feature. Finally, a global depth order, i.e., a full order of all shapes that is as consistent as possible with the computed partial orders that can tolerate conflicting partial or ders is computed. An integration scheme based on a Markov chain approximation of the rank aggregation problem is used for this purpose. The experiments conducted show that the proposed method compares favorably with the state of the art.
dc.description.sponsorship The authors acknowledge partial support by MICINN project, reference MTM2012-30772, and by GRC reference 2014 SGR 1301, Generalitat de Catalunya.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.publisher SCITEPRESS – Science and Technology Publications, Lda.
dc.relation.ispartof Proceedings of the 11th Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISAPP) - Volume 4; 2016 Feb 27-29; Rome, Italy. Setúbal: Scitepress; 2016.
dc.rights © 2017 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved
dc.title Monocular depth ordering using perceptual occlusion cues
dc.type info:eu-repo/semantics/conferenceObject
dc.identifier.doi http://dx.doi.org/10.5220/0005726404310441
dc.subject.keyword Monocular depth
dc.subject.keyword Ordinal depth
dc.subject.keyword Depth layering
dc.subject.keyword Occlusion reasoning
dc.subject.keyword Convexity
dc.subject.keyword T-junctions
dc.subject.keyword Boundary ownership
dc.subject.keyword 2.1D
dc.rights.accessRights info:eu-repo/semantics/openAccess
dc.type.version info:eu-repo/semantics/publishedVersion


This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics

Compliant to Partaking