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
Efficient Legendre moment computation for grey level images
β Scribed by G.Y. Yang; H.Z. Shu; C. Toumoulin; G.N. Han; L.M. Luo
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 216 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
Computing lower order moments is important in image processing. Suppose the input grey image with size N Γ N has been compressed into the block representation where the number of blocks is K, commonly K < N 2 due to the compression effect. This correspondence presents an efficient algorithm for comp
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 Computation of Moments on Compressed Grey Images using Block Representation I n image processing, moments are useful tools for analyzing shapes. Suppose that the input grey image with size N Γ N has been compressed into the compressed image using the block representation, where the number of bl