A fast technique for comparing graph representations with applications to performance evaluation

Authors:
D. Lopresti;G. Wilfong
Affiliations:
Lehigh University, Department of Computer Science and Engineering, 19 Memorial Drive West, PA 18015, Bethlehem, USA;Lucent Technologies Inc., Bell Labs, 600 Mountain Avenue, NJ 07974, Murray Hill, USA
Venue:
International Journal on Document Analysis and Recognition
Year:
2003

Citing 0
Cited 14

Case-Based Reasoning for Invoice Analysis and Recognition

ICCBR '07 Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
A Vectorial Representation for the Indexation of Structural Informations

SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Graph Matching Based on Node Signatures

GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
A graph matching method and a graph matching distance based on subgraph assignments

Pattern Recognition Letters
A graph classification approach using a multi-objective genetic algorithm application to symbol recognition

GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Comparing graph similarity measures for graphical recognition

GREC'09 Proceedings of the 8th international conference on Graphics recognition: achievements, challenges, and evolution
Recent advances in graph-based pattern recognition with applications in document analysis

Pattern Recognition
Learning graph prototypes for shape recognition

Computer Vision and Image Understanding
Why and how to measure exploration in behavioral space

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Towards performance evaluation of graph-based representation

GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Graph matching – challenges and potential solutions

ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing
Encouraging behavioral diversity in evolutionary robotics: An empirical study

Evolutionary Computation
A better edit distance measure allowing for block swaps

Proceedings of the 2013 Research in Adaptive and Convergent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding efficient, effective ways to compare graphs arising from recognition processes with their corresponding ground-truth graphs is an important step toward more rigorous performance evaluation.In this paper, we examine in detail the graph probing paradigm we first put forth in the context of our work on table understanding and later extended to HTML-coded Web pages. We present a formalism showing that graph probing provides a lower bound on the true edit distance between two graphs. From an empirical standpoint, the results of two simulation studies and an experiment using scanned pages show that graph probing correlates well with the latter measure. Moreover, our technique is very fast; graphs with tens or hundreds of thousands of vertices can be compared in mere seconds. Ease of implementation, scalability, and speed of execution make graph probing an attractive alternative for graph comparison.