Sparse recursive filtering for O 1 stereo matching

Date

2015-09-30

Author

Gürbüz, Yeti Ziya
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

168
views

0
downloads

Recursive edge-aware filters have been proved to be one of the most efficient approaches for cost aggregation in stereo matching. However, disparity search space dependency, as a result of full search, is the bottle-neck of these local techniques that prevent further reduction in computation. In this paper, the cost aggregation and correspondence search problems are re-formulated to enable adaptive search for each pixel during recursive operations that provides significant reduction in computational complexity. In that manner, fixed number of disparity candidates are tested for each pixel, regardless of the search space, that are aggregated through sparse recursive filtering. Hierarchical approach is exploited to pick disparity candidates for each pixel. The experimental results show that the proposed approach has linear complexity with the image size and in practice it speeds up the recursive approaches almost four times with a marginal decrease in matching accuracy. Compared to the state-of-the-art techniques, hierarchical sparse recursive aggregation is possibly the fastest approach with a competitive accuracy based on Middlebury benchmarking.

Subject Keywords

O(1) stereo matching, Predictive filtering, Hierarchical stereo matching, Recursive cost aggregation

URI

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

Conference Name

IEEE International Conference on Image Processing (ICIP)

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

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...
Fast, efficient and dynamically optimized data and hardware architectures for string matching Zengin, Salih; Güran, Hasan Cengiz; Schmidt, Şenan Ece; Department of Electrical and Electronics Engineering (2014) Many fields of computing such as network intrusion detection employ string matching modules (SMM) that search for a given set of strings in their input. An SMM is expected to produce correct outcomes while scanning the input data at high rates. Furthermore, the string sets that are searched for are usually large and their sizes increase steadily. In this thesis, motivated by the requirement of designing fast, accurate and efficient SMMs; we propose a number of SMM architectures that employ Bloom Filters to ...
Space-bandwidth-efficient realizations of linear systems KUTAY, MA; ERDEN, MF; OZAKTAS, HM; ARIKAN, O; GULERYUZ, O; Candan, Çağatay (The Optical Society, 1998-07-15) One can obtain either exact realizations or useful approximations of linear systems or matrix-vector products that arise in many different applications by implementing them in the form of multistage or multichannel fractional Fourier-domain filters, resulting in space-bandwidth-efficient systems with acceptable decreases in accuracy. Varying the number and the configuration of filters enables one to trade off between accuracy and efficiency in a flexible manner. The proposed scheme constitutes a systematic ...
Cluster searching strategies for collaborative recommendation systems Altıngövde, İsmail Sengör; Ulusoy, Ozgur (2013-05-01) In-memory nearest neighbor computation is a typical collaborative filtering approach for high recommendation accuracy. However, this approach is not scalable given the huge number of customers and items in typical commercial applications. Cluster-based collaborative filtering techniques can be a remedy for the efficiency problem, but they usually provide relatively lower accuracy figures, since they may become over-generalized and produce less-personalized recommendations. Our research explores an individua...

Citation Formats

Y. Z. Gürbüz and A. A. Alatan, “Sparse recursive filtering for O 1 stereo matching,” presented at the IEEE International Conference on Image Processing (ICIP), Quebec City, CANADA, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55967.