Towards content-based retrieval of technical drawings through high-dimensional indexing

Computers and Graphics (Pergamon)

Volumn 27, Issue 1, 2003, Pages 61-69

  Fonseca, Manuel J ^a   Jorge, Joaquim A ^a  

^a INESC ID   (Portugal)

Author keywords

Content based retrieval; Graph matching; High dimensional indexing

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER SIMULATION; DATABASE SYSTEMS; DRAWING (GRAPHICS); GRAPH THEORY; INDEXING (OF INFORMATION); VISUALIZATION;

GRAPH MATCHING; HIGH-DIMENSIONAL INDEXING;

COMPUTER GRAPHICS;

EID: 0037308070     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-8493(02)00244-3     Document Type: Conference Paper

References (28)

1. Do EY. The right tool at the right time. PhD thesis, Georgia Institute of Technology, September 1998.
2. Do EY. What's in a diagram that a computer should understand? In: Proceedings of The Sixth International Conference on Computer Aided Architectural Design Futures (CAADF'95), The Global Design Studio, National University of Singapore, 1995. p. 469-82.
3. Bakergem D.V. Image collections in the design studio. The electronic design studio: architectural knowledge and media in the computer age. 1990;261-272 MIT Press, Cambridge, MA.
4. Clayton M, Wiesenthal H. Enhancing the sketchbook. In: Proceedings of the Association for Computer Aided Design in Architecture (ACADIA '91), Los Angeles, CA, 1991.
5. Gross MD. Indexing visual databases of designs with diagrams. In: Koutamanis A, Timmermans H, Vermeulen I, editors. Visual Databases in Architecture, Aldershot, UK: Avebury; 1995.
6. Chang S.K., Perry B., Rosenfeld A. Content-based multimedia information access. 1999;Kluwer Academic Publishers, Dordrecht.
7. Rui Y, Huang TS, Chang S-F. Image retrieval: past, present, and future. Invited paper in Int Symp on Multimedia Information Processing, 11-13 Dec 1997, Taipei, Taiwan.
8. Gross M, Do E. Demonstrating the electronic cocktail napkin: a paper-like interface for early design. In: Proceedings of the Conference on Human Factors in Computing Systems (CHI'96), Vancouver, 1996. p. 5-6.
9. Berchtold S, Kriegel H-P. S3: similarity in CAD database systems. In: Proceedings of the International Conference on Management of Data (SIGMOD'97), Tuscon, AZ, 1997.
10. Park J., Um B. A new approach to similarity retrieval of 2D graphic objects based on dominant shapes. Pattern Recognition Letters. 20:1999;591-616.
11. Cvetkovic D., Rowlinson P., Simic S. Eigenspaces of graphs. 1997;Cambridge University Press, Cambridge, UK.
12. Shokoufandeh A, Dickson S, Siddiqi K, Zucker S. Indexing using a spectral encoding of topological structure, IEEE CVPR 2.
13. Fonseca M.J., Jorge J.A. Experimental evaluation of an on-line scribble recognizer. Pattern Recognition Letters. 22(12):2001;1311-1319.
14. Weber R, Schek H-J, Blott S. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of the 24th International Conference on Very Large Data Bases (VLDB'98), New York, USA, 1998. p. 194-205.
15. Ooi BC, Sacks-Davis R, McDonell KJ. Spatial K-D-tree: an indexing mechanism for spatial databases. In: Proceedings of IEEE COMPSAC Conference, Tokyo, 1987.
16. White DA, Jain R. Similarity indexing: algorithms and performance. In: Proceedings of the SPIE Storage and Retrieval for Image and Video Databases, San Jose, CA, 1996. Vol. 2670.
17. Henrich A, Six H-W, Widmayer P. The LSD tree: spatial access to multidimensional point and non-point objects. In: Proceedings of the 15th International Conference on Very Large Data Bases (VLDB'89), Amsterdam, 1989. p. 45-53.
18. Henrich A. The LSDh-tree: an access structure for feature vectors. In: Proceedings of the 14th International Conference on Data Engineering (ICDE'98), Orlando, FL, 1998. p. 362-9.
19. Chakrabarti K, Mehrotra S. The hybrid tree: an index structure for high dimensional feature spaces. In: Proceedings of the 15th International Conference on Data Engineering (ICDE'99), Sydney, 1999. p. 440-7.
20. Guttman A. R-trees: a dynamic index structure for spatial searching. In: Yormark B, editor. Proceedings of the International Conference on Management of Data (SIGMOD'84), Boston, MA: ACM Press, 1984. p. 47-57.
21. Beckmann N, Kriegel H-P, Schneider R, Seeger B. The r*-tree: an efficient and robust access method for points and rectangles. In: Garcia-Molina H, Jagadish HV, editors. Proceedings of the International Conference on Management of Data (SIGMOD'90), Atlantic City, NJ: ACM Press, 1990. p. 322-31.
22. White DA, Jain R. Similarity indexing with the SS-tree. In: Proceedings of the 12th IEEE International Conference on Data Engineering, New Orleans, LA, 1996. p. 516-23.
23. Katayama N, Satoh S. The SR-tree: an index structure for high-dimensional nearest neighbor queries. In: Proceedings of the International Conference on Management of Data (SIGMOD '97), Tuscon, AZ: ACM Press, 1997. p. 369-80.
24. Berchtold S, Keim DA, Kriegel H-P. The X-tree: an index structure for high-dimensional data. In: Proceedings of the 22nd International Conference on Very Large Data Bases (VLDB'96), Mumbai (Bombay), India, 1996.
25. Sakurai Y, Yoshikawa M, Uemura S, Kojima H. The A-tree: an index structure for high-dimensional spaces using relative approximation. In: Proceedings of the 26th International Conference on Very Large Data Bases (VLDB'00), Cairo, Egypt, 2000. p. 516-26.
26. Berchtold S, Böhm C, Kriegel H-P. The pyramid-technique: towards breaking the curse of dimensionality. In: Proceedings of the International Conference on Management of Data (SIGMOD'98), Seattle, WA: ACM Press, 1998.
27. Berchtold S., Keim D., Kriegel H-.P., Seidi T. Indexing the solution space. a new technique for nearest neighbor search in high-dimensional space IEEE Transactions on Knowledge and Data Engineering. 12(1):2000;45-57.
28. Berchtold S, Bohm C, Jagadish HV, Kriegel H-P, Sander J. Independent quantization: an index compression technique for high-dimensional data spaces. In: Proceedings of the 16th International Conference on Data Engineering (ICDE'00), San Diego, USA, 2000. p. 577-88.