Image analysis by Krawtchouk moments.

IEEE Trans Image Process

Dept. of Electr. Eng., Univ. of Malaya, Kuala Lumpur, Malaysia.

Published: December 2009

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 Tchebyscheff moments. Krawtchouk moment invariants are constructed using a linear combination of geometric moment invariants; an object recognition experiment shows Krawtchouk moment invariants perform significantly better than Hu's moment invariants in both noise-free and noisy conditions.

Download full-text PDF

Source
http://dx.doi.org/10.1109/TIP.2003.818019DOI Listing

Publication Analysis

Top Keywords

krawtchouk moments
20
krawtchouk polynomials
20
moment invariants
16
krawtchouk
12
weighted krawtchouk
12
moments
11
orthogonal moments
8
krawtchouk moment
8
polynomials
5
image analysis
4

Similar Publications

Article Synopsis
  • - In medical, veterinary, and forensic fields, whole-image analysis using image data has proven to be a cost-effective method for identifying different fly species, particularly focusing on their wing images.
  • - Krawtchouk moment invariants are employed to highlight specific biological features in these wing images, enabling the classification of 759 fly specimens from various families and species using advanced machine learning techniques.
  • - The study achieved impressive accuracy rates of 98.56% at the family level and 91.04% at the species level, suggesting a reliable approach for ongoing automated identification of flies important to these fields.
View Article and Find Full Text PDF

By introducing parameters with local information, several types of orthogonal moments have recently been developed for the extraction of local features in an image. But with the existing orthogonal moments, local features cannot be well-controlled with these parameters. The reason lies in that zeros distribution of these moments' basis function cannot be well-adjusted by the introduced parameters.

View Article and Find Full Text PDF

In image analysis, orthogonal moments are useful mathematical transformations for creating new features from digital images. Moreover, orthogonal moment invariants produce image features that are resistant to translation, rotation, and scaling operations. Here, we show the result of a case study in biological image analysis to help researchers judge the potential efficacy of image features derived from orthogonal moments in a machine learning context.

View Article and Find Full Text PDF

An objective metric that predicts speech intelligibility under different types of noise and distortion would be desirable in voice communication. To date, the majority of studies concerning speech intelligibility metrics have focused on predicting the effects of individual noise or distortion mechanisms. This study proposes an objective metric, the spectrogram orthogonal polynomial measure (SOPM), that attempts to predict speech intelligibility for people with normal hearing under adverse conditions.

View Article and Find Full Text PDF

Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials.

Entropy (Basel)

September 2021

Department of Computer Engineering, Interdisciplinary Research Center for Intelligent Secure Systems, Research Institute, King Fahd University of Petroleum & Minerals, Dhahran 31261, Saudi Arabia.

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter () values deviate away from 0.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!