𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new fast algorithm for moment computation

✍ Scribed by Wilfried Philips

Book ID
107840359
Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
207 KB
Volume
26
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A novel algorithm for fast computation o
A novel algorithm for fast computation of Zernike moments
✍ J. Gu; H.Z. Shu; C. Toumoulin; L.M. Luo πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 369 KB

Zernike moments (ZMs) have been successfully used in pattern recognition and image analysis due to their good properties of orthogonality and rotation invariance. However, their computation by a direct method is too expensive, which limits the application of ZMs. In this paper, we present a novel al

A new fast method for computing Legendre
A new fast method for computing Legendre moments
✍ H.Z. Shu; L.M. Luo; W.X. Yu; Y. Fu πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 161 KB

This paper presents a new algorithm for fast and accurate computation of Legendre moments. For a binary image, by use of a Green's theorem, we transform a surface integral to a simple integration along the boundary. The inter-order relationship of Legendre moments is then investigated. As a result,

Fast algorithm for generation of moment
Fast algorithm for generation of moment invariants
✍ Liu Jin; Zhang Tianxu πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 292 KB

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