The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1997 vol.19)
pp: 1090-1099
ABSTRACT
<p><b>Abstract</b>—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 a long arc.</p>
INDEX TERMS
Curve matching, polygonal arcs, 3D registration, segment matching, 3D arcs.
CITATION
Behzad Kamgar-Parsi, Behrooz Kamgar-Parsi, "Matching Sets of 3D Line Segments with Application to Polygonal Arc Matching", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.19, no. 10, pp. 1090-1099, October 1997, doi:10.1109/34.625109
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool