Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/5699
Title: Efficient shape retrieval under partial matching
Authors: Demirci, Muhammed Fatih
Issue Date: 2010
Source: 2010 20th International Conference on Pattern Recognition, ICPR 2010, 23 August 2010 through 26 August 2010, Istanbul, 82392
Abstract: Indexing into large database systems is essential for a number of applications. This paper presents a new indexing structure, which overcomes an important restric-tion of a previous indexing technique using a recently developed theorem from the domain of matrix analysis. Specifically, given a set of distance values computed by distance function, which do not necessarily satisfy the triangle inequality, this paper shows that computing its nearest distance values that obey the properties of a metric enables us to overcome the limitations of the previous indexing algorithm. We demonstrate the proposed framework in the context of a recognition task. © 2010 IEEE.
URI: https://doi.org/10.1109/ICPR.2010.749
https://hdl.handle.net/20.500.11851/5699
ISBN: 9780769541099
ISSN: 1051-4651
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Show full item record

CORE Recommender

SCOPUSTM   
Citations

8
checked on Sep 23, 2022

Page view(s)

20
checked on Feb 6, 2023

Google ScholarTM

Check

Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.