2015
DOI: 10.18178/lnit.3.2.60-64
|View full text |Cite
|
Sign up to set email alerts
|

Fast Computation of Chebyshev-Harmonic Fourier Moments

Abstract: The orthogonal invariant descriptors are among the best region based shape descriptors which are used in many image processing and pattern recognition applications. The Chebyshev Harmonic Fourier Moments (CHFMs) are one of such invariant descriptor. They, however, suffer from high time complexity and numerical instability at high orders of moment. In this paper, we propose a fast method based on the recursive computation of radial kernel function of CHFMs which not only reduces time complexity but also improve… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 11 publications
(11 reference statements)
0
0
0
Order By: Relevance