### Abstract

Original language | English |
---|---|

Title of host publication | Image analysis and processing — ICIAP 2015 |

Subtitle of host publication | 18th International Conference, Genoa, Italy, September 7-11, 2015, Proceedings |

Editors | Vittorio Murino, Enrico Puppo |

Place of Publication | Chem (CH) |

Publisher | Springer |

Pages | 27-38 |

Number of pages | 10 |

Volume | Part I |

ISBN (Electronic) | 978-3-319-23231-7 |

ISBN (Print) | 978-3-319-23230-0 |

DOIs | |

Publication status | Published - 21 Aug 2015 |

Event | 18th International Conference on Image Analysis and Processing - Genova, Italy Duration: 7 Sep 2015 → 11 Sep 2015 |

### Publication series

Name | Lecture notes in computer science |
---|---|

Publisher | Springer |

Volume | 9279 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 18th International Conference on Image Analysis and Processing |
---|---|

Abbreviated title | ICIAP 2015 |

Country | Italy |

City | Genova |

Period | 7/09/15 → 11/09/15 |

### Fingerprint

### Bibliographical note

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-23231-7_3### Cite this

*Image analysis and processing — ICIAP 2015: 18th International Conference, Genoa, Italy, September 7-11, 2015, Proceedings*(Vol. Part I, pp. 27-38). (Lecture notes in computer science; Vol. 9279). Chem (CH): Springer. https://doi.org/10.1007/978-3-319-23231-7_3

}

*Image analysis and processing — ICIAP 2015: 18th International Conference, Genoa, Italy, September 7-11, 2015, Proceedings.*vol. Part I, Lecture notes in computer science, vol. 9279, Springer, Chem (CH), pp. 27-38, 18th International Conference on Image Analysis and Processing, Genova, Italy, 7/09/15. https://doi.org/10.1007/978-3-319-23231-7_3

**An edge-based matching kernel through discrete-time quantum walks.** / Bai, Lu; Zhang, Zhihong; Ren, Peng; Rossi, Luca; Hancock, Edwin R.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - An edge-based matching kernel through discrete-time quantum walks

AU - Bai, Lu

AU - Zhang, Zhihong

AU - Ren, Peng

AU - Rossi, Luca

AU - Hancock, Edwin R.

N1 - The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-23231-7_3

PY - 2015/8/21

Y1 - 2015/8/21

N2 - In this paper, we propose a new edge-based matching kernel for graphs by using discrete-time quantum walks. To this end, we commence by transforming a graph into a directed line graph. The reasons of using the line graph structure are twofold. First, for a graph, its directed line graph is a dual representation and each vertex of the line graph represents a corresponding edge in the original graph. Second, we show that the discrete-time quantum walk can be seen as a walk on the line graph and the state space of the walk is the vertex set of the line graph, i.e., the state space of the walk is the edges of the original graph. As a result, the directed line graph provides an elegant way of developing new edge-based matching kernel based on discrete-time quantum walks. For a pair of graphs, we compute the h-layer depth-based representation for each vertex of their directed line graphs by computing entropic signatures (computed from discrete-time quantum walks on the line graphs) on the family of K-layer expansion subgraphs rooted at the vertex, i.e., we compute the depth-based representations for edges of the original graphs through their directed line graphs. Based on the new representations, we define an edge-based matching method for the pair of graphs by aligning the h-layer depth-based representations computed through the directed line graphs. The new edge-based matching kernel is thus computed by counting the number of matched vertices identified by the matching method on the directed line graphs. Experiments on standard graph datasets demonstrate the effectiveness of our new kernel.

AB - In this paper, we propose a new edge-based matching kernel for graphs by using discrete-time quantum walks. To this end, we commence by transforming a graph into a directed line graph. The reasons of using the line graph structure are twofold. First, for a graph, its directed line graph is a dual representation and each vertex of the line graph represents a corresponding edge in the original graph. Second, we show that the discrete-time quantum walk can be seen as a walk on the line graph and the state space of the walk is the vertex set of the line graph, i.e., the state space of the walk is the edges of the original graph. As a result, the directed line graph provides an elegant way of developing new edge-based matching kernel based on discrete-time quantum walks. For a pair of graphs, we compute the h-layer depth-based representation for each vertex of their directed line graphs by computing entropic signatures (computed from discrete-time quantum walks on the line graphs) on the family of K-layer expansion subgraphs rooted at the vertex, i.e., we compute the depth-based representations for edges of the original graphs through their directed line graphs. Based on the new representations, we define an edge-based matching method for the pair of graphs by aligning the h-layer depth-based representations computed through the directed line graphs. The new edge-based matching kernel is thus computed by counting the number of matched vertices identified by the matching method on the directed line graphs. Experiments on standard graph datasets demonstrate the effectiveness of our new kernel.

U2 - 10.1007/978-3-319-23231-7_3

DO - 10.1007/978-3-319-23231-7_3

M3 - Conference contribution

SN - 978-3-319-23230-0

VL - Part I

T3 - Lecture notes in computer science

SP - 27

EP - 38

BT - Image analysis and processing — ICIAP 2015

A2 - Murino, Vittorio

A2 - Puppo, Enrico

PB - Springer

CY - Chem (CH)

ER -