Fast Computation of Orthogonal Polar Harmonic Transforms - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Fast Computation of Orthogonal Polar Harmonic Transforms

(1) , (2)
1
2

Abstract

This paper presents a method for the computation of polar harmonic transforms that is fast and efficient. The method is based on the inherent recurrence relations among harmonic functions that are used in the definitions of the radial and angular kernels of the transforms. The employment of these relations leads to recursive strategies for fast computation of harmonic function-based kernels. Polar harmonic transforms were recently proposed and have shown nice properties for image representation and pattern recognition. The proposed method is 10-time faster than direct computation and five-time faster than fast computation of Zernike moments.
Fichier principal
Vignette du fichier
PID2416719.pdf (163.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00734307 , version 1 (27-10-2012)

Identifiers

  • HAL Id : hal-00734307 , version 1

Cite

Thai V. Hoang, Salvatore Tabbone. Fast Computation of Orthogonal Polar Harmonic Transforms. ICPR 2012 - The 21st International Conference on Pattern Recognition, Nov 2012, Tsukuba Science City, Japan. ⟨hal-00734307⟩
154 View
344 Download

Share

Gmail Facebook Twitter LinkedIn More