|
|
|
|
RI | Publications | Characterizing Stereo Matching Problems using Local Spatial Frequency
|
|
Text only version of this site
Characterizing Stereo Matching Problems using Local Spatial Frequency
M. Maimone
tech. report CMU-CS-96-125, Computer Science Department, Carnegie Mellon University, 1996.
Jump to: Download | Abstract | Text Reference | BibTeX Reference
| Download [Help] |
Adobe portable document format (pdf) [3192 KB] Compressed postscript (ps.gz) [4287 KB]
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
| Abstract |
The model of local spatial frequency provides a powerful analytical tool for image analysis. In this thesis we explore the application of this representation to long-standing problems in stereo vision. As the basis for this analysis, we develop a phase-based algorithm for stereo matching that uses an adaptive scale selection process. Our approach demonstrates a novel solution to the phase-wraparound problem that has limited the applicability of other phase-based methods.
The problem of ambiguous matches, or false targets, can greatly reduce the accuracy of a stereo vision system. A common approach to alleviating the problem is the use of a coarse to fine refinement strategy, but we show that this approach imposes some (perhaps overly) strong requirements on the stereo images. Our phase-based method relaxes those requirements, and is therefore able to handle a wider variety of otherwise ambiguous images. But sometimes ambiguity is inherent in the images, so we propose a generalized disparity model to explicitly represent multiple candidates.
Perspective foreshortening, an effect that occurs when a surface is viewed at a sharp angle, can reduce the precision of stereo methods. Many methods tacitly assume that the projection of an object will have the same area in both images, but this condition is violated by perspective foreshortening. We show how to overcome this problem using a local spatial frequency representation. A simple geometric analysis leads to an elegant solution in the frequency domain which, when applied to our phase-based system, increases the system's maximum matchable surface angle from 30 degrees to over 75 degrees.
The analysis of stereo vision algorithms can be greatly enhanced through the use of datasets with ground truth. We outline a taxonomy of datasets with ground truth that use varying degrees of realism to characterize particular aspects of stereo vision systems, and show that each component of this taxonomy can be effectively realized with current technology. We propose that datasets generated in this way be used as the foundation for a suite of statistical analyses to effectively characterize the performance of stereo vision systems.
| Text Reference |
M. Maimone, Characterizing Stereo Matching Problems using Local Spatial Frequency, tech. report CMU-CS-96-125, Computer Science Department, Carnegie Mellon University, 1996.
| BibTeX Reference |
@techreport{Maimone_1996_1473,
author = "Mark Maimone",
title = "Characterizing Stereo Matching Problems using Local Spatial Frequency",
institution = "Computer Science Department, Carnegie Mellon University",
year = "1996",
number = "CMU-CS-96-125",
address = "Pittsburgh, PA"
}