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.

     

A systematic method for efficient computation of full and subsets Zernike moments

A new method is proposed for fast and accurate computation of Zernike moments. This method presents a novel formula for computing exact Zernike moments by using exact complex moments where the exact values of complex moments are computed by mathematical integration of the monomials over digital image pixels. The proposed method is applicable to compute the full set of Zernike moments as well as the subsets of individual order, repetition and an individual moment. A comparison with other conventional methods is performed. The results show the superiority of the proposed method.     

Accurate and speedy computation of image Legendre moments for computer vision applications

A novel algorithm that permits the fast and accurate computation of the Legendre image moments is introduced in this paper. The proposed algorithm is based on the block representation of an image and on a new image representation scheme, the Image Slice Representation (ISR) method. The ISR method decomposes a gray-scale image as an expansion of several two-level images of different intensities (slices) and thus enables the partial application of the well-known Image Block Representation (IBR) algorithm to each image component. Moreover, using the resulted set of image blocks, the Legendre moments’ computation can be accelerated through appropriate computation schemes. Extensive experiments prove that the proposed methodology exhibits high efficiency in calculating Legendre moments on gray-scale, but furthermore on binary images. The newly introduced algorithm is suitable for the computation of the Legendre moments for pattern recognition and computer vision applications, where the images consist of objects presented in a scene.     

Exact Legendre moment computation for gray level images

A novel method is proposed for exact Legendre moment computation for gray level images. A recurrence formula is used to compute exact values of moments by mathematically integrating the Legendre polynomials over digital image pixels. This method removes the numerical approximation errors involved in conventional methods. A fast algorithm is proposed to accelerate the moment's computations. A comparison with other conventional methods is performed. The obtained results explain the superiority of the proposed method.     

A unified methodology for the efficient computation of discrete orthogonal image moments

A novel methodology is proposed in this paper to accelerate the computation of discrete orthogonal image moments. The computation scheme is mainly based on a new image representation method, the image slice representation (ISR) method, according to which an image can be expressed as the outcome of an appropriate combination of several non-overlapped intensity slices. This image representation decomposes an image into a number of binary slices of the same size whose pixels come in two intensities, black or any other gray-level value. Therefore the image block representation can be effectively applied to describe the image in a more compact way. Once the image is partitioned into intensity blocks, the computation of the image moments can be accelerated, as the moments can be computed by using decoupled computation forms. The proposed algorithm constitutes a unified methodology that can be applied to any discrete moment family in the same way and produces similar promising results, as has been concluded through a detailed experimental investigation.     

正交傅里叶—梅林矩的一种高效算法*

提出了一种高效计算图像正交傅里叶—梅林矩的算法。该算法通过消除正交多项式中的阶乘项和提取该图像矩的公共项以提高图像矩值的计算性能。实验分析表明,与传统的直接计算方法相比,该算法可有效节省计算时间,尤其是在计算高阶连续矩情况下性能更好。     

一种基于图像块的Legendre矩高精度快速算法

针对图像的Legendre正交矩计算量大和矩值求解过程中存在离散近似误差等问题,提出一种新的高精度快速计算图像Legendre矩方法.文中首先提出一种最大块优先分块策略,然后在此基础上,根据图像像素灰度值的取值特征将图像进行分块表示,以每个图像块为单位计算图像的Legendre矩.实验结果表明,与现有的快速算法相比,文中方法在保证矩值高精确的前提下,有效地减少了算术运算的次数,降低了计算复杂度,具有较快的计算速度.     

参数可调的通用半正交图像矩模型

目的 为了提高以正交多项式为核函数构造的高阶矩数值的稳定性,增强低阶矩抗噪和滤波的能力,将仅具有全局描述能力的常规正交矩推广到可以局部化提取图像特征的矩模型,从频率特性分析的角度定义一种参数可调的通用半正交矩模型。方法 首先,对传统正交矩的核函数进行合理的修正,以修正后的核函数（也称基函数）替代传统正交矩中的原核函数,使其成为修改后的特例之一。经过修正后的基函数可以有效消除图像矩数值不稳定现象。其次,采用时域的分析方法能够对图像的低阶矩作定量的分析,但无法对图像的高频部分（对应的高阶矩）作更合理的表述。因此提出一种时—频对应的方法来分析和增强不同阶矩的稳定性,通过对修正后核函数的频带宽度微调可以建立性能更优的不同阶矩。最后,利用构建的半正交—三角函数矩研究和分析了通用半正交矩模型的特点及性质。结果 将三角函数为核函数的图像矩与现有的Zernike、伪Zernike、正交傅里叶—梅林矩及贝塞尔—傅里叶矩相比,由于核函数组成简单,且其值域恒定在[-1,1]区间,因此在图像识别领域具有更快的计算速度和更高的稳定性。结论 理论分析和一系列相关图像的仿真实验表明,与传统的正交矩相比,在数值稳定性、图像重构、图像感兴趣区域（ROI）特征检测、噪声鲁棒性测试及不变性识别方面,通用的半正交矩性能及效果更优。     

Image representation using separable two-dimensional continuous and discrete orthogonal moments

This paper addresses bivariate orthogonal polynomials, which are a tensor product of two different orthogonal polynomials in one variable. These bivariate orthogonal polynomials are used to define several new types of continuous and discrete orthogonal moments. Some elementary properties of the proposed continuous Chebyshev–Gegenbauer moments (CGM), Gegenbauer–Legendre moments (GLM), and Chebyshev–Legendre moments (CLM), as well as the discrete Tchebichef–Krawtchouk moments (TKM), Tchebichef–Hahn moments (THM), Krawtchouk–Hahn moments (KHM) are presented. We also detail the application of the corresponding moments describing the noise-free and noisy images. Specifically, the local information of an image can be flexibly emphasized by adjusting parameters in bivariate orthogonal polynomials. The global extraction capability is also demonstrated by reconstructing an image using these bivariate polynomials as the kernels for a reversible image transform. Comparisons with the known moments are performed, and the results show that the proposed moments are useful in the field of image analysis. Furthermore, the study investigates invariant pattern recognition using the proposed three moment invariants that are independent of rotation, scale and translation, and an example is given of using the proposed moment invariants as pattern features for a texture classification application.     

Fast computation of accurate Gaussian–Hermite moments for image processing applications

Gaussian–Hermite moments are orthogonal moments widely used in image processing and computer vision applications. Similar to the other families of orthogonal moments, highly computational demands represent the main challenging. In this work, an efficient method is proposed for fast computation of highly accurate Gaussian–Hermite moments for gray-level images. The proposed method achieves the accuracy through the integration of Gaussian–Hermite polynomials over the image pixels. To achieve the efficiency, the symmetry property of Gaussian–Hermite polynomials is employed where the computational complexity is reduced by 75%. Fast computational methodology is employed to significantly accelerate the computational process where the 2D Gaussian–Hermite moments are treated in a separated form. Numerical experiments are performed where the results are compared with the conventional method. The comparison of the obtained results clearly ensures the efficiency of the proposed method.     

Fast computation of accurate Zernike moments

Zernike polynomials are continuous orthogonal polynomials defined in polar coordinates over a unit disk. Zernike moment’s computation using conventional methods produced two types of errors namely approximation and geometrical. Approximation errors are removed by using exact Zernike moments. Geometrical errors are minimized through a proper mapping of the image. Exact Zernike moments are expressed as a combination of exact radial moments, where exact values of radial moments are computed by mathematical integration of the monomial polynomials over digital image pixels. A fast algorithm is proposed to accelerate the moment’s computations. A comparison with other conventional methods is performed. The obtained results explain the superiority of the proposed method.     

A novel approach to the fast computation of Zernike moments

This paper presents a novel approach to the fast computation of Zernike moments from a digital image. Most existing fast methods for computing Zernike moments have focused on the reduction of the computational complexity of the Zernike 1-D radial polynomials by introducing their recurrence relations. Instead, in our proposed method, we focus on the reduction of the complexity of the computation of the 2-D Zernike basis functions. As Zernike basis functions have specific symmetry or anti-symmetry about the x-axis, the y-axis, the origin, and the straight line y=x, we can generate the Zernike basis functions by only computing one of their octants. As a result, the proposed method makes the computation time eight times faster than existing methods. The proposed method is applicable to the computation of an individual Zernike moment as well as a set of Zernike moments. In addition, when computing a series of Zernike moments, the proposed method can be used with one of the existing fast methods for computing Zernike radial polynomials. This paper also presents an accurate form of Zernike moments for a discrete image function. In the experiments, results show the accuracy of the form for computing discrete Zernike moments and confirm that the proposed method for the fast computation of Zernike moments is much more efficient than existing fast methods in most cases.     

一种可有效抵抗几何攻击的鲁棒图像水印算法

伪Zernike矩(Pesudo-Zernike Moments)是一组正交复数矩,其不仅具有旋转不变性、更低的噪声敏感性,而且还具有表达有效性、计算快速性以及多级表达性等特点.以伪Zernike矩理论为基础,提出了一种可有效抵抗几何攻击的数字图像水印新方案.该方案首先结合伪Zernike矩的旋转不变特性,计算出原始载体图像的伪Zernike矩;然后选取部分低阶伪Zernike矩;最后采纳量化调制策略将水印信息嵌入到伪Zernike矩幅值中.实验结果表明,该数字图像水印方案不仅具有良好的透明性,而且具有较强的抵抗常规信号处理、几何攻击等能力,整体性能优于Zernike矩图像水印方案.     

一种快速的具有旋转不变性的模板匹配方法

传统的基于相关的匹配方法计算量相当大，而且当模板相对于搜索图有角度旋转时，匹配的计算量更大。用圆警影和zemike矩的方法对快速的且具有旋转不变性的模板匹配方法进行了研究，圆投影将图像由二维变换成一维，这样就降低了计算复杂度，通过相似性度量可进行快速地粗匹配，然后在可能的匹配点中，再用Zemike矩实现精匹配。     

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.     

Efficient and accurate computation of geometric moments on gray-scale images

A novel algorithm that permits the fast and accurate computation of geometric moments on gray-scale images is presented in this paper. The proposed algorithm constitutes an extension of the IBR algorithm, introduced in the past, which was applicable only for binary images. A new image representation scheme, the ISR (intensity slice representation), which represents a gray-scale image as an expansion of several two-level images of different intensity values, enables the partially application of the IBR algorithm to each image component. Moreover, using the resulted set of image blocks, the geometric moments’ computation can be accelerated through appropriate computation schemes.     

Translation invariants of Zernike moments

Moment functions defined using a polar coordinate representation of the image space, such as radial moments and Zernike moments, are used in several recognition tasks requiring rotation invariance. However, this coordinate representation does not easily yield translation invariant functions, which are also widely sought after in pattern recognition applications. This paper presents a mathematical framework for the derivation of translation invariants of radial moments defined in polar form. Using a direct application of this framework, translation invariant functions of Zernike moments are derived algebraically from the corresponding central moments. Both derived functions are developed for non-symmetrical as well as symmetrical images. They mitigate the zero-value obtained for odd-order moments of the symmetrical images. Vision applications generally resort to image normalization to achieve translation invariance. The proposed method eliminates this requirement by providing a translation invariance property in a Zernike feature set. The performance of the derived invariant sets is experimentally confirmed using a set of binary Latin and English characters.     

Fast computation of exact Zernike moments using cascaded digital filters

Zernike moments have been extensively used and have received much research attention in a number of fields: object recognition, image reconstruction, image segmentation, edge detection and biomedical imaging. However, computation of these moments is time consuming. Thus, we present a fast computation technique to calculate exact Zernike moments by using cascaded digital filters. The novelty of the method proposed in this paper lies in the computation of exact geometric moments directly from digital filter outputs, without the need to first compute geometric moments. The mathematical relationship between digital filter outputs and exact geometric moments is derived and then they are used in the formulation of exact Zernike moments. A comparison of the speed of performance of the proposed algorithm with other state-of-the-art alternatives shows that the proposed algorithm betters current computation time and uses less memory.