5 October 1998 Indexing based on edit-distance matching of shape graphs
Author Affiliations +
Proceedings Volume 3527, Multimedia Storage and Archiving Systems III; (1998) https://doi.org/10.1117/12.325825
Event: Photonics East (ISAM, VVDC, IEMB), 1998, Boston, MA, United States
Abstract
We are investigating a graph matching approach for indexing into pictorial databases using shock graphs, a symmetry- based representation of shape. Each shape (or a collection of edge elements) is represented by a shock graph. Indexing of a query into a pictorial database is accomplished by comparing the corresponding shock graph to the graphs representing database elements and selecting the best match. This paper introduces a new metric for comparing shock graphs.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Srikanta Tirthapura, Daniel Sharvit, Philip Klein, Benjamin B. Kimia, "Indexing based on edit-distance matching of shape graphs", Proc. SPIE 3527, Multimedia Storage and Archiving Systems III, (5 October 1998); doi: 10.1117/12.325825; https://doi.org/10.1117/12.325825
PROCEEDINGS
12 PAGES


SHARE
Back to Top