Efficient Edge-Preserving Stereo Matching

2011-11-13
Cigla, Cevahir
Alatan, Abdullah Aydın
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.

Suggestions

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...
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...
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 ...
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.