Lee, C-H., and Joshi, A., Correspondence problem in image sequence analysis. Pattern Recognition, Vol. 26, No. 1, pp. 47-61, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Using Weighted Bipartite Matching to Solve the.. - Wang, Cheng.. (1995) (Correct)
....3 D rigid body motion, 3 D point correspondence, absolute orientation This work was funded by the RADIUS project under ARPA Army TEC contract number DACA76 92 C 0041. 1 1 Introduction Motion estimation is an important problem in many aspects of computer vision and has been extensively studied [1, 5, 7, 8, 13, 15, 16]. The problem is to recover the 3 D motion parameters and or the structure of the objects undergoing motion from images taken at two or more time instances. We restrict our attention to rigid body motion, in which the structure of the object stays the same before and after the motion, and 3 D ....
....That is a combinatorial search problem, which is considerably time consuming. The other research trend is the estimation of motion parameters without knowing correspondences. Notable results are shown in Aloimonos and coworkers work [1, 8] Huang and his colleagues work [5, 15] and others [13, 16]. These researchers all developed a similar approach to motion estimation without correspondence. The approach rests on a property that the eigenstructure of a scatter matrix is invariant to rotation, so that the rotation can be solved linearly in a closed form. The advantage of this approach is ....
[Article contains additional citation context not shown here]
C.-H. Lee and A. Joshi, "Correspondence problem in image sequence analysis," Pattern Recognition, vol. 26, pp. 47-61, 1993.
Determining Correspondences and Rigid Motion of 3-D.. - Wang, Cheng, Collins, .. (1996) (2 citations) (Correct)
....depending on whether or not the correspondences are recovered. Some researchers (e.g. 2] try to recover the point correspondences using combinatorial searches. These methods are very time consuming. The other research trend is the estimation of motion parameters without knowing correspondences [1, 4, 5, 7, 8, 9]. However, correspondenceless algorithms work in a very narrow domain, called This work was funded under ARPA Army TEC contract DACA76 92 C 0041 and NSF grant CDA 8922572. the ideal motion problem, where the numbers of points in the two sets are equal and each point in a set must have a ....
....matrices D, UA and UB can be calculated from standard eigenstructure decomposition procedures. Equation (5) holds only if the signs of the eigenvectors in UA and UB are consistent. It is worth noting that there is a symmetry [11] between our method and the traditional correspondenceless methods [1, 4, 5, 7, 8, 9]. Based on an eigenstructure decomposition of the 3 Theta 3 scatter matrices ACA T C and BCB T C , correspondenceless methods use the orthogonality property of P to solve for R, while our method uses the the orthogonality of R to solve for P , as seen in equation (4) The symmetry reflects ....
[Article contains additional citation context not shown here]
C.-H. Lee and A. Joshi, "Correspondence problem in image sequence analysis," Pattern Recognition, vol. 26, pp. 47-61, 1993.
Three-Dimensional Reconstruction of Points and.. - Cheng, Riseman.. (2000) (3 citations) (Correct)
No context found.
Lee, C-H., and Joshi, A., Correspondence problem in image sequence analysis. Pattern Recognition, Vol. 26, No. 1, pp. 47-61, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC