ML Anthology

Optimal Contour Approximation by Deformable Piecewise Cubic Splines

Linnan Liu, Brian G. Schunck, Charles R. Meyer
CVPR 1991 pp. 638-643
doi:10.1109/CVPR.1991.139767 /cvpr/1991/liu1991cvpr-optimal/

Abstract

An optimal deformable contour approximation algorithm using a cardinal-form piecewise cubic spline (PCS) curve representation is presented. The approximation is optimal in the sense of least square errors in both location and orientation. The knots are set automatically at high curvature positions. The sample data are generated by a robust edge fragment detection algorithm which is optimal in the sense of a weighted absolute error. An initial contour placement algorithm uses a penalized maximum likelihood algorithm to group the edge fragments together for an initial contour. A controlled deformable contour algorithm refines the initial contour to cover meaningful edge features.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

CVPR Semantic Scholar

Cite

Text

Liu et al. "Optimal Contour Approximation by Deformable Piecewise Cubic Splines." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991. doi:10.1109/CVPR.1991.139767

Markdown

[Liu et al. "Optimal Contour Approximation by Deformable Piecewise Cubic Splines." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991.](https://mlanthology.org/cvpr/1991/liu1991cvpr-optimal/) doi:10.1109/CVPR.1991.139767

BibTeX

@inproceedings{liu1991cvpr-optimal,
  title     = {{Optimal Contour Approximation by Deformable Piecewise Cubic Splines}},
  author    = {Liu, Linnan and Schunck, Brian G. and Meyer, Charles R.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1991},
  pages     = {638-643},
  doi       = {10.1109/CVPR.1991.139767},
  url       = {https://mlanthology.org/cvpr/1991/liu1991cvpr-optimal/}
}