Fast Template Matching Based on Normalized Cross Correlation With Adaptive Multilevel Winner Update

In this paper, we propose a fast pattern matching algorithm based on the normalized cross correlation (NCC) criterion by combining adaptive multilevel partition with the winner update scheme to achieve very efficient search. This winner update scheme is applied in conjunction with an upper bound for the cross correlation derived from Cauchy-Schwarz inequality. To apply the winner update scheme in an efficient way, we partition the summation of cross correlation into different levels with the partition order determined by the gradient energies of the partitioned regions in the template. Thus, this winner update scheme in conjunction with the upper bound for NCC can be employed to skip unnecessary calculation. Experimental results show the proposed algorithm is very efficient for image matching under different lighting conditions.     

自适应连续多级分区与初始阈值估计的快速模板匹配方法

归一化互相关测度在光照改变时比采用绝对差之和测度（SAD）要稳定，但是归一化互相关测度的缺陷在于它的计算量非常大。为此，提出了一种结合自适应连续多级分区和初始阈值估计的基于归一化互相关（NCC）的快速模板匹配算法。根据模板图像中不同模块的梯度值，将模板图像进行逐级分区，通过分区顺序将互相关之和分为不同的层，得到各层互相关的上界，运用柯西-施不等式得到上界间的关系，形成自适应连续多级分区淘汰方法。同时，为了加快匹配速度，利用初始阈值估计产生一个较大的边界阈值，以淘汰初始搜索时的大量非匹配点，减少搜索点数目。实验结果表明:所提出的算法具有较好的鲁棒性，且算法的执行速度优于传统算法。     

基于NCC的图像匹配快速算法

在图像匹配过程中,针对传统归一化积相关（NCC）算法计算量大的问题,提出一种对NCC进行改进的图像匹配快速算法。该算法首先使用差分求和定理改造NCC相似度量函数,以降低匹配计算量。然后提出模板区域分割,设定阈值,进一步去除大量不必要的计算,优化匹配搜索过程,实现了快速匹配。实验结果证明,与传统的匹配算法相比,在保证精度的前提下,计算复杂度大大降低。     

基于多目标优化的SIFT特征匹配算法

SIFT算子在实际应用中,由于地面图像本身特征不明显且提取出的特征点多、乱以及灰度变化不明显等特点的影响,从而导致特征点误匹配。为此提出一种改进的SIFT图像特征匹配算法。该算法是在SIFT特征匹配的基础上,利用多目标优化算法,建立相关匹配模板,利用给定同一场景的两幅图像,寻找同一场景点投影到图像中的模板之间的相关性建立数学模型即目标函数,根据同一幅图像中模板间的距离建立边界约束条件,从而剔除一些误匹配点。实验表明,该算法可以有效地提高图像匹配精度。     

基于绝对值差的归一化波形匹配混合算法

基于归一化的波形匹配算法运用十分广泛,但缺点是运算量大。为此提出一种基于绝对值差的归一化混合算法。该算法先将原始波形分解成三层,在每一层分别采用改良的绝对值差法、改良的序列相似性法、归一化互相关法进行匹配,最终实现精确匹配。实验表明,这种混合算法比归一化互相关法在波形匹配速度上有了大幅度的提高。     

实时的归一化相关匹配算法

通过分析归一化相关匹配算法的原理，提出了建立累加和表与平方求和表来减少匹配过程中加减法的冗余计算量，并采用快速傅里叶变换算法减少乘法的计算时间，使算法在无损匹配性能的条件下大大降低了计算时间。同时，该快速算法对于匹配模板和搜索区域的增加不敏感，十分有利于工程实现。     

Robust and efficient image alignment based on relative gradient matching.

In this paper, we present a robust image alignment algorithm based on matching of relative gradient maps. This algorithm consists of two stages; namely, a learning-based approximate pattern search and an iterative energy-minimization procedure for matching relative image gradient. The first stage finds some candidate poses of the pattern from the image through a fast nearest-neighbor search of the best match of the relative gradient features computed from training database of feature vectors, which are obtained from the synthesis of the geometrically transformed template image with the transformation parameters uniformly sampled from a given transformation parameter space. Subsequently, the candidate poses are further verified and refined by matching the relative gradient images through an iterative energy- minimization procedure. This approach based on the matching of relative gradients is robust against nonuniform illumination variations. Experimental results on both simulated and real images are shown to demonstrate superior efficiency and robustness of the proposed algorithm over the conventional normalized correlation method.     

一种用于不相似图像的匹配定位方法研究

本文定义了一种新的图像与模板相似性度量，并结合距离变换给出相应的匹配算法，实验结果表明该算法匹配速度在大多数情况下比传统的ＭＡＤ、ＮＣＣ算法快，且抗灰度变换，抗边缘偏移和不连续能力强。     

自适应模板匹配在自主空中加油跟踪中的应用

自主空中加油技术越来越重要,在软管加油的对接阶段,运用模板匹配跟踪技术对目标进行跟踪。本文利用直方图均衡化、形态学算法和边缘轮廓提取得到初始模板;然后利用归一化相关匹配法对模板进行匹配,同时利用归一化相关值作为参考,判断是否对模板进行更新,从而得到自适应模板;为了缩小匹配时的搜索范围,加入了轨迹跟踪的算法,大大节省了运算时间。通过仿真实验显示,该算法切实可行。     

任意指定地面复杂场景图像目标的去均值相关跟踪算法

本文通过对相关系数作为相似性度量准则的匹配跟踪算法的改进,提出了去均值相关跟踪算法,采用网格搜索法进行粗匹配,以邻域法进行精匹配,减少了算法的计算量,满足机载成像光电吊舱系统目标跟踪的实时性要求。提出了自适应模板更新方法和修正的自适应模板更新方法,并对这两种方法进行仿真比较,实验表明,修正的自适应模板更新方法具有更高的跟踪精度和更好的跟踪稳定性。     

基于LS MPP的图像分块模板匹配并行算法

该文提出了一种新颖的在基于K元2-立方体网络的SIMD计算机上运行的图像分块模板匹配并行算法。该算法对于NN的图像、MM的模板和KK的处理元阵列(M K, N = BK, B 1), 可通过将图像分成BB个图像块的分块模板匹配来实现。与已知的各算法相比,该算法具有可处理比处理元阵列尺寸大的图像的优越性。     

Correlation-coefficient-based fast template matching through partial elimination

Partial computation elimination techniques are often used for fast template matching. At a particular search location, computations are prematurely terminated as soon as it is found that this location cannot compete with an already known best match location. Due to the nonmonotonic growth pattern of the correlation-based similarity measures, partial computation elimination techniques have been traditionally considered inapplicable to speed up these measures. In this paper, we show that partial elimination techniques may be applied to a correlation coefficient by using a monotonic formulation, and we propose basic-mode and extended-mode partial correlation elimination algorithms for fast template matching. The basic-mode algorithm is more efficient on small template sizes, whereas the extended mode is faster on medium and larger templates. We also propose a strategy to decide which algorithm to use for a given data set. To achieve a high speedup, elimination algorithms require an initial guess of the peak correlation value. We propose two initialization schemes including a coarse-to-fine scheme for larger templates and a two-stage technique for small- and medium-sized templates. Our proposed algorithms are exact, i.e., having exhaustive equivalent accuracy, and are compared with the existing fast techniques using real image data sets on a wide variety of template sizes. While the actual speedups are data dependent, in most cases, our proposed algorithms have been found to be significantly faster than the other algorithms.     

基于自适应遗传算法的模板匹配研究

目前图像模板匹配算法的一般都有计算量非常大的缺点,在实际运用中存在一定问题,根据这一问题提出了将自适应遗传算法应用到图像模板相关匹配中.模板匹配实际是寻找最优解的问题,将模板和子图像的互相关函数做为目标函数,基于自适应遗传算法实现了快速模板匹配算法.最后根据实验说明了该算法较搜索式模板匹配算法计算量大大减少的优越性.     

基于匹配模板的二相编码信号识别方法

雷达采用低截获概率（LPI）技术之后,特别是在低信噪比条件下,传统的基于参数提取的雷达信号识别方法将会失效。针对这一问题,提出了基于匹配模板的雷达信号识别方法,阐述了该方法中匹配模板的创建、匹配算法的实现和匹配输出性能参数提取与分析三个关键步骤,以二相编码信号为例制定了相应的匹配识别准则,通过仿真实验验证了该准则的有效性和该方法的可行性。在信号受到噪声污染的情况下,该方法对二相编码信号的识别信噪比可以达到-6 dB。     

Circular Layout Cutsets: An Approach for Improving Consecutive Cutset Bounds for Network Reliability

In this paper, we introduce a new type of parameterized class of cutsets for the 2-terminal network reliability problem, called the circular layout (CL) cutsets with parameter k, and devise a polynomial time algorithm for computing upper bounds from such structures. The CL cutsets, and the devised bounding method are characterized by the following aspects. 1) CL cutsets include the well known class of consecutive minimal cutsets, introduced by Shanthikumar, as a proper subset. Thus, bounds obtained by our main algorithm yield strict improvements on the basic consecutive cutsets algorithm. We note that extensive empirical studies done to date have shown that the consecutive cutsets method, when empowered by heuristics for choosing suitable cutsets, yields competitive bounds. 2) CL cutsets satisfy the semilattice structure required by Shier's algorithm for computing upper bounds in time polynomial in the number of cuts in a given cutset. Thus, CL cutsets define a new class of efficiently constructible cutsets of polynomial size that benefit from such generalized algorithm. 3) For any fixed value of the parameter k, the devised bounding method can be adapted to satisfy stringent constant-time update constraints, required by the most probable state algorithm of Colbourn & Harms , for obtaining iteratively improvable bounds, without adding significant time overhead to the method. Moreover, the devised bounding algorithm is easy to implement, and the obtained numerical results show more than a 32% improvement over bounds obtained by the basic consecutive cutsets algorithm     

一种基于主动轮廓模型的自适应模板更新算法

在目标相关跟踪过程中,由于目标的姿态、大小发生变化,所以合理地更新模板极为重要.而已有的模板更新方法都不能适应目标的姿态和大小变化.提出了一种模板更新的新方法,该方法以颜色直方图的Bhattacharyya系数为基础,来进行模板更新时机的判断.并利用主动轮廓模型算法得到目标的边缘,自适应调整模板的大小和内容,从而实现对目标在发生姿态和大小等变化下的可靠跟踪.     

基于相位相关和模板匹配的亚像素图像配准参数估计

针对图像配准中的亚像素参数估计问题,提出了一种相位相关和模板匹配相结合的方法。该方法先采用相位相关法进行粗配准,找到整像素平移;然后运用模板(窗口)匹配和基于最小二乘的曲面拟合法实现亚像素图像配准参数估计。通过实验表明该方法可以充分利用FFT的高效运算,达到亚像素精度。     

基于灰色关联分析的图像匹配方法

针对图像匹配正确率的问题,在研究灰色关联理论的基础上,提出了基于灰色关联分析的匹配方法,找出模板图像在待匹配图像中的最佳匹配位置。通过计算图像直方图的灰关联度及边缘点集间的Hausdorff距离,从图像的灰度分布和形状特征两方面来验证了定位的准确性。实验采用了多张不同的图片进行图像匹配,实验结果表明了该算法的有效性和良好的匹配效果,具有匹配效率高、匹配误差小等特点。     

一种快速的亚像素图像配准算法

图像超分辨率重建是在现有红外探测器基础上提升空间分辨率的一种有效方法.超分辨率图像重建是利用一组相互之间存在亚像素位移的低分辨率图像构造出一幅高分辨率的图像,快速、高精度估计图像间的位移是其关键技术之一.提出了一种用于超分辨率重建的亚像素配准算法,算法由特征检测、像素级配准和亚像素级配准三个处理过程组成.在特征检测过程,首先采用梯度算子对图像进行边缘检测,然后对边缘点进行角点预检测,排除非角点像素点,之后再进行 Harris 角点检测,大大减少了计算量;在像素级配准过程,用 NCC 算法进行像素级配准,用统计方法去除误匹配点对;在亚像素级配准过程,先对像素级匹配点的邻域进行插值放大,再进行亚像素匹配,误匹配点剔除,相对偏移量计算.对提出的算法进行了仿真实验,结果显示本算法的速度较类似算法速度有较大的提高.