Computing the eccentricity transform of a polygonal shape

Authors:
Walter G. Kropatsch;Adrian Ion;Samuel Peltier
Affiliations:
Pattern Recognition and Image Processing Group, Faculty of Informatics, Vienna University of Technology, Austria;Pattern Recognition and Image Processing Group, Faculty of Informatics, Vienna University of Technology, Austria;Pattern Recognition and Image Processing Group, Faculty of Informatics, Vienna University of Technology, Austria
Venue:
CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
Year:
2007

Citing 7
Cited 0

The all-geodesic furthest neighbor problem for simple polygons

SCG '87 Proceedings of the third annual symposium on Computational geometry
Shock Graphs and Shape Matching

International Journal of Computer Vision
Morphological Image Analysis: Principles and Applications

Morphological Image Analysis: Principles and Applications
Handbook of Mathematical Models in Computer Vision

Handbook of Mathematical Models in Computer Vision
Decomposition for efficient eccentricity transform of convex shapes

CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Shape representation and classification using the Poisson equation

CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
The eccentricity transform (of a digital shape)

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

The eccentricity transform associates to each point of a shape the distance to the point farthest away from it. The transform is defined in any dimension, for open and closed manyfolds, is robust to Salt & Pepper noise, and is quasi-invariant to articulated motion. This paper presents and algorithm to efficiently compute the eccentricity transform of a polygonal shape with or without holes. In particular, based on existing and new properties, we provide an algorithm to decompose a polygon using parallel steps, and use the result to derive the eccentricity value of any point.