Efficient retrieval of similar shapes
We propose an indexing technique for the fast retrieval of objects in 2D images based on similarity between their boundary shapes. Our technique is robust in the presence of noise and supports several important notions of similarity including optimal matches irrespective of variations in orientation...
Saved in:
Published in | The VLDB journal Vol. 11; no. 1; pp. 17 - 27 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Heidelberg
Springer
01.08.2002
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We propose an indexing technique for the fast retrieval of objects in 2D images based on similarity between their boundary shapes. Our technique is robust in the presence of noise and supports several important notions of similarity including optimal matches irrespective of variations in orientation and/or position. Our method can also handle size-invariant matches using a normalization technique, although optimality is not guaranteed here. We implemented our method and performed experiments on real (hand-written digits) data. Our experimental results showed the superiority of our method compared to search based on sequential scanning, which is the only obvious competitor. The performance gain of our method increases with any increase in the number or the size of shapes. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 1066-8888 0949-877X |
DOI: | 10.1007/s007780100059 |