噪声对基于不同梯度算子的ICG算法的影响

反向合成梯度算法是一种基于局部指向性的反向合成图像对齐算法,能有效克服光照变化对匹配结果准确性的影响。局部指向性的计算在本质上是梯度的计算,可以用不同的梯度算子求解。该文采用4种梯度算子计算局部指向性,通过给输入图像和模板图像中加入噪声模拟实际图像,研究了噪声对基于4种梯度算子的反向合成梯度算法的影响。     

基于局部指向性的反向合成图像对齐算法

传统的反向合成图像对齐算法比较的是模板图像与输入图像之间的像素值。该方法容易受到图像中光照变化的影响，从而导致收敛性变差甚至发散。根据局部指向性对光照变化不敏感的特性，提出了一种新的反向合成图像对齐算法——反向合成梯度算法。由于局部指向性的计算在本质上是图像梯度的计算，因此采用几种不同的梯度算子来计算局部指向性。通过实验，验证了反向合成梯度算法能够有效克服图像中光照变化的影响，同时比较了不同算子在不同光照下对反向合成梯度算法的影响。     

AAM反向合成匹配算法及其性能分析

介绍了一种基于反向合成图像对齐算法的AAM匹配算法。首先对反向合成算法的内容及其在AAM匹配过程中需要注意的问题进行了阐述,然后通过实验,分别应用反向合成算法和原始AAM匹配算法对一定数量的图像进行匹配,验证了反向合成算法的有效性。     

基于局部梯度的WaDi图像插值

线性插值算法容易产生细节模糊和边缘锯齿效应,为了较好地保持图像的边缘信息,改善图像的主观视觉效果,提出了一种改进的Warped Distance（WaDi）图像插值方法。传统的WaDi算法是对空间线性插值的改进,但它仅仅利用了图像边缘的局部不对称特征来计算WaDi。除了局部不对称特征,局部梯度特征也是图像边缘的一种重要特征。文中采用将局部不对称特征和局部梯度特征相结合的方法来计算WaDi,可同时保持图像边缘的细节特征和非边缘的光滑性。实验结果表明,用该方法能获得高精度的插值图像。     

基于形态学梯度的图像边缘检测算法

边缘检测是数字图像处理的一个重要内容,讨论了经典的边缘检测算子算法,该算法更多地采用Prewitt算子、LOG算子、Canny算子等在空域中进行。数学形态学在图像处理中有广泛的应用,其基本原理是基于利用结构元素去探测图像;在讨论常见数学形态学梯度的基础上,提出了一种基于形态学梯度的图像边缘检测算法,应用定义的形态学梯度结构检测出较理想的图像边缘信息。仿真结果表明,该算法在含噪图像中能得到较为理想的图像边缘信息,其抗噪声性能明显地优于经典的算子检测算法,在检测精度方面较经典的单一算子检测方法亦有一定的改善。     

基于梯度的光流计算方法中梯度计算对性能的影响

基于梯度的方法是光流计算中很重要的一类方法,而梯度的计算对整个算法的性能有着重要的影响。文章考察了几种常用梯度算子对光流计算的影响,并给出了理论分析。实验结果证明理论分析是正确的。     

基于形态学梯度的图像边缘检测算法

边缘检测是数字图像处理的一个重要内容，讨论了经典的边缘检测算子算法，该算法更多地采用Prewitt算子、LOG算子、Canny算子等在空域中进行。数学形态学在图像处理中有广泛的应用，其基本原理是基于利用结构元素去探测图像；在讨论常见数学形态学梯度的基础上，提出了一种基于形态学梯度的图像边缘检测算法，应用定义的形态学梯度结构检测出较理想的图像边缘信息。仿真结果表明，该算法在含噪图像中能得到较为理想的图像边缘信息，其抗噪声性能明显地优于经典的算子检测算法，在检测精度方面较经典的单一算子检测方法亦有一定的改善。     

基于多尺度形态梯度的灰度图像边缘检测

研究了一种基于多尺度抗噪型形态梯度的灰度图像边缘检测算法。该算法通过构造5个不同的结构元素,结合多尺度合成对图像进行边缘检测。为验证本文算法的效果,用几种传统的微分算子对实验图像进行了边缘提取的实验,并把结果与用本文算法提取的结果进行了比较。结果表明:本文算法比较成功地完成了图像的边缘检测,且检测效果在完整性和细节的丰富性方面优于经典的Sobel算子,LOG算子和Canny算子,但在某些边缘的连接性和平滑性方面不如Canny算子,在这方面还有待改进。     

基于梯度比率的SAR图像局部特征提取方法研究

本文研究了基于像素灰度差值计算的LBP算子和基于梯度比率的LGRP算子等局部二值模式。首先介绍了基本LBP算子和其他几种LBP算子的变形模式,并通过光学图像和实测SAR图像对LBP算子进行性能评估。针对LBP对SAR 图像乘性噪声敏感的问题,利用梯度比率计算的LGRP算子,并结合旋转不变LBP的抗旋转性,本文提出了一种改进的SAR 图像LGRP特征,获得了对SAR 图像的抗噪性和抗旋转性能。实验结果表明,由本文方法提取的SAR图像局部特征具有较好的不变性,可用于姿态角变化下的目标识别与图像纹理切片匹配。     

采用多尺度掩模消除干扰的反向组合算法

反向组合算法是最有效的图像对齐算法之一,但该算法抗干扰能力差.当输入图像部分被遮挡时,图像对齐效果变差.针对该问题,我们提出一种采用多尺度掩模消除干扰的反向组合算法.该算法采用自适应的方法设置初始掩模,再通过迭代判断和逐层分块来细化初始掩模,使得掩模能准确地设置在干扰区域上.实验结果表明,该算法既保留了原反向组合算法的优点,又提高了算法抗干扰的能力,使得反向组合算法能在更复杂的环境下进行图像对齐.     

Consistent gradient operators

We propose optimal gradient operators based on a newly derived consistency criterion. This criterion is based on an orthogonal decomposition of the difference between a continuous gradient and discrete gradients into the intrinsic smoothing effect and the self-inconsistency involved in the operator. We show that consistency assures the exactness of gradient direction of a locally 1D pattern in spite of its orientation, spectral composition, and sub-pixel translation. Stressing that inconsistency reduction is of primary importance, we derive an iterative algorithm which leads to accurate gradient operators of arbitrary size. We compute the optimum 3×3, 4×4, and 5×5 operators, compare them with conventional operators and examine the performance for one synthetic and several real images. The results indicate that the proposed operators are superior with respect to accuracy, bandwidth and isotropy     

Extracting image orientation feature by using integration operator

This paper presents an orientation operator to extract image local orientation features. We show that a proper employment of image integration leads to an unbiased orientation estimate, based on which an orientation operator is proposed. The resulting discrete operator has flexibility in the scale selection as the scale change does not violate the bias minimization criteria. An analytical formula is developed to compare orientation biases of various discrete operators. The proposed operator shows lower bias than eight well-known gradient operators. Experiments further demonstrate higher orientation accuracy of the proposed operator than these gradient operators.     

基于共轭梯度法改进的人工鱼群算法*

在基本人工鱼群算法中引入共轭梯度法,得到改进的人工鱼群算法。基本人工鱼群算法对每条人工鱼分别进行聚群算子和追尾算子,若更新结果没有得到改善则进行觅食算子,由于觅食算子具有很大的随机性,这样不能保证每次更新都是有价值的,本文用共轭梯度法代替此时的觅食算子,也就是如果人工鱼利用聚群算子和追尾算子更新,如果没有得到改善,利用共轭梯度法对该条鱼进行更新。在人工鱼群更新过程中引入共轭梯度法,减少随机性,增强人工鱼个体的局部寻优能力,确保人工鱼每次更新都会得到改善,从而加快人工鱼群算法收敛速度。数值试验结果表明,所得改进人工鱼群算法具有更快的收敛速度,同时收敛精度也得到一定提升。     

Quantitative study of 3D gradient operators

An analytical and comparative study of 3D gradient operators is presented. Based on 3D models, the general formulas representing the gradient magnitude and direction responses of 3D operators are derived. The responses of several commonly used 3D operators (with different variations) as functions of the 3D edge's position and orientation are computed. By analysing the results, the performances of those operators are evaluated and compared according to our proposed judge criteria. This study shows the different behaviour between 3D operators and their 2D correspondents, and provides useful guidelines in choosing and using appropriate operators in 3D edge detection aplications.     

基于相对梯度的人脸识别方法

在原始相对梯度算子的基础上,提出一种新的相对梯度算子,并将它与二维主成分分析（2DPCA）或者二维Fisher线性判别分析（2DFLD）相结合,形成一种基于改进相对梯度算子的人脸识别算法。在AR库和Yale_B库上的实验表明,基于改进相对梯度算子的人脸识别算法对人脸图像的光照、表情等变化均具有较好的鲁棒性,识别准确率明显高于只用2DPCA或2DFLD进行特征抽取的人脸识别方法,以及基于原始相对梯度算子的人脸识别算法。同时采用三种不同大小的窗口分别进行实验,实验结果证明,当窗口大小为3×3时,识别效果相对最好。     

A local tangential lifting differential method for triangular meshes

In this note we present a local tangential lifting (LTL) algorithm to compute differential quantities for triangular meshes obtained from regular surfaces. First, we introduce a new notation of the local tangential polygon and lift functions and vector fields on a triangular mesh to the local tangential polygon. Then we use the centroid weights proposed by Chen and Wu [4] to define the discrete gradient of a function on a triangular mesh. We also use our new method to define the discrete Laplacian operator acting on functions on triangular meshes. Higher order differential operators can also be computed successively. Our approach is conceptually simple and easy to compute. Indeed, our LTL method also provides a unified algorithm to estimate the shape operator and curvatures of a triangular mesh and derivatives of functions and vector fields. We also compare three different methods : our method, the least square method and Akima’s method to compute the gradients of functions.     

A local tangential lifting differential method for triangular meshes

In this note we present a local tangential lifting (LTL) algorithm to compute differential quantities for triangular meshes obtained from regular surfaces. First, we introduce a new notation of the local tangential polygon and lift functions and vector fields on a triangular mesh to the local tangential polygon. Then we use the centroid weights proposed by Chen and Wu [4] to define the discrete gradient of a function on a triangular mesh. We also use our new method to define the discrete Laplacian operator acting on functions on triangular meshes. Higher order differential operators can also be computed successively. Our approach is conceptually simple and easy to compute. Indeed, our LTL method also provides a unified algorithm to estimate the shape operator and curvatures of a triangular mesh and derivatives of functions and vector fields. We also compare three different methods : our method, the least square method and Akima’s method to compute the gradients of functions.