Stereo depth estimation using synchronous optimization with segment based regularization

Authors:
Tarkan Aydin;Yusuf Sinan Akgul
Affiliations:
GIT Vision Lab, Department of Computer Engineering, Gebze Institute of Technology, Gebze, Kocaeli 41400, Turkey and Bahcesehir University, Istanbul 34353, Turkey;GIT Vision Lab, Department of Computer Engineering, Gebze Institute of Technology, Gebze, Kocaeli 41400, Turkey
Venue:
Pattern Recognition Letters
Year:
2010

Citing 25
Cited 0

Scale-Space and Edge Detection Using Anisotropic Diffusion

IEEE Transactions on Pattern Analysis and Machine Intelligence
Dense depth recovery from stereo images

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Disparity-space images and large occlusion stereo

ECCV '94 Proceedings of the third European conference on Computer Vision (Vol. II)
Application of genetic algorithms to stereo matching of images

Pattern Recognition Letters - Special issue on genetic algorithms
Stereo Matching with Nonlinear Diffusion

International Journal of Computer Vision
Fast Approximate Energy Minimization via Graph Cuts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Mean Shift: A Robust Approach Toward Feature Space Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms

International Journal of Computer Vision
A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment

IEEE Transactions on Pattern Analysis and Machine Intelligence
Dense Depth Map Reconstruction: A Minimization and Regularization Approach which Preserves Discontinuities

ECCV '96 Proceedings of the 4th European Conference on Computer Vision-Volume I - Volume I
Recovery and Tracking of Continuous 3D Surfaces from Stereo Data Using a Deformable Dual-Mesh

ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Stereo Matching Using Belief Propagation

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem

ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Bilateral Filtering for Gray and Color Images

ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
What Energy Functions Can Be Minimizedvia Graph Cuts?

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Unambiguous Stereo Matching Using Reliability-Based Dynamic Programming

IEEE Transactions on Pattern Analysis and Machine Intelligence
Adaptive Support-Weight Approach for Correspondence Search

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Convex Formulation of Continuous Multi-label Problems

ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part III
Stereo by two-level dynamic programming

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Stereo Matching with Mumford-Shah Regularization and Occlusion Handling

IEEE Transactions on Pattern Analysis and Machine Intelligence
High-accuracy stereo depth maps using structured light

CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Optic flow goes stereo: a variational method for estimating discontinuity-preserving dense disparity maps

PR'05 Proceedings of the 27th DAGM conference on Pattern Recognition
Differential geometric consistency extends stereo to curved surfaces

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
Segment-based stereo matching using energy-based regularization

MRCS'06 Proceedings of the 2006 international conference on Multimedia Content Representation, Classification and Security
Exact optimization for Markov random fields with convex priors

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.10

Visualization

Abstract

Stereo correspondence is inherently an ill-posed problem, which is addressed by regularization methods. This paper introduces a novel stereo correspondence method that uses two synchronous interdependent optimizations. The regularization of the correspondence problem is done adaptively by considering the image segments and the intermediate disparity maps of the two optimizations. Our adaptive regularization allows inter-segment diffusion at the beginning of the optimizations to be robust against local minima. When the two optimizations start producing similar disparity maps, our regularization prevents inter-segment diffusion to recover the depth discontinuities. Our experimental results showed that the proposed algorithm can handle sharp discontinuities well and provides disparity maps with accuracy comparable to the state of the art stereo methods.