Paper
19 December 2001 New shape representation and similarity measure for efficient shape indexing
Konstantin Y. Kupeev, Zohar Sivan
Author Affiliations +
Proceedings Volume 4676, Storage and Retrieval for Media Databases 2002; (2001) https://doi.org/10.1117/12.451082
Event: Electronic Imaging, 2002, San Jose, California, United States
Abstract
Efficient search and retrieval of similar shapes in large databases stipulates two hardly compatible demands to the shape representations. On one hand, shape similarity conveys similarity of spatial relations of the shape parts. Thus, the representation should embed a kind of graph description of the shape, and allow estimation of the (inexact) correspondence between these descriptions. On the other hand, the representation should enable fast retrieval in large databases. Current shape indexing solutions do not comply well to these stipulations simultaneously. The G-graphs have been introduced as shape descriptors conveying structural and quantitative shape information. In the current work we define a representation of the G-graphs by strings consisting of the symbols from a four-letter alphabet such that two G-graphs are isomorphic as G-graphs if and only if their string representations are identical. This allows us to represent shapes by vectors consisting of strings and to introduce a shape representation satisfying both above demands. Experimental results are presented.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Konstantin Y. Kupeev and Zohar Sivan "New shape representation and similarity measure for efficient shape indexing", Proc. SPIE 4676, Storage and Retrieval for Media Databases 2002, (19 December 2001); https://doi.org/10.1117/12.451082
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Databases

Nanoimprint lithography

Genetic algorithms

Shape analysis

Analytical research

Data storage

Detection and tracking algorithms

RELATED CONTENT


Back to Top