2003•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIERequires access

Two new algorithms for fast computation of Legendre moments

Lei Qin, Huazhong Shu, Fenghua Jin, Christine Toumoulin, Limin Luo

Abstract

Orthogonal moments have been successfully used in the field of pattern recognition and image analysis. However, due to the complexity in their calculation, the problem of fast computation of orthogonal moments has not till now been well solved. This paper presents two fast and efficient algorithms for the two dimensional (2D) Legendre moment computation. They are based on a block representation of the image and respectively use cumulative and integral methods. Results on 2D binary images show that these algorithms can decrease the computational complexity in a very important way.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Legendre polynomials, Computation, Algorithm, Computational complexity theory, Block (permutation group theory), Moment (physics), Method of moments (probability theory), Representation (politics)