1. 安徽大学电子信息工程学院,安徽,合肥,230039
2. 安徽大学计算智能与信号处理教育部重点实验室,安徽,合肥,230039
3. 安徽大学电子信息工程学院安徽合肥,230039
4. 安徽大学计算智能与信号处理教育部重点实验室安徽合肥,230039
纸质出版:2012
移动端阅览
梁栋, 朱明, 唐俊, 等. 基于局部相对形状上下文与Q-谱的点模式匹配算法[J]. 电子学报, 2012,40(4):636-641.
LIANG Dong, ZHU Ming, TANG Jun, et al. A Point Pattern Matching Algorithm Based on Local Relative Shape Context and Q-Spectra[J]. Acta Electronica Sinica, 2012, 40(4): 636-641.
梁栋, 朱明, 唐俊, 等. 基于局部相对形状上下文与Q-谱的点模式匹配算法[J]. 电子学报, 2012,40(4):636-641. DOI: 10.3969/j.issn.0372-2112.2012.04.003.
LIANG Dong, ZHU Ming, TANG Jun, et al. A Point Pattern Matching Algorithm Based on Local Relative Shape Context and Q-Spectra[J]. Acta Electronica Sinica, 2012, 40(4): 636-641. DOI: 10.3969/j.issn.0372-2112.2012.04.003.
本文提出了一种基于局部相对形状上下文与Q-谱的点模式匹配算法
对每个点构造相应的线图
并对线图的无符号Laplacian矩阵进行谱分解;利用谱分解所获得的特征值(Q-谱)作为点的特征
进而计算点的初始匹配概率;通过定义局部相对形状上下文计算点的相似性距离;将Q-谱方法与局部相对形状上下文结合进行概率松弛迭代获得匹配结果.实验结果表明了本文算法的可行性与有效性.
This paper presents a point pattern matching algorithm based on local relative shape context and Q-spectra of line graph.A line graph is constructed for each point
and the spectrum decomposition is performed on the signless Laplacian matrix of line graph.The eigenvalues(Q-spectra) obtained from the spectrum decomposition are used to represent the point's feature
and the initial matching probability is calculated.Local relative shape context is defined to compute the similarity distance between any two points.Q-spectra method is combined with local relative shape context via a probabilistic relaxation approach to get the matching result.Experimental results indicate the effectiveness and feasibility of the proposed algorithm.
0
浏览量
2
下载量
4
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621