Hierarchical shape recognition using polygon approximation and dynamic alignment

Author

Lu, Cheng-Chang ; Dunham, James George

Author_Institution

Dept. of Electr. Eng., Southern Methodist Univ., Dallas, TX, USA

fYear

1988

fDate

11-14 Apr 1988

Firstpage

976

Abstract

A method for classifying closed planar shapes is presented. A shape is preprocessed and represented by several ordered sequences of vertices which are obtained by using an optimal polygon approximation algorithm with different approximation error criteria. A dynamic alignment algorithm is used to compute a similarity index between two sets of shape descriptors. The shape recognition process is hierarchical and invariant to rotation, translation and scaling. Classification experiments using noisy contours and objects have been performed with satisfactory results

Keywords

errors; pattern recognition; approximation error criteria; closed planar shapes; dynamic alignment; dynamic alignment algorithm; hierarchical shape recognition; noisy contours; ordered sequences; pattern recognition; polygon approximation; shape descriptors; similarity index; vertices; Application software; Approximation algorithms; Approximation error; Computer vision; Heuristic algorithms; Noise shaping; Pattern analysis; Pattern matching; Pattern recognition; Shape;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on

Conference_Location

New York, NY

ISSN

1520-6149

Type

conf

DOI

10.1109/ICASSP.1988.196754

Filename

196754