Show simple item record

dc.contributor.authorBala, E.en_US
dc.contributor.authorÇetin, A. Enisen_US
dc.date.accessioned2016-02-08T10:26:18Z
dc.date.available2016-02-08T10:26:18Z
dc.date.issued2004en_US
dc.identifier.issn0162-8828
dc.identifier.urihttp://hdl.handle.net/11693/24244
dc.description.abstractAn 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. © 2004 IEEE.en_US
dc.language.isoEnglishen_US
dc.source.titleIEEE Transactions on Pattern Analysis and Machine Intelligenceen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/TPAMI.2004.39en_US
dc.subjectAlgorithmsen_US
dc.subjectApproximation theoryen_US
dc.subjectComputational complexityen_US
dc.subjectComputer simulationen_US
dc.subjectCorrelation methodsen_US
dc.subjectImage analysisen_US
dc.subjectMatrix algebraen_US
dc.subjectWavelet transformsen_US
dc.subjectAffine transformationen_US
dc.subjectComputational efficiencyen_US
dc.subjectDecimated wavelet transformen_US
dc.subjectShape recognitionen_US
dc.subjectObject recognitionen_US
dc.titleComputationally efficient wavelet affine invariant functions for shape recognitionen_US
dc.typeArticleen_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.citation.spage1095en_US
dc.citation.epage1099en_US
dc.citation.volumeNumber26en_US
dc.citation.issueNumber8en_US
dc.identifier.doi10.1109/TPAMI.2004.39en_US
dc.publisherIEEEen_US
dc.contributor.bilkentauthorÇetin, A. Enis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record