一种基于补偿法则的矩的快速算法

由于不变矩对图像的平移放大旋转的不敏感性，因此在模式识别、图像分类、场景匹配等图像处理和分析领域获得越来越广泛的应用．但是，求矩运算过程复杂、计算量大、使它的应用受到限制．基于Delta方法，提出了一种新的基于补偿法则的矩的快速算法．对任意二值图像分解为多条线段，图像的矩就等于所有线段的矩的和．对每一线段，将其左方(或上方)填满．每一线段的矩就等于填充后的线段的矩减去填充线段的矩．这样做的好处在于：一幅图像所有可能横(竖)线段的数目由N^2减少为N．引入一组N大小的数组，将求矩过程中大量重复计算的数据一次计算后存人数组，需要时查数组即得．从而极大地减少了计算量．由于填充后线段规格一致，便于用统一的公式计算且有利于编程．和已有的某些算法仅适用于无凹图像和矩计算结果是近似的相比，该算法计算结果准确，适用于任意复杂的二值图像．列出了已有矩算法运算量的评估，比较而言，所讨论的算法的计算量和用时都优于其他算法．     

几何矩顺序算法的比较性研究

几何矩是用于推导平移、伸缩和旋转不变量的常用技术。用直接方法计算矩涉及大量的加法和乘法,因而有必要研究几何矩的快速算法。该文首先综述现有的对几何矩进行快速计算的顺序算法,然后用数字实验比较Delta方法、多线段积分方法、以及Li和Shen的格林定理法的性能。多线段积分方法和Delta方法在计算Hu矩不变量方面性能是相同的,但Delta方法仅适于处理二值水平连续图像,而多线段积分方法可以处理任意二值图像。与Li和Shen的格林定理法相比,多线段积分方法在计算精度上性能很完美。     

一种用于复杂二维图像矩的快速算法

本文给出一种新的求矩快速算法。该算法用扫描方法求图像各行各线段的左外边界和右内边界;将所有线段转换为标准线段,从而使所有可能的线段数目由N^2减少为N;定义了一组N维数组,将求矩过程中大量重复计算的一些算式的结果储存于数组,需要时查数组即得,从而极大地减少了计算量。该算法原理简单,计算结果准确。不同于有些文献给出的算法只适用于无凹图像或不适用于图像中有空洞的情形。本算法适用于任何复杂的有任意多个空洞的图像。从对各种算法求矩运算量比较来看。本算法要优于其他算法。     

一种新的灰度图像Legendre矩的快速算法

Legendre正交矩在模式识别和图像分析等领域有着广泛的应用,但由于计算的复杂性,相关的快速算法尚未得到很好的解决,已有方法均局限于二值图像．文章提出了一种灰度图像的Legendre正交矩的快速算法,借助于Legendre多项式的递推公式推导出计算一维Legendre矩的递归公式．利用该关系式,一维Legendre矩Lp可以用一系列初始值L1(a),a＜p,Lo(a),a＜p-1来得到．而二维Legendre矩pq可以利用一维算法进行计算,为了降低算法复杂度,文中采用基于Systolic阵列的快速算法进行计算L1(a),Lo(a),与直接方法相比,快速算法可以大幅度减少乘法的次数,从而达到了降低算法复杂度的目的。     

一种实用的规则矩快速算法

对规则矩快速算法了进行了综述,包括图像变换、Delta方法、拐点方法、Green定理法和图像块表示法。提出了一种实用的规则矩快速算法－－截线段法,该方法可对任意二值图像计算精确。以三个图像求解Hu的矩不变量为例,对各种算法进行了分析与比较。     

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

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

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

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

Chebyshev-Fourier矩的快速计算方法

给出了求解Chebyshev-Fourier正交矩及其反变换的快速算法．和其它类型的正交矩相比,Chebyshev-Fourier正交矩不仅表达形式简单,而且具有更好的图像描述能力和鲁棒性．利用Clenshaw递推公式,作者实现了一维Fourier变换及多项式求和运算的快速计算,大大减少了复指数运算的次数,降低了计算复杂度,从而加快了Chebyshev-Fourier矩正、反变换的运算时间．图像的重建结果表明,该算法和直接计算方法具有相同的精度和稳定性,但效率更高．     

Legendre矩的一种有效算法

Ｌｅｇｅｎｄｒｅ正交矩的模式识别、图像分析等许多领域有成功的应用,然而,由于正交矩的复杂性,目前有关正交矩快速算法的研究很少,从而在一定程度上影响了它的应用,对此,作者对Ｌｅｇｅｎｄｒｅ多项式进行了研究,获得了一些新的有效的性质,它们能够显著地减少矩计算中的运算量。     

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

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

Two new algorithms for efficient computation of Legendre moments

Orthogonal moments have been successfully used in the field of pattern recognition and image analysis. However, the direct computation of orthogonal moments is very expensive. In this paper, we present two new algorithms for fast computing the two-dimensional (2D) Legendre moments. The first algorithm consists of transforming the pixel-based calculation of Legendre moments into the line-segment-based calculation. After all line-segment moments have been calculated, Hatamian's filter method is extended to calculate the one-dimensional Legendre moments. The second algorithm is directly based on the double integral formulation. The 2D shape is considered as a continuous region and the contribution of the boundary points is used for fast calculation of shape moments. The numerical results show that the new algorithms can decrease the computational complexity tremendously, furthermore, they can be used to treat any complicated objects.     

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.

     

构造标定自动机实现数字图像的Freeman链编码标定

图像的Freeman链编码是对图像边界的描述,这种链编码给我们图形一些基本特征,正在被广泛地应用到图像处理和图像识别中。本文给出了二值图像区域的标定方法。对于八近邻的图像,分别建立了一组最小的完备图。利用图像标定的基本图,为二值图像边界的识别构造了一个自动机,自动机的输出就是Freeman链编码,为二值图像区域的标定提供了一个有效算法。     

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.     

Efficient Legendre moment computation for grey level images

Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been devoted to the reduction of computational complexity. Nevertheless, the existing algorithms are mainly focused on binary images. We propose here a new fast method for computing the Legendre moments, which is not only suitable for binary images but also for grey level images. We first establish a recurrence formula of one-dimensional (1D) Legendre moments by using the recursive property of Legendre polynomials. As a result, the 1D Legendre moments of order p, L_p=L_p(0), can be expressed as a linear combination of L_p-1(1) and L_p-2(0). Based on this relationship, the 1D Legendre moments L_p(0) can thus be obtained from the arrays of L₁(a) and L₀(a), where a is an integer number less than p. To further decrease the computation complexity, an algorithm, in which no multiplication is required, is used to compute these quantities. The method is then extended to the calculation of the two-dimensional Legendre moments L_pq. We show that the proposed method is more efficient than the direct method.     

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.