Efficient Edge-Preserving Stereo Matching

Date

2011-11-13

Author

Cigla, Cevahir
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

135
views

0
downloads

A computationally efficient stereo matching algorithm is introduced providing high precision dense disparity maps via local aggregation approach. The proposed algorithm exploits a novel paradigm, namely separable successive weighted summation (SWS) among horizontal and vertical directions with constant operational complexity, providing effective connected 2D support regions based on local color similarities. The intensity adaptive aggregation enables crisp disparity maps which preserve object boundaries and depth discontinuities. The same procedure is also utilized to diffuse information through overlapped pixels during occlusion handling. According to the experimental results on Middlebury online stereo benchmark, the proposed method is one of the most effective local stereo algorithm providing high quality disparity models by unifying constant time filtering and weighted aggregation. Hence, the proposed algorithm provides a competitive alternative, with its efficient GPU and FPGA implementations, for various local methods in terms of achieving precise disparity maps from stereo video within fast execution time.

Subject Keywords

Permeability, Filtering, Algorithm design and analysis, Field programmable gate arrays, Graphics processing unit, Complexity theory, Stereo vision

URI

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

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

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...
Efficient User Grouping for Hybrid Beamforming in Single Carrier Wideband Massive MIMO Channels Kilcioglu, Emre; Güvensen, Gökhan Muzaffer (2021-01-01) In this paper, three types of user grouping algorithms in which our own performance metric is utilized are investigated for single carrier downlink wideband spatially correlated massive MIMO channels by using hybrid beamforming structure motivated by the joint spatial division and multiplexing (JSDM) framework. The user grouping procedure consists of two stages. Internally, our own metric called as the achievable information rate (AIR) is calculated given a user grouping input by considering both inter-grou...
Efficient Bayesian track-before-detect Tekinalp, Serhat; Alatan, Abdullah Aydın (2006-10-11) This paper presents a novel Bayesian recursive track-before-detect (TBD) algorithm for detection and tracking of dim targets in optical image sequences. The algorithm eliminates the need for storing past observations by recursively incorporating new data acquired through sensor to the existing information. It calculates the likelihood ratio for optimal detection and estimates target state simultaneously. The technique does not require velocity-matched filtering and hence, it is capable of detecting any targ...
Subcarrier allocation in OFDMA with time varying channel and packet arrivals Toktas, Engin; Uysal-Biyikoglu, Elif; Yılmaz, Ali Özgür (2009-12-01) This study considers the design of efficient low-complexity algorithms for dynamic allocation of subcarriers to users in a multiuser transmitter using Orthogonal Frequency Division. The effects upon throughput and delay performances of several canonical algorithms of varying the number of users, the number of subcarriers, and the statistical characteristics of incoming packets are investigated. Consequently, a subcarrier allocation algorithm with low computational complexity and satisfactory performance in ...
Efficient Surface Integral Equation Methods for the Analysis of Complex Metamaterial Structures Yla-Oijala, Pasi; Ergül, Özgür Salih; Gurel, Levent; Taskinen, Matti (2009-03-27) Two approaches, the multilevel fast multipole algorithm with sparse approximate inverse preconditioner and the surface equivalence principle algorithm, are applied to analyze complex three-dimensional metamaterial structures. The efficiency and performance of these methods are studied and discussed.

Citation Formats

C. Cigla and A. A. Alatan, “Efficient Edge-Preserving Stereo Matching,” 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/54676.