Computationally efficient wavelet affine invariant functions for shape recognition

Author

Bala, Erdem ; Cetin, A. Enis

Author_Institution

Dept. of Electr. & Comput. Eng., Delaware Univ., Newark, DE, USA

Volume

26

Issue

8

fYear

2004

Firstpage

1095

Lastpage

1099

Abstract

An affine invariant function for object recognition is constructed from wavelet coefficients of the object boundary. In previous works, undecimated dyadic wavelet transform was used to construct affine invariant functions. In this paper, an algorithm based on decimated wavelet transform is developed to compute an affine invariant function. As a result computational complexity is reduced without decreasing recognition performance. Experimental results are presented.

Keywords

computational complexity; object recognition; wavelet transforms; computational complexity; object recognition; shape recognition; undecimated dyadic wavelet transform; wavelet affine invariant functions; wavelet coefficients; Computational complexity; Discrete wavelet transforms; Filter bank; Jacobian matrices; Object recognition; Shape; Signal resolution; Transmission line matrix methods; Wavelet coefficients; Wavelet transforms; Affine transformation; computational efficiency.; decimated wavelet transform; shape recognition; Algorithms; Artificial Intelligence; Cluster Analysis; Computer Graphics; Image Enhancement; Image Interpretation, Computer-Assisted; Imaging, Three-Dimensional; Information Storage and Retrieval; Numerical Analysis, Computer-Assisted; Pattern Recognition, Automated; Reproducibility of Results; Sensitivity and Specificity; Signal Processing, Computer-Assisted;

fLanguage

English

Journal_Title

Pattern Analysis and Machine Intelligence, IEEE Transactions on

Publisher

ieee

ISSN

0162-8828

Type

jour

DOI

10.1109/TPAMI.2004.39

Filename

1307016