摘要
针对传统的相关匹配算法计算量大,对图像旋转敏感等问题,提出了一种位平面和尺度不变特征变换(SIFT)相结合的图像匹配算法。将待拼接的两幅图像A、B各自分解为8个位平面,对两幅图像都选择前4个具有视觉信息的位平面A1A2A3A4和B1B2B3B4;对A1A2、A2A3、A3A4图像进行异或运算,得到3幅图像。由于异或后的图像A1A2具有足够的细节部分,轮廓却不清晰,图像A3A4轮廓清晰,但是丢失了太多细节,而图像A2A3具有清晰的轮廓,又具有足够的细节信息,所以采用图像A2A3,然后与原图像A进行异或得到A′,同时采用同样的方法得到图像B′,再次采用SIFT算法进行点对匹配,利用欧氏距离进行图像匹配,最后利用RANSAC进行图像容错处理,得到一幅匹配图像。实验结果表明,该算法有效地提高了匹配速度,对图像明暗变化、尺度旋转等具有较强的健壮性。
Traditional-correlation-based matching methods require heavy computation time and they are sensitive to image rotation. This paper presents an image matching algorithm by combining bit planes and SIFT. It divides the two spliced images A and B into eight bit planes. The top four bit planes with visual infomaation A1A2A3A4 and B1B2B3B4 are selected from the two images. Then, using the images A1A2, A2A3 and A3A4 to XOR, it gets three images. Since after XOR, the image A1A2 gets many details, but the contour is not clear:while the image A3A4 has clear contour, but losts too many details; the image A2A3 has clear contour, and also has enough detail information. So the paper selects the image A2A3, then uses image A2A3 and the original A to XOR, and gets the image A', at the same time, uses the same method to get the image B', and SIFT algorithm to match again. Euclidean distance is used for inaage matching. Finally the RANSAC is used to process fault-tolerant, and gets a matching image. The experimental results show that the algorithm can effectively improve the matching speed, the image brightness changes, rotation and scale, with strong robustness.
出处
《计算机工程与应用》
CSCD
2013年第8期191-194,共4页
Computer Engineering and Applications
基金
国家自然科学基金(No.60971127)
陕西省教育厅科学研究计划项目(No.09JK617)
西安理工大学高层次人员科研启动资金(No.108-210905)