High-dimensional descriptor indexing for large multimedia databases

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2008, Pages 739-747

  Valle, Eduardo ^a   Cord, Matthieu ^b   Philipp Foliguet, Sylvie ^a  

^a Centre national de la recherche scientifique   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

High dimensional data indexing; K nearest neighbors search; Local

Indexed keywords

CULTURAL INSTITUTIONS; DESCRIPTORS; DIMENSIONAL SPACES; FAST SEARCH; HIGH DIMENSIONAL DATA; HIGH-DIMENSIONAL; HIGH-DIMENSIONAL DATA INDEXING; IMAGE IDENTIFICATION; K NEAREST NEIGHBOR SEARCH; K NEAREST NEIGHBORS SEARCH; K-NEAREST NEIGHBORS; LARGE DATABASE; LOCAL; LOCAL DESCRIPTORS; MULTIMEDIA DATABASE; REAL-WORLD APPLICATION; SECONDARY STORAGE; SEQUENTIAL SEARCH; SPEED-UPS;

DATABASE SYSTEMS; KNOWLEDGE MANAGEMENT; MOTION COMPENSATION; MULTIMEDIA SYSTEMS; TRACKING (POSITION);

INDEXING (OF INFORMATION);

EID: 70349245462     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1458082.1458181     Document Type: Conference Paper

References (28)

1. Böhm, C., Berchtold, S. and Keim, D. A. 2001. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Sur-veys (CSUR), 33, 3 (September 2001), pp. 322-373. DOI= 10.1145/502807.502809
2. Weber, R., Schek, H.-J. and Blott, S. 1998. A Quantitative Analysis and Performance Study for Similarity-Search Me-thods in High-Dimensional Spaces. In Proceedings of the 24rd International Conference on Very Large Data Bases (New York, NY, USA, August 24-27, 1998). Morgan Kauf-mann Publishers Inc., San Francisco, CA, USA, 194-205.
3. Samet, H. J. 2006. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, San Francisco, CA, USA.
4. Shakhnarovich, G., Darrell, T. and Indyk, P. 2006. Nearest-Neighbor Methods in Learning and Vision: Theory and Prac-tice. The MIT Press, Cambridge, MA, USA.
5. Indyk, P. and Motwani, R. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the 13th annual ACM symposium on Theory of computing (Dallas, Texas, USA, May 24-26, 1998). ACM, New York, NY, USA, pp. 604-613. DOI= 10.1145/276698.276876
6. Fagin, R., Kumar, R. and Sivakumar, D. 2003. Efficient similarity search and classification via rank aggregation In Proceedings of the 2003 ACM SIGMOD international conference on Management of data (San Diego, California, USA, June 09-12, 2003). ACM, New York, NY, USA, pp. 301-312. DOI=10.1145/872757.872795
7. Lejsek, H., Ásmundsson, F. H., Jónsson, B. ó. and Amsaleg, L. 2008. NV-tree: An Efficient Disk-Based Index for Approximate Search in Very Large High-Dimensional Collections. IEEE Transactions on Pattern Analysis and Machine Intelli-gence, preprint (May 20, 2008). DOI= 10.1109/TPAMI.2008.130
8. Lejsek, H., Ásmundsson, H. F., Björn¶ór, J. and Amsaleg, L. 2005. Efficient and effective image copyright enforcement. Technical report, INRIA, Rennes, France.
9. Sagan, H. 1994. Space-filling curves. Springer-Verlag, Berlin / New York.
10. Faloutsos, C. 1986. Multiattribute hashing using Gray codes. In 1986 ACM SIGMOD International Conference on Man-agement of data (Washington, D.C., USA, May 28-30, 1986). ACM Press, New York, NY, USA, pp. 227-238. DOI= 10.1145/16894.16877
11. Morton, G. M. 1966. A computer oriented geodetic data base and a new technique in file sequencing. Technical Report, IBM Ltd., Ottawa, Ontario, Canada.
12. Faloutsos, C. and Roseman, S. 1989. Fractals for secondary key retrieval. In Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Philadelphia, Pennsylvania, USA, March 29-31). ACM Press, New York, NY, USA, pp. 247-252. DOI= 10.1145/73721.73746
13. Skubalska-Rafajlowicz, E. and Krzyzak, A. 1996. Fast k-NN Classification Rule Using Metrics on Space-Filling Curves In Proceedings of the International Conference on Pattern Rec-ognition (Vienna, Austria, August 25-29, 1996). IEEE Com-puter Society, Washington, DC, USA, pp. 121-126. DOI= 10.1109/ICPR.1996. 546736
14. Megiddo, N. and Shaft, U. 1997. Efficient nearest neighbor indexing based on a collection of space filling curves. Research Report, IBM Almaden Research Center, San Jose, California, USA.
15. Shepherd, J. A., Zhu, X. and Megiddo, N. 1999. A fast indexing method for multidimensional nearest neighbor search. In SPIE Conference on Storage and Retrieval for Image and Video Databases VII (San Jose, California, USA, January 26-29, 1999). pp. 350-355. DOI= 10.1117/12.333854
16. Liao, S., Lopez, M. A. and Leutenegger, S. T. 2001. High Dimensional Similarity Search With Space Filling Curves. In Proceedings of the International Conference on Data Engineering (Heidelberg, Germany, April 02-06, 2001). IEEE Computer Society Washington, DC, USA, pp. 615-622. DOI= 10.1109/ICDE.2001.914876
17. Mainar-Ruiz, G. and Pérez-Cortés, J.-C. 2006. Approximate Nearest Neighbor Search using a Single Space-filling Curve and Multiple Representations of the Data Points. In Proceed-ings of the 18th International Conference on Pattern Recog-nition (Wan Chai, Hong Kong, August 20-24, 2006). IEEE Computer Society, Washington, DC, USA, pp. 502-505. DOI= 10.1109/ICPR.2006.275
18. Moon, B., Jagadish, H. V., Faloutsos, C. and Saltz, J. H. 1996. Analysis of the clustering properties of Hilbert space-filling curve. Technical Report, University of Maryland at College Park, College Park, Maryland, USA.
19. Mokbel, M. F., Aref, W. G. and Kamel, I. 2003. Analysis of Multi-Dimensional Space-Filling Curves. Geoinformatica, 7, 3 (September 2003), pp. 179-209. DOI= 10.1023/A:1025196714293
20. Butz, A. R. 1971. Alternative Algorithm for Hilbert's Space-Filling Curve. IEEE Transactions on Computers, C-20, 4 (April 1971), pp. 424-426.
21. Bayer, R. and McCreight, E. M. 1972. Organization and maintenance of large ordered indexes. Acta Informatica, 1, 3 (September 1972), p. 173-189. DOI= 10.1007/BF00288683
22. Lowe, D. G. 2004. Distinctive Image Features from Scale-Invariant Keypoints International Journal of Computer Vi-sion, 60, 2 (November 2004), pp. 91-110. DOI= 10.1023/B:VISI.0000029664.99615.94
23. Voorhees, E. M. and Harman, D. 2001. Overview of TREC 2001. In TREC 2001 (Gaithersburg, MD, USA, 2001). National Institute of Standards and Technology.
24. Chang, E. Y., Wang, J. Z., Li, C. and Wiederhold, G. 1998. RIME: A Replicated Image Detector for the World-Wide Web. In Multimedia storage and archiving systems III (Bos-ton, MA, USA, November 2-4, 1998). SPIE, Bellingham, USA, pp. 58-67.
25. Ke, Y., Sukthankar, R. and Huston, L. 2004. An efficient parts-based near-duplicate and sub-image retrieval system. In Proceedings of the 12th ACM international conference on Multimedia (New York, NY, USA, October 10-16, 2004). ACM, New York, NY, USA, pp. 869-876. DOI= 10.1145/1027527.1027729
26. Moëllic, P.-A. and Fluhr, C. 2007. ImagEVAL Official Results. In ImagEVAL Workshop (University of Amsterdam, Amsterdam, Netherlands, July 12, 2007).
27. Valle, E., Cord, M. and Philipp-Foliguet, S. 2006. Content-Based Retrieval of Images for Cultural Institutions Using Local Descriptors. In Geometric Modeling and Imaging - New Trends (London, UK, July 5-7, 2006). IEEE Computer Society, Washington, DC, USA, pp. 177-182. DOI= 10.1109/GMAI.2006.16
28. Fischler, M. A. and Bolles, R. C. 1981. Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM, 24, 6 (June 1981), pp. 381-395. DOI= 10.1145/358669.358692