基于线性规划的SAR图像相干斑抑制算法

通过雷达图像优化,能提供高质量源图像.针对传统的软阈值搜索方法由于没有考虑图像本身的分布特点,容易造成各子带去噪的不平衡,从而影响SAR 图像重建的问题,为了进行SAR图像相干斑抑制,提出了一种新的最优阈值确定算法,结合经典的线性规划理论,把最优阈值搜索问题抽象为线性规划问题,再利用简单的图解法求出对不同分解层的小波系数进行最优阈值确定,保证了不同应用背景下的阈值选取的最优性,从而获得了更好的相干斑抑制效果,为SAR图像的压缩、传输和重建等处理过程提供了更好地源图像.仿真证明,算法在保证SAR图像相干斑噪声抑制效果,相比其它算法能更好的细节信息,可提供视觉优化的SAR图像.     

基于小波变换和PCA的SAR图像相干斑抑制

提出一种SAR图像相干斑噪声抑制新的滤波方法。该方法利用小波变换结合主分量分析(PCA)对SAR图像进行去噪。小波变换可以很好地保持边缘细节信息,主分量分析(PCA)能从混合信号中提取出主分量即信号的主要特征,将小波变换结合PCA用于图像处理,能在有效消除噪声的同时保持边缘信息。与Kirsch模板加权平滑滤波和结合小波变换的Kirsch模板加权平滑滤波去噪方法进行比较,实验结果表明,该方法具有良好的抑制相干斑噪声效果和较强的边缘保持能力。     

基于Zernike矩的视频对象零水印算法

针对几何攻击所导致的水印不同步问题,提出了一种结合Zernike矩和图像归一化的有效视频对象水印算法。Zernike矩的幅度具有旋转不变性,缩放和平移不变性通过图像归一化取得。水印嵌入采用零水印方案,解决了基于Zernike矩的图像重构效果不理想和重构过程中复杂度高的问题。实验结果表明,该水印算法对旋转、缩放等几何操作具有鲁棒性,同时对压缩、滤波、高斯噪声等常见的图像处理操作也具有鲁棒性。     

基于Zernike色度分布矩的彩色图像检索算法

以对立色度空间及Zernike矩理论为基础,提出一种基于Zernike色度分布矩的彩色图像检索方法。该方法首先将彩色图像从三维RGB颜色空间转换到二维对立色度空间,以获得图像像素的色差度量值。然后结合Zernike矩相关知识,在二维色度空间中计算出各像素的Zernike色度分布矩,最后将Zernike色度分布矩作为图像颜色特征,并进行彩色图像检索。仿真实验表明,该算法能够准确高效地查找出用户所需内容的彩色图像,并且具有较好的查准率和查全率。     

自适应边缘保护的SAR图像降斑算法

针对以往SAR图像相干斑抑制算法中存在的难以兼顾均匀区域平滑和边缘细节保护的不足,提出一种自适应边缘保护的SAR图像降斑算法。采用方差系数、均值比值和空间相关性等信息作为滤波器权重分配因子。实验结果表明,综合运用以上3种图像的局部邻域信息,该算法在均匀区域平滑和边缘保护两方面都有较好的效果。     

自适应边缘保护的SAR图像降斑算法

针对以往SAR图像相干斑抑制算法中存在的难以兼顾均匀区域平滑和边缘细节保护的不足,提出一种自适应边缘保护的SAR图像降斑算法。采用方差系数、均值比值和空间相关性等信息作为滤波器权重分配因子。实验结果表明,综合运用以上3种图像的局部邻域信息,该算法在均匀区域平滑和边缘保护两方面都有较好的效果。     

一种抑制SAR图像相干斑的空域滤波算法

为在保护SAR图像边缘特征的同时有效抑制乘性相干斑噪声,提出了一种空域滤波新算法。该算法以负指数衰减型加权滤波模型为基础,通过将SAR图像多种局部统计参量巧妙结合作为联合衰减因子,形成与SAR图像区域分布特性相适应的负指数型加权系数;同时采取两次滤波策略,先由预滤波削弱SAR图像相干斑噪声并估计获得更精准的局部统计参量,然后借助精细局部统计参量再对原SAR图像实施精细滤波。实验结果表明,与多种抑斑算法相比,该算法在SAR图像抑斑与边缘保护方面均获得了更好的性能。     

基于Zernike矩和DCT变换的数字水印算法

提出一种基于Zernike矩和DCT变换的鲁棒数字水印算法,对图像的旋转角度进行估计,以提高其抵抗旋转攻击的能力,将基于图像内容的具有正交特性的Zemike多项式作为水印信号,并在Watson视觉感知模型的控制下嵌入图像低频系数中,同时采用相关检测方法确定水印的存在,实验结果表明,该算法具有良好的鲁棒性、不可见性及可检测性。     

一种新型的空域SAR图像相干斑抑制方法

为了有效抑制SAR强度图像中的相干斑噪声,提出一种改进Sigma滤波并结合Gamma MAP滤波的空域相干斑抑制方法。首先利用阈值判断法判断并保留强点目标,然后结合SAR图像分布模型和MMSE准则判断Sigma区间,其中可以根据图像局部统计特性自适应调整窗口尺寸,最后选择Sigma区间内像素进行Gamma MAP滤波。实验结果表明:对于星载和机载SAR图像,在相干斑噪声抑制和边缘纹理细节信息保持方面,该方法较其他常用的空域相干斑抑制方法具有明显的优越性,能极大地提高SAR图像判读和目标识别能力。     

一种改进的基于非局部均值的极化SAR相干斑抑制算法

贝叶斯形式的非局部均值模型在极化SAR图像相干斑抑制中有良好的应用,在实现抑制相干斑的同时较地保持了边缘细节和点目标。本文通过分析SAR图像多视数据的空间统计分布,结合贝叶斯形式的非局部均值模型,得出了在该模型下多视与单视SAR图像中像素间相似性度量函数一致性的结论,并对该相似性度量函数进行了修正,使之满足对称性;最后针对算法全局使用一个固定滤波参数影响滤波效果的问题,提出了一种根据像素间相似程度自适应选取滤波参数的方法。实验结果验证了本文算法的有效性。     

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

为了实施图像的版权保护,提出了一种基于Zernike不变矩的零水印算法。利用Zernike矩幅度的旋转不变性提取图像特征点,将特征点通过设定的阈值量化为二值序列作为零水印保存到零水印信息库（IPR）。证明版权利用Zernike矩提取待检测图像特征点,以同样的阈值量化为二值水印序列与零水印作相关性检测。实验结果表明,该方法很好地解决了传统水印鲁棒性和不可感知性的矛盾问题,对常用的图像处理和几何攻击具有较好的鲁棒性。     

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

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

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.     

基于Zernike形状矩的地图匹配算法

地图匹配算法的有效性和可靠性对于智能交通系统而言是非常重要的,而目前存在的地图匹配算法在一些复杂环境下（如道路交叉口）仍然不能提供合理的输出。采用D-S证据理论融合当前车辆位置信息和方向信息可以有效地扩大待匹配道路之间的差异,但在复杂路网下信息量的不足会降低其匹配精度。因此,为了提高道路网络中的地图匹配精度,提出了基于Zernike形状矩的地图匹配算法。新算法引入Zernike矩描述轨迹曲线的形状,进一步修正了错误结果。通过仿真和实验表明,新算法在复杂环境下具有较强的有效性和可靠性。     

基于Zernike矩亚像素边缘检测的快速算法

为了克服传统的Zernike法在边缘检测过程中,由于人工手动选取阈值而带来的低效率、高误判等不足,将原算法与Otsu法相结合,提出了一种边缘检测的快速算法。利用传统的Zernike法计算出图像的阶跃灰度矩阵,再将该矩阵作为计算对象,用Otsu法直接得到最优的阶跃灰度阈值进行边缘判别,并考虑了由于边缘模型带来的误差,在保证检测效果的同时缩短了检测时间。实验结果表明,改进的算法能够更有效地完成边缘检测,补偿后的亚像素定位更准确。     

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 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.     

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.     

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.