Graph-Based Representations in Pattern Recognition: 11th IAPR-TC-15 International Workshop, GbRPR 2017, Anacapri, Italy, May 16–18, 2017, Proceedings

✍ Scribed by Pasquale Foggia, Cheng-Lin Liu, Mario Vento (eds.)

• Publisher: Springer International Publishing
• Year: 2017
• Tongue: English
• Leaves: 290
• Series: Lecture Notes in Computer Science 10310
• Edition: 1
• Category: Library

✦ Synopsis

This book constitutes the refereed proceedings of the 11th IAPR-TC-15 International Workshop on Graph-Based Representation in Pattern Recognition, GbRPR 2017, held in Anacapri, Italy, in May 2017. The 25 full papers and 2 abstracts of invited papers presented in this volume were carefully reviewed and selected from 31 submissions. The papers discuss research results and applications in the intersection of pattern recognition, image analysis, graph theory, and also the application of graphs to pattern recognition problems in other fields like computational topology, graphic recognition systems and bioinformatics.

✦ Table of Contents

Front Matter....Pages I-XV
Front Matter....Pages 1-1
Saliency Detection via A Graph Based Diffusion Model....Pages 3-12
Shape Simplification Through Graph Sparsification....Pages 13-22
Reeb Graphs of Piecewise Linear Functions....Pages 23-35
Front Matter....Pages 37-37
Learning from Diffusion-Weighted Magnetic Resonance Images Using Graph Kernels....Pages 39-48
Learning Graph Matching with a Graph-Based Perceptron in a Classification Context....Pages 49-58
A Nested Alignment Graph Kernel Through the Dynamic Time Warping Framework....Pages 59-69
Front Matter....Pages 71-71
GERoMe – A Novel Graph Extraction Robustness Measure....Pages 73-82
Speeding-Up Graph-Based Keyword Spotting in Historical Handwritten Documents....Pages 83-93
Detecting Alzheimer’s Disease Using Directed Graphs....Pages 94-104
Front Matter....Pages 105-105
Error-Tolerant Coarse-to-Fine Matching Model for Hierarchical Graphs....Pages 107-117
A Hungarian Algorithm for Error-Correcting Graph Matching....Pages 118-127
Introducing VF3: A New Algorithm for Subgraph Isomorphism....Pages 128-139
Front Matter....Pages 141-141
Node Matching Computation Between Two Large Graphs in Linear Computational Cost....Pages 143-153
Measuring Vertex Centrality Using the Holevo Quantity....Pages 154-164
On the Interplay Between Strong Regularity and Graph Densification....Pages 165-174
Front Matter....Pages 175-175
Mining Frequent Patterns in 2D+t Grid Graphs for Cellular Automata Analysis....Pages 177-186
Density Normalization in Density Peak Based Clustering....Pages 187-196
Fast Nearest Neighbors Search in Graph Space Based on a Branch-and-Bound Strategy....Pages 197-207
Front Matter....Pages 209-209
Exact Computation of Graph Edit Distance for Uniform and Non-uniform Metric Edit Costs....Pages 211-221
Improved Graph Edit Distance Approximation with Simulated Annealing....Pages 222-231
Front Matter....Pages 209-209
An Edit Distance Between Graph Correspondences....Pages 232-241
A Survey on Applications of Bipartite Graph Edit Distance....Pages 242-252
Front Matter....Pages 253-253
Minimising Entropy Changes in Dynamic Network Evolution....Pages 255-265
Synchronization Over the Birkhoff Polytope for Multi-graph Matching....Pages 266-275
Adaptive Feature Selection Based on the Most Informative Graph-Based Features....Pages 276-287
Back Matter....Pages 289-289

✦ Subjects

Pattern Recognition;Image Processing and Computer Vision;Computer Graphics;Discrete Mathematics in Computer Science;Data Structures;Algorithm Analysis and Problem Complexity