Fast generic polar harmonic transforms

Abstract : Generic polar harmonic transforms have recently been proposed to extract rotation-invariant features from images and their usefulness has been demonstrated in a number of pattern recognition problems. However, direct computation of these transforms from their definition is inefficient and is usually slower than some efficient computation strategies that have been proposed for other methods. This paper presents a number of novel computation strategies to compute these transforms rapidly. The proposed methods are based on the inherent recurrence relations among complex exponential and trigonometric functions used in the definition of the radial and angular kernels of these transforms. The employment of these relations leads to recursive and addition chain-based strategies for fast computation of harmonic function-based kernels. Experimental results show that the proposed method is about 10× faster than direct computation and 5× faster than fast computation of Zernike moments using the q-recursive strategy. Thus, among all existing rotation-invariant feature extraction methods, polar harmonic transforms are the fastest.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [42 references]  Display  Hide  Download

https://hal.inria.fr/hal-01083716
Contributor : Thai V. Hoang <>
Submitted on : Monday, November 17, 2014 - 5:39:03 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:34 PM
Document(s) archivé(s) le : Friday, April 14, 2017 - 1:28:33 PM

File

Moment_har_fast_final.pdf
Files produced by the author(s)

Identifiers

Citation

Thai V. Hoang, Salvatore Tabbone. Fast generic polar harmonic transforms. IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers, 2014, 23 (7), pp.2961 - 2971. ⟨10.1109/TIP.2014.2322933⟩. ⟨hal-01083716⟩

Share

Metrics

Record views

266

Files downloads

368