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.     

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.     

Fast and numerically stable methods for the computation of Zernike moments

Zernike moments (ZMs) are used in many image processing applications due to their superior performance over other moments. However, they suffer from high computation cost and numerical instability at high order of moments. In the past many recursive methods have been developed to improve their speed performance and considerable success has been achieved. The analysis of numerical stability has also gained momentum as it affects the accuracy of moments and their invariance property. There are three recursive methods which are normally used in ZMs calculation—Prata’s, Kintner’s and q-recursive methods. The earlier studies have found the q-recursive method outperforming the two other methods. In this paper, we modify Prata’s method and present a recursive relation which is proved to be faster than the q-recursive method. Numerical instability is observed at high orders of moments with the q-recursive method suffering from the underflow problem while the modified Prata’s method suffering from finite precision error. The modified Kintner’s method is the least susceptible to these errors. Keeping in view the better numerical stability, we further make the modified Kintner’s method marginally faster than the q-recursive method. We recommend the modified Prata’s method for low orders (≤90) and Kintner’s fast method for high orders (>90) of ZMs.     

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.     

基于Zernike矩的快速PPB相干斑抑制算法

应用非局部均值算法到SAR图像相干斑抑制中时存在计算量大、图像自相似性利用不足等缺点,严重制约该类算法的实际应用.针对该问题,提出一种SAR图像快速PPB滤波算法.给出基于积分图的PPB快速算法,引入Zemike矩构造一种图块相似性度量,利用Cosmo实测SAR数据进行实验.实验结果表明,该算法提高了图像自相似特征利用率,显著改善了滤波效果.     

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.     

A novel algorithm for fast computation of Zernike moments

Zernike moments (ZMs) have been successfully used in pattern recognition and image analysis due to their good properties of orthogonality and rotation invariance. However, their computation by a direct method is too expensive, which limits the application of ZMs. In this paper, we present a novel algorithm for fast computation of Zernike moments. By using the recursive property of Zernike polynomials, the inter-relationship of the Zernike moments can be established. As a result, the Zernike moment of order n with repetition m, Z_nm, can be expressed as a combination of Z_n−2,m and Z_n−4,m. Based on this relationship, the Zernike moment Z_nm, for n>m, can be deduced from Z_mm. To reduce the computational complexity, we adopt an algorithm known as systolic array for computing these latter moments. Using such a strategy, the multiplication number required in the moment calculation of Z_mm can be decreased significantly. Comparison with known methods shows that our algorithm is as accurate as the existing methods, but is more efficient.     

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.     

基于局部Zernike矩的RST不变零水印算法

旋转、缩放和平移(RST)等几何攻击能够破坏水印检测的同步性,使得水印检测失败。针对此问题,提出了一种基于图像局部Zernike矩的RST不变零水印算法。Zernike矩的幅度具有旋转不变性,再结合图像归一化,使其具有缩放和平移不变性。由于Zernike矩的图像重构效果不理想且重构过程中复杂度高,因此水印嵌入选择零水印方案。实验结果表明,该算法对旋转、缩放和平移(RST)的攻击具有很好的鲁棒性,同时对JPEG压缩、加噪、滤波等常见的图像处理操作也具有很好的鲁棒性。     

An approach for on-line signature authentication using Zernike moments

In this work, shape analysis of the acceleration plot, using lower order Zernike moments is performed for authentication of on-line signature. The on-line signature uses time functions of the signing process. The lower order Zernike moments represent the global shape of a pattern. The derived feature, acceleration vector is computed for the sample signature which comprises on-line pixels. The Zernike moment represent the shape of the acceleration plot. The summation value of a Zernike moment for a signature sample is obtained on normalized acceleration values. This type of substantiation decreases the influence of primary features with respect to translation, scaling and rotation at preprocessing stage. Zernike moments provide rotation invariance. In this investigation it was evident that the summation of magnitude of a Zernike moment for a genuine sample was less as compared to the summation of magnitude of a imposter sample. The number of derivatives of acceleration feature depends on the structural complexity of the signature sample. The computation of best order by polynomial fitting and reference template of a subject is discussed. The higher order derivatives of acceleration feature are considered. Signatures with higher order polynomial fitting and complex structure require higher order derivatives of acceleration. Each derivative better represents a portion of signature. The best result obtained is 4% of False Rejection Rate [FRR] and 2% of False Acceptance Rate [FAR].     

On the accuracy of image normalization by Zernike moments

Zernike Moment (ZM) is an effective region-based shape representation technique. The extracted ZM features should be independent of scale, position and orientation, which can be achieved by ZM-based image normalization. Nevertheless, due to the discretization of digital image and the presence of noise, the normalization is imperfect. Thus, in practice Zernike Moment Invariants (ZMI) cannot perfectly preserve the invariant properties. In this paper, firstly the ZM-based image normalization criteria are derived, and then I theoretically and experimentally evaluate the accuracy of the ZM-based image normalization. Our theoretical and experimental results not only disclose some essential facts, but also have some new findings. The relations between the accuracy of ZM-based image normalization and its influencing factors are established. A creative pseudo-polar coordinate is proposed to cut down the geometrical errors to the greatest extent. Furthermore, I suggest several techniques to improve the accuracy of image normalization. By combining moment-based image normalization with the image regularization theory and the scale-space theory, and several new conclusions are drawn. Our experimental results show that the proposed techniques can preserve the invariance of image normalization and restrain the influence of noise quite effectively.     

Shot boundary detection using Zernike moments in multi-GPU multi-CPU architectures

This paper presents an analysis of a Multi-GPU Multi-CPU environment, along with the different possible hybrid combinations. The analysis has been performed for a shot boundary detection application, based on Zernike moments, although it is general enough to be applied to many different application areas. A deep study of the performance, bottlenecks and design challenges is carried out showing the validity of this approach and achieving very high frame per second rates. In this paper, Zernike calculations are carried out on GPUs, taking advantage of a packing strategy proposed to minimize host-device communication time.     

A new class of Zernike moments for computer vision applications

A Modified Direct Method for the computation of the Zernike moments is presented in this paper. The presence of many factorial terms, in the direct method for computing the Zernike moments, makes their computation process a very time consuming task. Although the computational power of the modern computers is impressively increasing, the calculation of the factorial of a big number is still an inaccurate numerical procedure. The main concept of the present paper is that, by using Stirling’s Approximation formula for the factorial and by applying some suitable mathematical properties, a novel, factorial-free direct method can be developed. The resulted moments are not equal to those computed by the original direct method, but they are a sufficiently accurate approximation of them. Besides, their variability does not affect their ability to describe uniquely and distinguish the objects they represent. This is verified by pattern recognition simulation examples.     

Image representation using accurate orthogonal Gegenbauer moments

Image representation by using polynomial moments is an interesting theme. In this paper, image representation by using orthogonal Gegenbauer function is presented. A novel method for accurate and fast computation of orthogonal Gegenbauer moments is proposed. The accurate values of Gegenbauer moments are obtained by mathematically integrating Gegenbauer polynomials multiplied by their weight functions over the digital image pixels. A novel recurrence formula is derived for the kernel generation. The proposed method removes the numerical approximation errors involved in conventional method. A fast algorithm is proposed to accelerate the moment’s computations. A comparison with the conventional method is performed. The obtained results explain the efficiency and the superiority of the proposed method.     

Fast and low-complexity method for exact computation of 3D Legendre moments

A new method is proposed for fast and low-complexity computation of exact 3D Legendre moments. The proposed method consists of three main steps. In the first step, the symmetry property is employed where the computational complexity is reduced by 87%. In the second step, exact values of 3D Legendre moments are obtained by mathematically integrating the Legendre polynomials over digital image voxels. An algorithm is employed to significantly accelerate the computational process. In this algorithm, the equations of 3D Legendre moments are treated in a separated form. The proposed method is applied to determine translation-scale invariance of 3D Legendre moments in a very simple way. Numerical experiments are performed where the results are compared with those of the existing methods. Complexity analysis and results of the numerical experiments clearly ensure the efficiency of the proposed method.     

Zernike亚像素图像矩边缘检测算子方向角模型研究

基于Zernike图像矩的理想边缘模型,深入研究了方向角模型与亚像素判据间的关系。利用Zernike矩定义及其旋转不变特性,提出一种新的基于4阶方向角的Zernike矩亚像素边缘检测算子。为了提高边缘算子定位速度,首先基于9×9尺寸模板对Zernike图像矩0～4阶正交复数多项式进行了计算,推导出基于4阶方向角的边缘检测算子参数模型。最后将边缘算子应用在理想图像与实际图像上,检测结果表明:相比于传统的Zernike矩算子,基于4阶方向角的边缘检测算子具有更高的检测精度。     

基于Zernike矩、粗集和神经网络的数字识别方法

针对无指针式表盘的数字判读问题,提出一种基于Zernike矩和粗集预处理的神经网络数字识别方法。该方法首先利用Zernike矩的旋转不变性特征提取数字图像特征,再对所提取的Zernike矩进行基于粗集的特征约简,约简后的信息输入到训练好的神经网络进行识别。通过实际的表盘分割截取的带旋转的数字识别中试验,结果表明该方法具有识别率高,速度快的特点,具有较高的实时价值。     

基于差分法的灰度图像矩的快速算法

本文提出了一种新的对于灰度图像的几何矩的快速算法。首先运用图像差分法,将图像函数f（x,y）变换为图像函数d（x,y）。其次,从x^n（n=1,2,3）的递推求和得到一组数组。灰度图像的几何矩可以由该数组和函数d（x,y）计算获得。这种方法的优点在于：图像行（列）中具有相同像素值的连续部分,经差分后,除端点外的其它部分都为0,求矩无需考虑值为0的像素。所以,求矩计算量大大地降低了。文中给出了实验结果,和其它灰度图像求矩算法相比,文中算法在大多数情形下都极大地降低了计算复杂度。该算法乘法和加法的运算次数大约是Belkasim’s算法的47．4％和59．8％,大约是Yang’s算法的35％和51．8％。     

基于四元数Zernike矩的RST不变彩色图像水印

提出一种基于四元数Zernike矩( QZM)的RST( Rotation, Scale, Translation)不变彩色图像水印方案,利用缩放平移归一化后的QZM模值具有旋转、缩放和平移不变性,采用抖动量化调制的方法在QZM模值中嵌入水印信息。该水印算法可以把水印嵌入所带来的误差扩散到红、绿、蓝3幅分量图像中,实验表明该算法在具有良好的不可感知性的同时对旋转、缩放和平移等几何攻击具有较好的鲁棒性。     

A generalized method of moments for closed queueing networks

We introduce a new solution technique for closed product-form queueing networks that generalizes the Method of Moments (MoM), a recently proposed exact algorithm that is several orders of magnitude faster and memory efficient than the established Mean Value Analysis (MVA) algorithm. Compared to MVA, MoM recursively computes higher-order moments of queue lengths instead of mean values, an approach that remarkably reduces the computational costs of exact solutions, especially on models with large numbers of jobs.In this paper, we show that the MoM recursion can be generalized to include multiple recursive branches that evaluate models with different numbers of queues, a solution approach inspired by the Convolution algorithm. Combining the approaches of MoM and Convolution simplifies the evaluation of normalizing constants and leads to large computational savings with respect to the recursive structure originally proposed for MoM.