Curvature correction of the Hamilton-Jacobi skeleton

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn 1, Issue , 2003, Pages

  Torsello, Andrea ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FEATURE EXTRACTION; HAMILTONIANS; MATHEMATICAL MODELS;

CURVATURE CORRECTION; HAMILTON-JACOBI SKELETON; SHAPE ANALYSIS;

IMAGE ANALYSIS;

EID: 17544403384     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. C. Arcelli and G. Sanniti di Baja. A width-independent fast thinning algorithm. IEEE TPAMI, 7(4):463-474, 1985.
2. C. Arcelli and G. Sanniti di Baja. Ridge points in euclidean distance maps. Pattern Rec. Letters, 13:237-243, 1992.
3. J. August, A. Tannenbaum, and S. W. Zucker. On the evolution of the skeleton. In ICCV, pp. 315-522, 1999.
4. H. Blum. Biological shape and visual science (part i). Journal of theoretical Biology, 38:205-287, 1973.
5. G. Borgefors, G. Ramella, and G. Sanniti di Baja. Multiscale skeletons via permanence ranking. In Advances in Visual Form Analysis, pages 31-42, World Scientific, 1997.
6. S. Bouix and Kaleem Siddiqi. Divergence-based medial surfaces. In Computer Vision ECCV 2000, Volume 1 of LNCS, pages 603-618. Springer, 2000. LNCS 1842.
7. J. Crank and P.Nicolson, A practical method for numerical evaluation of solutions of partial differential equations of the heat conduction type. In Proc. Cambridge Philos. Soc., Vol. 43, pp. 50-67, 1947.
8. P. Klein, S. Tirthapura, D. Sharvit, and B. B. Kimia. A tree-edit-distance algorithm for comparing simple, closed shapes. In ACM-SIAM Symp. on Discrete Algorithms, 1999.
9. F. Leymarie and M. D. Levine. Simulating the grassfire transform using an active contour model. IEEE TPAMI, 14(1):56-75, 1992.
10. B. Luo et al. A probabilistic framework for graph clustering. In CVPR, volume I, pages 912-919. IEEE Computer Society, 2001.
11. D. Macrini et al. View-Based 3-D Object Recognition using Shock Graphs. In ICPR, pages 24-28. IEEE Computer Society, 2002.
12. R. L. Ogniewicz, A multiscale mat from voronoi diagrams: the skeleton-space and its application to shape description and decomposition. In Aspects of Visual Form Processing, pages 430-439. World Scientific, 1994.
13. R. L. Ogniewicz and O. Kübler. Hierarchic voronoi skeletons. Pattern Recognition, 28(3):343-359, 1995.
14. S. J. Osher and J. A. Sethian. Fronts propagating with curvature dependent speed: Algorithms based on hamilton-jacobi formulations. J. of Computational Physics, 79: 12-49, 1988.
15. M. Pelillo, K. Siddiqi, and S. W. Zucker. Matching hierarchical structures using association graphs. IEEE TPAMI, (1911):1105-1120, 1999.
16. M. Schmitt. Some examples of algorithms analysis in computational geometry by means of mathematical morphological techniques. In Geom. and Robotics, 1989, LNCS 391.
17. T. S. Sebastian, P. N. Klein, and B. B. Kimia. Recognition of shapes by editing shock graphs. In ICCV, volume I, pages 755-762, 2001.
18. A. Shokoufandeh, S. J. Dickinson, K. Siddiqi, and S. W. Zucker. Indexing using a spectral encoding of topological structure. In CVPR, 1999.
19. K. Siddiqi, S. Bouix, A. Tannenbaum, and S. W. Zucker, The hamilton-jacobi skeleton. In ICCV, pages 828-834, 1999.
20. K. Siddiqi, S. Bouix, A. Tannenbaum, and S. W. Zucker. Hamilton-Jacobi skeletons. Int. J. of Computer Vision, 3:215-231, 2002.
21. K. Siddiqi and B. B. Kimia. A shock grammar for recognition. In CVPR, pages 507-513, 1996.
22. K. Siddiqi, A. Shokoufandeh, S. J. Dickinson, and S. W. Zucker. Shock graphs and shape matching. Int. J. of Computer Vision, 35(1):13-32, 1999.
23. H. Tek and B. B. Kimia. Symmetry maps of free-form curve segments via wave propagation. In ICCV, pages 362-369, 1999.
24. S. Tirthapura, D. Sharvit, P. Klein, and B. B. Kimia. Indexing based on edit-distance matching of shape graphs. In SPIE International Symposium on Voice, Video, and Data Communications, pages 25-36, 1998.
25. A. Torsello and E. R. Hancock. Efficiently computing weighted tree edit distance using relaxation labeling. In EMMCVPR, pages 438-453, 2001. LNCS 2134.