ML Anthology

An Invariant, Closed-Form Solution for Matching Sets of 3D Lines

Behzad Kamgar-Parsi, Behrooz Kamgar-Parsi
CVPR 2004 pp. 431-436
doi:10.1109/CVPR.2004.33 /cvpr/2004/kamgarparsi2004cvpr-invariant/

Abstract

Existing algorithms for finding the best match between two sets of 3D lines are not completely satisfactory in the sense that they either yield approximate solutions, or are iterative which means they may not converge to the globally optimal solution. An even more serious shortcoming of the existing algorithms is that they are all non-invariant with respect to the translation of the coordinate system. Thus, any best match found becomes rather meaningless. In this paper, we discuss the source of this non-invariance and present a new algorithm that is invariant to coordinate transforms. Moreover, the algorithm is closed-form, which implies that it always yields the best global match.

CVPR Semantic Scholar

Cite

Text

Kamgar-Parsi and Kamgar-Parsi. "An Invariant, Closed-Form Solution for Matching Sets of 3D Lines." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2004. doi:10.1109/CVPR.2004.33

Markdown

[Kamgar-Parsi and Kamgar-Parsi. "An Invariant, Closed-Form Solution for Matching Sets of 3D Lines." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2004.](https://mlanthology.org/cvpr/2004/kamgarparsi2004cvpr-invariant/) doi:10.1109/CVPR.2004.33

BibTeX

@inproceedings{kamgarparsi2004cvpr-invariant,
  title     = {{An Invariant, Closed-Form Solution for Matching Sets of 3D Lines}},
  author    = {Kamgar-Parsi, Behzad and Kamgar-Parsi, Behrooz},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2004},
  pages     = {431-436},
  doi       = {10.1109/CVPR.2004.33},
  url       = {https://mlanthology.org/cvpr/2004/kamgarparsi2004cvpr-invariant/}
}