Batch nearest neighbor search for video retrieval

IEEE Transactions on Multimedia

Volumn 10, Issue 3, 2008, Pages 409-420

  Shao, Jie ^b   Huang, Zi ^c   Shen, Heng Tao ^b   Zhou, Xiaofang ^a,b   Lim, Ee Peng ^a,d   Li, Yijun ^e  

^a IEEE

^b UNIVERSITY OF QUEENSLAND   (Australia)

^c OPEN UNIVERSITY   (United Kingdom)

^d NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^e Nielsen Media Research   (Australia)

Author keywords

Content based retrieval; High dimensional indexing; Multimedia databases; Query processing

Indexed keywords

DATABASE SYSTEMS; FEATURE EXTRACTION; INDEXING (OF INFORMATION); MULTIMEDIA SERVICES; QUERY PROCESSING; VECTORS;

HIGH-DIMENSIONAL FEATURE VECTORS; HIGH-DIMENSIONAL INDEXING; MULTIMEDIA DATABASES;

CONTENT BASED RETRIEVAL;

EID: 41549138893     PISSN: 15209210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMM.2008.917339     Document Type: Conference Paper

References (36)

1. H. Wang, A. Divakaran, A. Vetro, S.-F. Chang, and H. Sun, "Survey of compressed-domain features used in audio-visual indexing and analysis," J. Vis. Commun. Image Represent., vol. 14, no. 2, pp. 150-183, 2003.
2. S.-C. S. Cheung and A. Zakhor, "Efficient video similarity measurement with video signature," IEEE Trans. Circuits Syst. Video Technol., vol. 13, no. 1, pp. 59-74, Jan. 2003.
3. H. T. Shen, B. C. Ooi, X. Zhou, and Z. Huang, "Towards effective indexing for very large video sequence database," in Proc. SIGMOD Conf., 2005, pp. 730-741.
4. G. Lu, "Techniques and data structures for efficient multimedia retrieval based on similarity," IEEE Trans. Multimedia., vol. 4, no. 3, pp. 372-384, Sep. 2002.
5. R. Weber, H.-J. Schek, and S. Blott, "A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces," Proc. Conf. Very Large Data Bases, pp. 194-205, 1998.
6. G.-H. Cha, X. Zhu, D. Petkovic, and C.-W. Chung, "An efficient indexing method for nearest neighbor searches in high-dimensional image databases," IEEE Trans. Multimedia, vol. 4, no. 1, pp. 76-87, Mar. 2002.
7. S. Berchtold, D. A. Keim, and H.-P. Kriegel, "The x-tree: An index structure for high-dimensional data," Proc. Conf. Very Large Data Bases, pp. 28-39, 1996.
8. + -tree based indexing method for nearest neighbor search," ACM Trans. Database Syst., vol. 30, no. 2, pp. 364-397, 2005.
9. S. Berchtold, C. Böhm, H. V. Jagadish, H.-P. Kriegel, and J. Sander, "Independent quantization: An index compression technique for highdimensional data spaces," in Proc. Int. Conf. Data Engineering, 2000, pp. 577-588.
10. G.-H. Cha and C.-W. Chung, "The gc-tree: A high-dimensional index structure for similarity search in image databases," IEEE Trans. Multimedia, vol. 4, no. 1, pp. 235-247, Mar. 2002.
11. N. Koudas, B. C. Ooi, H. T. Shen, and A. K. H. Tung, "LDC: Enabling search by partial distance in a hyper-dimensional space," in Proc. Int. Conf. Data Engineering, 2004, pp. 6-17.
12. Z. Yang, W. T. Ooi, and Q. Sun, "Hierarchical, non-uniform locality sensitive hashing and its application to video identification," in Proc. ICME, 2004, pp. 743-746.
13. H. Lu, B. C. Ooi, H. T. Shen, and X. Xue, "Hierarchical indexing structure for efficient similarity search in video retrieval," IEEE Trans. Knowl. Data Eng., vol. 18, no. 11, pp. 1544-1559, Nov. 2006.
14. J. Shao, Z. Huang, H. T. Shen, X. Zhou, and Y. Li, "Dynamic batch nearest neighbor search in video retrieval," in Proc. Int. Conf. Data Engineering, 2007, pp. 1395-1399.
15. P. Ciaccia, M. Patella, and P. Zezula, "M-tree: An efficient access method for similarity search in metric spaces," in Proc. Conf. Very Large Data Bases, 1997, pp. 426-435.
16. R. F. S. Filho, A. J. M. Traina, C. Traina, Jr, and C. Faloutsos, "Similarity search without tears: The omni family of all-purpose access methods," in Proc. Int. Conf. Data Engineering, 2001, pp. 623-630.
17. S. Kiranyaz and M. Gabbouj, "Hierarchical cellular tree: An efficient indexing scheme for content-based retrieval on multimedia databases," IEEE Trans. Multimedia, vol. 9, pp. 102-119, Jan. 2007.
18. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. E. Abbadi, "High dimensional nearest neighbor searching," Inf. Syst., vol. 31, no. 6, pp. 512-540, 2006.
19. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu, "An optimal algorithm for approximate nearest neighbor searching fixed dimensions," J. ACM, vol. 45, no. 6, pp. 891-923, 1998.
20. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," in Proc. Conf. Very Large Data Bases, 1999, pp. 518-529.
21. F. Korn and S. Muthukrishnan, "Influence sets based on reverse nearest neighbor queries," in Proc. SIGMOD Conf., 2000, pp. 201-212.
22. Y. Tao, D. Papadias, and Q. Shen, "Continuous nearest neighbor search," in Proc. Conf. Very Large Data Bases, 2002, pp. 287-298.
23. D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis, "Group nearest neighbor queries," in Proc. Int. Conf. Data Engineering, 2004, pp. 301-312.
24. D. Papadias, Y. Tao, K. Mouratidis, and C. K. Hui, "Aggregate nearest neighbor queries in spatial databases," ACM Trans. Database Syst., vol. 30, no. 2, pp. 529-576, 2005.
25. R. Fagin, "Combining fuzzy information: An overview," SIGMOD Rec., vol. 31, no. 2, pp. 109-118, 2002.
26. C. Xia, H. Lu, B. C. Ooi, and J. Hu, "Gorder: An efficient method for knn join processing," in Proc. Conf. Very Large Data Bases, 2004, pp. 756-767.
27. C. Böhm, B. Braunmüller, F. Krebs, and H.-P. Kriegel, "Epsilon grid order: An algorithm for the similarity join on massive high-dimensional data," in Proc. SIGMOD Conf., 2001, pp. 379-388.
28. T. K. Sellis, "Multiple-query optimization," ACM Trans. Database Syst., vol. 13, no. 1, pp. 23-52, 1988.
29. M. H. Kang, H. G. Dietz, and B. K. Bhargava, "Multiple-query optimization at algorithm-level," Data Knowl. Eng., vol. 14, no. 1, pp. 57-75, 1994.
30. K. Shim, T. K. Sellis, and D. S. Nau, "Improvements on a heuristic algorithm for multiple-query optimization," Data Knowl. Eng., vol. 12, no. 2, pp. 197-222, 1994.
31. P. Roy, S. Seshadri, S. Sudarshan, and S. Bhobe, "Efficient and extensible algorithms for multi query optimization," in Proc. SIGMOD Conf., 2000, pp. 249-260.
32. J. Zhang, N. Mamoulis, D. Papadias, and Y. Tao, "All-nearest- neighbors queries in spatial databases," in Proc. Scientific Statistical Database Management, 2004, pp. 297-306.
33. H. T. Shen, B. C. Ooi, and K.-L. Tan, "Saverf: Towards efficient relevance feedback search," in Proc. Int. Conf. Data Engineering, 2006.
34. B. Braunmuller, M. Ester, H.-P. Kriegel, and J. Sander, "Efficiently supporting multiple similarity queries for mining in metric databases," in Proc. Int. Conf. Data Engineering, 2000, pp. 256-267.
35. C. Böhm, "A cost model for query processing in high dimensional data spaces," ACM Trans. Database Syst., vol. 25, no. 2, pp. 129-178, 2000.
36. [Online], Available: http://www.virtualdub.org