Stereo Correspondence with Compact Windows via Minimum Ratio Cycle

Authors:
Olga Veksler
Affiliations:
-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2002

Citing 10
Cited 18

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Occlusions and binocular stereo

International Journal of Computer Vision
Large Occlusion Stereo

International Journal of Computer Vision
Toward Improved Ranking Metrics

IEEE Transactions on Pattern Analysis and Machine Intelligence
Globally Optimal Regions and Boundaries as Minimum Ratio Weight Cycles

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
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
Efficient Stereo with Multiple Windowing

CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Robust Adaptive Window Matching by Homogeneity Constraint and Integration of Descriptions

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 1 - Volume 1
Computer matching of areas in stereo images.

Computer matching of areas in stereo images.

Adaptive Support-Weight Approach for Correspondence Search

IEEE Transactions on Pattern Analysis and Machine Intelligence
Reconfigurable hardware implementation of a phase-correlation stereoalgorithm

Machine Vision and Applications
A Geometric Approach for Regularization of the Data Term in Stereo-Vision

Journal of Mathematical Imaging and Vision
Semiautomatic segmentation with compact shape prior

Image and Vision Computing
Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log2 n)-time algorithm

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
RASCor: An associative hardware algorithm for real time stereo

Computers and Electrical Engineering
Cross-based local stereo matching using orthogonal integral images

IEEE Transactions on Circuits and Systems for Video Technology
Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm

ACM Transactions on Algorithms (TALG)
A new method for stereo matching using pixel cooperative optimization

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Activity based matching in distributed camera networks

IEEE Transactions on Image Processing - Special section on distributed camera networks: sensing, processing, communication, and implementation
Video-rate stereo depth measurement on programmable hardware

CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Correspondence search in the presence of specular highlights using specular-free two-band images

ACCV'06 Proceedings of the 7th Asian conference on Computer Vision - Volume Part II
A novel stereo matching method for wide disparity range detection

ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
Support aggregation via non-linear diffusion with disparity-dependent support-weights for stereo matching

ACCV'09 Proceedings of the 9th Asian conference on Computer Vision - Volume Part I
An efficient adaptive window based disparity map computation algorithm by dense two frame stereo correspondence

ICVGIP'06 Proceedings of the 5th Indian conference on Computer Vision, Graphics and Image Processing
An optimal time---space algorithm for dense stereo matching

Journal of Real-Time Image Processing
Cross image inference scheme for stereo matching

ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part IV
Stereo matching by using the global edge constraint

Neurocomputing

Quantified Score

Hi-index	0.14

Visualization

Abstract

One of the earliest and still widely used methods for dense stereo correspondence is based on matching windows of pixels. The main difficulty of this method is choosing a window of appropriate size and shape. Small windows may lack sufficient intensity variation for reliable matching, while large windows smooth out disparity discontinuities. We propose an algorithm to choose a window size and shape by optimizing over a large class of "compact" windows. The word compact is used informally to reflect the fact that the ratio of perimeter to area of our windows is small. We believe that this is the first area based method which efficiently constructs nonrectangular windows. Fast optimization over compact windows is achieved via the minimum ratio cycle algorithm for graphs. The algorithm has only a few parameters which are easy to fix.