Using browsing to improve content-based image retrieval

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 3527, Issue , 1998, Pages 101-109

  Jin, Jesse S ^a   Kurniawati, Ruth ^a   Xu, Guangyu ^b   Bai, Xuesheng ^b  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Browsing; Content based image retrieval; Indexing; Multimedia database

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INDEXING (OF INFORMATION); MULTIMEDIA SYSTEMS; QUERY LANGUAGES; TREES (MATHEMATICS); WEB BROWSERS;

IMAGE DATABASES;

CONTENT BASED RETRIEVAL;

EID: 0006430966     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.325805     Document Type: Conference Paper

References (38)

1. Aurenhammer, F, Voronoi diagrams - A survey of a fundamental geometric data structure, ACM Computing Surveys, 23(3):345-405, 1991.
2. Beckmann, N., Kriegel, H.-P., Schneider, R., and Seeger, B. The R*-tree: an efficient and robust access method for points and rectangles. In Proceedings of the ACM SIGMOD International Conference on Management of Data (Atlantic City, NJ, May 1990), 322-331.
3. Berchtold, S., Keim, D. A., and Kriegel, H.-P. The X-tree: An index structure for high-dimensional data. In Proceedings of the 22th International Conference on Very Large Data Bases (Bombay, India, 1996), 28-39.
4. Bielski, L. The image database of the future begins, Advanced Imaging. 10, 1995, 26-91.
5. Caelli, T. and Reye, D. On the classification of image regions by colour texture and shape, Pattern Recognition. 26, 1993, 461-470.
6. Chang, N. S. and Fu, K. S. Picture query languages for pictorial data-base systems, IEEE Computer. 14, 1981, 23-33.
7. Chang, S. K. and Kunii, T. L. Pictorial data-base systems, IEEE Computer. 14, 1981, 13-21.
8. Cleary, J. G. Analysis of an algorithm for finding nearest neighbors in Euclidean space. ACM Transactions on Mathematical Software 5, 2 (June 1979), 183-192.
9. Comer, D. The ubiquitous B-tree, ACM Computing Surveys. 11, 1979, 121-137.
10. Cormen, T. H.; Leiserson, C. E. and Rivest, R. L. Introduction to Algorithms, MIT Press, 1990.
11. Elzinga, D & Hearn, D, The minimum covering sphere problem, Management Science, 19(1):96-104, 1972
12. Faloutsos, C. and Christodoulakis, S. Signature files: An access method for documents and its analytical performance evaluation, ACM Transactions on Office Information Systems. 2, 1984, 267-288.
13. Flickner, M.; Sawhney, H.; Niblack, W.; Ashley, J.; Huang, Q.; Dom, B.; Gorkani, M.; Hafner, J.; Lee, D.; Petkovic, D.; Steele, D. and Yanker, P. Query by image and video content: The QBIC system, IEEE Computer. 28, 1995, 23-32.
14. Frigui, H & Krishnapuram, R, A robust algorithm for automatic extraction of an unknown number of clusters from noisy data, Pattern Recognition Letters, 17:12230-1232, 1996.
15. Guttman, A. R-trees: A dynamic index structure for spatial searching. In Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data (Boston, MA, June 1984), 47-57.
16. Jagadish, H. V. Indexing for retrieval by similarity. In Multimedia Database Systems: Issues and Research Directions, V. Subrahmanian and S. Jajodia, Eds. Springer-Verlag, Berlin, 1996.
17. Jain, R. NSF workshop on visual information management systems, SIGMOD Record. 22, 1993, 57-75.
18. Jin, J. S.; Kurniawati, R. and Xu, G. A scheme for intelligent image retrieval in multimedia databases. Journal of Visual Communication and Image Representation, 7(4):369-377, 1997.
19. Kamel, I., and Faloutsos, C. On packing R-trees. In Proceedings of the Second International Conference on Information and Knowledge Management (Washington DC, November 1993), 490-499.
20. Kelly, P. M.; Cannon, M. and Hush, D. R. Query by image example: the CANDID approach, Technical Report, Computer Research and Applications Group, Los Alamos National Laboratory, 1995.
21. +-tree: An improved index structure for similarity searches in a high-dimensional feature space. In Proceedings of the SPIE: Storage and Retrieval for Image and Video Databases V (San Jose, CA, February 1997), vol. 3022. 110-120.
22. La Cascia, M. and Ardizzone, E. JACOB: just a content-based query system for video databases, In Proceedings, ICASSP-96, 1996, Atlanta, Georgia.
23. Larish, J. Kodak's still picture exchange for print and film use, Advanced Imaging. 10, 1995, 38-39.
24. Lin, K.-I., Jagadish, H. V., and Faloutsos, C. The TV-tree: An index structure for high-dimensional data. Journal of Very Large Databases (VLDB Journal) 3, 4 (October 1994), 517-549.
25. MacQueen, J. B. Some methods for classification and analysis of multivariate observations. In Proceedings of the Berkeley Symposium on Mathematical Statistics and Probability (1967), vol. 1(5), 281-297.
26. Martucci, M. Digital still marketing at PressLink, Advanced Imaging. 10, 1995, 34-36.
27. 3 and related problem, SIAM Journal on Computing, 12:759-776, 1983.
28. Minsky, M., and Papert, S. Perceptrons: An Introduction to Computational Geometry. MIT Press, Cambridge, 1969.
29. Niblack, W.; Barber, R.; Equitz, W.; Flickner, M.; Glasman, E.; Petkovic, D.; Yanker, P.; Faloutsos, C. and Taubin, G. The QBIC project: Querying images by content using color, texture and shape, SPIE, 1908, 1993, 173-187.
30. Ogle, V. E. and Stonebraker, M. Chabot: retrieval from a relational database of images, IEEE Computer. 28, 1995, 40-48.
31. Oosterom, P J M v, Reactive Data Structures for Geographic Information Systems, Oxford University press, NY 1993
32. Pagel, B.-U., Six, H.-W., Toben, H., and Widmayer, P. Towards an analysis of range queries performance in spatial data structures. In Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Washington, DC, May 1993), 214-221.
33. Pentland, A.; Picard, R. W. and Sclaroff, S. Photobook: content-based manipulation of image databases, In Proc. of SPIE: Storage and Retrieval Image and Video Databases II, San Jose, vol 2185, 1995.
34. Salton, G. and McGill, M. J. Introduction to modern Information Retrieval, NY:McGraw-Hill, 1983.
35. Schroeder, M, Fractals, Chaos, Power Laws: Minutes from an Infinite Paradise. W H Freeman and Company, NY, 1991.
36. +-tree: A dynamic index for multi-dimensional objects. In Proceedings of the Thirteenth Conference on Very Large Databases (Los Altos, CA, September 1987), Morgan Kaufman, 507-518.
37. Welzl, E, Smallest enclosing disks (Balls and Ellipsoids), In: LNCS 555: Proceedings of New Results and New Trends in Computer Science, pp.359-370, Spinger 1991.
38. White, D. A., and Jain, R. Similarity indexing with the SS-tree. In Proceedings of the Twelfth IEEE International Conference on Data Engineering (New Orleans, Louisiana, February 1996), 516-523.