Skip to Main content Skip to Navigation
Journal articles

Fast computation of Tchebichef moments for binary and grayscale images.

Abstract : Discrete orthogonal moments have been recently introduced in the field of image analysis. It was shown that they have better image representation capability than the continuous orthogonal moments. One problem concerning the use of moments as feature descriptors is the high computational cost, which may limit their application to the problems where the online computation is required. In this paper, we present a new approach for fast computation of the 2-D Tchebichef moments. By deriving some properties of Tchebichef polynomials, and using the image block representation for binary images and intensity slice representation for grayscale images, a fast algorithm is proposed for computing the moments of binary and grayscale images. The theoretical analysis shows that the computational complexity of the proposed method depends upon the number of blocks of the image, thus, it can speed up the computational efficiency as far as the number of blocks is smaller than the image size.
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://www.hal.inserm.fr/inserm-00503235
Contributor : Lotfi Senhadji <>
Submitted on : Saturday, July 17, 2010 - 3:27:57 PM
Last modification on : Friday, July 5, 2019 - 10:16:02 AM
Long-term archiving on: : Friday, October 22, 2010 - 3:28:06 PM

Files

Identifiers

Collections

Citation

Huazhong Shu, Hui Zhang, Chen Beijing, Pascal Haigron, Limin Luo. Fast computation of Tchebichef moments for binary and grayscale images.. IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers, 2010, 19 (12), pp.3171-80. ⟨10.1109/TIP.2010.2052276⟩. ⟨inserm-00503235⟩

Share

Metrics

Record views

590

Files downloads

1457