Anytime and Distributed Approaches for Graph Matching

Autor: Zeina Abu-Aisheh

Publikováno v: ELCVIA Electronic Letters on Computer Vision and Image Analysis, Vol 15, Iss 2 (2016)

Due to the inherent genericity of graph-based representations, and thanks to the improvement of computer capacities, structural representations have become more and more popular in the field of Pattern Recognition (PR). In a graph-based representatio

Externí odkaz: https://doaj.org/article/f3f6c5949b9c44f386191715b787f0e6

Efficient k-nearest neighbors search in graph space

Autor: Jean-Yves Ramel, Romain Raveaux, Zeina Abu-Aisheh

Publikováno v: Pattern Recognition Letters
Pattern Recognition Letters, Elsevier, 2018, 〈10.1016/j.patrec.2018.05.001〉
Pattern Recognition Letters, Elsevier, 2020, 134, pp.77-86. ⟨10.1016/j.patrec.2018.05.001⟩
Pattern Recognition Letters, Elsevier, 2018, ⟨10.1016/j.patrec.2018.05.001⟩

The k-nearest neighbors classifier has been widely used to classify graphs in pattern recognition. An unknown graph is classified by comparing it to all the graphs in the training set and then assigning it the class to which the majority of the neare

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f24fd672323c24888a0bde255814f1e
https://hal-espci.archives-ouvertes.fr/hal-01791560/file/templateLIFAT.pdf

Photo(Graph) Gallery: An 'Exhibition' of Graph Classification

Autor: Zeina Abu-Aisheh, Frédéric Rayar

Publikováno v: IV

This paper is an exhibition of graph matchingresults, in a classification context. We present Photo(Graph) Gallery, a platform that allows one to visually interpret graphmatchings. We aim at understanding the computed matchingsin order to improve the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::4eb4802acccb19697fc61311ce2ae53e
https://doi.org/10.1109/iv.2017.21

Fast Nearest Neighbors Search in Graph Space Based on a Branch-and-Bound Strategy

Autor: Zeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel

Publikováno v: Graph-Based Representations in Pattern Recognition ISBN: 9783319589602
GbRPR
Graph-Based Representations in Pattern Recognition-11th IAPR-TC-15 International Workshop, GbRPR
Graph-Based Representations in Pattern Recognition-11th IAPR-TC-15 International Workshop, GbRPR, May 2017, Anacapri, Italy

When using k-nearest neighbors, an unknown object is classified by comparing it to all the prototypes stored in the training database. When the size of the database is large, and especially if prototypes are represented by graphs, the search of k-nea

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8327e5544031c136021454ab7405238e
https://doi.org/10.1007/978-3-319-58961-9_18

Exact Graph Edit Distance Computation Using a Binary Linear Program

Autor: Romain Raveaux, Sébastien Adam, Julien Lerouge, Pierre Héroux, Zeina Abu-Aisheh

Publikováno v: Structural, Syntactic, and Statistical Pattern Recognition-Joint IAPR International Workshop, S+SSPR 2016, Mérida, Mexico, November 29-December 2, 2016, Proceedings
Structural, Syntactic, and Statistical Pattern Recognition-Joint IAPR International Workshop, S+SSPR 2016, Mérida, Mexico, November 29-December 2, 2016, Proceedings, 2016, Unknown, Unknown Region. pp.485--495, ⟨10.1007/978-3-319-49055-7_43⟩
Lecture Notes in Computer Science ISBN: 9783319490540
S+SSPR

This paper presents a binary linear program which computes the exact graph edit distance between two richly attributed graphs (i.e. with attributes on both vertices and edges). Without solving graph edit distance for large graphs, the proposed progra

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::23198f73fe73fec81489f78dfc2f47d8
https://hal.archives-ouvertes.fr/hal-01491027