11 citations found. Retrieving documents...
Z. Wang and A. Jepson, "A new closed-form solution for absolute orientation," Proceedings of CVPR 94, Seattle, pp. 129--134, June, 1994.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
A Taxonomy for Stereo Computer Vision Experiments - Maimone, Shafer (1996)   (3 citations)  (Correct)

....datasets collected in this laboratory are among the first of their kind to be made available to general research community: high quality images with piecewise dense ground truth. 1 Publications by other researchers using these datasets have already appeared in peer reviewed publications, e.g. [32]. 3 The Linkoping University Division of Computer Vision provides a small calibrated outdoor dataset at ftp: isy.liu.se images calib.ic 4 See the Computer Vision Source Code web page at http: www.cs.cmu.edu cil v source.html. 9 Summary The analysis of stereo vision algorithms can be ....

Z. Wang and A. Jepson, "A new closed-form solution for absolute orientation," in IEEE Conference on Computer Vision and Pattern Recognition, pp. 129--134, 1994.


Surface Reconstruction and Display from Range and Color Data - Pulli (1997)   (4 citations)  (Correct)

....were published independently by Horn [1987] and Faugeras and Hebert [1986] There is also a more recent formulation 1 Three point pairs would be enough to determine the relative orientation and position, but with more points small errors in pairing have less influence on the solution. 23 by Wang and Jepson [1994] that according to the authors provides more robust solutions when the data are contaminated by anisotropic noise. There have been many suggestions on how to obtain the initial registration without user interactions. Unfortunately, they are not robust, general purpose solutions that could be ....

Z. Wang and A. Jepson. A new closed-form solution for absolute orientation. In Proc. Conf. on Computer Vision and Pattern Recognition, pages 129-- 134, June 1994.


Modal Matching for Correspondence and Recognition - Sclaroff, Pentland (1995)   (45 citations)  (Correct)

....two sets of points is potentially large, then it is necessary to perform an initial alignment step before recovering the modal deformations. Orientation, position, and (if desired) scale can be recovered in closed form via quaternion based algorithms described by Horn [12] or by Wang and Jepson [43]. 1 Using only a few of the strongest feature correspondences (recall that strong matches have relatively small values in the affinity matrix Z) the rigid body modes can be solved for directly. The resulting additional alignment parameters are: p 0 position vector q unit quaternion defining ....

Z. Wang and A. Jepson. A new closed-form solution of absolute orientation. In Proc. Computer Vision and Pattern Recognition, pages 129--134, 1994.


Using Weighted Bipartite Matching to Solve the.. - Wang, Cheng.. (1995)   Self-citation (Wang)   (Correct)

....sets before and after the motion, but their positions are not precise due to corruption of the spatial coordinates by noise. Outliers in a set are those points whose corresponding points in the other set are missing. To deal with noise, knowing correspondences is useful, since there is evidence [20] showing that more stable motion parameters can be computed when correspondences are given. To deal with outliers, correspondence analysis is even more crucial. With the knowledge of correspondence, the motion can be estimated on a point by point basis, whereas the correspondenceless algorithms ....

....A and B. So far we solved the 3 D rigid body correspondence problem in a closed form, and the problem is converted to a rotation and translation recovery problem with correspondences known. This is a subject that has been extensively studied. Recent work on the subject is done by Wang and Jepson [20]. They proposed a novel closed form algorithm solving for the translation and rotation, which is claimed to be very robust in the presence of noise. Although closed form solutions are also presented for ideal motion problems by Aloimonos s group [1, 8] Huang s group [5, 15] and others [13, 16] ....

Z. Wang and A. Jepson, "A new closed-form solution for absolute orientation," Proc. IEEE Conf. Computer Vision Pattern Recognition, pp. 129-134, 1994.


An Autonomous Mobile Robot for Known Industrial.. - Nickerson.. (1997)   Self-citation (Jepson)   (Correct)

....of performing related tasks such as measuring iso contours of events such as temperature and gas concentations. In addition to meeting these technical goals, research undertaken as part of the project has lead to advances in general mobile robot system (e.g. 24] image understanding (e.g. [16, 27, 11]) system control (e.g. 23] and immersive user interfaces (e.g. 1] Acknowledgments Funding for this work was provided, in part, by the ARK (Autonomous Robot for a Known environment) Project, which receives its funding from PRECARN Associates Inc. Industry Canada, the National Research ....

Z. Wang and A. Jepson. A new closed-form solution for absolute orientation. In Proc. of IEEE Conf on Comp. Vis. and Pat. Rec., pages 129--134, Seattle, WA, 1994.


Determining Correspondences and Rigid Motion of 3-D.. - Wang, Cheng, Collins, .. (1996)   (2 citations)  Self-citation (Wang)   (Correct)

....in A and B. So far we have solved the ideal 3 D correspondence problem in a closed form, and have reduced the original problem to estimation of rotation and translation from 3 D points with known correspondences. Several noise resistant solutions to this problem have been published (e.g. [12]) One of the advantages of our method over correspondenceless methods is that it can make use of these noise resistant algorithms directly, while correspondenceless methods cannot. 3 General Correspondence Recovey A shortcoming of the closed form solution is that it is limited to ideal motion ....

....B T C BC to get the eigenvalues and the eigenvector matrices QA and QB . 3. Compute the affinity h ij s using formula (7) 4. Compute the maximum weighted matching M using Karp s algorithm. 5. Get M 0 by outlier removal from M . 6. Compute R and T by applying noise resistant algorithms (e.g. [12]) to the correspondences in M 0 . Some implementation issues regarding the algorithm, such as the eigenvector sign issue, are discussed elsewhere [11] We point out that better estimates of the motion parameters can be obtained by iteratively running the algorithm. Some outliers are removed in ....

Z. Wang and A. Jepson, "A new closed-form solution for absolute orientation," Proc. IEEE Conf. Computer Vision Pattern Recognition, pp. 129-134, 1994.


Performance Assessment by Resampling: Rigid Motion.. - Peter Meer David (1998)   (1 citation)  (Correct)

No context found.

Z. Wang and A. Jepson, "A new closed-form solution for absolute orientation," Proceedings of CVPR 94, Seattle, pp. 129--134, June, 1994.


Optimal Rigid Motion Estimation and Performance Evaluation with .. - Matei, Meer (1999)   (6 citations)  (Correct)

No context found.

Z. Wang and A. Jepson, "A new closed-form solution for absolute orientation," 1994.


Optimal Rigid Motion Estimation and Performance Evaluation with .. - Matei, Meer (1999)   (6 citations)  (Correct)

No context found.

Z. Wang and A. Jepson, "A new closed-form solution for absolute orientation," 1994.


Performance Assessment by Resampling: Rigid Motion.. - Peter Meer David (1998)   (1 citation)  (Correct)

No context found.

Z. Wang and A. Jepson, "A new closed-form solution for absolute orientation," Proceedings of CVPR 94, Seattle, pp. 129--134, June, 1994.


Precision: Effects of Foreshortening - Maimone (1996)   (Correct)

No context found.

Wang, Z. & Jepson, A. (1994). A new closed-form solution for absolute orientation. In IEEE Conference on Computer Vision and Pattern Recognition, pages 129--134.

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