MFI-Tree: An Effective Multi-feature Index Structure for Weighted Query Application
Computer Science and Information Systems, Tome 7 (2010) no. 1
Cet article a éte moissonné depuis la source Computer Science and Information Systems website
Multi-Feature Index Tree (MFI-Tree) a new indexing structure, is proposed to index multiple high-dimensional features of video data for video retrieval through example. MFI-Tree employs tree structure which is beneficial for the browsing application, and retrieves the last level cluster nodes in retrieval application to improve the performance. Aggressive Decided Distance for kNN (ADD-kNN) search algorithm is designed because it can effectively reduce the distance to prune the search space. Experimental results demonstrate that the MFI-Tree and ADD-kNN algorithm have the advantages over sequential scan in performance.
Keywords:
Multi-Feature Index Tree; KNN; Aggressive Decided Distance for kNN; Video Retrieval
@article{CSIS_2010_7_1_a12,
author = {Yunfeng He and Junqing Yu},
title = {MFI-Tree: {An} {Effective} {Multi-feature} {Index} {Structure} for {Weighted} {Query} {Application}},
journal = {Computer Science and Information Systems},
year = {2010},
volume = {7},
number = {1},
url = {http://geodesic.mathdoc.fr/item/CSIS_2010_7_1_a12/}
}
Yunfeng He; Junqing Yu. MFI-Tree: An Effective Multi-feature Index Structure for Weighted Query Application. Computer Science and Information Systems, Tome 7 (2010) no. 1. http://geodesic.mathdoc.fr/item/CSIS_2010_7_1_a12/