Spectral matching algorithm based on nonsubsampled contourlet transform and scale-invariant feature transform

A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency im- age. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity matrix, a matching matrix （or matching result） reflecting the match- ing degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy.

Active Shape Models Using Scale Invariant Feature Transform

A new active shape models (ASMs) was presented, which is driven by scale invariant feature transform (SIFT) local descriptor instead of normalizing first order derivative profiles in the original formulation, to segment lung fields from chest radiographs. The modified SIFT local descriptor, more distinctive than the general intensity and gradient features, is used to characterize the image features in the vicinity of each pixel at each resolution level during the segmentation optimization procedure. Experimental results show that the proposed method is more robust and accurate than the original ASMs in terms of an average overlap percentage and average contour distance in segmenting the lung fields from an available public database.

Face recognition using SIFT features under 3D meshes

Expression, occlusion, and pose variations are three main challenges for 3D face recognition. A novel method is presented to address 3D face recognition using scale-invariant feature transform(SIFT) features on 3D meshes. After preprocessing, shape index extrema on the 3D facial surface are selected as keypoints in the difference scale space and the unstable keypoints are removed after two screening steps. Then, a local coordinate system for each keypoint is established by principal component analysis(PCA).Next, two local geometric features are extracted around each keypoint through the local coordinate system. Additionally, the features are augmented by the symmetrization according to the approximate left-right symmetry in human face. The proposed method is evaluated on the Bosphorus, BU-3DFE, and Gavab databases, respectively. Good results are achieved on these three datasets. As a result, the proposed method proves robust to facial expression variations, partial external occlusions and large pose changes.

基于SIFT特征点提取的ICP配准算法

为解决传统迭代最近点(ICP)算法对点云配准的起始点对选择不佳而导致配准时间长、效率低的问题,提出一种基于尺度不变特征变换(SIFT)特征点提取的ICP点云配准算法(ST-ICP)。首先使用SIFT算法进行原始点云与目标点云的SIFT特征点提取,根据提取特征点完成快速点特征直方图(FPFH)特征运算,通过采样一致性初始配准算法(SAC-IA)搜索对应点对、求解变换矩阵,再进一步运用ICP算法进行点云精细配准。实验结果表明:与ICP算法相比较,ST-ICP算法的配准误差在迭代次数为5次时减小了1.019 cm,迭代次数为10次时减小了0.443 cm;在配准误差达到10^(-2) cm级别时,ST-ICP算法所用时间比传统ICP算法减少了12.829 s。ST-ICP算法优化了对应点对的选择,提升了配准精度和配准效率。

Image matching algorithm based on SIFT using color and exposure information

Image matching based on scale invariant feature transform（SIFT） is one of the most popular image matching algorithms, which exhibits high robustness and accuracy. Grayscale images rather than color images are generally used to get SIFT descriptors in order to reduce the complexity. The regions which have a similar grayscale level but different hues tend to produce wrong matching results in this case. Therefore, the loss of color information may result in decreasing of matching ratio. An image matching algorithm based on SIFT is proposed, which adds a color offset and an exposure offset when converting color images to grayscale images in order to enhance the matching ratio. Experimental results show that the proposed algorithm can effectively differentiate the regions with different colors but the similar grayscale level, and increase the matching ratio of image matching based on SIFT. Furthermore, it does not introduce much complexity than the traditional SIFT.

An Approach to Parallelization of SIFT Algorithm on GPUs for Real-Time Applications

Scale Invariant Feature Transform (SIFT) algorithm is a widely used computer vision algorithm that detects and extracts local feature descriptors from images. SIFT is computationally intensive, making it infeasible for single threaded im-plementation to extract local feature descriptors for high-resolution images in real time. In this paper, an approach to parallelization of the SIFT algorithm is demonstrated using NVIDIA’s Graphics Processing Unit (GPU). The parallel-ization design for SIFT on GPUs is divided into two stages, a) Algorithm de-sign-generic design strategies which focuses on data and b) Implementation de-sign-architecture specific design strategies which focuses on optimally using GPU resources for maximum occupancy. Increasing memory latency hiding, eliminating branches and data blocking achieve a significant decrease in aver-age computational time. Furthermore, it is observed via Paraver tools that our approach to parallelization while optimizing for maximum occupancy allows GPU to execute memory bound SIFT algorithm at optimal levels.

Research on will-dimension SIFT algorithms for multi-attitude face recognition

The results of face recognition are often inaccurate due to factors such as illumination,noise intensity,and affine/projection transformation.In response to these problems,the scale invariant feature transformation(SIFT) is proposed,but its computational complexity and complication seriously affect the efficiency of the algorithm.In order to solve this problem,SIFT algorithm is proposed based on principal component analysis(PCA) dimensionality reduction.The algorithm first uses PCA algorithm,which has the function of screening feature points,to filter the feature points extracted in advance by the SIFT algorithm;then the high-dimensional data is projected into the low-dimensional space to remove the redundant feature points,thereby changing the way of generating feature descriptors and finally achieving the effect of dimensionality reduction.In this paper,through experiments on the public ORL face database,the dimension of SIFT is reduced to 20 dimensions,which improves the efficiency of face extraction;the comparison of several experimental results is completed and analyzed to verify the superiority of the improved algorithm.

基于Bag of Features模型的害虫图像分类技术研究

将Bag of Features模型结合OpenCV开源图像库提取害虫图像的特征,然后用Kmedoids算法对其进行聚类,生成关键字,最后用AdaBoosting算法构建分类器,实验采用Pascal Voc图像库中的数据进行训练和测试,实验表明,该算法分类精度高、特征提取速度和分类速度也比较快。

基于改进SIFT算法的城市航拍图像快速拼接方法

城市航拍图像在城市规划、土地管理、环境监测和基础设施建设等领域具有广泛应用。针对无人机航拍高度越高,图像捕获成本越高,图像质量或能见度越低的问题,使用低空无人机来大量捕获图像;针对经典的尺度不变特征转换(SIFT)图像拼接算法存在匹配稳定性差、拼接质量差的问题,提出一种改进SIFT算法,通过提取图像金字塔模型,提高了匹配的稳定性;采用RANSAC算法减少局外点的干扰,提高图像拼接质量;采用混合平均加权法消除重叠区域接缝,最终实现了图像快速精准拼接。仿真实验结果显示,改进后的SIFT算法在图像拼接稳定性和质量上均表现较好,能获得良好且完整的拼接图像。

基于SIFT特征点提取算法的三维数字影像重建方法

针对在数字影像三维重建过程中,由于原始数据中存在噪声和失真等不足,导致特征匹配效率和精度较低的问题,提出基于SIFT(Scale-Invariant Feature Transform)特征点提取算法的三维数字影像重建方法。采用双边滤波算法对数字影像中的环境噪声实施消除处理,并保留数字影像的边缘信息,提高特征点提取精度;通过尺度不变特征转换(SIFT)算法对其提取特征点,得到数字影像的特征点对;将该特征点对作为初始面片,利用空间目标多视影像密集匹配方法,实现对数字影像的三维重建。实验结果表明,所提方法特征匹配效率和匹配精度高,且降噪能力强,生成的三维重建影像所需平均时间为26.74 ms。

基于特征点和SAR-SIFT算法的林权测绘地形图像几何配准

目前常规的测绘地形图像几何配准主要通过对单应性矩阵进行求解,从而实现图像配准,由于对待配准图像的灰度化处理程度较低,导致配准精度较差。对此,本文研究基于特征点和合成孔径雷达(SAR)-尺度不变特征变换(SIFT)算法的林权测绘地形图像几何配准方法。首先对SAR图像成像机理进行分析,在此基础上采用滤波算法对图像进行处理,并采用加权平均法对红、绿、蓝三原色(RGB)通道分量进行灰度化处理。然后结合SAR-SIFT算法,构建多层次的尺度空间,并结合海森矩阵对像素梯度值进行计算,生成特征描述子。最后通过对特征描述子的相似度进行计算,结合匹配阈值,实现图像特征点的匹配。实验结果表明:采用基于特征点和SAR-SIFT算法的林权测绘地形图像几何配准方法对图像进行几何配准时,算法的均方根误差值较小,具备较为理想的几何配准精度。

一种针对于描述子的SIFT简化方法

由于目前的SIFT(scale invariant feature transform)特征提取算法具有较高的时间复杂度,不利于大规模的数据存储和搜索,提出一种简化的SIFT局部图像特征提取算法。改进的SIFT算法针对于描述子生成部分进行简化,将原算法中特征点描述子的矩形区域改为圆形区域,并将RANSAC(random sample consensus)算法应用于SIFT特征匹配中,有效地剔除错误匹配点。采用K.Mikolajczyk的衡量方法,即查全率和错误率进行评估。实验结果显示,算法在旋转、光照、视角变化等情况下都有很好的匹配效果,并且降低了时间复杂度。

改进SIFT算法在文字图像匹配中的应用

使用SIFT算法对文字图像进行特征提取时,产生的特征点数目较少,且不同文字产生的特征向量存在强干扰性,导致匹配准确率较低。为此,提出一种改进的SIFT算法。该算法利用二值化图像代替灰度图像,增加特征点数目,并取消SIFT的旋转不变性。实验结果证明,与标准SIFT算法相比,改进SIFT算法能有效提高文字图像匹配的准确率。

一种简化的SIFT图像特征点提取算法

针对目前尺度不变的图像特征点提取算法计算量较大,算法较复杂的问题,提出一种简化的SIFT图像特征点提取算法。此算法通过改变金字塔尺度空间的结构实现对SIFT特征点提取过程的简化,通过改变特征点描述子的结构实现对特征向量计算的简化,从而在保证算法鲁棒性的同时减少了计算量并增强了实时性。实验证明了该算法的有效性。

基于SIFT特征的遥感影像自动配准

遥感影像的自动配准是长期以来一直未能很好解决的一个重要问题。本文将视频图像匹配中获得巨大成功的SIFT(Scale Invariant Feature Transform)特征应用于遥感影像的自动配准问题中,并且针对遥感影像的成像特点,给出了一种具体的特征匹配方法。对航空和航天遥感影像在不同的变形、不同的光照变化和不同的分辨率下进行的大量实验表明,该方法具有稳定、可靠、快速等特点。

改进的SIFT特征提取和匹配算法

针对月球影像和尺度不变特征变换(SIFT)算法的特点,在改进SIFT特征提取算法的基础上,提出了一种稳健的图像自动匹配策略。首先,自动调整SIFT算法中的对比度控制系数,提高关键点提取的均衡性;然后,用SIFT描述向量之间的欧氏距离最小值与次小值的比值作为阈值,进行粗匹配,并利用匹配对主方向角度差直方图剔除部分伪匹配;最后,自动计算随机采样次数、误差容忍度等参数,使用改进的随机选取一致性(RANSAC)方法确定透视变换模型初始参数,并用该模型和误差容忍度对匹配集合中的匹配对进行校验,选取出正确的匹配对。实验结果表明,在图像有一定程度的视点、光照、旋转、比例、模糊和对比度变化等情形下,该算法稳定、可靠。该方法能有效解决图像匹配门限的选择问题,真正实现了无人工干预的自动匹配。

一种基于SIFT特征的航拍图像序列自动拼接方法

针对航拍图像序列拼接问题,提出一种基于尺度不变特征变换(SIFT)特征的自动拼接方法,该方法主要包括图像配准和镶嵌两个步骤。由于航拍序列各帧图像之间存在较大差异,因而常用的基于特征的配准方法适用性较差,对此,提出利用SIFT特征来实现准确、稳健的航拍图像配准。进一步的,提出一种基于视觉特征的色彩融合方法以取得平滑的镶嵌效果。最后,通过对真实航拍序列进行拼接实验验证了所提方法的有效性。

基于SIFT特征匹配的监控图像自动拼接

针对不同摄像头的监控图像,提出了一种优化的SIFT特征匹配的监控图像自动拼接方法。在图像整合方面,通过高速提取SIFT特征描述符并进行稳定精确匹配,利用改进RANSAC算法去除错配,从而确定待拼接图像之间的变换参数;在图像融合方面,有效消除了颜色和光照差异,最终实现自动的无缝拼接系统。实验结果证明该方法对重叠区域小、形变大、有运动遮挡和噪声的监控图像有较完美的拼接效果。

基于SIFT特征目标跟踪算法研究

在尺度不变特征变换(Scale invariant feature transform,SIFT)特征匹配算法的基础上,提出了一种基于累积特征的多目标的跟踪算法,通过对目标的SIFT特征进行实时更新来去除由噪声(或形变)带来的"过时"特征信息,保证了特征的稳定,提高了匹配准确度.实验结果表明,本算法能够有效处理目标由于旋转、形变而导致跟踪性能下降甚至跟踪目标丢失的问题,同时对跟踪过程中多目标的关联,也具有较好的鲁棒性.

基于旋转不变特征的SIFT描述子在图像配准中的应用

针对尺度不变特征变换(SIFT)算法中描述子维度高造成配准过程中计算量过大的问题,提出了一种改进的SIFT算法。该算法利用圆形的旋转不变性,以特征点为中心,在近似大小的圆形特征点邻域内构造特征描述子,以每个圆环作为一个子环,每个子环内只有像素位置发生了改变,像素之间其他相对信息是保持不变的。当图像发生旋转时,统计每个圆环内元素的梯度累加值进行排序,生成特征向量描述子,降低了算法的维度及复杂度,把特征描述子的维数从128维降低到48维。实验结果表明,改进算法旋转配准重复率在85%以上;在图像旋转、缩放和光照变化情况下,与SIFT算法相比,平均配准准确率提高5%,平均配准耗时降低30%左右,有效实现了对SIFT的改进。