18 citations · 52 across the 12 of their papers we have counts for
5 papers · 1 filter
Improved local search for graph edit distance
Nicolas Boria, David B. Blumenthal, Sébastien Bougleux +1
The graph edit distance (GED) measures the dissimilarity between two graphs as the minimal cost of a sequence of elementary operations transforming one graph into another. This mea…
Upper Bounding the Graph Edit Distance Based on Rings and Machine Learning
David B. Blumenthal, Johann Gamper, Sébastien Bougleux +1
The graph edit distance (GED) is a flexible distance measure which is widely used for inexact graph matching. Since its exact computation is NP-hard, heuristics are used in practic…
Generalized Median Graph via Iterative Alternate Minimizations
Nicolas Boria, S'ebastien Bougleux, Benoit Gaüzère +1
Computing a graph prototype may constitute a core element for clustering or classification tasks. However, its computation is an NP-Hard problem, even for simple classes of graphs.…
Skeleton-Based Hand Gesture Recognition by Learning SPD Matrices with Neural Networks
Xuan Nguyen, Luc Brun, Olivier Lezoray +1
In this paper, we propose a new hand gesture recognition method based on skeletal data by learning SPD matrices with neural networks. We model the hand skeleton as a graph and intr…
A neural network based on SPD manifold learning for skeleton-based hand gesture recognition
Xuan Son Nguyen, Luc Brun, Olivier Lézoray +1
This paper proposes a new neural network based on SPD manifold learning for skeleton-based hand gesture recognition. Given the stream of hand's joint positions, our approach combin…