Results 1 
7 of
7
Graphgrep: A fast and universal method for querying graphs. In:
 Proc. 16th Int. Conference on Pattern Recognition. Volume
, 2002
"... ..."
The representation and matching of categorical shape
, 2006
"... We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated parts of an object at appropriate scales. These parts, in turn, map to nodes in a directed acyclic graph, in which edges enco ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated parts of an object at appropriate scales. These parts, in turn, map to nodes in a directed acyclic graph, in which edges encode both semantic relations (parent/child) as well as geometric relations. Given two image descriptions, each represented as a directed acyclic graph, we draw on spectral graph theory to derive a new algorithm for computing node correspondence in the presence of noise and occlusion. In computing correspondence, the similarity of two nodes is a function of their topological (graph) contexts, their geometric (relational) contexts, and their node contents. We demonstrate the approach on the domain of viewbased 3D object recognition.
Metrics for attributed graphs based on the maximal similarity common subgraph
 Int. J. Pattern Recognition Artif. Intell
, 2004
"... Two distance measures for attributed graphs are presented that are based on the maximal similarity common subgraph of two graphs. They are generalizations of two existing distance measures based on the maximal common subgraph. The new measures are superior to the wellknown measures based on element ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
Two distance measures for attributed graphs are presented that are based on the maximal similarity common subgraph of two graphs. They are generalizations of two existing distance measures based on the maximal common subgraph. The new measures are superior to the wellknown measures based on elementary edit transformations in that no particular edit operations (together with their costs) need to be defined. Moreover, they can deal not only with structural distortions, but also with perturbations of attributes. It is shown that the new distance measures are metrics. 1
Contraction kernels and . . .
, 2002
"... Graph pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids overcome the main limitations of their regular ancestors. The graphs used in the pyramid may be region adjacency graphs, dual graphs or combinatorial maps. Compared to usual graph data structures, ..."
Abstract
 Add to MetaCart
Graph pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids overcome the main limitations of their regular ancestors. The graphs used in the pyramid may be region adjacency graphs, dual graphs or combinatorial maps. Compared to usual graph data structures, combinatorial maps offer an explicit encoding of the orientation of edges around vertices. Each combinatorial map in the pyramid is generated from the one below by a set of edges to be contracted. This contraction process is controlled by kernels that can be combined in many ways. This paper shows that kernels producing a slow reduction rate can be combined to speed up reduction. Conversely, kernels decompose into smaller kernels that generate a more gradual reduction. We also propose one sequential and one parallel algorithm to compute the contracted combinatorial maps.
Design And Implementation Of Interactive Graph Simulator
"... Abstract — The field of mathematics plays important role in most of fields. The most important areas in mathematics is graph theory which is used in structural models. This structural arrangement of various objects or technologies leads to new inventions and modifications in the existing environment ..."
Abstract
 Add to MetaCart
Abstract — The field of mathematics plays important role in most of fields. The most important areas in mathematics is graph theory which is used in structural models. This structural arrangement of various objects or technologies leads to new inventions and modifications in the existing environment for enhancement in most fields. Graph simulator is concern with output of algorithms which can be applied on graph. There are many different algorithms which can be applied on graph and studying those algorithms theoretically is quite difficult. So, the graph simulator is the simulator, which helps us to learn different graph algorithms easy and get the output for the given input easily. These mechanisms which can easily solve graph algorithm according to the user requirements. The graph simulator is mainly dealing with the shortest path algorithms which will be sufficient to generate results as required. Those