%0 Journal Article
%T Efficient High-Dimensional Image Indexing Based on SVD for Quadratic form Distance<br>二次式距离上基于SVD的高维图像索引方法
%A CUI Jiang-tao
%A SUN Jun-ding
%A FU Shao-feng
%A ZHOU Li-hu
%A CUI Jiang-tao
%A SUN Jun-ding
%A FU Shao-feng
%A ZHOU Li-hu
%A CUI Jiang-tao
%A SUN Jun-ding
%A FU Shao-feng
%A ZHOU Li-hua
%A CUI Jiang-tao
%A SUN Jun-ding
%A FU Shao-feng
%A ZHOU Li-hua
%A <br>崔江涛
%A 孙君顶
%A 付少锋
%A 周利华
%J 中国图象图形学报
%D 2006
%I 
%X Many traditional indexing methods perform poorly in high dimensional vector space.The Vector Approximation File approach overcomes some of the difficulties of dimensionality curse,but it can't support the quadratic form metric.A novel VA-File approach for quadratic form distance is introduced in this paper.By the SVD of similarity matrix,the quadratic form distance can be converted to the Euclidean distance,and the approximation vector can be obtained. The low-dimensional filter algorithm is also applied during the nearest neighbor search.The vectors are first filtered with the low-dimensional approximate distance measure,and then the candidate results are re-computed with high-dimensional distance measure.The experimental results show that it can save the computational time significantly because only a small set of vectors is computed on the high-dimensional distance measure.
%K dimensionality curse
%K quadratic form distance
%K nearest neighbor search
%K singular value decomposition(SVD)
%K vector approximation<br>维数灾难
%K 二次式距离
%K 近邻搜索
%K 奇异值分解
%K 向量近似
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D06194629680C940ACE75262F54B9D85&aid=AFDBE26139C9234F&yid=37904DC365DD7266&vid=708DD6B15D2464E8&iid=E158A972A605785F&sid=E3C3E274D87A8C16&eid=9296A146D1D94BC4&journal_id=1006-8961&journal_name=中国图象图形学报&referenced_num=0&reference_num=11