Hierarchical representation of 2-D shapes using convex polygons: a contour-based approach

Authors:
O. El Badawy;M. S. Kamel
Affiliations:
Pattern Analysis and Machine Intelligence Laboratory, Department of Systems Design Engineering, University of Waterloo, Waterloo, ON, Canada N2L 3G1;Pattern Analysis and Machine Intelligence Laboratory, Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada N2L 3G1
Venue:
Pattern Recognition Letters
Year:
2005

Citing 9
Cited 5

On-line construction of the convex hull of a simple polyline

Information Processing Letters
Morphological Shape Decomposition

IEEE Transactions on Pattern Analysis and Machine Intelligence
Analyzing nonconvex 2D and 3D patterns

Computer Vision and Image Understanding
Hierarchical representation of 2-D shapes using convex polygons: A morphological approach

Pattern Recognition Letters
Morphological Reversible Contour Representation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal Decomposition of Convex Morphological Structuring Elements for 4-Connected Parallel Array Processors

IEEE Transactions on Pattern Analysis and Machine Intelligence
Measuring Concavity on a Rectangular Mosaic

IEEE Transactions on Computers
Morphological operators for image and video compression

IEEE Transactions on Image Processing
Efficient morphological shape representation with overlapping disk components

IEEE Transactions on Image Processing

3D shape recursive decomposition by Poisson equation

Pattern Recognition Letters
Envelope detection of multi-object shapes

ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
Compressing 2-d shapes using concavity trees

ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
Retrieval of hand-sketched envelopes in logo images

ICIAR'07 Proceedings of the 4th international conference on Image Analysis and Recognition
Recursive computation of minimum-length polygons

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.10

Visualization

Abstract

A concavity tree is a data structure for hierarchically representing the shape of two-dimensional silhouettes using convex polygons. In this paper, we present a new algorithm for concavity tree extraction. The algorithm is fast, works directly on the pixel grid of the shape, and uses exact convex hull computations. We compare our method to the morphological approach to concavity tree extraction and we report better computational performance and smaller reconstruction errors.