Abstract
A method for identifying groups of intensity edges in an image
that are likely to result from the same convex object in a scene is
described. A key property of the method is that its output is no more
complex than the original image. The method uses a triangulation of
linear edge segments to define a local neighborhood that is scale
invariant. From this local neighborhood a local convexity graph that
encodes which neighboring image edges could be part of a convex group of
image edges is constructed. A path in the graph corresponds to a convex
polygonal chain in the image, such as a convex polygon or a spiral.
Examples are presented to illustrate that the technique find intuitively
salient groups
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
