Modelling Shapes with Uncertainties: Higher Order Polynomials, Variable Bandwidth Kernels and Non Parametric Density Estimation
Abstract
In this paper, we introduce a new technique for shape modelling in the space of implicit polynomials. Registration consists of recovering an optimal one-to-one transformation of a higher order polynomial along with uncertainties measures that are determined according to the covariance matrix of the correspondences at the zero isosurface. In the modelling phase, these measures are used to weight the importance of the training samples phase according to a variable bandwidth non-parametric density estimation process. The selection of the most appropriate kernels to represent the training set is done through the maximum likelihood criterion. Excellent results for patterns of digits, related with the registration and the modelling aspects of our approach demonstrate the potentials of our method
Cite
Text
Taron et al. "Modelling Shapes with Uncertainties: Higher Order Polynomials, Variable Bandwidth Kernels and Non Parametric Density Estimation." IEEE/CVF International Conference on Computer Vision, 2005. doi:10.1109/ICCV.2005.153Markdown
[Taron et al. "Modelling Shapes with Uncertainties: Higher Order Polynomials, Variable Bandwidth Kernels and Non Parametric Density Estimation." IEEE/CVF International Conference on Computer Vision, 2005.](https://mlanthology.org/iccv/2005/taron2005iccv-modelling/) doi:10.1109/ICCV.2005.153BibTeX
@inproceedings{taron2005iccv-modelling,
title = {{Modelling Shapes with Uncertainties: Higher Order Polynomials, Variable Bandwidth Kernels and Non Parametric Density Estimation}},
author = {Taron, Maxime and Paragios, Nikos and Jolly, Marie-Pierre},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {2005},
pages = {1659-1666},
doi = {10.1109/ICCV.2005.153},
url = {https://mlanthology.org/iccv/2005/taron2005iccv-modelling/}
}