%0 Journal Article
%T Robust and Fast Feature Points Matching<br>鲁棒且快速的特征点匹配算法
%A 徐正光
%A 陈宸
%J 计算机科学
%D 2013
%I 
%X Aiming at the problem that most stereo matching algorithms cost too much time, an algorithm in which fca- lure points are detected in frectuency domain and feature vectors are extracted in spatial domain was proposed. Firstly, effective coding theory was studied. Secondly, the salient features were located in the image and their scales were com- puled. Finally, patterns whose scales are matched with the feature points' scales were constructed to extract features, and then,fcatures were matched by the nearest neighbor rule. The experiment results show that the proposed method has high computational effciency, less time consumption, strong robustness to scale and affine tranformation and make a balance between speed and performance.
%K Feature points matching
%K Salient feature
%K Affine invariance<br>特征点匹配，显著性特征，仿射不变性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=D8CF0D2A1D9D3361D7C49421A500882A&yid=FF7AA908D58E97FA&vid=1371F55DA51B6E64&iid=0B39A22176CE99FB&sid=E39A3F4E3A67639B&eid=D0182A31A5EB14BA&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=0