Graph-Based Representations in Pattern Recognition

10th IAPR-TC-15 International Workshop, GbRPR 2015, Beijing, China, May 13-15, 2015. Proceedings

AvCheng-Lin Liu,Bin Luo

Häftad, Engelska, 2015

Del 9069 i serien Lecture Notes in Computer Science

535 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

The accepted papers cover diverse issues of graph-based methods and applications, with 7 in graph representation,15 in graph matching, 7 in graph clustering and classification, and 7 in graph-based applications.

Produktinformation

Utgivningsdatum:2015-04-16
Mått:155 x 235 x 21 mm
Vikt:587 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:376
Förlag:Springer International Publishing AG
ISBN:9783319182230

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Grafik och bildbehandling inom Data och IT
Diskret matematik inom Naturvetenskap och teknik

Innehållsförteckning

Graph-based Representation.- Approximation of Graph Edit Distance in Quadratic Time.- Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem.- An Entropic Edge Assortativity Measure.- A Subpath Kernel for Learning Hierarchical Image Representations.- Coupled-Feature Hypergraph Representation for Feature Selection.- Reeb Graphs Through Local Binary Patterns.- Incremental embedding within a dissimilarity-based framework.- Graph Matching.- A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching.- Consensus of Two Graph Correspondences through a Generalisation of the Bipartite Graph Matching Algorithm.- Revisiting Volegnant-Jonker for Approximating Graph Edit Distance.- A Hypergraph Matching Framework for Refining Multi-source Feature Correspondences.- Kite Recognition by means of Graph Matching.- GEM++: a tool for solving substitution-tolerant subgraph isomorphism.- A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance.- Improving Hausdorff Edit Distance Using Structural Node Context.- Learning Graph Model for Different Dimensions Image Matching.- VF2 Plus: An Improved Version of VF2 For Biological Graphs.- Report on the First Contest on Graph Matching Algorithms for Pattern Search in Biological Databases.- Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance.- Multi-layer Tree Matching Using HSTs.- Large-scale Graph Indexing using Binary Embeddings of Node Contexts.- Attributed Relational Graph Matching with Sparse Relaxation and Bistochastic Normalization.- Graph Clustering and Classification.-On the Influence of Node Centralities on Graph Edit Distance for Graph Classification.- A Mixed Weisfeiler-Lehman Graph Kernel.- A Quantum Jensen-Shannon Graph Kernel using Discrete-time Quantum Walks.- Density Based Cluster Extension and Dominant Sets Clustering.- Salient Object Segmentation from Stereoscopic Images.- Causal Video Segmentation using Superseeds and Graph Matching.- Fast Minimum Spanning Tree based Clustering Algorithms on Local Neighborhood Graph.- Graph-based Application.- From bags to graphs of stereo subgraphs in order to predict molecule's properties.- Thermodynamics of Time Evolving Networks.- Isometric Mapping Hashing.- Skeletal Graphs from Schrodinger Magnitude and Phase.- Graph Based Lymphatic Vessel Wall Localisation and Tracking.- A Comic Retrieval System Based on Multilayer Graph Representation and Graph Mining.- Learning High-Order Structures for Texture Retrieval.