Edge-Aware Stereo Matching with O(1) Complexity

2012-01-26
Cigla, Cevahir
Alatan, Abdullah Aydın
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 integration approach by weighted and connected support regions. The proposed approach exploits a new paradigm, separable successive weighted summation (SWS), among horizontal and vertical directions enabling constant operational complexity for adaptive filtering, as well as providing connected 2D support regions. Once aggregation of the cost values for each disparity candidate is performed independently, minimization is achieved by winner-take-all approach. The same procedure is also utilized to diffuse information through overlapped pixels during occlusion handling, after detecting unreliable disparity assignments. According to the experimental results on Middlebury stereo benchmark, the proposed method outperforms the state-of-the-art local methods in terms of precision and computational efficiency through unifying constant time filtering and weighted aggregation.

Suggestions

Information permeability for stereo matching
Cigla, Cevahir; Alatan, Abdullah Aydın (Elsevier BV, 2013-10-01)
A novel local stereo matching algorithm is introduced to address the fundamental challenge of stereo algorithms, accuracy and computational complexity dilemma. The time consuming intensity dependent aggregation procedure of local methods is improved in terms of both speed and precision. Providing connected 2D support regions, the proposed approach exploits a new paradigm, namely separable successive weighted summation (SWS) among horizontal and vertical directions enabling constant operational complexity. T...
Feature extraction from acoustic and hyperspectral data by 2d local discriminant bases search
Kalkan, Habil; Kalkan, Habil; Department of Information Systems (2008)
In this thesis, a feature extraction algorithm based on 2D Local Discriminant Bases (LDB) search is developed for acoustic and hyperspectral data. The developed algorithm extracts the relevant features by both eliminating the irrelevant ones and/or by merging the ones that do not provide extra information on their own. It is implemented on real world data to separate aflatoxin contaminated or high risk hazelnuts from the sound ones by using impact acoustic and hyperspectral data. Impact acoustics data is us...
Inverse design of compressor cascades
Kaplan, B.; Eyi, Sinan (2001-12-01)
In this paper an inverse design method is presented which couples a Navier-Stokes flow solver and a numerical optimization algorithm. The design method generates a compressor cascade, producing a specified surface pressure distribution at a transonic speed. A least-square optimization technique is used to minimize pressure discrepancies between the target and designed cascades. In order to represent the nonlinear, rotational and viscous physics of transonic flows, Navier-Stokes equations are used to predict...
PARALLEL MULTILEVEL FAST MULTIPOLE ALGORITHM FOR COMPLEX PLASMONIC METAMATERIAL STRUCTURES
Ergül, Özgür Salih (2013-11-09)
A parallel implementation of the multilevel fast multipole algorithm (MLFMA) is developed for fast and accurate solutions of electromagnetics problems involving complex plasmonic metamaterial structures. Composite objects that consist of multiple penetrable regions, such as dielectric, lossy, and plasmonic parts, are formulated rigorously with surface integral equations and solved iteratively via MLFMA. Using the hierarchical strategy for the parallelization, the developed implementation is capable of simul...
Waterfall region analysis for iterative decoding
Yılmaz, Ali Özgür (2004-12-01)
Finite length analysis of iterative decoders can be done by using probabilistic models based on EXIT charts. The validity of these models will be investigated by checking the performance of iterative decoding under various scenarios.
Citation Formats
C. Cigla and A. A. Alatan, “Edge-Aware Stereo Matching with O(1) Complexity,” 2012, vol. 8290, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36622.