Perceptual convexity

Konstantin Y. Kupeev, Haim J. Wolfson

Research output: Contribution to journalConference articlepeer-review

Abstract

Often objects which are not convex in the mathematical sense are treated as 'perceptually convex'. We present an algorithm for recognition of the perceptual convexity of a 2-d contour. We start by reducing the notion of 'a contour is perceptually convex' to the notion of 'a contour is Y-convex'. The latter reflects an absence of large concavities in the OY direction of an XOY frame. Then we represent a contour by a G-graph and modify the slowest descent-the small leaf trimming procedure recently introduced for the estimation of shape similarity. We prove that executing the slowest descent down to a G-graph consisting of 3 vertices allows us to detect large concavities in the QY direction. This allows us to recognize the perceptual convexity of an input contour.

Original languageEnglish
Pages (from-to)125-136
Number of pages12
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume2573
DOIs
StatePublished - 11 Aug 1995
EventVision Geometry IV 1995 - San Diego, United States
Duration: 9 Jul 199514 Jul 1995

Keywords

  • Contour
  • G-graph
  • Perceptual convexity
  • Segmentation
  • Slowest descent

Fingerprint

Dive into the research topics of 'Perceptual convexity'. Together they form a unique fingerprint.

Cite this