2 citations · 5 across the 5 of their papers we have counts for
8 papers
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]
Lucas Gnecco, Nicolas Boria, Sébastien Bougleux +2
The inference of minimum spanning arborescences within a set of objects is a general problem which translates into numerous application-specific unsupervised learning tasks. We int…
Deep learning using Havrda-Charvat entropy for classification of pulmonary endomicroscopy
Thibaud Brochet, Jerome Lapuyade-Lahorgue, Sebastien Bougleux +2
Pulmonary optical endomicroscopy (POE) is an imaging technology in real time. It allows to examine pulmonary alveoli at a microscopic level. Acquired in clinical settings, a POE im…
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…