Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Stereo-Motion with Stereo and Motion in Complement
Ho P., Chung R. IEEE Transactions on Pattern Analysis and Machine Intelligence22 (2):215-220,2000.Type:Article
Date Reviewed: Jan 1 2002

In this paper, Ho and Chung describe an algorithm that obtains environmental depth information from a pair of calibrated affine cameras that move as a rigid unit through a static environment. They demonstrate that if robust temporal correspondences are obtained from each camera, the stereo correspondence problem can be solved trivially--provided that temporal correspondences can be found that do not violate certain geometric constraints. Experiments with synthetic and real imagery are presented.

The approach described in this paper seems quite robust provided that good temporal correspondences can be established in each camera over the entire sequence. For many objects and camera motions, this may not be practical, and the extension of the approach to deal with these sorts of conditions would make the approach more applicable for real-world applications.

Reviewer:  M. R. M. Jenkin Review #: CR125610 (0201-0046)
Bookmark and Share
 
Stereo (I.4.8 ... )
 
 
Motion (I.4.8 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Stereo": Date
Three-dimensional surface mapping simulator: theory, capabilities and operation
Schalkoff R., Labuz J. Image and Vision Computing 3(1): 36-39, 1985. Type: Article
Aug 1 1985
Integration of visual modules: an extension of the Marr paradigm
Aloimonos J., Shulman D., Academic Press Prof., Inc., San Diego, CA, 1989. Type: Book (9780120530205)
May 1 1990
Applying temporal constraints to the dynamic stereo problem
Jenkin M. (ed), Tsotsos J. Computer Vision, Graphics, and Image Processing 33(1): 16-32, 1986. Type: Article
Apr 1 1987
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy