期刊文献+

基于马氏度量的图像谱特征描述

Image Spectral Feature Description Based on Mahalanobis Metric
下载PDF
导出
摘要 传统的谱特征描述过程中采用的是不能反映样本间潜在关系的欧式距离进行度量的.为更好地区分数据之间的联系,提出基于马氏度量的图像谱特征描述算法.首先,对特征点及其周围特征点按照马氏距离进行分层,并在每层上面构造相应的结构图及计算其关联矩阵;接着,对关联矩阵进行谱分解得到其特征值向量和谱隙向量;然后分别用两者的最大值、平均值和方差统计量得到最终的马氏度量谱特征;最后,根据马氏度量谱特征之间的相似性和特征点之间距离关系来构建匹配数学模型,并用贪心算法求解得到特征点之间的匹配关系.实验结果表明,该算法提高匹配精度;同时将其应用于偏振图像的匹配问题上,并取得较好的匹配结果. The traditional spectral features in the process of description use the European distance metric thatcan not reflect the potential relationship between the samples.In order to better distinguish the relation be-tween data,the image spectral feature description algorithm based on mahalanobis metric is proposed in thispaper.Firstly,the feature points and their surrounding points are layered according to the Mahalanobis dis-tance,and the corresponding structure graph is constructed on each layer and the correlation matrix is calcu-lated.Secondly,the eigenvalue vector and the spectral gap vector are obtained by spectral decomposition ofthe correlation matrix.And then,the maximum,mean and variance of the two vectors are calculated respective-ly to obtain the final mahalanobis metric spectral features.Finally,a matching mathematical model is con-structed based on the similarity between the mahalanobis metric spectral and the distance between featurepoints,and the matching relation between feature points is obtained by greedy algorithm.A large number ofexperimental results show that the proposed algorithm improves the matching accuracy.At the same time,it is applied to the matching of polarimetric images and a good matching result is obtained.
出处 《淮北师范大学学报(自然科学版)》 CAS 2017年第4期38-43,共6页 Journal of Huaibei Normal University:Natural Sciences
基金 国家自然科学基金项目(61401001,61501003) 安徽省重点实验室开放基金项目(2017KJQ010001) 安徽大学2016年大学生科研训练计划资助项目
关键词 谱特征描述 马氏度量 马氏度量谱特征 偏振图像 spectral feature description Mahalanobis metric Mahalanobis metric spectral feature polarimetric image
  • 相关文献

参考文献5

二级参考文献78

  • 1苗启广,王宝树.基于非负矩阵分解的多聚焦图像融合研究[J].光学学报,2005,25(6):755-759. 被引量:25
  • 2王年,范益政,韦穗,梁栋.基于图的Laplace谱的特征匹配[J].中国图象图形学报,2006,11(3):332-336. 被引量:32
  • 3Chung Fan R K. Spectral graph theory [ M ]. Providence: American Mathematical Society, 1997.
  • 4Scott G L,Longuet-Higgins H C. An algorithm for associa- ting the features of 2 images [ J]. Proceedings of the Royal Society London B :Biological Sciences, 1991,2d4:21-26.
  • 5Shapiro L S, Brady J M. Feature-based correspondence:an eigenvector approach [ J]. Image Vision Computing, 1992, 10(5) :283-288.
  • 6Carcassoni M, Hancock E R. Spectral correspondence for point pattern matching [ J ]. Pattern Recognition,2003, 36 (1) :193-204.
  • 7Tang J, Liang D, Wang N, et al. A Laplacian spectral method for stereo correspondence [ J ]. Pattern Recogni- tion Letters,2007,28(12) : 1391-1399.
  • 8Mohar B, Juvan Martin. Some applications of Laplace ei- genvalues of graphs [ M ] // Ham G, Sabiussi G. Graph symmetry: algebraic methods and applications. Dordrecht: Kluwer Academic Publishers, 1997:227- 275.
  • 9Grone R, Merris R, Sunder V S. The Laplacian spectrum of a graph [ J ]. SIAM Journal Matrix Analysis Applica- tions, 1990,11 (2) :218- 238.
  • 10Merris R. Laplacian matrices of graphs: a survey [ J ]. Li-near Algebra and Its Applications, 1994, 197/198 : 143- 176.

共引文献45

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部