Fast Computation of Orthogonal Polar Harmonic Transforms

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.
Document type :
Conference papers
ICPR 2012 - The 21st International Conference on Pattern Recognition, Nov 2012, Tsukuba Science City, Japan. 2012


https://hal.inria.fr/hal-00734307
Contributor : Thai V. Hoang <>
Submitted on : Saturday, October 27, 2012 - 2:17:28 PM
Last modification on : Friday, February 22, 2013 - 11:58:03 AM

File

PID2416719.pdf
fileSource_public_author

Identifiers

  • HAL Id : hal-00734307, version 1

Collections

Citation

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. 2012. <hal-00734307>

Export

Share

Metrics

Consultation de
la notice

109

Téléchargement du document

211