Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
GBRPR
2005
Springer
11 years 11 months ago
Towards Unitary Representations for Graph Matching
In this paper we explore how a spectral technique suggested by quantum walks can be used to distinguish non-isomorphic cospectral graphs. Reviewing ideas from the field of quantum...
David Emms, Simone Severini, Richard C. Wilson, Ed...
GBRPR
2005
Springer
11 years 11 months ago
Reactive Tabu Search for Measuring Graph Similarity
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...
Sébastien Sorlin, Christine Solnon
GBRPR
2005
Springer
11 years 11 months ago
An Experimental Comparison of Fingerprint Classification Methods Using Graphs
In this paper, an experimental comparison among three structural approaches to fingerprint classification is reported. Main pros and cons of such approaches are investigated by exp...
Alessandra Serrau, Gian Luca Marcialis, Horst Bunk...
GBRPR
2005
Springer
11 years 11 months ago
Pyramids of n-Dimensional Generalized Maps
Graph pyramids are often used for representing irregular image pyramids. For the 2D case, combinatorial pyramids have been recently defined in order to explicitly represent more ...
Carine Grasset-Simon, Guillaume Damiand, Pascal Li...
GBRPR
2005
Springer
11 years 11 months ago
Adaptive Pyramid and Semantic Graph: Knowledge Driven Segmentation
A method allowing to integrate syntactic and semantic approaches in an automatic segmentation process is described. This integration is possible thanks to the formalism of graphs....
Aline Deruyver, Yann Hodé, Eric Laemmer, Je...
GBRPR
2005
Springer
11 years 11 months ago
Graphical Knowledge Management in Graphics Recognition Systems
Abstract. This paper deals with the problem of graphical knowledge management (formalization, modelling, representation and operationalization) in graphics recognition systems. We ...
Mathieu Delalandre, Éric Trupin, Jacques La...
GBRPR
2005
Springer
11 years 11 months ago
A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...
Bertrand Cuissart, Jean-Jacques Hébrard
GBRPR
2005
Springer
11 years 11 months ago
A Graph-Based, Multi-resolution Algorithm for Tracking Objects in Presence of Occlusions
One of the main difficult problem in video analysis is to track moving objects during a video sequence, especially in presence of occlusions. Unfortunately, almost all the differ...
Donatello Conte, Pasquale Foggia, Jean-Michel Joli...
GBRPR
2005
Springer
11 years 11 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli
books