Automatic contour segmentation for object analysis

D. C.Douglas Hung, I. R. Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The problem of distinguishing shapes from a compound contour, which is formed by overlapping more than one distinct object, is considered. The algorithm exploits the fact that planar shapes can be completely described by contour segments, and that they can be decomposed at their maximum concavity into simpler objects. To reduce spurious decomposition, the decomposed segments are merged hypotheses. The algorithm calculates the linking possibility by weighting the angular differentiation which measures against k-curvature consistency. The techniques were implemented and applied to other partial shape matching problems for clustering purposes.

Original languageEnglish (US)
Title of host publicationThird Int Conf Tools Artif Intell
PublisherPubl by IEEE
Pages518-519
Number of pages2
ISBN (Print)0818623004
StatePublished - Jan 1 1992
EventThird International Conference on Tools for Artificial Intelligence - San Jose, CA, USA
Duration: Nov 5 1991Nov 8 1991

Publication series

NameThird Int Conf Tools Artif Intell

Other

OtherThird International Conference on Tools for Artificial Intelligence
CitySan Jose, CA, USA
Period11/5/9111/8/91

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Automatic contour segmentation for object analysis'. Together they form a unique fingerprint.

Cite this