Skip to Main content Skip to Navigation
Conference papers

Fast Computation of Orthogonal Polar Harmonic Transforms

Thai Hoang 1 Salvatore Tabbone 2
1 ORPAILLEUR - Knowledge representation, reasonning
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
2 QGAR - Querying Graphics through Analysis and Recognition
LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
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
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Thai V. Hoang Connect in order to contact the contributor
Submitted on : Saturday, October 27, 2012 - 2:17:28 PM
Last modification on : Saturday, October 16, 2021 - 11:26:09 AM
Long-term archiving on: : Monday, January 28, 2013 - 2:35:09 AM


Files produced by the author(s)


  • HAL Id : hal-00734307, version 1



Thai 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⟩



Record views


Files downloads