A study of fast, robust stereo-matching algorithms
| Autor: | Hong, Wenxian |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2010 |
| Předmět: | |
| Druh dokumentu: | Diplomová práce |
| Popis: | Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2010. Cataloged from PDF version of thesis. Includes bibliographical references (p. 115-117). Stereo matching is an actively researched topic in computer vision. The goal is to recover quantitative depth information from a set of input images, based on the visual disparity between corresponding points. This thesis investigates several fast and robust techniques for the task. First, multiple stereo pairs with different baselines may be meaningfully combined to improve the accuracy of depth estimates. In multibaseline stereo, individual pairwise similarity measures are aggregated into a single evaluation function. We propose the novel product-of-error-correlation function as an effective example of this aggregate function. By imposing a common variable, inverse distance, across all stereo pairs, the correct values are reinforced while false matches are eliminated. Next, in a two-view stereo context, the depth estimates may also be made more robust by accounting for foreshortening effects. We propose an algorithm that allows a matching window to locally deform according to the surface orientation of the imaged point. The algorithm then performs correlation in multiple dimensions to simultaneously determine the most probable depth and tilt. The 2D surface orientation search may be made more efficient and robust by separating into two 1D searches along the epipolar lines of two stereo pairs. Moreover, by organizing the multi-dimensional correlation to avoid redundant pixel comparisons or using numerical minimization methods, greater efficiency may be achieved. Finally, we propose an iterative, randomized algorithm which can significantly speed up the matching process. The key insights behind the algorithm are that random guesses for correspondences can often produce some good disparity matches, and that these matches may then be propagated to nearby pixels assuming that disparity maps are piecewise smooth. Such a randomized algorithm converges within a small number of iterations and accurately recovers disparity values with relative computational efficiency. All three techniques developed are described analytically and evaluated empirically using synthetic or real image datasets to demonstrate their superior performance. by Wenxian Hong. S.M. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|