基于两变量Hahn矩的图像分析

提出了一种新的、以两变量离散正交Hahn多项式为核函数的图像矩,推导了正则化后,两变量离散正交Hahn多项式的简单的计算方法。对二值图像、灰度图像以及噪声图像的重建实验表明：相对于同系数的单变量的Hahn矩,两变量Hahn矩的重建误差更小。因此,它们能够更好地提取图像的特征。     

Krawtchouk矩旋转不变性的分析

矩是基于区域的形状描述子,相对于基于轮廓的描述子例如傅立叶、链码描述子等,对于不连通的图像形状描述和对噪声的鲁棒性等方面有着更良好的性能.正交矩又可分为连续正交矩和离散正交矩,Krawtchouk矩是离散正交矩中的一种,和连续正交矩不同,基于离散正交矩本身的离散特性,更适合于对数字图像的处理.但同其他离散矩一样,Krawtchou矩并不具备天然的几何不变性(旋转、缩放和平移),这也从一定程度上限制了Krawtchouk矩的应用.为使Krawtchouk矩得到更广泛的应用,对Krawtchouk旋转不变矩的构造进行详细分析和实验,比较出更适合用于浮游植物的Krawtchouk旋转不变矩.     

新形式勒让德矩的研究

针对传统非正交矩很难进行图像重建的缺点,以及离散矩用于重建需要重复采样的缺陷,以降低图像重建误差为目标,提出了一种以在离散坐标空间内拟合克罗内克狄拉克函数为核心思想的新形式矩的定义--基于勒让德多项式的矩,并对其性质进行了阐述。这种矩在函数空间非正交却拥有优秀的重建效果,且其在矩计算误差、旋转不变性等多个维度较目前主流矩都具有更优秀性能,特别是在目前主流图像矩表现不尽如人意的大尺寸图像领域。此外,突破性地发掘图像矩的抗噪音性能并加入性能对比。通过与目前主流的三种矩：Zernike矩、Polar-Fourier矩以及Polar Harmonic Transform（PHT）矩的对比实验,证明利用这种基于新思想的矩提取图像特征可以具有更小的信息冗余度及多个维度的鲁棒性,其在旋转不变性、减小图像重建误差以及提高抗噪稳定性方面的性能表现至少可以提高22%。     

基于Krawtchouk矩和小波变换的数字水印算法

提出了一种基于Krawtchouk矩和小波变换的抵抗几何攻击的内容认证水印算法。该方法首先对图像进行一次小波分解，然后计算其低频成分的Krawtchouk低阶矩不变量来构建水印。水印提取过程简单，只需计算所得图像的几个低阶Krawtchouk矩不变量。文中给出了实验结果，并与Alghoniemy提出的基于几何矩不变量的数字水印算法进行了比较。结果表明，该方法简单、有效，对旋转、缩放、剪切、组合攻击等几何攻击以及JPEG压缩攻击具有更高的稳健性。     

基于局部Hu矩的非局部均值去噪算法

针对非局部均值中度量邻域块间相似性不够准确的问题,提出一种基于Krawtchouk多项式权重函数的局部Hu矩的去噪算法。将Krawtchouk多项式的权重函数与图像函数相结合构造几何矩的新的权重函数。利用几何矩权重函数得到新的中心矩。使用二阶和三阶中心矩构造7个不变矩组成特征矢量,通过欧式距离度量邻域间特征矢量的相似性,并与邻域块间的权重相结合得到新的权重。在不同噪声强度下的测试结果表明,与原始非局部均值去噪算法相比,该算法峰值信噪比与结构相似度都有明显提高。     

Krawtchouk矩的误差传递分析及算法改进

提出了Krawtchouk矩的误差传递模型,分析了其误差传递的机理,提出一种基于GMP大数库的分段迭代算法来精确计算Krawtchouk多项式,且此方法对参数p取任意值均有效。该方法的原理为：根据经典Krawtchouk矩的传递误差累积趋势,将其迭代过程分为若干段,每段迭代的初值均由GMP库计算得到,通过保证初值的精确性和控制迭代的次数来降低多项式计算的误差,提高高阶矩计算的精度。实验证明该方法确实能有效抑制且在一定程度上控制高阶Krawtchouk矩的累积误差,消除重构图像的劣化。     

一种基于Krawtchouk矩的水印算法

提出一种基于Krawtchouk矩的水印算法,通过修改一些原始Krawtchouk矩并重构图像以获得水印图像.基于Krawtchouk矩与几何矩的关系,提出采用具有平移、比例缩放和旋转不变性的几何不变矩来检测水印.实验表明,与用Krawtchouk不变矩检测相比,该算法对于大角度旋转和图像平移的几何攻击具有更好的鲁棒性.     

正交旋转不变 V 矩及其在图像重建中的应用

定义在单位圆盘上的正交旋转不变矩函数(如Zernike矩) 具有非常广泛的应用. 本文基于一类正交分段多项式函数系--V系统, 构造了一种新型的矩函数, 称之为正交旋转不变V矩(简称为V矩). 除了正交性、旋转不变性之外, 由于V系统具有次数低、表达式简单的优点, V矩能够避免传统矩函数中高阶多项式的计算, 从而能够保证数值稳定性, 降低计算复杂度. 实验结果表明, V矩比传统的正交旋转不变矩具有更好的图像重建与图像检索结果.     

Hu不变矩的构造与推广

为了更简洁高效地构造指定要求的不变矩,并判断矩组信息冗余性,推导了实复矩反演关系公式并提出了Hu不变矩构造定理。不变矩多项式和不变矩多项式空间概念的引入,可以赋予不变矩多项式空间代数结构特征。结合组合计数定理,列出了工程上非常实用且没有信息冗余的全部3阶4次不变矩,这是对7个经典Hu不变矩的推广。实验表明,与Hu不变矩的代数不变量构造方法和三角函数系构造方法相比,该构造方法更简洁高效且具有一般性,也更适合判断矩组信息冗余。所构造新不变矩具有较好的鲁棒性,用于图像描述取得了较好效果。     

相位矩不变量

为了克服矩不变量存在的高阶矩计算不稳定和对噪声敏感的问题,提出一种构造相位矩不变量的方法．通过选取正交基构造相位函数,然后将相位函数作为模型函数生成新的矩不变量．该方法可以将矩不变量这种全局不变量与局部特征进行结合．分析和实验结果表明,该方法可以对不变量进行有效的拓展,并且可以取得优于原不变量的检索结果．     

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.     

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.     

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.      

鲁棒性数字图像水印技术

数字水印技术作为版权保护的重要手段已经成为了研究的热点,但是实用的鲁棒性数字水印技术不多,特别是抗几何攻击的水印算法不多.文中利用Krawtchouk不变矩对平移、旋转和缩放的不变性以及Krawtchouk矩良好的局部特性和重构性能,根据水印的容量自适应地改变某些相对稳定的低阶矩来嵌入水印,并用Rijndael加密和Arnold置乱等技术以及构造的图像特征不变矩阵生成相关的二值逻辑表来进行版权认证.实验证明,该算法不仅对JPEG压缩、裁剪、噪声等常见攻击有较强的免疫力,而且对平移、旋转、缩放等几何攻击也具有较强的免疫力.     

一种快速计算Zernike矩的改进q-递归算法

提出了一种快速计算Zernike矩的改进q-递归算法,该方法通过同时降低核函数中Zernike多项式和Fourier函数的计算复杂度以提高Zernike矩的计算效率。采用 q-递归法快速计算Zernike多项式以避免复杂的阶乘运算,再利用x轴、y轴、x=y和x=-y 4条直线将图像域分成8等分。计算Zernike矩时,仅计算其中1个区域的核函数的值,其他区域的值可以通过核函数关于4条直线的对称性得到。该方法不仅减少了核函数的存储空间,而且大大降低了Zernike矩的计算时间。试验结果表明,与现有方法相比,改进q-递归算法具有更好的性能。     

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.     

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.