𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new fast method for computing Legendre moments

✍ Scribed by H.Z. Shu; L.M. Luo; W.X. Yu; Y. Fu

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
161 KB
Volume
33
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

✦ Synopsis

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, the moments of higher order can be deduced from those of lower order. Based on this relationship, an iterative method is proposed to calculate the Legendre moments from a polygonal approximation of the boundary. Comparison with known methods shows that our algorithm is almost as e$cient as the existing method, but is more accurate.

πŸ“œ SIMILAR VOLUMES

An Efficient Method for Computation of L
An Efficient Method for Computation of Legendre Moments
✍ Huazhong Shu; Limin Luo; Xudong Bao; Wenxue Yu; Guoniu Han πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 227 KB

The two-dimensional (2D) and three-dimensional (3D) orthogonal moments are useful tools for 2D and 3D object recognition and image analysis. However, the problem of computation of orthogonal moments has not been well solved because there exist few algorithms that can efficiently reduce the computati

Two new algorithms for efficient computa
Two new algorithms for efficient computation of Legendre moments
✍ J.D. Zhou; H.Z. Shu; L.M. Luo; W.X. Yu πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 147 KB

Orthogonal moments have been successfully used in the ΓΏeld of pattern recognition and image analysis. However, the direct computation of orthogonal moments is very expensive. In this paper, we present two new algorithms for fast computing the two-dimensional (2D) Legendre moments. The ΓΏrst algorithm