Preface of special issue on ``Graph-based processing for pattern recognition
From MaRDI portal
Publication:1677048
DOI10.1016/j.patcog.2014.08.018zbMath1378.00116OpenAlexW4255218301MaRDI QIDQ1677048
No author found.
Publication date: 10 November 2017
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2014.08.018
Proceedings of conferences of miscellaneous specific interest (00B25) Pattern recognition, speech recognition (68T10) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- A long trip in the charming world of graphs for pattern recognition
- On the complexity of submap isomorphism and maximum common submap problems
- Efficient subgraph matching using topological node feature constraints
- Approximation of graph edit distance based on Hausdorff matching
- A quantum Jensen-Shannon graph kernel for unattributed graphs
- Treelet kernel incorporating cyclic, stereo and inter pattern information in chemoinformatics
- Graph-based point drift: graph centrality on the registration of point-sets
- Exact solution to median surface problem using 3D graph search and application to parameter space exploration
- An entropy-based persistence barcode
This page was built for publication: Preface of special issue on ``Graph-based processing for pattern recognition
