12 search results - page 1 / 3 » Automatic learning of cost functions for graph edit distance |
ISCI
2007
13 years 4 months ago
2007
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
ICPR
2004
IEEE
14 years 5 months ago
2004
IEEE
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
PAMI
2006
13 years 4 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
NIPS
2004
13 years 5 months ago
2004
A new distance measure between probability density functions (pdfs) is introduced, which we refer to as the Laplacian pdf distance. The Laplacian pdf distance exhibits a remarkabl...
ICDAR
2011
IEEE
12 years 3 months ago
2011
IEEE
—We propose a novel method to evaluate table segmentation results based on a table image ground truther. In the ground-truthing process, we first extract connected components fr...