Skip Navigation
York U: Redefine the PossibleHOME | Current Students | Faculty & Staff | Research | International
Search »FacultiesLibrariesCampus MapsYork U OrganizationDirectorySite Index
Future Students, Alumni & Visitors
1998 Technical Reports

Efficient Shape Matching and Retrieval at Multiple Scales

Evangelos Milios and Euripides Petrakis

Technical Report CS-1998-11

York University

December 2, 1998


Reactive systems exhibit ongoing, possibly non-terminating, interaction with the environment. Real-time systems are reactive systems that must satisfy quantitative timing constraints. This paper presents a structured compositional design method for discrete real-time systems that can be used to combWe propose a novel approach for the recognition, clustering and retrieval of shapes. The heart of our methodology is a shape matching algorithm based on dynamic programming, that operates implicitly at multiple scales, but avoids the heavy computational cost of the explicit curvature scale space representation. Our method provides for clustering, visualization and browsing of a data set, as well as for indexing, achieving up to three orders of magnitude speed-up over sequential scanning. We illustrate the application of our method to real two-dimensional static hand gesture data. We also demonstrate the superiority of our approach over traditional approaches to shape matching and retrieval, such as Fourier descriptors, Geometric and Sequential moments. Our evaluation is based on human relevance judgements following a well established methodology from the information retrieval field.

Download paper in PDF format.

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.