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.     

Image reconstruction from continuous Gaussian–Hermite moments implemented by discrete algorithm

The problem of image reconstruction from its statistical moments is particularly interesting to researchers in the domain of image processing and pattern recognition. Compared to geometric moments, the orthogonal moments offer the ability to recover much more easily the image due to their orthogonality, which allows reducing greatly the complexity of computation in the phase of reconstruction. Since the 1980s, various orthogonal moments, such as Legendre moments, Zernike moments and discrete Tchebichef moments have been introduced early or late to image reconstruction. In this paper, another set of orthonormal moments, the Gaussian–Hermite moments, based on Hermite polynomials modulated by a Gaussian envelope, is proposed to be used for image reconstruction. Especially, the paper's focus is on the determination of the optimal scale parameter and the improvement of the reconstruction result by a post-processing which make Gaussian–Hermite moments be useful and comparable with other moments for image reconstruction. The algorithms for computing the values of the basis functions, moment computation and image reconstruction are also given in the paper, as well as a brief discussion on the computational complexity. The experimental results and error analysis by comparison with other moments show a good performance of this new approach.     

3D radial invariant of dual Hahn moments

In this work, we propose new sets of 2D and 3D rotation invariants based on orthogonal radial dual Hahn moments, which are orthogonal on a non-uniform lattice. We also present theoretical mathematics to derive them. Thus, this paper presents in the first case new 2D radial dual Hahn moments based on polar representation of an image by one-dimensional orthogonal discrete dual Hahn polynomials and a circular function. The dual Hahn polynomials are general case of Tchebichef and Krawtchouk polynomials. In the second case, we introduce new 3D radial dual Hahn moments employing a spherical representation of volumetric image by one-dimensional orthogonal discrete dual Hahn polynomials and a spherical function, which are orthogonal on a non-uniform lattice. The 2D and 3D rotational invariants are extracts from the proposed 2D and 3D radial dual Hahn moments respectively. In order to test the proposed approach, three problems namely image reconstruction, rotational invariance and pattern recognition are attempted using the proposed moments. The result of experiments shows that the radial dual Hahn moments have performed better than the radial Tchebichef and Krawtchouk moments, with and without noise. Simultaneously, the mentioned reconstruction converges quickly to the original image using 2D and 3D radial dual Hahn moments, and the test images are clearly recognized from a set of images that are available in COIL-20 database for 2D image and PSB database for 3D image.

     

Using tchebichef moment for fast and efficient image compression

Orthogonal moment is known as better moment functions compared to the non-orthogonal moment. Among all the orthogonal moments, Tchebichef Moment appear to be the most recent moment functions that still attract the interest among the computer vision researchers. This paper proposes a novel approach based on discrete orthogonal Tchebichef Moment for an efficient image compression. The image compression is useful in many applications especially related to images that are needed to be seen in small devices such as in mobile phone. Meanwhile, the method incorporates simplified mathematical framework techniques using matrices, as well as a block-wise reconstruction technique to eliminate possible occurrences of numerical instabilities at higher moment orders. In addition, a comparison between Tchebichef Moment compression and JPEG compression is conducted. The result shows significant advantages for Tchebichef Moment in terms of its image quality and compression rate. Tchebichef moment provides a more compact support to the image via sub-block reconstruction for compression. Tchebichef Moment Compression is able to perform potentially better for a broader domain on real digital images and graphically generated images.     

Three dimensional radial Tchebichef moment invariants for volumetric image recognition

The property of rotation, scaling and translation invariant has a great important in 3D image classification and recognition. Tchebichef moments as a classical orthogonal moment have been widely used in image analysis and recognition. Since Tchebichef moments are represented in Cartesian coordinate, the rotation invariance can’t easy to realize. In this paper, we propose a new set of 3D rotation scaling and translation invariance of radial Tchebichef moments. We also present a theoretical mathematics to derive them. Hence, this paper we present a new 3D radial Tchebichef moments using a spherical representation of volumetric image by a one-dimensional orthogonal discrete Tchebichef polynomials and a spherical function. 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 Tchebichef 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. The result of experiments prove that the Tchebichef moments have done better than the Krawtchouk moments with and without noise. Simultaneously, the reconstructed 3D image converges quickly to the original image using 3D radial Tchebichef moments and the test images are clearly recognized from a set of images that are available in a PSB database.     

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.     

二维Tchebichef 正交矩反变换的快速算法

提出了一种二维Tchebichef矩反变换的快速算法.借助Clenshaw递推公式,推导了一维Tchebichef矩反变换的快速算法,并将其推广至二维Tchebichef正交矩反变换的计算.与以迭代方式计算Tchebichef多项式进而计算二维Tchebichef矩反变换的方法相比,文中提出的算法有效地减少了算术运算的次数,大幅提高了计算速度.实验结果表明了该方法的有效性.     

Recursive computation of Tchebichef moment and its inverse transform

Tchebichef moment is a novel set of orthogonal moment applied in the fields of image analysis and pattern recognition. Less work has been made for the computation of Tchebichef moment and its inverse moment transform. In this paper, both a direct recursive algorithm and a compact algorithm are developed for the computation of Tchebichef moment. The effective recursive algorithm for inverse Tchebichef moment transform is also presented. Clenshaw's recurrence formula was used in this paper to transform kernels of the forward and inverse Tchebichef moment transform. There is no need for the proposed algorithms to compute the Tchebichef polynomial values. The approaches presented are more efficient compared with the straightforward methods, and particularly suitable for parallel VLSI implementation due to their regular and simple filter structures.     

Reconstruction of tomographic images from limited range projections using discrete Radon transform and Tchebichef moments

This paper presents an image reconstruction method for X-ray tomography from limited range projections. It makes use of the discrete Radon transform and a set of discrete orthogonal Tchebichef polynomials to define the projection moments and the image moments. By establishing the relationship between these two sets of moments, we show how to estimate the unknown projections from known projections in order to improve the image reconstruction. Simulation results are provided in order to validate the method and to compare its performance with some existing algorithms.     

An Optimized Quantization Technique for Image Compression Using Discrete Tchebichef Transform

Discrete Tchebichef transform (DTT) has been utilized to improve the reconstruction quality of the traditional methods in image compression. Although DTT has the effective capability of energy concentration and ease of computation, not been exploited polynomials in orthogonal transform as compared with discrete cosine transform (DCT). This paper proposes an efficient lossy compression based DTT to produce better quality reconstructed image for the desired compression ratio. We combine soft decision quantization (SDQ) to design optimal quantization table and to approximate the rate-distortion for the purpose of the reconstruction quality. Compared with DCT under the scheme of JPEG baseline system, experimental results show that the proposed algorithm is of greater reconstruction image quality when the bit ratio exceeds 0.5 bpp. The bit ratio is decreased by 0.25, 0.49, 0.20 bpp, respectively when peak signal-to-noise-ratio (PSNR) is 35, 40, 45 dB. Meanwhile, they are similar on the elapsed time in encoding and decoding.     

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.

     

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.     

基于两变量Krawtchouk矩的图像重建

传统的离散正交Krawtchouk矩的基函数由两个单变量的Krawtchouk多项式乘积构成,它割裂平面两个方向之间的联系。提出了一种新的、以两变量Krawtchouk正交多项式为基函数的图像矩,并推导了正则化后两变量多项式的简单的计算方法。重建实验结果表明,相对于同系数的单变量的离散正交矩,两变量离散正交矩的重建误差更小。     

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.     

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.     

Orthogonal moments based on exponent functions: Exponent-Fourier moments

In this paper, we propose a new set of orthogonal moments based on Exponent functions, named Exponent-Fourier moments (EFMs), which are suitable for image analysis and rotation invariant pattern recognition. Compared with Zernike polynomials of the same degree, the new radial functions have more zeros, and these zeros are evenly distributed, this property make EFMs have strong ability in describing image. Unlike Zernike moments, the kernel of computation of EFMs is extremely simple. Theoretical and experimental results show that Exponent-Fourier moments perform very well in terms of image reconstruction capability and invariant recognition accuracy in noise-free, noisy and smooth distortion conditions. The Exponent-Fourier moments can be thought of as generalized orthogonal complex moments.     

An efficient method for the computation of Legendre moments

Legendre moments are continuous moments, hence, when applied to discrete-space images, numerical approximation is involved and error occurs. This paper proposes a method to compute the exact values of the moments by mathematically integrating the Legendre polynomials over the corresponding intervals of the image pixels. Experimental results show that the values obtained match those calculated theoretically, and the image reconstructed from these moments have lower error than that of the conventional methods for the same order. Although the same set of exact Legendre moments can be obtained indirectly from the set of geometric moments, the computation time taken is much longer than the proposed method.     

Image quality assessment by discrete orthogonal moments

This paper proposes a novel full-reference quality assessment (QA) metric that automatically assesses the quality of an image in the discrete orthogonal moments domain. This metric is constructed by representing the spatial information of an image using low order moments. The computation, up to fourth order moments, is performed on each individual (8×8) non-overlapping block for both the test and reference images. Then, the computed moments of both the test and reference images are combined in order to determine the moment correlation index of each block in each order. The number of moment correlation indices used in this study is nine. Next, the mean of each moment correlation index is computed and thereafter the single quality interpretation of the test image with respect to its reference is determined by taking the mean value of the computed means of all the moment correlation indices. The proposed objective metrics based on two discrete orthogonal moments, Tchebichef and Krawtchouk moments, are developed and their performances are evaluated by comparing them with subjective ratings on several publicly available databases. The proposed discrete orthogonal moments based metric performs competitively well with the state-of-the-art models in terms of quality prediction while outperforms them in terms of computational speed.