Referenced Items are not available for this document.
In this paper, we consider two sets of corresponding 3D line segments of equal length. We derive a closed-form solution for the coordinate transform (rotation and translation) that gives the best match between the two sets; best in the sense of a least-squares distance measure between the sets. We use these results as the basis to construct efficient algorithms for solving other problems in computer vision. Specifically, we address the problem of matching polygonal arcs, that is, the problem of finding a match between a short arc and a piece of long arc
Published in:
Pattern Analysis and Machine Intelligence, IEEE Transactions on
(Volume:19
,
Issue:
10
)
Date of Publication: Oct 1997
- Page(s):
- 1090 - 1099
- ISSN :
- 0162-8828
- INSPEC Accession Number:
- 5748444
- Digital Object Identifier :
- 10.1109/34.625109
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Oct 1997
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
