Concavity trees are structures for 2-D shape representation. In this paper, we present a new recursive method for concavity tree matching that returns the distance between two attr...
The aim of the research presented in this paper is to contribute to reduction of development time for ontologies by discovering reusable parts and patterns. The approach is to use...
Feature selection and weighting are central problems in pattern recognition and instance-based learning. In this work, we discuss the challenges of constructing and weighting feat...
Kreshna Gopal, Tod D. Romo, James C. Sacchettini, ...
Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forwar...
We consider the template matching problem, in which one wants to find all good enough occurrences of a pattern template P from a larger image I. The current standard of template m...