A Computationally Efficient Algorithm for Shape Decomposition

Cortopassi, Pedro Paulo; Rearick, T. C.

doi:10.1109/CVPR.1988.196297

A Computationally Efficient Algorithm for Shape Decomposition

Pedro Paulo Cortopassi, T. C. Rearick

CVPR 1988 pp. 597-601

doi:10.1109/CVPR.1988.196297 /cvpr/1988/cortopassi1988cvpr-computationally/

Abstract

An algorithm is described that is capable of decomposing homogeneous image regions into a complete set of convex parts ordered by size. The process is information-preserving and computationally efficient, and does not require prior edge smoothing. Shape decomposition is useful for parsing undersegmented image regions into which parts correspond to separate semantic entities. The algorithm is efficient because it operates on a list-oriented form of shape representation. Results of decomposing several different shapes are presented and discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>

CVPR Semantic Scholar

Cite

Text

Cortopassi and Rearick. "A Computationally Efficient Algorithm for Shape Decomposition." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988. doi:10.1109/CVPR.1988.196297

Markdown

[Cortopassi and Rearick. "A Computationally Efficient Algorithm for Shape Decomposition." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988.](https://mlanthology.org/cvpr/1988/cortopassi1988cvpr-computationally/) doi:10.1109/CVPR.1988.196297

BibTeX

@inproceedings{cortopassi1988cvpr-computationally,
  title     = {{A Computationally Efficient Algorithm for Shape Decomposition}},
  author    = {Cortopassi, Pedro Paulo and Rearick, T. C.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1988},
  pages     = {597-601},
  doi       = {10.1109/CVPR.1988.196297},
  url       = {https://mlanthology.org/cvpr/1988/cortopassi1988cvpr-computationally/}
}