计算机与现代化 ›› 2013, Vol. 1 ›› Issue (2): 43-47+5.doi: 10.3969/j.issn.1006-2475.2013.02.011

• 算法分析与设计 • 上一篇    下一篇

基于图像混合图结构的区域匹配和图像约化算法

庄小芳,滕忠坚,洪 亲   

  1. 福建师范大学物理与光电信息科技学院,福建福州350007
  • 收稿日期:2012-10-26 修回日期:1900-01-01 出版日期:2013-02-27 发布日期:2013-02-27

Algorithm of Image Region Matching and Reduction Based on Mix-graph Structure

ZHUANG Xiao-fang, TENG Zhong-jian, HONG Qin   

  1. School of Physics and Optoelectronics Technology, Fujian Normal University, Fuzhou 350007, China
  • Received:2012-10-26 Revised:1900-01-01 Online:2013-02-27 Published:2013-02-27

摘要: 讨论使用混合图对图像进行识别的连通性、相似性和可比性原则,并提出一种混合图结构的约化算法。通过可比性原则,对图像的混合图结构中复合节点用参考图像进行比较,计算出混合图复合节点在参考图像中的可能匹配和相似度,以此对混合图结构进行约化。为方便计算和阐述约化过程,使用单个属性,对混合图进行属性标记,把相似性比较简化为线性复杂度的排序和查询运算。结果显示,该方法切实可行。

关键词: 混合图, 连通性, 相似性, 可比性, 混合图结构约化, 区域合并, 匹配算法, 复合相似度

Abstract: This paper discusses the principles of connectivity, similarity and comparability in image identification based on the mixed-graph structure. It proposes a reduction algorithm that compares each composite node in a mixed-graph against a reference image to find the possible matches and the corresponding maximal similarity value (i.e., compound similarity), and reduces the mixed-graph using the best matches. To ease the calculation and better illustrate the reduction process, this paper labels the nodes in the mixed-graph with single attributes, and simplifies the similarity computation to sort and query operations with a linear complexity. The results show that the method is efficient and feasible.

Key words: mixed-graph, connectivity, similarity, comparability, mixed-graph structure reduction, region merging, matching algorithm, compound similarity