返回
Robust and efficient image alignment based on relative gradient matching
DOI:10.1109/TIP.2006.877500.png)
摘要
En 中文
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.
Keyword:
energy minimization
illumination variations
image alignment
image matching
industrial inspection
nearest-neighbor search
robust image matching
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
暂无机构信息
引用论文
A fast globally optimal algorithm for template matching using low-resolution pruning一种基于低分辨率剪枝的快速全局最优模板匹配算法
A novel two stage template matching method for rotation and illumination invariance
PATTERN RECOGNITION
IF7.6

