Share Email Print

Proceedings Paper

Indexing based on edit-distance matching of shape graphs
Author(s): Srikanta Tirthapura; Daniel Sharvit; Philip Klein; Benjamin B. Kimia
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 5 October 1998
PDF: 12 pages
Proc. SPIE 3527, Multimedia Storage and Archiving Systems III, (5 October 1998); doi: 10.1117/12.325825
Show Author Affiliations
Srikanta Tirthapura, Brown Univ. (United States)
Daniel Sharvit, Brown Univ. (United States)
Philip Klein, Brown Univ. (United States)
Benjamin B. Kimia, Brown Univ. (United States)

Published in SPIE Proceedings Vol. 3527:
Multimedia Storage and Archiving Systems III
C.-C. Jay Kuo; Shih-Fu Chang; Sethuraman Panchanathan, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?