The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
Traditional graph drawing is only concerned with viewing of data and relations amount data items. It uses a graph model to present the data items and the relations and tries to ca...
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
This paper proposes a model-based methodology for recognizing and tracking objects in digital image sequences. Objects are represented by attributed relational graphs (or ARGs), w...
Ana Beatriz V. Graciano, Roberto Marcondes Cesar J...