检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杜玉龙[1] 李建增[1] 张岩[1] 李德良[1] 范聪[1]
机构地区:[1]军械工程学院无人机工程系,河北石家庄050003
出 处:《军械工程学院学报》2016年第1期52-58,共7页Journal of Ordnance Engineering College
基 金:军队科研计划项目
摘 要:针对传统最稳定极值区域算法,只能从灰度通道进行不变特征提取而不能充分利用彩色图像信息的缺点,以及MSER(maximally stable extremal regions)算法与SIFT(scale invariant feature transform)算法本身存在的局限性,提出一种融合MSER与SIFT的多通道图像匹配算法.首先利用HSI(hue-saturation-insensity)颜色空间,同时从三通道进行MSER特征提取,对得到的特征进行简单筛选,将S和I通道得到的MSERs经椭圆拟合与归一化处理,并在H通道得到的区域中进行SIFT特征提取,而后对所有特征利用融合了C-均值聚类法的SIFT描述子进行描述,并用高维数据的可伸缩最近邻算法(fast library for approximate nearest neighbors,FLANN)连接同名点,利用PROSAC(progressive sample consensus)算法去除错误点,最终实现图像之间的匹配.仿真实验证明,该方法能够解决传统MSER存在的问题,并且在提取的特征质量以及处理速度上更具优势.To overcome the disadvantages in the maximally stable extremal regions (MSER) algorithm, which can only detect the invariant feature in the gray channel while wasting the color image information, an extraction algorithm of integrated MSER and SIFT features in multichannel images is proved. First, MSER features are extracted from the three channels of HSI to make full use of the information of the color image. Then the process the MSERs obtained from the S and I channels elliptically fitted and normalized, and the SIFT features in the area detected from the H channel at the same time are extracted. After that, all of the features by the SIFT descriptor which combined the C-means clustering algorithm are described. And then the homonymy points by FLANN algorithm contacted. Lastly, PROSAC algorithm is used to realize the matching between images. The method is proved by simulation and it can solve the problem existing in the traditional MSER algorithm and achieve superior results in the feature quality and processing rate.
关 键 词:特征提取 MSER SIFT HSI颜色空间 C-均值聚类法 FLANN算法 PROSAC算法
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15