改进的SIFT特征点图像匹配方法研究

图像配准是遥感、计算机视觉、医学等许多领域中的一个基本问题,而图像特征点的提取和匹配是完成图像配准的基础。本文采用SIFT尺度不变特性变换算子进行图像匹配,通过改进该算法,提高算法的效率,通过仿真实验,证明改进的SIFT特征点匹配方法,可以提高特征点匹配的速率,降低匹配计算的耗时。     

基于特征的hausdorff距离图像配准

针对图像配准问题,提出了基于Harris及SIFT(Scale-invariant feature transform)特征的Hausdorff距离方法来实现图像配准。首先利用harris角点检测和SIFT特征提取参考图像和待配准图像的角点,通过两种方法获得的角点在融合之后获得更大的角点搜索范围,再利用相似一致性匹配原则剔除错误角点,进而通过改进的Hausdorff距离算法完成图像的配准操作。结果证明,改进算法比传统Hausdorff距离算法运行时间更短,算法时间降低约45%,具有较强的抗噪声能力和旋转鲁棒性,提高了图像配准的效率和精确性。     

改进SIFT变换与客观评价结合的图像配准算法

针对SIFT (scale invariant feature transform)算子在大幅复杂图像中提取的过多不稳定特征点及在只有少量重合区域下图像配准过程中出现的过多误匹配,导致图像配准精度下降;提出一种改进的SIFT算法,在对目标图像提取SIFT特征后,利用双向BBF(Best-Bin-First)匹配算法对提取的特征点进行匹配,采用SIFT描述子的尺度以及梯度方向信息建立最小邻域匹配剔除误匹配点,通过随机抽取一致性算法(RANSAC)进一步筛选匹配点,并利用最小二乘法结合多项式近似拟合出变换模型,利用局部均方根有效值(RMS)评价映射矩阵与实际图像的误差,找出并删除引起误差的误匹配点,迭代至配准图像符合评价标准后,计算出精确变换模型.实验结果表明,该算法提高了大幅复杂图像在少量重合区域时的配准精度.     

基于改进的SIFT算法的红外图像配准

电路板红外图像具有分辨率低、对比度低、信噪比低、视觉效果模糊的特点,目前的图像配准算法用于电路板红外图像配准时,运算时间长且匹配准确度低.针对电路板红外图像的特点,梳理了图像配准方面的国内外研究现状,分析了SIFT算法的基本原理,对原有的SIFT算法进行了修改.对特征点的提取方式进行了改进,减少了不必要的特征点;改进了特征点的描述符,降低了特征向量的维数;在特征点匹配的时候加入了分层阈值.对改进的算法进行了一系列的测试,针对三对电路板的红外图像进行配准,实验结果表明,相比于传统的SIFT算法,改进的SIFT算法在进行电路板红外图像配准的时候,匹配的准确率和运算时间得到了很大的提升,为电路板红外图像的配准提供了新的方法.     

具有SIFT描述的多尺度角点图像配准

角点含有丰富的图像结构信息,在图像配准中是广泛应用的图像特征。Harris算法是经典的角点提取算法,Harris角点对图像旋转具有不变性,但对尺度变化敏感,在有尺度变化的图像配准中,应用受限。仿照SIFT特征点提取过程,提出了一种多尺度角点提取方法,提取的多尺度角点对图像旋转和尺度变化有很好的适用性。并用SIFT描述子描述,用光学及SAR图像进行了配准实验。结果表明,与SIFT、Harris算法相比,本文方法在保证配准精度的基础上,配准时间减少40%以上,特征点在配准过程中的利用率提高一倍多。     

SIFT算法优化及其在遥感影像配准中的应用

针对传统尺度不变特征转换(scale invariant feature transform,SIFT)方法在处理存在角度偏差的图像配准数据时得到的配准点对数量低以及配准精度不高的问题,提出一种基于多角度归一化互相关法优化的SIFT遥感图像配准方法。以相关性系数为标准确定图像最佳配准位置,进行角度校正;用SIFT算法进行特征提取和特征匹配,并结合随机抽样一致性算法(random sample consensus,RANSAC),剔除错误配准点,以提高配准精度。实验表明,该实验配准方法比单一的SIFT配准方法得到数量更多且精度更高的特征点对,结果显示SIFT配准点对数量平均提高24.5倍,RANSAC算法确定的正确配准点对平均调高86.8倍。     

基于Marr小波改进的SIFT算法的遥感影像配准

针对遥感图像配准方法中错误匹配点对过多、配准效率低和其他性能,提出了一种基于小波的遥感图像配准方法。首先,利用尺度空间理论下的Marr小波对参考图像和待配准图像进行特征提取,然后利用欧氏距离对参考图像和待配准图像的特征点进行初配准,再根据随机采样一致法,对初配准结果进行精配准。为了验证方法的有效性,选择无人机实时航拍图像、不同时相变化遥感图像以及遥感不同高度的遥感图像。实验结果表明:该方法与SIFT(Scale Invariant Feature Transform)算法以及其他改进SIFT算法相比可以有效剔除错误匹配点对,提高了配准精度,同时提高配准效率两倍以上。该方法可以应用于不同遥感数据源,能够有效地提高配准精度,降低配准时间。     

一种去冗余的SIFT特征提取方法

基于SIFT特征点的配准是图像配准领域里常采用的一种方法。但是,在复杂背景下,图像SIFT特征点通常量大且冗余,这会带来浪费存储空间、容易误配、配准耗时多等问题。针对这些缺点,提出了一种去冗余的SIFT特征提取算法。首先提取出SIFT特征点,然后根据特征点周边梯度情况,判断特征点是否落于目标区域,进而保留目标区域特征点,删除背景区域特征点,减少特征点数量的同时也实现了去冗余。提取所得的特征点质量好坏由落入目标区域的点数和落入背景区域的点数比例判断。实验结果表明,本算法减少了复杂背景下大量的干扰特征点。这将为后续的配准工作提高精度和效率。     

基于SIFT与Contourlet变换的高分辨遥感图像配准

针对高分辨遥感图像特征量较多的情况,提出一种基于SIFT与Contourlet变换相结合的图像配准算法。首先将图像进行Contourlet变换分解成低频和高频子带,对高频子带通过设定合适的阈值来提取图像边缘特征点,对低频子带进行SIFT特征点提取。将两者提取到的特征点分别匹配后得到粗匹配点对,利用随机抽样一致性(RANSAC)选择出精匹配点对,实现图像配准。实验表明:在多源遥感图像配准过程中,与基于非采样Contourlet变换(NSCT)和基于SIFT特征提取相比,该算法能够更准确地提取到特征点,具有更高的运算效率以及匹配率。     

具有仿射不变性的彩色图像配准方法研究

经典SIFT算法在特征提取及特征匹配阶段存在耗时过长的问题,而SURF算法对仿射角度大的图像配准时错配率较高;且已有算法对彩色图像的处理均把彩色信息转为灰度信息,从而丢失了表征图像的颜色信息.提出一种具有仿射不变性的彩色图像配准算法:C-ASURF算法,通过模拟仿射变换得到一系列模拟图像,对模拟得到的图像计算颜色不变量,再对其进行特征点的检测及特征点的匹配,因此,它能够很好的解决图像配准时因图像仿射角度过大而造成的配准失效问题,且能够保留彩色图像的彩色信息.实验结果表明,C-ASURF算法的运行速度比具有仿射不变性的SIFT算法要快很多,且图像配准的准确率也很高,能够满足图像配准的高效性及实时性要求,具有很好的稳定性.     

基于STEP的特征模型及重构算法

随着CAX技术的发展,特征技术得到越来越多的重视,特征技术的使用,大幅度提高了产品的设计、制造、集成等过程的效率。目前,基于特征的CAD、CAM系统是市场的主流,CAPP是完全基于特征的应用系统。但是在STEP的众多应用协议中,涉及机械设计、制造、管理的应用协议有很多,但是这些应用协议基本上没有提供对特征的支持。AP224是较早支持特征的STEP应用协议,主     

支持特征的非流形造型数据结构的研究

文章提出了一种新的数据结构,统一的表示了线框、表面和实体三种模型,及非几何特征信息,扩大传统实体造型的覆盖域,并可表示非流形模型。     

一种基于关联性的特征选择算法

目前在文本分类领域较常用到的特征选择算法中,仅仅考虑了特征与类别之间的关联性,而对特征与特征之间的关联性没有予以足够的重视.提出一种新的基于关联分析的特征选择算法,该方法以信息论量度为基本工具,综合考虑了计算代价以及特征评估的客观性等问题.算法在保留类别相关特征的同时识别并摒弃了冗余特征,取得了较好的约简效果.     

基于最大决策边界的局部在线流特征选择

现有的在线流特征选择算法通常选择一个最优的全局特征子集,并假设该子集适用于样本空间的所有区域.但是,样本空间的每个区域都使用独有的特征子集进行准确描述,这些特征子集的特征和大小可能有所不同.因此,文中提出基于最大决策边界的局部在线流特征选择算法.引入局部特征选择,在充分利用局部信息的基础上,设计基于最大决策边界的特征衡量标准,尽可能分开同类样本和不同类样本.同时,使用最大化平均决策边界、最大化决策边界和最小化冗余3种策略选择合适的特征.针对局部区域选择最优的特征子集,然后使用类相似度测量方法进行分类.在14个数据集上的实验结果和统计假设检验验证文中算法的分类有效性和稳定性.     

基于特征的CAD／CAM集成技术评述与研究

本文对特征识别，基于特征的设计和特征转换等方法进行了评述和研究，并据此提出了基于特征的ＣＡＤ／ＣＡＭ集成系统的总体设计方案。     

Pedestrian Re-ID based on feature consistency and contrast enhancement

For robust person re-identification(Re-ID), the key is effectively learning the features of body parts and their long-distance dependence. ResNet and Transformer are respectively good at learning local dependence and long-distance dependence between region features due to their respective special structures. In order to fully integrate the advantages of the two models, we propose a novel person Re-ID framework that effectively incorporates pixel-level region features, posture-level relation features and the long-distance dependence of region features. Specifically, we design a Semantic Correction Module (SCM) that corrects pixel-level region features and posture-level relation features in a masked manner to generate discriminative fine-grained features with high pose semantics. Considering the semantic inconsistency between relation features and region features, we propose a Contrastive Association Module (CAM) to interactively enhances the long-distance correlation and local saliency of features in a self-attention way. Finally, to improve the robustness of local and global features, we construct a CAM layer to enhance the representation of features based on their potential relationships. Extensive experiment results on general and occlusion datasets demonstrate that our approach performs favorably against the state-of-the-art methods, e.g. 96% Rank-1 on Market-1501.     

Stability of feature selection algorithms: a study on high-dimensional spaces

With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components of the learning process. Strangely, despite extensive work on the stability of learning algorithms, the stability of feature selection algorithms has been relatively neglected. This study is an attempt to fill that gap by quantifying the sensitivity of feature selection algorithms to variations in the training set. We assess the stability of feature selection algorithms based on the stability of the feature preferences that they express in the form of weights-scores, ranks, or a selected feature subset. We examine a number of measures to quantify the stability of feature preferences and propose an empirical way to estimate them. We perform a series of experiments with several feature selection algorithms on a set of proteomics datasets. The experiments allow us to explore the merits of each stability measure and create stability profiles of the feature selection algorithms. Finally, we show how stability profiles can support the choice of a feature selection algorithm. Alexandros Kalousis received the B.Sc. degree in computer science, in 1994, and the M.Sc. degree in advanced information systems, in 1997, both from the University of Athens, Greece. He received the Ph.D. degree in meta-learning for classification algorithm selection from the University of Geneva, Department of Computer Science, Geneva, in 2002. Since then he is a Senior Researcher in the same university. His research interests include relational learning with kernels and distances, stability of feature selection algorithms, and feature extraction from spectral data. Julien Prados is a Ph.D. student at the University of Geneva, Switzerland. In 1999 and 2001, he received the B.Sc. and M.Sc. degrees in computer science from the University Joseph Fourier (Grenoble, France). After a year of work in industry, he joined the Geneva Artificial Intelligence Laboratory, where he is working on bioinformatics and datamining tools for mass spectrometry data analysis. Melanie Hilario has a Ph.D. in computer science from the University of Paris VI and currently works at the University of Geneva’s Artificial Intelligence Laboratory. She has initiated and participated in several European research projects on neuro-symbolic integration, meta-learning, and biological text mining. She has served on the program committees of many conferences and workshops in machine learning, data mining, and artificial intelligence. She is currently an Associate Editor of theInternational Journal on Artificial Intelligence Toolsand a member of the Editorial Board of theIntelligent Data Analysis journal.     

An approach to identify design and manufacturing features from a data exchanged part model

Due to the large variety of CAD systems in the market, data exchange between different CAD systems is indispensable. Currently, data exchange standards such as STEP and IGES, etc. provide a unique approach for interfacing among different CAD platforms. Once the feature-based CAD model created in one CAD system is input into another via data exchange standards, many of the original features and the feature-related information may not exist any longer. The identification of the design features and their further decomposition into machining features for the downstream activities from a data exchanged part model is a bottleneck in integrated product and process design and development. In this paper, the feature panorama is succinctly articulated from the viewpoint of product design and manufacturing. To facilitate feature identification and extraction, a multiple-level feature taxonomy and hierarchy is proposed based on the characteristics of part geometry and topology entities. The relationships between the features and their geometric entities are established. A litany of algorithms for the identification of design and machining features are proposed. Besides, how to recognize the intersecting features or compound features based on the featureless chunks of geometry entities is critical and the issue is addressed in the paper. A multi-level compound feature representation and recognition approach are presented. Finally, case studies are used to illustrate the validity of the approach and algorithms proposed for the identification of the features from CAD part models in neutral format.     

一种基于几何特征的表情相似性度量方法

在表演驱动、表情克隆等人脸动画中,需要寻找最相似表情以提高动画真实感和逼真度。基于面部表情几何特征提出一种特征加权的表情相似性度量方法。首先,在主动外观模型上,利用链码描述各区域的形状特征以刻画局部表情细节,并根据区域特征点间的拓扑关系构建形变特征以反映整体表情信息。然后,采用特征加权方式对融合的几何特征进行相似性度量,并将权重的求解过程转化为加权目标函数最小化。最后,利用求解的权重以及特征加权函数度量表情间的相似性,寻找与之最相似的表情图像。在BU-3DFE数据库和FEEDTUM数据库上的实验结果表明,该方法在寻找相似表情的正确率方面明显高于现有的度量方法,并且对不同类型、不同强度的表情描述保持较好鲁棒性,尤其在嘴型、脸颊收缩、嘴开合幅度等表情细节维持较高相似度。     

Optimal feature selection for support vector machines

Selecting relevant features for support vector machine (SVM) classifiers is important for a variety of reasons such as generalization performance, computational efficiency, and feature interpretability. Traditional SVM approaches to feature selection typically extract features and learn SVM parameters independently. Independently performing these two steps might result in a loss of information related to the classification process. This paper proposes a convex energy-based framework to jointly perform feature selection and SVM parameter learning for linear and non-linear kernels. Experiments on various databases show significant reduction of features used while maintaining classification performance.