Indexing based on edit-distance matching of shape graphs

Srikanta Tirthapura; Daniel Sharvit; Philip Klein; Benjamin B. Kimia

doi:10.1117/12.325825

5 October 1998 Indexing based on edit-distance matching of shape graphs

Srikanta Tirthapura, Daniel Sharvit, Philip Klein, Benjamin B. Kimia

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.

Citation Download Citation

Srikanta Tirthapura, Daniel Sharvit, Philip Klein, and Benjamin B. Kimia "Indexing based on edit-distance matching of shape graphs", Proc. SPIE 3527, Multimedia Storage and Archiving Systems III, (5 October 1998); https://doi.org/10.1117/12.325825

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available