Point Pattern Matching Based on Spectra of Directed Graphs  

作　　者：LIANG Dong ZHU Ming FAN Yizheng YAN Pu 

机构地区：[1]Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei 230039, China

出　　处：《Chinese Journal of Electronics》2011年第4期662-666,共5页电子学报（英文版）

基　　金：This work is supported by the National Natural Science Foundation of China （No.60772121, No.11071002）, Key Project of Chinese Ministry of Education （No.210091）, Specialized Research Fund for the Doc- toral Program of Higher Education （No.20103401110002）, Anhui Provincial Natural Science Foundation （No.10040606Y33）, Natural Sci- ence Foundation of Anhui Provincial Education Department （No.KJ2011A008）, Academic Innovation Team of Anhui University Project （No.KJTD007A, No.KJTD001B）.

摘　　要：We present a novel algorithm for point pattern matching by means of spectra of directed graphs. Given a feature point-set, we construct a weighted di- rected graph and skew-symmetric matrix associated with the graph. By using spectral decomposition of the matrix, we give a spectral representation of the feature points with half of the eigenvectors. We theoretically analyze that our method can well deal with the matching problem under affine transformation. The expreiments applied to syn- thetic data and real-world images show the effectiveness of our method.

关 键 词：MATCHING SPECTRUM Directed graph Affine transformation. 

分 类 号：O157.5[理学—数学] TP391.41[理学—基础数学]