Multiconstraint shape analysis

Tom Henderson, Ashok Samal

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

The paper presents a method for applying multiple semantic constraints based on discrete relaxation. A separate graph is maintained for each constraint relation and used in parallel to achieve consistent labelling. This permits both local and global analysis without recourse to complete graphs. Here, the term 'local' is used with respect to a particular constraint graph, and thus includes global spatial relations on the features, eg parallel edges on an object will be neighbours in the parallel constraint graph even though they are far apart in Euclidean space. Another major result is a technique for handling occlusion by incorporating the use of spatially local feature sets in the relaxation-type updating method.

Original languageEnglish (US)
Pages (from-to)84-96
Number of pages13
JournalImage and Vision Computing
Volume4
Issue number2
DOIs
StatePublished - May 1986

Keywords

  • constraint relation
  • discrete relaxation
  • shape analysis

ASJC Scopus subject areas

  • Signal Processing
  • Computer Vision and Pattern Recognition

Fingerprint Dive into the research topics of 'Multiconstraint shape analysis'. Together they form a unique fingerprint.

Cite this