Perceptual convexity

Konstantin Y. Kupeev; Haim J. Wolfson

doi:10.1117/12.216408

11 August 1995 Perceptual convexity

Konstantin Y. Kupeev, Haim J. Wolfson

Proceedings Volume 2573, Vision Geometry IV; (1995) https://doi.org/10.1117/12.216408
Event: SPIE's 1995 International Symposium on Optical Science, Engineering, and Instrumentation, 1995, San Diego, CA, United States

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 2D 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 represented 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 dow to a G-graph consisting of 3 vertices allows us to detect large concavities in the OY direction. This allows us to recognize the perceptual convexity of an input contour.

Citation Download Citation

Konstantin Y. Kupeev and Haim J. Wolfson "Perceptual convexity", Proc. SPIE 2573, Vision Geometry IV, (11 August 1995); https://doi.org/10.1117/12.216408

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available