A universal data model, named DG, is introduced to handle vectorized data uniformly during the whole recognition process. The model supports low level graph algorithms as well as h...
This paper proposes to transform data scanned randomly in a well-defined space (e.g, Euclidean) along a hierarchical irregular pyramidal structure in an attempt reduce search time...
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
We present an irregular image pyramid which is derived from multi-scale analysis of segmented watershed regions. Our framework is based on the development of regions in the Gaussia...
Abstract. Combinatorial maps define a general framework which allows to encode any subdivision of an nD orientable quasi-manifold with or without boundaries. Combinatorial pyramids...