Fast computation of Tchebichef moments for binary and grayscale images.

Huazhong Shu (1, 2) , Hui Zhang (1, 2) , Chen Beijing (1, 2) , Pascal Haigron (3) , Limin M. Luo (1, 2)

1 CRIBS - Centre de Recherche en Information Biomédicale sino-français
2 LIST - Laboratory of Image Science and Technology [Nanjing]
3 LTSI - Laboratoire Traitement du Signal et de l'Image

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.

Mots clés: Discrete orthogonal moments; Tchebichef polynomials; fast computation; image block representation; intensity slice representation

Domaines: Ingénierie biomédicale; Traitement du signal et de l'image [eess.SP]; Vision par ordinateur et reconnaissance de formes [cs.CV]; Traitement du signal et de l'image [eess.SP]

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⟩