Image analysis by Bessel-Fourier moments

In this paper, we proposed a new set of moments based on the Bessel function of the first kind, named Bessel-Fourier moments (BFMs), which are more suitable than orthogonal Fourier-Mellin and Zernike moments for image analysis and rotation invariant pattern recognition. Compared with orthogonal Fourier-Mellin and Zernike polynomials of the same degree, the new orthogonal radial polynomials have more zeros, and these zeros are more evenly distributed. The Bessel-Fourier moments can be thought of as generalized orthogonalized complex moments. Theoretical and experimental results show that the Bessel-Fourier moments perform better than the orthogonal Fourier-Mellin and Zernike moments (OFMMs and ZMs) in terms of image reconstruction capability and invariant recognition accuracy in noise-free, noisy and smooth distortion conditions.     

An efficient and robust multi-frame image super-resolution reconstruction using orthogonal Fourier-Mellin moments

Multi-frame image super-resolution (SR) has recently become an active area of research. The orthogonal rotation invariant moments (ORIMs) have several useful characteristics which make them very suitable for multi-frame image super-resolution application. Among the various ORIMs, Zernike moments (ZMs) and pseudo-Zernike moments (PZMs)-based SR approaches, i.e., NLM-ZMs and NLM-PZMs, have already shown improved SR performances for multi-frame image super-resolution. However, it is a well-known fact that among many ORIMs, orthogonal Fourier-Mellin moments (OFMMs) demonstrate better noise robustness and image representation capabilities for small images as compared to ZMs and PZMs. Therefore, in this paper, we propose a multi-frame image super-resolution approach using OFMMs. The proposed approach is based on the NLM framework because of its inherent capability of estimating motion implicitly. We have referred to this proposed approach as NLM-OFMMs-I. Also, a novel idea of using OFMMs-based interpolation in place of traditional Lanczos interpolation for obtaining an initial estimate of HR sequence has been presented in this paper. This variant of the proposed approach is referred to as NLM-OFMMs-II. Detailed experimental analysis demonstrates the effectiveness of the proposed OFMMs-based SR approaches to generate high-quality HR images in the presence of factors like image noise, global motion, local motion, and rotation in between the image frames.     

基于Radon和解析Fourier Mellin变换的尺度

由于正交矩对噪声鲁棒性强、重建效果好,因此被广泛应用于目标识别与分类中,但是正交矩本质上缺乏尺度变换不变性,而且必要的图像二值化与规一化过程会引入重采样与重量化误差。为此,在研究现有正交矩的基础上,提出了一种基于Radon变换和解析FourierMellin变换的尺度与旋转不变的目标识别算法。该算法首先直接对目标灰度图像进行Radon变换,然后对Radon变换结果进行进一步解析,通过FourierMellin变换将原图像的旋转变化转化为相位变化,将原图像的尺度变化转化为幅度变化;最后,通过定义一旋转与尺度不变函数,同时利用不变函数的4种特征,再应用k近邻法实现分类。理论与实验结果表明,由于避免了正交矩方法存在的重采样与重量化误差,该算法的分类精度高于基于正交矩的分类方法,而且对白噪声的鲁棒性也显著高于基于正交矩的识别与分类方法。     

Circularly orthogonal moments for geometrically robust image watermarking

Circularly orthogonal moments, such as Zernike moments (ZMs) and pseudo-Zernike moments (PZMs), have attracted attention due to their invariance properties. However, we find that for digital images, the invariance properties of some ZMs/PZMs are not perfectly valid. This is significant for applications of ZMs/PZMs. By distinguishing between the ‘good’ and ‘bad’ ZMs/PZMs in terms of their invariance properties, we design image watermarks with ‘good’ ZMs/PZMs to achieve watermark's robustness to geometric distortions, which has been considered a crucial and difficult issue in the research of digital watermarking. Simulation results show that the embedded information can be decoded at low error rates, robust against image rotation, scaling, flipping, as well as a variety of other common manipulations such as lossy compression, additive noise and lowpass filtering.     

基于Radon和解析Fourier-Mellin变换的尺度与旋转不变目标识别算法

由于正交矩对噪声鲁棒性强、重建效果好,因此被广泛应用于目标识别与分类中,但是正交矩本质上缺乏尺度变换不变性,而且必要的图像二值化与规一化过程会引入重采样与重量化误差。为此,在研究现有正交矩的基础上,提出了一种基于Radon变换和解析Fourier-Mellin变换的尺度与旋转不变的目标识别算法。该算法首先直接对目标灰度图像进行Radon变换,然后对Radon变换结果进行进一步解析,通过Fourier-Mellin变换将原图像的旋转变化转化为相位变化,将原图像的尺度变化转化为幅度变化;最后,通过定义一旋转与尺度不变函数,同时利用不变函数的4种特征,再应用k-近邻法实现分类。理论与实验结果表明,由于避免了正交矩方法存在的重采样与重量化误差,该算法的分类精度高于基于正交矩的分类方法,而且对白噪声的鲁棒性也显著高于基于正交矩的识别与分类方法。     

Fuzzy ARTMAP classification of invariant features derived using angle of rotation from a neural network

Conventional regular moment functions have been proposed as pattern sensitive features in image classification and recognition applications. But conventional regular moments are only invariant to translation, rotation and equal scaling. It is shown that the conventional regular moment invariants remain no longer invariant when the image is scaled unequally in the x- and y-axis directions. We address this problem by presenting a technique to make the regular moment functions invariant to unequal scaling. However, the technique produces a set of features that are only invariant to translation, unequal/equal scaling and reflection. They are not invariant to rotation. To make them invariant to rotation, moments are calculated with respect to the principal axis of the image. To perform this, the exact angle of rotation must be known. But the method of using the second-order moments to determine this angle will also be inclusive of an undesired tilt angle. Therefore, in order to correctly determine the amount of rotation, the tilt angle which differs for different scaling factors in the x- and y-axis directions for the particular image must be obtained. In order to solve this problem, a neural network using the back-propagation learning algorithm is trained to estimate the tilt angle of the image and from this the amount of rotation for the image can be determined. Next, the new moments are derived and a Fuzzy ARTMAP network is used to classify these images into their respective classes. Sets of experiments involving images rotated and scaled unequally in the x- and y-axis directions are carried out to demonstrate the validity of the proposed technique.     

图像识别的RSTC不变矩

分析了对比度变化对Hu矩的影响，构造了一种新的不变矩形式，该矩不但具有通常的旋转、尺度缩放以及平移不变性，同时还具有对比度变化不变性。以三类具有旋转、尺度缩放、平移以及对比度变化（RSTC）的目标图像为例进行了识别仿真实验，结果表明新的不变矩形式消除了对比度变化带来的影响，增强了三类图像的类内内聚性和类间可分性，实验结果证明能够对具有RSTC变化的目标图像进行有效识别。     

Rotation,scaling and translation invariant texture recognition by Bessel-Fourier moments

The ideal of Bessel-Fourier moments (BFMs) for image analysis and only rotation invariant image cognition has been proposed recently. In this paper, we extend the previous work and propose a new method for rotation, scaling and translation (RST) invariant texture recognition using Bessel-Fourier moments. Compared with the others moments based methods, the radial polynomials of Bessel-Fourier moments have more zeros and these zeros are more evenly distributed. It makes Bessel-Fourier moments more suitable for invariant texture recognition as a generalization of orthogonal complex moments. In the experiment part, we got three testing sets of 16, 24 and 54 texture images by way of translating, rotating and scaling them separately. The correct classification percentages (CCPs) are compared with that of orthogonal Fourier-Mellin moments and Zernike moments based methods in both noise-free and noisy condition. Experimental results validate the conclusion of theoretical derivation: BFM performs better in recognition capability and noise robustness in terms of RST texture recognition under both noise-free and noisy condition when compared with orthogonal Fourier-Mellin moments and Zernike moments based methods.     

Algorithms for fast computation of Zernike moments and their numerical stability

Accuracy, speed and numerical stability are among the major factors restricting the use of Zernike moments (ZMs) in numerous commercial applications where they are a tool of significant utility. Often these factors are conflicting in nature. The direct formulation of ZMs is prone to numerical integration error while in the recent past many fast algorithms are developed for its computation. On the other hand, the relationship between geometric moments (GMs) and ZMs reduces numerical integration error but it is observed to be computation intensive. We propose fast algorithms for both the formulations. In the proposed method, the order of time complexity for GMs-to-ZMs formulation is reduced and further enhancement in speed is achieved by using quasi-symmetry property of GMs. The existing q-recursive method for direct formulation is further modified by incorporating the recursive steps for the computation of trigonometric functions. We also observe that q-recursive method provides numerical stability caused by finite precision arithmetic at high orders of moment which is hitherto not reported in the literature. Experimental results on images of different sizes support our claim.     

Radial shifted Legendre moments for image analysis and invariant image recognition

The rotation, scaling and translation invariant property of image moments has a high significance in image recognition. Legendre moments as a classical orthogonal moment have been widely used in image analysis and recognition. Since Legendre moments are defined in Cartesian coordinate, the rotation invariance is difficult to achieve. In this paper, we first derive two types of transformed Legendre polynomial: substituted and weighted radial shifted Legendre polynomials. Based on these two types of polynomials, two radial orthogonal moments, named substituted radial shifted Legendre moments and weighted radial shifted Legendre moments (SRSLMs and WRSLMs) are proposed. The proposed moments are orthogonal in polar coordinate domain and can be thought as generalized and orthogonalized complex moments. They have better image reconstruction performance, lower information redundancy and higher noise robustness than the existing radial orthogonal moments. At last, a mathematical framework for obtaining the rotation, scaling and translation invariants of these two types of radial shifted Legendre moments is provided. Theoretical and experimental results show the superiority of the proposed methods in terms of image reconstruction capability and invariant recognition accuracy under both noisy and noise-free conditions.     

基于图像边缘小波矩和支持向量机的目标识别

小波矩结合了矩特征和小波特征,既反映了图像的全局性信息,又反映了图像的局域性信息,并且具有旋转、平移和缩放不变性.利用小波矩与支持向量机进行目标识别,不但解决了图像识别中特征量随图像旋转、平移和缩放而变化的问题,而且提高了对近似物体的识别能力,是解决小样本、近似图像识别的有效方法.     

New set of adapted Gegenbauer–Chebyshev invariant moments for image recognition and classification

Orthogonal moments and their invariants to geometric transformations for gray-scale images are widely used in many pattern recognition and image processing applications. In this paper, we propose a new set of orthogonal polynomials called adapted Gegenbauer–Chebyshev polynomials (AGC). This new set is used as a basic function to define the orthogonal adapted Gegenbauer–Chebyshev moments (AGCMs). The rotation, scaling, and translation invariant property of (AGCMs) is derived and analyzed. We provide a novel series of feature vectors of images based on the adapted Gegenbauer–Chebyshev orthogonal moments invariants (AGCMIs). We practice a novel image classification system using the proposed feature vectors and the fuzzy k-means classifier. A series of experiments is performed to validate this new set of orthogonal moments and compare its performance with the existing orthogonal moments as Legendre invariants moments, the Gegenbauer and Tchebichef invariant moments using three different image databases: the MPEG7-CE Shape database, the Columbia Object Image Library (COIL-20) database and the ORL-faces database. The obtained results ensure the superiority of the proposed AGCMs over all existing moments in representation and recognition of the images.

     

On the fast computation of orthogonal Fourier–Mellin moments with improved numerical stability

A fast and numerically stable recursive method for the computation of orthogonal Fourier?CMellin moments (OFMMs) is proposed. Fast recursive method is developed for the radial polynomials which occur in the kernel function of the OFMMs, thus enhancing the overall computation speed. The proposed method is free from any overflow situations as it does not consist of any factorial term. It is also free from underflow situations as no power terms are involved. The proposed recursive method is claimed to be fastest in comparison with the direct and other methods to compute OFMMs till date. The elimination of the computation of factorial terms makes the moments very stable even up to an order of 200, which become instable in conventional or in any other recursive methods proposed earlier wherein instability occurs at moment order ??25. Experiments are performed on standard test images to prove the superiority of the proposed method on existing methods in terms of speed and numerical stability.     

Sorting of rice grains using Zernike moments

Two important factors that determine the efficiency and reliability of a rice sorting machine are the overall processing speed and the classification accuracy. In this paper, an efficient rice sorting process which uses a subset of Zernike moments (ZM) and a multilayer perceptron is presented. Since the falling rice grains during sorting process can be in any orientation, a rotational invariant feature set is crucial in this application. Hence, the set of ZM with its inherent rotational invariance property is chosen in this context. Nevertheless, one of the main drawbacks of ZM in real-time application is its long computation time. To overcome this, a subset of ZM is selected from its original full set of 12 orders, using the combination of fuzzy ARTMAP and genetic algorithm. To further reduce the computation time, the combination of q-recursive method and Zernike polynomials’ inherent symmetry property is utilized. Hence, the processing time of the subset of ZM is significantly reduced by almost 67% while maintaining the classification accuracy as compared to computing the original full set of ZMs.     

Image Analysis by Two Types of Franklin-Fourier Moments

In this paper, we first derive two types of transformed Franklin polynomial: substituted and weighted radial Franklin polynomials. Two radial orthogonal moments are proposed based on these two types of polynomials, namely substituted Franklin-Fourier moments and weighted Franklin-Fourier moments (SFFMs and WFFMs), which are orthogonal in polar coordinates. The radial kernel functions of SFFMs and WFFMs are transformed Franklin functions and Franklin functions are composed of a class of complete orthogonal splines function system of degree one. Therefore, it provides the possibility of avoiding calculating high order polynomials, and thus the accurate values of SFFMs and WFFMs can be obtained directly with little computational cost. Theoretical and experimental results show that Franklin functions are not well suited for constructing higher-order moments of SFFMs and WFFMs, but compared with traditional orthogonal moments (e.g., BFMs, OFMs and ZMs) in polar coordinates, the proposed two types of Franklin-Fourier Moments have better performance respectively in lower-order moments.