Indexing and retrieval mechanism for complex similarity queries in image databases

Journal of Visual Communication and Image Representation

Volumn 10, Issue 3, 1999, Pages 268-290

  Cha, Guang Ho ^a   Chung, Chin Wan ^b  

^a Tongmyong University of Information Technology   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; DATA STRUCTURES; MULTIMEDIA SYSTEMS; QUERY LANGUAGES; TREES (MATHEMATICS);

CONTENT-BASED IMAGE RETRIEVAL MECHANISMS; IMAGE DATABASES;

INFORMATION RETRIEVAL SYSTEMS;

EID: 0032689281     PISSN: 10473203     EISSN: None     Source Type: Journal    
DOI: 10.1006/jvci.1999.0410     Document Type: Article

References (31)

1. Cha G.-H., Chung C.-W. A new indexing scheme for content-based image retrieval. Multimedia Tools Appl. 6:1998;263-288.
2. Flickner M. Query by image and video content: The QBIC system. IEEE Comput. 1995;23-32.
3. Ogle V. E., Stonebraker M. Chabot: Retrieval from a relational database of images. IEEE Comput. 1995;40-48.
4. Wu J. K., Ang Y. H., Lam P., Loh H. H., Narasimhalu A. D. Inference and retrieval of facial images. Multimedia Sys. 2:1994;1-14.
5. Wu J. K., Narasimhalu A. D., Mehtre B. M., Lam C. P., Gao Y. J. CORE: A content-based retrieval engine for multimedia information systems. Multimedia Sys. 3:1995;25-41.
6. Comer D. The ubiquitous B-tree. ACM Computing Surveys. 11:1979;121-137.
7. Ciaccia P., Patella M., Zezula P. Processing Complex Similarity Queries with Distance-based Access Methods. September 1997.
8. R. Fagin, Combining fuzzy information from multiple systems, in Proceedings of the 15th ACM Symposium on Principles of Database Systems, 1996, pp. 216-226.
9. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, The R*-tree: An efficient and robust access method for points and rectangles, in Proceedings of ACM SIGMOD International Conference on Management of Data, 1990, pp. 322-331.
10. Petrakis E. G. M., Faloutsos C. Similar Searching in Large Image Databases. 1994.
11. A. Guttman, R-Trees: A dynamic index structure for spatial searching, in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1984, pp. 47-57.
12. Mehrotra R., Gary J. E. Similar-shape retrieval in shape data management. IEEE Comput. 1995;57-62.
13. J. T. Robinson, The K-D-B-Tree: A search structure for large multidimensional dynamic indexes, in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1981, pp. 10-18.
14. H. J. Zhang and D. Zhong, A scheme for visual feature based image indexing, in Proceedings of the IS&T/SPIE Conference on Storage and Retrieval for Image and Video Databases III, 1995, pp. 36-46.
15. Kohonen T. The self-organizing map. Proc. IEEE. 78:1990;1464-1480.
16. T.-C. Chiueh, Content-based image indexing, in Proceeedings of the 20th VLDB Conference, 1994, pp. 582-593.
17. S. Brin, Near neighbor search in large metric spaces, in Proceedings of the 21st VLDB International Conference, 1995, pp. 574-584.
18. Hilbert D. Uber die stetige abbildung einer linie auf ein flachenstuck. Math. Ann. 38:1891.
19. Peano G. Sur une courbe qui remplit toute une aire plane. Math. Ann. 36:1890;157-160.
20. Faloutsos C. Gray codes for partial match and range queries. IEEE Trans. Software Eng. 14:1988;1381-1393.
21. C. Faloutsos and S. Roseman, Fractals for secondary key retrieval, in Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989, pp. 247-252.
22. Jagadish, Linear clustering of objects with multiple attributes, in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1990, pp. 332-342.
23. Christodoulakis S., Faloutsos C. Signature files: An access method for documents and its analytical performance evaluation. ACM Trans. Office Information Sys. 2:1984;267-288.
24. U. Deppisch, S-tree: A dynamic balanced signature index for office retrieval, in Proceedings of the ACM Conferences on Research and Development in Information Retrieval, September 1986, pp. 77-87.
25. Lee D. L., Leng C.-W. Partitioned signature files: Design issues and performance evaluation. ACM Trans. Office Information Sys. 7:1989;158-180.
26. Lin Z., Faloutsos C. Frame-sliced signature files. IEEE Trans. Knowledge Data Eng. 4:1992;281-289.
27. Sacks-Davis R., Kent A., Ramamohanarao K. Multikey access methods based on superimposed coding techniques. ACM Trans. Database Sys. 12:1987;655-696.
28. Zezula P., Rabitti F., Tiberio P. Dynamic partitioning of signature files. ACM Trans. Information Sys. 9:1991;336-369.
29. Nievergelt J., Hinterberger H., Sevcik K. C. The grid file: An adaptable, symmetric multikey file structure. ACM Trans. Database Sys. 9:1984;38-71.
30. Zadeh L. A. Fuzzy sets. Information and Control. 8:1965;115-124.
31. B. Seeger and H.-P. Kriegel, The buddy-tree: An efficient and robust access method for spatial data base systems, in Proceedings of the 16th International Conference on VLDB, 1990, pp. 590-601.