Improving bipartite graph matching by assessing the assignment confidence

@article{Ferrer2015ImprovingBG,
  title={Improving bipartite graph matching by assessing the assignment confidence},
  author={Miquel Ferrer and Francesc Serratosa and Kaspar Riesen},
  journal={Pattern Recognition Letters},
  year={2015},
  volume={65},
  pages={29-36}
}
Due to the ability of graphs to represent properties of entities and binary relations at the same time, a growing interest in this representation formalism can be observed in various fields of pattern recognition. The availability of a distance measure is a basic requirement for pattern recognition. For graphs, graph edit distance is still one of the most popular distance measures. In the present paper we substantially improve the distance accuracy of a recent framework for the approximation of… CONTINUE READING
5 Citations
30 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Structural matching by discrete relaxation

  • E. Hancock R. Wilson
  • Proceedings of the 9 th International Workshop on…
  • 2013

Solé - Ribalta , On the graph edit distance cost : Properties and applications

  • X. Cortés F. Serratosa, A.
  • Int . J . Pattern Recogn . Artif . Intell .
  • 2012

Recent advances in graph - based pattern recognition with applications in document analysis

  • K. Riesen H. Bunke
  • Pattern Recogn .
  • 2011

Similar Papers

Loading similar papers…