Fast computation of Tchebichef moments for binary and grayscale images. - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Image Processing Year : 2010

Fast computation of Tchebichef moments for binary and grayscale images.

(1, 2) , (1, 2) , (1, 2) , (3) , (1, 2)
1
2
3

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.
Fichier principal
Vignette du fichier
inserm-00503235_edited.pdf (747.76 Ko) Télécharger le fichier
Vignette du fichier
Fast_computation_of_Tchebichef_moments_for_binary_and_gray-scale_images.pdf (2.28 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Origin : Files produced by the author(s)
Loading...

Dates and versions

inserm-00503235 , version 1 (17-07-2010)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More