Similarity search using sparse pivots for efficient multimedia information retrieval

ISM 2006 - 8th IEEE International Symposium on Multimedia

Volumn , Issue , 2006, Pages 881-886

  Brisaboa, Nieves R ^a   Fariña, Antonio ^a   Pedreira, Oscar ^a   Reyes, Nora ^b  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UNIVERSIDAD NACIONAL DE SAN LUIS   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; INFORMATION SERVICES; SEARCH ENGINES; SET THEORY; TOPOLOGY;

(+ MOD 2N) OPERATION; DISTANCE FUNCTIONS; EXPERIMENTAL RESULTS; INTERNATIONAL SYMPOSIUM; MEMORY STORAGE; METRIC SPACES; MULTIMEDIA INFORMATION RETRIEVAL (MIR); SIMILARITY SEARCHES; UNSTRUCTURED DATA;

TECHNICAL PRESENTATIONS;

EID: 46249118951     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISM.2006.137     Document Type: Conference Paper

References (14)

1. R. Baeza-Yates. Searching: an algorithmic tour. Encyclopedia of Computer Science and Technology, 37:331-359, 1997.
2. R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu. Proximity matching using fixed-queries trees. In Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, pages 198-212. Springer-Verlag, Berlin, 1994.
3. S. Brin. Near neighbor search in large metric spaces. In 21st conference on Very Large Databases, 1995.
4. W. A. Burkhard and R. M. Keller. Some approaches to best-match file searching. Communications of the ACM, 16(4):230-236, 1973.
5. B. Bustos, G. Navarro, and E. Chavez. Pivot selection techniques for proximity search in metric spaces. In SCCC 2001, Proceedings of the XXI Conference of the Chilean Computer Science Society, pages 33-40. IEEE CS Press, 2001.
6. E. Chavez, J. L. Marroquin, and G. Navarro. Overcoming the curse of dimensionality. In European Workshop on Content-based Multimedia Indexing (CBMI'99), pages 5764, 1999.
7. E. Chavez, G. Navarro, R. Baeza-Yates, and J. L. Marroquín. Searching in metric spaces. ACM Computing Surveys, 33(3):273-321, 2001.
8. I. Kalantari and G. McDonald. A data structure and an algorithm for the nearest point problem. IEEE Transactions on Software Engineering, 9:631-634, 1983.
9. L. Micó, J. Oncina, and R. E. Vidal. A new version of the nearest-neighbor approximating and eliminating search (aesa) with linear pre-processing time and memory requirements. Pattern Recognition Letters, 15:9-17, 1994.
10. G. Navarro. Searching in metric spaces by spatial approximation. In Proceedings of String Processing and Information Retrieval (SPIRE'99), pages 141-148. IEEE CS Press, 1999.
11. J. K. Uhlmann. Satisfying general proximity/similarity queries with metric trees. Information Processing Letters, 40:175-179, 1991.
12. E. Vidal. An algorithm for finding nearest neighbors in (aproximately) constant average time. Pattern Recognition Letters, 4:145-157, 1986.
13. P. Yianilos. Data structures and algorithms for nearestneighbor search in general metric spaces. In Proceedings of the fourth annual ACM-SIAM Symposium on Discrete Algorithms, pages 311-321. ACM Press, 1993.
14. P. Zezula, G. Amato, V. Dohnal, and M. Batko. Similarity search. The metric space approach, volume 32 of Advances in Database Systems. Springer, 2006.