Shock-based indexing into large shape databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2352, Issue , 2002, Pages 731-746

  Sebastian, Thomas B ^a   Klein, Philip N ^b   Kimia, Benjamin B ^a  

^a Brown University   (United States)

^b Brown Univerity   (United States)

Author keywords

Categorization; Exemplars; Object recognition; Shape matching; Shape retrieval; Similarity metric

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTER VISION; INDEXING (OF INFORMATION); OBJECT RECOGNITION; QUERY PROCESSING; TOPOLOGY;

CATEGORIZATION; EXEMPLARS; SHAPE MATCHING; SHAPE RETRIEVAL; SIMILARITY METRICS;

DATABASE SYSTEMS;

EID: 84949958654     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47977-5_48     Document Type: Conference Paper

References (34)

1. A. Lanitis, C.J. Taylor, and T.F. Cootes. Automatic interpretation and coding of face images using flexible models. PAMI, 19(7):743–756, 1997.
2. R. Basri. Recognition by prototypes. IJCV, 19(2):147–167, August 1996.
3. R. Basri, L. Costa, D. Geiger, and D. Jacobs. Determining the similarity of deformable shapes. Vision Research, 38:2365–2385, 1998.
4. S. Belongie, J. Malik, and J. Puzicha. Matching shapes. ICCV, pages 454–461, 2001.
5. J. L. Bentley and J. H. Friedman. Data structures for range searching. ACM Computing Surveys, 11(4):397–409, 1979.
6. S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-tree: An index structure for high-dimensional data. VLDB, pages 28–39, 1996.
7. L. Bergman and V. Castelli, editors. Image Databases, Search and Retrieval of Digital Imagery. John Wiley and Sons, 2002.
8. I. Biederman and G. Ju. Surface versus edge-based determinants of visual recognition. Cognitive Psychology, 20:38–64, 1988.
9. S. Brin. Near neighbor search in large metric spaces. VLDB, pages 574–584, 1995.
10. E. Chavez, G. Navarro, R. Baeza-Yates, and J. L. Marroquín. Searching in metric spaces. ACM Computing Surveys, 33(3):273-321, 2001.
11. C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petrkovic, and W. Equitz. Efficient and effective querying by image content. J. Intelligent Information Systems, 3:231–262, 1994.
12. Y. Gdalyahuand D. Weinshall. Flexible syntactic matching of curves and its application to automatic hierarchical classification of silhouettes. PAMI, 21(12):1312-1328, 1999.
13. P. J. Giblin and B. B. Kimia. On the local form and transitions of symmetry sets, and medial axes, and shocks in 2D. ICCV, pages 385–391, 1999.
14. W. I. Groski and R. Mehrota. Index-based object recognition in pictorial data management. CVGIP, 52:416–436, 1990.
15. P. Klein, T. Sebastian, and B. Kimia. Shape matching using edit-distance: an implementation. SODA, pages 781–790, 2001.
16. P. Klein, S. Tirthapura, D. Sharvit, and B. Kimia. A tree-edit distance algorithm for comparing simple, closed shapes. SODA, pages 696–704, 2000.
17. C. Lin and R. Chellappa. Classification of partial 2-D shapes using Fourier descriptors. PAMI, 9(5):686–690, 1987.
18. T. Liuand D. Geiger. Approximate tree matching and shape similarity. ICCV, pages 456–462, 1999.
19. E. Milios and E. Petrakis. Shape retrieval based on dynamic programming. IEEE Trans. Image Processing, 9(1):141–146, 2000.
20. G. Mori, S. Belongie, and J. Malik. Shape contexts enable efficient retrieval of similar shapes. CVPR, pages I:723–730, 2001.
21. M. Pelillo, K. Siddiqi, and S. Zucker. Matching hierarchical structures using association graphs. PAMI, 21(11):1105–1120, 1999.
22. E. Rivlin and I. Weiss. Local invariants for recognition. PAMI, 17(3):226–238, 1995.
23. H. Samet. The quadtree and related hierarchical data structures. ACM Computing Surveys, 16(2):187–260, 1984.
24. T. B. Sebastian, P. N. Klein, and B. B. Kimia. Alignment-based recognition of shape outlines. IWVF, pages 606–618, 2001. Springer.
25. T. B. Sebastian, P. N. Klein, and B. B. Kimia. Recognition of shapes by editing shock graphs. ICCV, pages 755–762, 2001.
26. D. Sharvit, J. Chan, H. Tek, and B. B. Kimia. Symmetry-based indexing of image databases. JVCIR, 9(4):366–380, 1998.
27. R. N. Shepard. Toward a universal law of generalization for psychological science. Science, pages 1317–1323, 1987.
28. K. Siddiqi, A. Shokoufandeh, S. Dickinson, and S. Zucker. Shock graphs and shape matching. IJCV, 35(1):13–32, November 1999.
29. M. J. Tarr and H. H. Bulthoff, editors. Object Recognition in Man, Monkey, and Machine. MIT Press/Elsevier, 1999.
30. A. Torsello and E. R. Hancock. Computing approximate tree edit-distance using relaxation labelling. Worksop on Graph-based Representations in Pattern Recognition, pages 125–136, 2001.
31. J. Uhlmann. Satisfying general proximity/similarity queries with metric trees. Information Processing Letters, 40:175–179, 1991.
32. P. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. SODA, pages 311–321, 1993.
33. L. Younes. Computable elastic distance between shapes. SIAM J. Appl. Math., 58:565–586, 1998.
34. S. C. Zhuand A. L. Yuille. FORMS: A flexible object recognition and modeling system. IJCV, 20(3):187–212, 1996.