Maximal matching of 3-D points for multiple-object motion estimation
References (19)
- et al.
Determining of 3-D object orientation from projections
Pattern Recognition Lett.
(1985) - et al.
Tracking modeled objects using binocular images
Comput. Vision Graphics Image Process.
(1985) The Interpretation of Visual Motion
(1979)Motion analysis
- et al.
Robust algorithm for motion estimation based on two sequential stereo image pairs
- H.H. Chen and T.S. Huang, Multiple-object motion estimation by matching 3-D line segments,...
- et al.
The representation, recognition and locating of 3-D objects
Int. J. Robotics Res.
(1986) Approximate algorithms for fast optimal attitude computation
- et al.
Model-based recognition and localization from sparse range or tactile data
Int. J. Robotics Res.
(1984)
There are more references available in the full text version of this article.
Cited by (26)
A relaxation algorithm for real-time multiple view 3D-tracking
2002, Image and Vision ComputingCitation Excerpt :Consistent labelling according to a set of a priori known constraints has combinatorial complexity [6,7]. The optimal labelling problem can be resolved by techniques such as relational graph matching, graph isomorphism, tree search and relaxation labelling [8–10,49]. Approaches to reducing the combinatorial complexity include knowledge-based clipping, heuristic search, divide-and-conquer and dynamic programming.
Task planning for humanoid robots using look-up table
2002, Robotics and Autonomous SystemsMatching point features under small nonrigid motion
2001, Pattern RecognitionAn algorithmic overview of surface registration techniques for medical imaging
2000, Medical Image AnalysisNonrigid Motion Analysis: Articulated and Elastic Motion
1998, Computer Vision and Image UnderstandingVehicle-type motion estimation by the fusion of image point and line features
1998, Pattern Recognition
- ∗
Now at AT&T Bell Laboratories, 4E-630, Crawfords Corner Road, Holmdel, NJ 07733, U.S.A.
Copyright © 1988 Published by Elsevier B.V.