K-Dvd-tree: A high dimensional data index applying to SIFT feature matching
When SIFT algorithm is applied to image feature matching on the mobile platform, it has been found some issues such as slow search rate, high memory consumption and frequency I/O, etc. Aiming at such problems, this paper studies on high dimensional data index structure for SIFT image feature matching, proposed a K-Dvd-tree index structure. This structure divides high dimensional data into multiple subspace using vantage dimension in order to increase the fanout degree of the tree, controls the number of feature points in leaf node in order to reduce the height of the tree, and ultimately raise the search rate;At the same time, it stores multiple internal nodes at the same level within one page , and makes each leaf node correspond to one page in order to reduce memory consumption, and improve I/O efficiency as well. The experiments show that the performance of this index structure is relatively increased in terms of search rate and I/O efficiency
Augmented reality SIFT mobile platforms high-dimensional data indexing KD-tree K-Dvd-tree
Huijuan Zhang Nan Li
School of Software Engineering, Tongji University Shanghai, China
国际会议
杭州
英文
592-595
2012-10-28（万方平台首次上网日期，不代表论文的发表时间）