𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast algorithm for generation of moment invariants

✍ Scribed by Liu Jin; Zhang Tianxu

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
292 KB
Volume
37
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

✦ Synopsis

Moment invariants are important shape descriptors in computer vision. The method of decomposing the trigonometric function is suggested to obtain various moment invariants. Based on this method, the "multi-ΓΏlter" algorithm is introduced as an ecient way to generate large numbers of moment invariants. A great deal of repeated computation on sub-polynomial is avoided. General explicit constructions of basic moment invariants are also provided. Furthermore, the proposed magnitude-normalized method makes invariants more stable and easier for classiΓΏcation.

πŸ“œ SIMILAR VOLUMES

Fast computation of moment invariants
Fast computation of moment invariants
✍ Bing-Cheng Li; Jun Shen πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 430 KB
A Fast Algorithm for Grid Generation
A Fast Algorithm for Grid Generation
✍ Stephen A. Jordan; Malcolm L. Spaulding πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 556 KB
A fast algorithm for generalized Hankel
A fast algorithm for generalized Hankel matrices arising in finite-moment problems
✍ Luca Gemignani πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 502 KB

Consider an n X n lower triangular matrix L whose (i + l)st row is defined by the coefficients of the real polynomial pi(x) of degree i such that {p,(x)} is's set of orthogonal polynomials satisfying a standard three-term recurrence relation. If H is an n X n real Hankel matrix with nonsingular lead