ML Anthology

A New Regularized Approach for Contour Morphing

Ge Cong, Bahram Parvin
CVPR 2000 pp. 1458-1463
doi:10.1109/CVPR.2000.855855 /cvpr/2000/cong2000cvpr-new/

Abstract

In this paper, we propose a new approach for interpolating curves (contour morphing) in time, which is a process of gradually changing a source curve (known) through intermediate curves (unknown) into a target curve (known). The novelty of our approach is in the deployment of a new regularization term and the corresponding Euler equation. Our method is applicable to implicit curve representation and it establishes a relationship between curve interpolation and a two dimensional function. This is achieved by minimizing the supremum of the gradient, which leads to the infinite Laplacian equation (ILE). ILE is optimal in the sense that interpolated curves are equally distributed along their normal direction. We point out that the existing distance field manipulation (DFM) methods are only an approximation to the proposed optimal solution and that the relationship between ILE and DFM is not local as it has been asserted before. The proposed interpolation can also be used to construct multiscale curve representation.

CVPR Semantic Scholar

Cite

Text

Cong and Parvin. "A New Regularized Approach for Contour Morphing." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2000. doi:10.1109/CVPR.2000.855855

Markdown

[Cong and Parvin. "A New Regularized Approach for Contour Morphing." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2000.](https://mlanthology.org/cvpr/2000/cong2000cvpr-new/) doi:10.1109/CVPR.2000.855855

BibTeX

@inproceedings{cong2000cvpr-new,
  title     = {{A New Regularized Approach for Contour Morphing}},
  author    = {Cong, Ge and Parvin, Bahram},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2000},
  pages     = {1458-1463},
  doi       = {10.1109/CVPR.2000.855855},
  url       = {https://mlanthology.org/cvpr/2000/cong2000cvpr-new/}
}