Constrained Contouring in Polar Coordinates

Revankar, Shriram V.; Sher, David B.

doi:10.1109/CVPR.1993.341026

Constrained Contouring in Polar Coordinates

Shriram V. Revankar, David B. Sher

CVPR 1993 pp. 688-689

doi:10.1109/CVPR.1993.341026 /cvpr/1993/revankar1993cvpr-constrained/

Abstract

A constrained contour is an outline of a region of interest, obtained by linking the possible edge points under the constraints of connectivity, smoothness, image context, and an externally specified approximate contour. A constrained contouring algorithm in polar coordinates that traces closed contours using their rough approximations is discussed. A set of locally optimal contour locations (LOCLs) is found in all the selected radial directions by analyzing the image features and the external constraints. A graph search based algorithm is used to select a smooth contour that passes through the maximum number of LOCLs.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>

CVPR Semantic Scholar

Cite

Text

Revankar and Sher. "Constrained Contouring in Polar Coordinates." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1993. doi:10.1109/CVPR.1993.341026

Markdown

[Revankar and Sher. "Constrained Contouring in Polar Coordinates." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1993.](https://mlanthology.org/cvpr/1993/revankar1993cvpr-constrained/) doi:10.1109/CVPR.1993.341026

BibTeX

@inproceedings{revankar1993cvpr-constrained,
  title     = {{Constrained Contouring in Polar Coordinates}},
  author    = {Revankar, Shriram V. and Sher, David B.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1993},
  pages     = {688-689},
  doi       = {10.1109/CVPR.1993.341026},
  url       = {https://mlanthology.org/cvpr/1993/revankar1993cvpr-constrained/}
}