Workshop Program

Presentation Instructions

All the accepted papers are presented in oral sessions. Each paper is given 25min, including 20min for presentation and 5min for questions and discussions.

Video projector and a laptop with Windows 7 OS will be prepared in the meeting room for presentation. Powerpoint (PPT) and PDF are usable on the laptop. The presenter may also use his/her own laptop for presentation.

A PDF Version of Workshop Program.

May 13 (Wednesday)
8:00-9:00	Registration
9:00-9:20	Opening
9:20-10:20	Keynote Speech 1
	Revealing Structure in Large Graphs: Szemerédi's Regularity Lemma and Its Use in Pattern Recognition Marcello Pelillo (University of Venice, Italy)
10:20-10:50	Break
10:50-12:30	Graph Matching 1
	A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching Miquel Ferrer, Francesc Serratosa and Kaspar Riesen
	Consensus of Two Graph Correspondences through a Generalisation of the Bipartite Graph Matching Algorithm Carlos Francisco Moreno-García, Francesc Serratosa and Xavier Cortés
	Revisiting Volegnant-Jonker for Approximating Graph Edit Distance William Jones, Aziem Chawdhary and Andy King
	A Hypergraph Matching Framework for Refining Multi-source Feature Correspondences He Zhang, Bin Du, Yanjiang Wang and Peng Ren
12:30-14:00	Lunch
14:00-15:40	Graph-based Representation 1
	Approximation of Graph Edit Distance in Quadratic Time Kaspar Riesen, Miquel Ferrer, Andreas Fischer and Horst Bunke
	Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem Samuel de Sousa and Walter Kropatsch
	Thermodynamics of Time Evolving Networks Cheng Ye, Andrea Torsello, Richard C. Wilson and Edwin R. Hancock
	A Subpath Kernel for Learning Hierarchical Image Representations Yanwei Cui, Laetitia Chapel and Sébastien Lefèvre
15:40-16:10	Break
16:10-17:50	Graph Clustering and Classification 1
	On the Influence of Node Centralities on Graph Edit Distance for Graph Classification Xavier Cortés, Francesc Serratosa and Carlos F. Moreno-García
	A Mixed Weisfeiler-Lehman Graph Kernel Lixiang Xu, Jin Xie, Xiaofeng Wang and Bin Luo
	A Quantum Jensen-Shannon Graph Kernel using Discrete-time Quantum Walks Lu Bai, Luca Rossi, Peng Ren, Zhihong Zhang and Edwin R. Hancock
	Density Based Cluster Extension and Dominant Sets Clustering Jian Hou, Chunshi Sha, Xu E, Qi Xia and Naiming Qi
May 14 (Thursday)
9:00-10:00	Keynote Speech 2
	Understanding Users by Connecting Large Scale Social Graphs Xing Xie (Microsoft Research Asia, China)
10:00-10:30	Break
10:30-12:35	Graph-based Applications 1
	Report on the First Contest on Graph Matching Algorithms for Pattern Search in Biological Databases Vincenzo Carletti, Pasquale Foggia, Mario Vento and Xiaoyi Jiang
	Kite Recognition by means of Graph Matching Kamel Madi, Hamida Seba, Hamamache Kheddouci, Charles-Edmond Bichot, Olivier Barge, Christine Chataigner, Remy Crassard, Emmanuelle Regagnon and Emmanuelle Vila
	From bags to graphs of stereo subgraphs in order to predict molecule's properties Pierre-Anthony Grenier, Luc Brun and Didier Villemin
	An Entropic Edge Assortativity Measure Cheng Ye, Richard C. Wilson and Edwin R. Hancock
	Graph Based Lymphatic Vessel Wall Localisation and Tracking Ehab Essa, Xianghua Xie and Jonathan Jones
12:30-14:00	Lunch
14:00-15:40	Graph Matching 2
	GEM++: a tool for solving substitution-tolerant subgraph isomorphism Julien Lerouge, Pierre Le Bodic, Pierre Héroux and Sébastien Adam
	A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance Zeina Abu-Aisheh, Romain Raveaux and Jean-Yves Ramel
	Improving Hausdorff Edit Distance Using Structural Node Context Andreas Fischer, Seiichi Uchida, Volkmar Frinken, Kaspar Riesen and Horst Bunke
	VF2 Plus: An Improved Version of VF2 for Biological Graphs Vincenzo Carletti, Pasquale Foggia, and Mario Vento
15:40-16:10	Break
16:10-17:25	Graph Clustering and Classification 2
	Salient Object Segmentation from Stereoscopic Images Xingxing Fan, Zhi Liu and Linwei Ye
	Causal Video Segmentation using Superseeds and Graph Matching Vijay N. Gangapure, Susmit Nanda, Ananda S. Chowdhury and Xiaoyi Jiang
	Fast Minimum Spanning Tree based Clustering Algorithms on Local Neighborhood Graph R.Jothi, Sraban Kumar Mohanty and Aparajita Ojha
17:25-18:10	TC15 session
19:30-22:00	Banquet
May 15 (Friday)
8:40-10:20	Graph Matching 3
	Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance Vincenzo Carletti, Benoit Gaüzère, Luc Brun and Mario Vento
	Multi-layer Tree Matching Using HSTs Yusuf Osmanlioglu and Ali Shokoufandeh
	Large-scale Graph Indexing using Binary Embeddings of Node Contexts Pau Riba, Josep Llados, Alicia Fornes and Anjan Dutta
	Attributed Relational Graph Matching with Sparse Relaxation and Bistochastic Normalization Bo Jiang, Jin Tang and Bin Luo
10:20-10:50	Break
10:50-12:30	Graph-based Representation 2
	Coupled-Feature Hypergraph Representation for Feature Selection Zhihong Zhang, Jianbing Xiahou, Lu Bai and Edwin R. Hancock
	Reeb Graphs Through Local Binary Patterns Ines Janusch and Walter Kropatsch
	Incremental embedding within a dissimilarity-based framework Rachid Hafiane, Luc Brun and Salvatore Tabbone
	Learning Graph Model for Different Dimensions Image Matching Haoyi Zhou, Xiao Bai, Jun Zhou, Haichuan Yang and Yun Liu
12:30-14:00	Lunch
14:00-15:40	Graph-based Applications 2
	Skeletal Graphs from Schrodinger Magnitude and Phase Francisco Escolano, Edwin R. Hancock and Miguel Angel Lozano
	Isometric Mapping Hashing Yanzhen Liu, Xiao Bai, Haichuan Yang, Jun Zhou and Zhihong Zhang
	A Comic Retrieval System Based on Multilayer Graph Representation and Graph Mining Thanh-Nam Le, Muhammad Muzzamil Luqman,Jean-Christophe Burie, and Jean-Marc Ogier
	Learning High-Order Structures for Texture Retrieval Ni Liu, Georgy Gimelfarb and Patrice Delmas
15:40-16:00	Closing