Tree-like data structures for effective recognition of 2-D solids

Author

Lange, Michail ; Ganebnykh, Sergei

Author_Institution

Sci. Council Cybern., Acad. of Sci., Moscow, Russia

Volume

1

fYear

2004

fDate

23-26 Aug. 2004

Firstpage

592

Abstract

An approach to extracting and recognizing the patterns given by the solids in two-level images is developed. The applied data processing and analyzing procedures are based on using the tree-structured representations of both the whole image and the individual patterns. These representations provide a significant reduction of calculations at the stages of pattern segmentation and recognition. The estimations of the fidelity and computational complexity performances have been obtained for the recognition procedure based on source coding and sequential decoding schemes.

Keywords

computational complexity; feature extraction; image recognition; image representation; image segmentation; sequential decoding; source coding; tree data structures; 2D solid recognition; computational complexity; data processing; fidelity estimation; image representation; pattern extraction; pattern recognition; pattern segmentation; sequential decoding; source coding; tree like data structures; Data analysis; Data mining; Data processing; Image analysis; Image recognition; Image segmentation; Pattern analysis; Pattern recognition; Solids; Tree data structures;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on

ISSN

1051-4651

Print_ISBN

0-7695-2128-2

Type

conf

DOI

10.1109/ICPR.2004.1334210

Filename

1334210