Matching Distance Functions: A Shape-to-Area Variational Approach for Global-to-Local Registration
Abstract
This paper deals with the matching of geometric shapes. Our primary contribution is the use of a simple, robust, rich and efficient way to represent shapes, the level set representations according to singed distance transforms. Based on these representations we propose a variational framework for global as well as local shape registration that can be extended to deal with structures of higher dimension. The optimization criterion is invariant to rotation, translation and scale and combines efficiently a global motion model with local pixel-wise deformations. Promising results are obtained on examples showing small and large global deformations as well as arbitrary topological changes.
Cite
Text
Paragios et al. "Matching Distance Functions: A Shape-to-Area Variational Approach for Global-to-Local Registration." European Conference on Computer Vision, 2002. doi:10.1007/3-540-47967-8_52Markdown
[Paragios et al. "Matching Distance Functions: A Shape-to-Area Variational Approach for Global-to-Local Registration." European Conference on Computer Vision, 2002.](https://mlanthology.org/eccv/2002/paragios2002eccv-matching/) doi:10.1007/3-540-47967-8_52BibTeX
@inproceedings{paragios2002eccv-matching,
title = {{Matching Distance Functions: A Shape-to-Area Variational Approach for Global-to-Local Registration}},
author = {Paragios, Nikos and Rousson, Mikaël and Ramesh, Visvanathan},
booktitle = {European Conference on Computer Vision},
year = {2002},
pages = {775-789},
doi = {10.1007/3-540-47967-8_52},
url = {https://mlanthology.org/eccv/2002/paragios2002eccv-matching/}
}