Share Email Print

Proceedings Paper

Perceptual convexity
Author(s): Konstantin Y. Kupeev; Haim J. Wolfson
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 11 August 1995
PDF: 12 pages
Proc. SPIE 2573, Vision Geometry IV, (11 August 1995); doi: 10.1117/12.216408
Show Author Affiliations
Konstantin Y. Kupeev, Tel Aviv Univ. (Israel)
Haim J. Wolfson, Tel Aviv Univ. (Israel)

Published in SPIE Proceedings Vol. 2573:
Vision Geometry IV
Robert A. Melter; Angela Y. Wu; Fred L. Bookstein; William D. K. Green, Editor(s)

© SPIE. Terms of Use
Back to Top