Blurred image recognition by Legendre moment invariants

Detection of Interactions between Proteins by Using Legendre Moments Descriptor to Extract Discriminatory Information Embedded in PSSM

Protein-protein interactions (PPIs) play a very large part in most cellular processes. Although a great deal of research has been devoted to detecting PPIs through high-throughput technologies, these methods are clearly expensive and cumbersome. Compared with the traditional experimental methods, computational methods have attracted much attention because of their good performance in detecting PPIs. In our work, a novel computational method named as PCVM-LM is proposed which combines the probabilistic classification vector machine (PCVM) model and Legendre moments (LMs) to predict PPIs from amino acid sequences. The improvement mainly comes from using the LMs to extract discriminatory information embedded in the position-specific scoring matrix (PSSM) combined with the PCVM classifier to implement prediction. The proposed method was evaluated on Yeast and Helicobacter pylori datasets with five-fold cross-validation experiments. The experimental results show that the proposed method achieves high average accuracies of 96.37% and 93.48%, respectively, which are much better than other well-known methods. To further evaluate the proposed method, we also compared the proposed method with the state-of-the-art support vector machine (SVM) classifier and other existing methods on the same datasets. The comparison results clearly show that our method is better than the SVM-based method and other existing methods. The promising experimental results show the reliability and effectiveness of the proposed method, which can be a useful decision support tool for protein research.

Copy Move Forgery Image Detection via Discrete Radon and Polar Complex Exponential Transform-Based Moment Invariant Features

Copy move forgery with geometric distortions such as the rotational operation, the scaling operation, the mirror operation and the additive noise operation became more common. Existing methods are not competent for the detection of the copy move forgery with these distortions. In fact, the most critical issue for the detection of the forgery is the determination of the geometric features. This paper proposes an efficient Discrete Radon Polar Complex Exponential Transform (DRPCET)-based method for the extraction of the rotational and the scaling invariant features for the copy move forgery detection. First, the features obtained by the Radon transform (RT) and the Polar Complex Exponential Transform (PCET) are fused together. Then, these features are normalized. In order to achieve the scaling invariant property, an auxiliary circular template is introduced. With the auxiliary circular template, the translational moment invariant features, the rotational moment invariant features and the scaling moment invariant features are constructed for the extraction of the planar geometrical features. By further extracting some useful features for the representation of the image background, the interference of the background information can be reduced. After extracting the geometrical features, the lexicographic sorting is applied. Then, a correlation between the same part or similar parts of the image which are copied and moved to another image is computed. Based on the obtained correlations, these forgery parts can be identified and their composed positions can be located. Finally, these images are denoted as the forgery image. Extensive computer numerical simulations have been performed. The obtained results show that the proposed method can detect the copy move region in the forgery image precisely even though the forgery regions are suffered from the mixed geometric distortions.

Recognition of Images Degraded by Gaussian Blur

In this paper, we propose a new theory of invariants to Gaussian blur. We introduce a notion of a primordial image as a canonical form of all Gaussian blur-equivalent images. The primordial image is defined in spectral domain by means of projection operators. We prove that the moments of the primordial image are invariant to Gaussian blur and we derive recursive formulas for their direct computation without actually constructing the primordial image itself. We show how to extend their invariance also to image rotation. The application of these invariants is in blur-invariant image comparison and recognition. In the experimental part, we perform an exhaustive comparison with two main competitors: 1) the Zhang distance and 2) the local phase quantization.

Quaternionic Local Ranking Binary Pattern: A Local Descriptor of Color Images

This paper proposes a local descriptor called quaternionic local ranking binary pattern (QLRBP) for color images. Different from traditional descriptors that are extracted from each color channel separately or from vector representations, QLRBP works on the quaternionic representation (QR) of the color image that encodes a color pixel using a quaternion. QLRBP is able to handle all color channels directly in the quaternionic domain and include their relations simultaneously. Applying a Clifford translation to QR of the color image, QLRBP uses a reference quaternion to rank QRs of two color pixels, and performs a local binary coding on the phase of the transformed result to generate local descriptors of the color image. Experiments demonstrate that the QLRBP outperforms several state-of-the-art methods.

Projection Operators and Moment Invariants to Image Blurring

In this paper we introduce a new theory of blur invariants. Blur invariants are image features which preserve their values if the image is convolved by a point-spread function (PSF) of a certain class. We present the invariants to convolution with an arbitrary N-fold symmetric PSF, both in Fourier and image domain. We introduce a notion of a primordial image as a canonical form of all blur-equivalent images. It is defined in spectral domain by means of projection operators. We prove that the moments of the primordial image are invariant to blur and we derive recursive formulae for their direct computation without actually constructing the primordial image. We further prove they form a complete set of invariants and show how to extent their invariance also to translation, rotation and scaling. We illustrate by simulated and real-data experiments their invariance and recognition power. Potential applications of this method are wherever one wants to recognize objects on blurred images.

A Unified Methodology for Computing Accurate Quaternion Color Moments and Moment Invariants

In this paper, a general framework for computing accurate quaternion color moments and their corresponding invariants is proposed. The proposed unified scheme arose by studying the characteristics of different orthogonal polynomials. These polynomials are used as kernels in order to form moments, the invariants of which can easily be derived. The resulted scheme permits the usage of any polynomial-like kernel in a unified and consistent way. The resulted moments and moment invariants demonstrate robustness to noisy conditions and high discriminative power. Additionally, in the case of continuous moments, accurate computations take place to avoid approximation errors. Based on this general methodology, the quaternion Tchebichef, Krawtchouk, Dual Hahn, Legendre, orthogonal Fourier-Mellin, pseudo Zernike and Zernike color moments, and their corresponding invariants are introduced. A selected paradigm presents the reconstruction capability of each moment family, whereas proper classification scenarios evaluate the performance of color moment invariants.

Improving the performance of image classification by Hahn moment invariants

The discrete orthogonal moments are powerful descriptors for image analysis and pattern recognition. However, the computation of these moments is a time consuming procedure. To solve this problem, a new approach that permits the fast computation of Hahn's discrete orthogonal moments is presented in this paper. The proposed method is based, on the one hand, on the computation of Hahn's discrete orthogonal polynomials using the recurrence relation with respect to the variable x instead of the order n and the symmetry property of Hahn's polynomials and, on the other hand, on the application of an innovative image representation where the image is described by a number of homogenous rectangular blocks instead of individual pixels. The paper also proposes a new set of Hahn's invariant moments under the translation, the scaling, and the rotation of the image. This set of invariant moments is computed as a linear combination of invariant geometric moments from a finite number of image intensity slices. Several experiments are performed to validate the effectiveness of our descriptors in terms of the acceleration of time computation, the reconstruction of the image, the invariability, and the classification. The performance of Hahn's moment invariants used as pattern features for a pattern classification application is compared with Hu [IRE Trans. Inform. Theory 8, 179 (1962)] and Krawchouk [IEEE Trans. Image Process.12, 1367 (2003)] moment invariants.

Scene-oriented hierarchical classification of blurry and noisy images

A system for scene-oriented hierarchical classification of blurry and noisy images is proposed. It attempts to simulate important features of the human visual perception. The underlying approach is based on three strategies: extraction of essential signatures captured from a global context, simulating the global pathway; highlight detection based on local conspicuous features of the reconstructed image, simulating the local pathway; and hierarchical classification of extracted features using probabilistic techniques. The techniques involved in hierarchical classification use input from both the local and global pathways. Visual context is exploited by a combination of Gabor filtering with the principal component analysis. In parallel, a pseudo-restoration process is applied together with an affine invariant approach to improve the accuracy in the detection of local conspicuous features. Subsequently, the local conspicuous features and the global essential signature are combined and clustered by a Monte Carlo approach. Finally, clustered features are fed to a self-organizing tree algorithm to generate the final hierarchical classification results. Selected representative results of a comprehensive experimental evaluation validate the proposed system.

Wavelet-domain blur invariants for image analysis

Radiometric degradation is a common problem in the image acquisition part of many applications. There is much research carried out in an effort to deblur such images. However, it has been proven that it is not always necessary to go through a burdensome process of deblurring. To tackle this problem, different blur-invariant descriptors have been proposed so far, which are either in the spatial domain or based on the properties available in the Fourier domain. In this paper, wavelet-domain blur invariants are proposed for the first time for discrete 2-D signals. These descriptors, which are invariant to centrally symmetric blurs, inherit the advantages that this domain provides. It is also proven that the spatial-domain blur invariants are a special version of the proposed invariants. The performance of these invariants will be demonstrated through experiments.

Blur invariants constructed from arbitrary moments

This paper deals with moment invariants with respect to image blurring. It is mainly a reaction to the works of Zhang and Chen , recently published in these Transactions. We present a general method on how to construct blur invariants from arbitrary moments and show that it is no longer necessary to separately derive the invariants for each polynomial basis. We show how to discard dependent terms in blur invariants definition and discuss a proper implementation of the invariants in orthogonal bases using recurrent relations. An example for Legendre moments is given.

Combined invariants to similarity transformation and to blur using orthogonal Zernike moments

The derivation of moment invariants has been extensively investigated in the past decades. In this paper, we construct a set of invariants derived from Zernike moments which is simultaneously invariant to similarity transformation and to convolution with circularly symmetric point spread function (PSF). Two main contributions are provided: the theoretical framework for deriving the Zernike moments of a blurred image and the way to construct the combined geometric-blur invariants. The performance of the proposed descriptors is evaluated with various PSFs and similarity transformations. The comparison of the proposed method with the existing ones is also provided in terms of pattern recognition accuracy, template matching and robustness to noise. Experimental results show that the proposed descriptors perform on the overall better.