Algorithms for Matching 3D Line Sets
IEEE Transactions on Pattern Analysis and Machine Intelligence
An invariant, closed-from solution for matching sets of 3D lines
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
| Hi-index | 0.14 |
We define a distance measure between 3D polygonal arcs of equal length, and show that the minimum value of this distance measure is the smallest eigenvalue of a certain matrix. Using this, we develop a mismatch measure and a matching algorithm for 3D polygonal arcs of unequal lengths.