![]() |
Edit-Distance Based Algorithms for Shape-Based Retrieval of Images
Goal: Enable shape-based retrieval from an image database- input: shape sketch
- output: images in database that most closely match input shape
Answer: Compare their skeletons (labeled graphs)
Project status: Complete
Project Home Page: http://www.cs.brown.edu/people/klein/projects/vision/web.html
Research Areas
| Design and Analysis of Algorithms |
People
| Philip Klein |
Publications
Sebastian, T. B., Klein, P. N., and Kimia, B. B. Recognition of shapes by editing their shock graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 5 (2004), 550-571. [ pdf ]
Sebastian, T. B., Klein, P. N., and Kimia, B. B. On aligning curves. IEEE Transactions on Pattern Analysis and Machine Intelligence 25, 1 (2003), 116-125. [ pdf ]
Klein, P. N. Preprocessing an undirected planar network to enable fast. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium On Discrete Mathematics (2002), pp. 820-827. [ pdf ]
Sebastian, T. B., Klein, P. N., and Kimia, B. B. Shock-based indexing into large shape databases. In Proceedings of the Seventh European Conference on Computer Vision (2002), pp. 731-746. [ pdf ]
Klein, P. N., Sebastian, T. B., and Kimia, B. B. Shape matching using edit-distance: an implementation. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (2001), pp. 781-790. [ pdf ]
Sebastian, T. B., Klein, P. N., and Kimia, B. B. Alignment-based recognition of shape outlines. In Proceedings of the Fourth International Workshop on Visual Form (2001), pp. 606-618. [ pdf ]
Sebastian, T. B., Klein, P. N., and Kimia, B. B. Recognition of shapes by editing shock graphs. In Proceedings of the Eighth International Conference On Computer Vision (2001), pp. 755-762. [ pdf ]
Crisco, J. J., Klein, P. N., Kimia, B. B., and Sebastian, T. B. Constructing 2D curve atlases. In Proceedings of the IEEE Workshop on Mathematical Methods in Biomedical Image Analysis (2000), pp. 70-77. [ pdf ]
Klein, P. N. Finding the closest lattice vector when it's unusually close. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (2000), pp. 937-941. [ pdf ]
Klein, P. N., Tirthapura, S., Sharvit, D., and Kimia, B. B. A tree-edit-distance algorithm for comparing simple, closed shapes. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (2000), pp. 696-704. [ pdf ]
Tirthapura, S., Sharvit, D., Klein, P. N., and Kimia, B. B. Indexing based on edit-distance matching of shape graphs. In Proceedings of the International Society for Optical Engineering (SPIE) Symposium on Voice, Video, and Data Communications (1998), pp. 25-36. [ postscript | pdf ]
| Page Owner: Webmaster | Last Modified: Mon Oct 23 14:57:09 2006 |
