.png){kind=icon}
返回
Fast Generic Polar Harmonic Transforms
.png){kind=icon}
OA
AI
DOI：10.1109/TIP.2014.2322933.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 10x faster than direct computation and 5x 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.
Keyword:
Polar harmonic transforms
orthogonal moments
recurrence relation
shortest addition chain
Chebyshev polynomials
fast computation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
引用论文
The generalization of the R-transform for invariant pattern representation.png)
PATTERN RECOGNITIONOAAI
PATTERN RECOGNITIONIF7.6
OAAI分享收藏Generic orthogonal moments: Jacobi-Fourier moments for invariant image descriptionPATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏Chemical Basis of Biological Homochirality during the Abiotic Evolution Stages on EarthSymmetryOAAI
SymmetryIF0
OAAI分享收藏
查看更多内容