Fast generic polar harmonic transforms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE Transactions on Image Processing Year : 2014

Fast generic polar harmonic transforms


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.
Fichier principal
Vignette du fichier
Moment_har_fast_final.pdf (1.08 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01083716 , version 1 (17-11-2014)



Thai V. Hoang, Salvatore Tabbone. Fast generic polar harmonic transforms. IEEE Transactions on Image Processing, 2014, 23 (7), pp.2961 - 2971. ⟨10.1109/TIP.2014.2322933⟩. ⟨hal-01083716⟩
162 View
324 Download



Gmail Facebook Twitter LinkedIn More