Image analysis by Krawtchouk moments
In this paper, a new set of orthogonal moments based on the discrete classical Krawtchouk polynomials is introduced. The Krawtchouk polynomials are scaled to ensure numerical stability, thus creating a set of weighted Krawtchouk polynomials. The set of proposed Krawtchouk moments is then derived from the weighted Krawtchouk polynomials. The orthogonality of the proposed moments ensures minimal information redundancy. No numerical approximation is involved in deriving the moments, since the weighted Krawtchouk polynomials are discrete. These properties make the Krawtchouk moments well suited as pattern features in the analysis of two-dimensional images. It is shown that the Krawtchouk moments can be employed to extract local features of an image, unlike other orthogonal moments, which generally capture the global features. The computational aspects of the moments using the recursive and symmetry properties are discussed. The theoretical framework is validated by an experiment on image reconstruction using Krawtchouk moments and the results are compared to that of Zernike, Pseudo-Zernike, Legendre, and Tchebichef moments. Krawtchouk moment invariants is constructed using a linear combination of geometric moment invariants and an object recognition experiment shows Krawtchouk moment invariants perform significantly better than Hu's moment invariants in both noise-free and noisy conditions.
krawtchouk moments orthogonal moments krawtchouk polynomials weighted krawtchouk polynomials local features discrete orthogonal systems region-of-interest