## A Fast Stereo Matching Method (1997)

Venue: | In Digital Image Computing: Techniques and Applications |

Citations: | 22 - 5 self |

### BibTeX

@INPROCEEDINGS{Sun97afast,

author = {Changming Sun},

title = {A Fast Stereo Matching Method},

booktitle = {In Digital Image Computing: Techniques and Applications},

year = {1997},

pages = {95--100}

}

### Years of Citing Articles

### OpenURL

### Abstract

Stereo matching is important in the area of computer vision and photogrammetry. This paper presents a fast stereo matching algorithm which produces a dense disparity map by using a pyramid structure, fast correlation and dynamic programming techniques. Fast correlation is achieved by using the box filtering technique which is invariant to the size of the correlation window. The disparity for each scan line is found in the correlation matrix by finding the best path using dynamic programming rather than simply choosing the position that gives the maximum correlation coefficient. Both synthetic and real image tests have been performed, and good results have been obtained. Keywords: Image matching, Stereo vision, Pyramid, Coarse-to-fine, Fast correlation, Dynamic programming, Box filtering, Similarity measure. 1 Introduction The correspondence problem in stereo vision concerns the matching of points or other kinds of primitives in two images such that the matched points are the project...

### Citations

83 | Disparity-Space Images and Large Occlusion Stereo
- Intlille, Bobick
- 1994
(Show Context)
Citation Context ...on [1, 2] used a correlation based algorithm with an adaptive window-size that is constrained by an edge map extracted from the image. They presented results on real aerial images. Intille and Bobick =-=[3]-=- presented a stereo algorithm that incorporates the detection of the occlusion regions directly into the matching process. They developed a dynamic programming solution that obeys the occlusion and or... |

77 |
A Class of Algorithms for Fast Digital Image Registration
- Barnea, Silverman
- 1972
(Show Context)
Citation Context ...ng method is described in Section 3. Section 4 shows the experimental results obtained using our stereo matching method. Section 5 contains concluding remarks. 2 Fast Correlation Barnea and Silverman =-=[5]-=- introduced a class of sequential algorithms for fast image registration. They were designed to reduce computation in matching procedures using minimum dissimilarity measures like the sum of the absol... |

56 |
Experimental results from a comparative study on correlation-type registration algorithms
- Aschwanden, Guggenbuhl
- 1992
(Show Context)
Citation Context ...ifferences (SAD). Konecny and Pape [6] reviewed image correlation techniques according to photogrammetric and mathematical fundamentals. Different similarity measures have been used in the literature =-=[7, 8]-=-, and their performance and computation cost vary. It has also been shown that the zero mean normalized cross correlation and the zero mean sum of squared differences tend to give better results [9]. ... |

54 |
3-d surface description from binocular stereo
- Cochran, Medioni
- 1992
(Show Context)
Citation Context ...s a cube containing the correlation coefficients as shown in Fig. 1(a). The size of the cube depends upon the image size and the disparity range (2w + 1). 3.2 Best Path in the Matrix Most researchers =-=[11]-=- choose the position that gives the maximum correlation coefficient as the disparity value. We choose a slice of the correlation coefficient cube as a 2D Correlation Matrix for each scan line of the i... |

19 |
Box-filtering techniques
- McDonnell
- 1981
(Show Context)
Citation Context ... window size. It can be seen from this equation that the co-variance between f and g and the variances of f and g at different positions in the image need to be evaluated. 2.1 Box Filtering McDonnell =-=[10]-=- described a box-filtering procedure for mean calculation. The main advantage of box filtering is its speed, which approaches four operations for each output pixel and is independent of box size. For ... |

13 | Adaptive Window Algorithm for Aerial Image Stereo
- Lotti, Giraudon
- 1994
(Show Context)
Citation Context ...aint: Matching should be unique between the two images; 3. Disparity gradient constraint: For certain kinds of 3D surfaces, the disparity gradient should be within a certain limit. Lotti and Giraudon =-=[1, 2]-=- used a correlation based algorithm with an adaptive window-size that is constrained by an edge map extracted from the image. They presented results on real aerial images. Intille and Bobick [3] prese... |

12 |
Regularised shortest-path extraction
- Buckley, Yang
- 1997
(Show Context)
Citation Context ... The position of the path indicates the best disparity for this scan line. The algorithm for finding the best path through the correlation matrix is performed by using a dynamic programming technique =-=[12]-=-. The best path gives the minimum cost when certain constraints are imposed. Sub-pixel accuracy can be obtained by fitting a second degree curve to the correlation coefficients in the neighbourhood of... |

10 |
Image pyramids for digital photogrammetry
- Ackermann, Hahn
- 1991
(Show Context)
Citation Context ...ty map can be obtained by exploiting multi-resolution. The upper levels of the pyramids are ideal to get an overview of the image scene. The details can be found down the pyramid at higher resolution =-=[14]-=-. During the process of projecting the disparity map from the current level of the pyramid to the next (if current level is not level 0), the image size was scaled up by the value of r (reduction rati... |

7 | Correlation algorithm with adaptive window for aerial image in stereo vision
- Lotti, Giraudon
- 1994
(Show Context)
Citation Context ...aint: Matching should be unique between the two images; 3. Disparity gradient constraint: For certain kinds of 3D surfaces, the disparity gradient should be within a certain limit. Lotti and Giraudon =-=[1, 2]-=- used a correlation based algorithm with an adaptive window-size that is constrained by an edge map extracted from the image. They presented results on real aerial images. Intille and Bobick [3] prese... |

6 | New algorithms for 3D surface description from binocular stereo using integration
- Kumar, Desai
- 1994
(Show Context)
Citation Context ...d degree curve can be a parabola. 3.3 Coarse-to-fine Scheme It has been shown that a multi-resolution or pyramid data structure approach to stereo matching is faster than one without multi-resolution =-=[13]-=-, as the search range in each level is small. Besides fast computation, a more accurate disparity map can be obtained by exploiting multi-resolution. The upper levels of the pyramids are ideal to get ... |

5 |
Dynamic workspace monitering
- Rechsteiner, Schneuwly, et al.
- 1994
(Show Context)
Citation Context ...ifferences (SAD). Konecny and Pape [6] reviewed image correlation techniques according to photogrammetric and mathematical fundamentals. Different similarity measures have been used in the literature =-=[7, 8]-=-, and their performance and computation cost vary. It has also been shown that the zero mean normalized cross correlation and the zero mean sum of squared differences tend to give better results [9]. ... |

4 |
Integrated method of stereo matching for computer vision
- Xiong, Wang, et al.
- 1996
(Show Context)
Citation Context ...on that obeys the occlusion and ordering constraints to find a best path through the disparityspace image. They also used ground control points to eliminate sensitivity to occlusion cost. Xiong et al =-=[4]-=- presented a stereo matching approach which integrates area-based and feature-based processes. In this paper we address some of the efficient and robust implementation aspects of the stereo matching a... |

4 |
Correlation techniques and devices
- Konecny, Pape
- 1981
(Show Context)
Citation Context ...thms for fast image registration. They were designed to reduce computation in matching procedures using minimum dissimilarity measures like the sum of the absolute differences (SAD). Konecny and Pape =-=[6]-=- reviewed image correlation techniques according to photogrammetric and mathematical fundamentals. Different similarity measures have been used in the literature [7, 8], and their performance and comp... |

3 |
Fast algorithms for correlation-relaxation technique to determine cloud motion fields
- Wu, McNeill, et al.
- 1995
(Show Context)
Citation Context ...7, 8], and their performance and computation cost vary. It has also been shown that the zero mean normalized cross correlation and the zero mean sum of squared differences tend to give better results =-=[9]-=-. We will use the zero mean normalized cross-correlation (ZNCC) coefficient as the similarity measure of the candidate matching areas. The estimate is independent of differences in brightness and cont... |