Segment-based stereo-matching via plane and angle sweeping

Date

2007-01-01

Author

Cigla, Cevahir
Zabulis, Xenophon
Alatan, Abdullah Aydın

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

95
views

0
downloads

A novel approach for segment-based stereo matching problem is presented, based on a modified plane-sweeping strategy. The space is initially divided into planes that are located at different depth levels via plane sweeping by the help of region-wise planarity assumption for the scene. Over-segmented homogenous color regions are utilized for defining planar segment boundaries and plane equations are determined by angle sweeping at different planes. The robustness of depth map estimates is improved by warping segments into the other image via the resulting homographies. In order to refine the reconstruction quality and update segment depths, as well as plane normals, with smoothness and visibility constraints, a greedy search algorithm is applied. Based on the simulation results, the proposed algorithm handles large un-textured regions, depth discontinuities at object boundaries and slanted surfaces. Moreover, the algorithm could be easily upgraded from stereo to multi-view case, since 3D plane equations are already determined.

Subject Keywords

Angle sweeping, Plane sweeping, Segment based stereo matching

URI

https://hdl.handle.net/11511/47196

DOI

https://doi.org/10.1109/3dtv.2007.4379465

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Region-based dense depth extraction from multi-view video Cigla, Cevahir; Zabulis, Xenophon; Alatan, Abdullah Aydın (2007-09-19) A novel multi-view region-based dense depth map estimation problem is presented, based on a modified plane-sweeping strategy. In this approach, the whole scene is assumed to be region-wise planar. These planar regions are defined by back-projections of the over-segmented homogenous color regions on the images and the plane parameters are determined by angle-sweeping at different depth levels. The position and rotation of the plane patches are estimated robustly by minimizing a segment-based cost function, w...
Sparse Recursive Cost Aggregation Towards O(1) Complexity Local Stereo Matching Gürbüz, Yeti Ziya; Alatan, Abdullah Aydın (2015-05-19) The complexity of the local stereo matching methods mainly increases with disparity search range and cost aggregation step. Joint elimination of the those complexity factors is a challenging task as a consequence of the contradicting nature of the methods attacking the reduction on the complexity factors. In this paper, that challenge is addressed and for the disparity search range reducing approaches, an efficient cost aggregation method is proposed by reformulating the filtering scheme of the recursive ed...
Occlusion aware stereo matching with o(1) complexity / Gürbüz, Yeti Ziya; Alatan, Abdullah Aydın; Department of Electrical and Electronics Engineering (2014) The problem of joint reduction of computational complexities of local stereo matching methods due to both cost aggregation step and correspondence search range is addressed and a novel hierarchical stereo matching algorithm is presented. The proposed approach exploits edge aware recursive volume filtering with a reduction on correspondence search range. The fastest state-of-the-art edge aware recursive filters are modified so that they become applicable to the methods to reduce the complexity in corresponde...
Edge-Aware Stereo Matching with O(1) Complexity Cigla, Cevahir; Alatan, Abdullah Aydın (2012-01-26) In this paper, a novel local stereo matching algorithm is introduced, providing precise disparity maps with low computational complexity. Following the common steps of local matching methods, namely cost calculation, aggregation, minimization and occlusion handling; the time consuming intensity dependent aggregation procedure is improved in terms of both speed and precision. For this purpose, a novel approach, denoted as permeability filtering (PF), is introduced, engaging computationally efficient two pass...
Frequency based target localization methods for MIMO radar Kalkan, Yılmaz; Baykal, Buyurman (null; 2011-04-22) A new frequency based target localization method is proposed for MIMO radars which are widely separated. The performance of this new method is compared with other frequency based target localization methods. For target localization, time of arrival (TOA), angle of arrival (AOA) and frequency of arrival (FOA) informations can be used in cooperation. In general, TOA information is enough to localize a target. However, when the time resolution of the transmitted signals is not enough or good,i.e.; unmodulated ...

Citation Formats

C. Cigla, X. Zabulis, and A. A. Alatan, “Segment-based stereo-matching via plane and angle sweeping,” 2007, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47196.