MFI-tree: An effective multi-feature index structure for weighted query application

6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

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 MFITree and ADD-kNN algorithm have the advantages over sequential scan in performance.

Cite

CITATION STYLE

APA

He, Y., & Yu, J. (2010). MFI-tree: An effective multi-feature index structure for weighted query application. Computer Science and Information Systems, 7(1), 139–152. https://doi.org/10.2298/CSIS1001139H

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free