Robust Object Recognition Based on Implicit Algebraic Curves and Surfaces
Abstract
Two problems pertinent to using implicit higher degree polynomials in real-world robust systems are dealt with: (1) characterization and fitting algorithms for the subset of these algebraic curves and surfaces that is bounded and exists largely in the vicinity of the data; (2) a Mahalanobis distance for comparing the coefficients of two polynomials, to determine whether the curves or surfaces that they represent are close over a specified region. These tools make practical use of geometric invariants for determining whether one implicit polynomial curve or surface is a rotation, translation, or an affine transformation of another. The approach is ideally suited to smooth curves and smooth curved surfaces that do not have detectable features.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Keren et al. "Robust Object Recognition Based on Implicit Algebraic Curves and Surfaces." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992. doi:10.1109/CVPR.1992.223171Markdown
[Keren et al. "Robust Object Recognition Based on Implicit Algebraic Curves and Surfaces." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992.](https://mlanthology.org/cvpr/1992/keren1992cvpr-robust/) doi:10.1109/CVPR.1992.223171BibTeX
@inproceedings{keren1992cvpr-robust,
title = {{Robust Object Recognition Based on Implicit Algebraic Curves and Surfaces}},
author = {Keren, Daniel and Subrahmonia, Jayashree and Cooper, David B.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1992},
pages = {791-794},
doi = {10.1109/CVPR.1992.223171},
url = {https://mlanthology.org/cvpr/1992/keren1992cvpr-robust/}
}