Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Applying temporal constraints to the dynamic stereo problem
Jenkin M. (ed), Tsotsos J. Computer Vision, Graphics, and Image Processing33 (1):16-32,1986.Type:Article
Date Reviewed: Apr 1 1987

A computer vision algorithm for dynamic stereoscopic vision simultaneously addresses two conceptually distinct operations: tracking a moving object through successive frames and locating the object in space and time by measuring parallax displacement and other geometric properties of binocular vision. Based on a general smoothness assumption of minimal movement between successive frames, the algorithm demonstrates that the tracking and locating operations are treated in a more efficient manner simultaneously, rather than separately. A significant improvement over previous approaches is the algorithm’s ability to deal with moving objects that become fully or partly hidden from one or both eyes. The authors demonstrate the efficacy of their algorithm with a simulated walking stick-person and a digitized stereoscopic film of a toy boat. Their clearly described procedures are a useful contribution to the theory underlying developments in robot vision.

Reviewer:  Mark Monmonier Review #: CR111349
Bookmark and Share
 
Stereo (I.4.8 ... )
 
 
Motion (I.2.10 ... )
 
 
Time-Varying Imagery (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
Representing stereo data with the Delaunay triangulation
Faugeras O., Le Bras-Mehlman E., Boissonnat J. Artificial Intelligence 44(1-2): 41-87, 1990. Type: Article
May 1 1991
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