首页> 外文会议>International symposium on photoelectronic detection and imaging >A new affine-invariant image matching method based on SIFT
【24h】

A new affine-invariant image matching method based on SIFT

机译:一种基于SIFT的仿射不变图像匹配新方法

获取原文

摘要

Local invariant feature extraction, as one of the main problems in the field of computer vision, has been widely applied to image matching, splicing and target recognition etc. Lowe's scale invariant feature transform (known as SIFT) algorithm has attracted much attention due to its invariance to scale, rotation and illumination. However, SIFT is not robust to affine deformations, because it is based on the DoG detector which extracts keypoints in a circle region. Besides, the feature descriptor is represented by a 128-dimensional vector, which means that the algorithm complexity is extremely large especially when there is a great quantity of keypoints in the image. In this paper, a new feature descriptor, which is robust to affine deformations, is proposed. Considering that circles turn to be ellipses after affine deformations, some improvements have been made. Firstly, the Gaussian image pyramids are constructed by convoluting the source image and the elliptical Gaussian kernel with two volatile parameters, orientation and eccentricity. In addition, the two parameters are discretely selected in order to imitate the possibilities of the affine deformation, which can make sure that anisotropic regions are transformed into isotropic ones. Next, all extreme points can be extracted as the candidates for the affine-invariant keypoints in the image pyramids. After accurate keypoints localization is performed, the secondary moment of the keypoints' neighborhood is calculated to identify the elliptical region which is affine-invariant, the same as SIFT, the main orientation of the keypoints can be determined and the feature descriptor is generated based on the histogram constructed in this region. At last, the PCA method for the 128-dimensional descriptor's reduction is used to improve the computer calculating efficiency. The experiments show that this new algorithm inherits all SIFT's original advantages, and has a good resistance to affine deformations; what's more, it is more effective in calculation and storage requirement.
机译:局部不变特征提取作为计算机视觉领域的主要问题之一,已广泛应用于图像匹配,拼接和目标识别等领域。缩放,旋转和照度不变。但是,SIFT对仿射变形不具有鲁棒性,因为它基于提取圆形区域中关键点的DoG检测器。此外,特征描述符由128维向量表示,这意味着算法复杂度非常大,尤其是在图像中有大量关键点时。本文提出了一种对仿射变形具有鲁棒性的新特征描述符。考虑到仿射变形后圆变成椭圆形,已经做了一些改进。首先,高斯图像金字塔是通过对源图像和椭圆高斯核与两个易变参数(方向和偏心率)进行卷积而构建的。另外,离散地选择两个参数以模拟仿射变形的可能性,这可以确保将各向异性区域转换为各向同性区域。接下来,可以提取所有极端点作为图像金字塔中仿射不变关键点的候选项。进行精确的关键点定位后,计算关键点邻域的次矩以识别仿射不变的椭圆区域,与SIFT相同,可以确定关键点的主要方向并基于以下特征生成特征描述符在该区域中构建的直方图。最后,采用PCA方法对128维描述子进行约简,以提高计算机的计算效率。实验表明,该新算法继承了SIFT的所有原始优点,并具有良好的抗仿射变形能力。而且,它在计算和存储需求方面更有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号