Grenoble Institute of Technology

∙ Grenoble , France ∙ 0 followers

Grenoble INP also has a two-year preparatory class programme, an adult education department, as well as 21 laboratories and a graduate school in Engineering Sciences.

Detecting Colorized Images via Convolutional Neural Networks: Toward High Accuracy and Good Generalization

Image colorization achieves more and more realistic results with the inc...
02/17/2019 ∙ by Weize Quan, et al. ∙ 6 ∙ share

read it
Dynamic Multi-Scale Semantic Segmentation based on Dilated Convolutional Networks

Semantic segmentation requires methods capable of learning high-level fe...
04/11/2018 ∙ by Keiller Nogueira, et al. ∙ 2 ∙ share

read it
Convergence and Stability of Graph Convolutional Networks on Large Random Graphs

We study properties of Graph Convolutional Networks (GCNs) by analyzing ...
06/02/2020 ∙ by Nicolas Keriven, et al. ∙ 2 ∙ share

read it
Coupled Ensembles of Neural Networks

We investigate in this paper the architecture of deep convolutional netw...
09/18/2017 ∙ by Anuvabh Dutt, et al. ∙ 0 ∙ share

read it
Multivariate Temporal Dictionary Learning for EEG

This article addresses the issue of representing electroencephalographic...
03/04/2013 ∙ by Quentin Barthélemy, et al. ∙ 0 ∙ share

read it
Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-Based Approaches

Imaging spectrometers measure electromagnetic energy scattered in their ...
02/28/2012 ∙ by Jose M. Bioucas-Dias, et al. ∙ 0 ∙ share

read it
On some Graphs with a Unique Perfect Matching

We show that deciding whether a given graph G of size m has a unique per...
12/12/2017 ∙ by S. Chaplick, et al. ∙ 0 ∙ share

read it
Efficient and Playful Tools to Teach Unix to New Students

Teaching Unix to new students is a common tasks in many higher schools. ...
03/09/2011 ∙ by Matthieu Moy, et al. ∙ 0 ∙ share

read it
Separation choosability and dense bipartite induced subgraphs

We study a restricted form of list colouring, for which every pair of li...
02/11/2018 ∙ by Louis Esperet, et al. ∙ 0 ∙ share

read it
Distributed coloring in sparse graphs with fewer colors

This paper is concerned with efficiently coloring sparse graphs in the d...
02/15/2018 ∙ by Pierre Aboulker, et al. ∙ 0 ∙ share

read it
EPTAS for Max Clique on Disks and Unit Balls

We propose a polynomial-time algorithm which takes as input a finite set...
03/05/2018 ∙ by Marthe Bonamy, et al. ∙ 0 ∙ share

read it
Least conflict choosability

Given a multigraph, suppose that each vertex is given a local assignment...
03/29/2018 ∙ by Zdeněk Dvořák, et al. ∙ 0 ∙ share

read it
Large-dimensional behavior of regularized Maronna's M-estimators of covariance matrices

Robust estimators of large covariance matrices are considered, comprisin...
04/26/2018 ∙ by Nicolas Auguin, et al. ∙ 0 ∙ share

read it
Handwriting styles: benchmarks and evaluation metrics

Evaluating the style of handwriting generation is a challenging problem,...
09/04/2018 ∙ by Omar Mohammed, et al. ∙ 0 ∙ share

read it
Reconfiguration of graphs with connectivity constraints

A graph G realizes the degree sequence S if the degrees of its vertices ...
09/14/2018 ∙ by Nicolas Bousquet, et al. ∙ 0 ∙ share

read it
Distributed coloring of graphs with an optimal number of colors

This paper studies sufficient conditions to obtain efficient distributed...
09/21/2018 ∙ by Étienne Bamas, et al. ∙ 0 ∙ share

read it
Online Localization and Tracking of Multiple Moving Speakers in Reverberant Environments

This paper addresses the problem of online multiple-speaker localization...
09/28/2018 ∙ by Xiaofei Li, et al. ∙ 0 ∙ share

read it
Polynomial-time algorithms for 2-edge-connected subgraphs on fundamental classes by top-down coloring

Finding the exact integrality gap α for the LP relaxation of the 2-edge-...
11/24/2018 ∙ by Arash Haddadan, et al. ∙ 0 ∙ share

read it
Rounding semidefinite programs for large-domain problems via Brownian motion

We present a new simple method for rounding a semidefinite programming r...
12/09/2018 ∙ by Kevin L. Chang, et al. ∙ 0 ∙ share

read it
Style Transfer and Extraction for the Handwritten Letters Using Deep Learning

How can we learn, transfer and extract handwriting styles using deep neu...
12/10/2018 ∙ by Omar Mohammed, et al. ∙ 0 ∙ share

read it
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs

A graph is diameter-2-critical if its diameter is 2 but the removal of a...
12/20/2018 ∙ by Antoine Dailly, et al. ∙ 0 ∙ share

read it
Local approximation of the Maximum Cut in regular graphs

This paper is devoted to the distributed complexity of finding an approx...
02/13/2019 ∙ by Étienne Bamas, et al. ∙ 0 ∙ share

read it
A polynomial version of Cereceda's conjecture

Let k and d be such that k > d+2. Consider two k-colourings of a d-degen...
03/13/2019 ∙ by Nicolas Bousquet, et al. ∙ 0 ∙ share

read it
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes

Finding the exact integrality gap α for the LP relaxation of the 2-edge-...
11/24/2018 ∙ by Arash Haddadan, et al. ∙ 0 ∙ share

read it
Planar graphs have bounded nonrepetitive chromatic number

A colouring of a graph is "nonrepetitive" if for every path of even orde...
04/10/2019 ∙ by Vida Dujmovic, et al. ∙ 0 ∙ share

read it
An Introduction to Deep Morphological Networks

The recent impressive results of deep learning-based methods on computer...
06/04/2019 ∙ by Keiller Nogueira, et al. ∙ 0 ∙ share

read it
Quantization in Compressive Sensing: A Signal Processing Approach

Influence of the finite-length registers and quantization effects on the...
07/01/2019 ∙ by Isidora Stanković, et al. ∙ 0 ∙ share

read it
Linear transformations between colorings in chordal graphs

Let k and d be such that k > d+2. Consider two k-colorings of a d-degene...
07/03/2019 ∙ by Nicolas Bousquet, et al. ∙ 0 ∙ share

read it
A global constraint for the capacitated single-item lot-sizing problem

The goal of this paper is to set a constraint programming framework to s...
07/04/2019 ∙ by Grigori German, et al. ∙ 0 ∙ share

read it
Towards improving Christofides algorithm for half-integer TSP

We study the traveling salesman problem (TSP) in the case when the objec...
07/03/2019 ∙ by Arash Haddadan, et al. ∙ 0 ∙ share

read it
Hyperspectral pansharpening: a review

Pansharpening aims at fusing a panchromatic image with a multispectral o...
04/17/2015 ∙ by Laetitia Loncan, et al. ∙ 0 ∙ share

read it
Tree search algorithms for the Sequential Ordering Problem

We present a study of several generic tree search techniques applied to ...
11/25/2019 ∙ by Luc Libralesso, et al. ∙ 0 ∙ share

read it
A New Re-synchronization Method based Multi-modal Fusion for Automatic Continuous Cued Speech Recognition

Cued Speech (CS) is an augmented lip reading complemented by hand coding...
01/03/2020 ∙ by Li Liu, et al. ∙ 0 ∙ share

read it
A note on the simultaneous edge coloring

Let G=(V,E) be a graph. A (proper) k-edge-coloring is a coloring of the ...
01/06/2020 ∙ by Nicolas Bousquet, et al. ∙ 0 ∙ share

read it
Packing and covering balls in graphs excluding a minor

We prove that for every integer t> 1 there exists a constant c_t such th...
01/13/2020 ∙ by Nicolas Bousquet, et al. ∙ 0 ∙ share

read it
Re-synchronization using the Hand Preceding Model for Multi-modal Fusion in Automatic Continuous Cued Speech Recognition

Cued Speech (CS) is an augmented lip reading complemented by hand coding...
01/03/2020 ∙ by Li Liu, et al. ∙ 0 ∙ share

read it
Integer Plane Multiflow Maximisation:Flow-Cut Gap and One-Quarter-Approximation

In this paper, we bound the integrality gap and the approximation ratio ...
02/25/2020 ∙ by Naveen Garg, et al. ∙ 0 ∙ share

read it
High-Resolution Speaker Counting In Reverberant Rooms Using CRNN With Ambisonics Features

Speaker counting is the task of estimating the number of people that are...
03/17/2020 ∙ by Pierre-Amaury Grumiaux, et al. ∙ 0 ∙ share

read it
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem

In this article, we present the anytime tree search algorithm we designe...
04/02/2020 ∙ by Luc Libralesso, et al. ∙ 0 ∙ share

read it
Graph-based fusion for change detection in multi-spectral images

In this paper we address the problem of change detection in multi-spectr...
04/02/2020 ∙ by David Alejandro Jimenez Sierra, et al. ∙ 0 ∙ share

read it
PackingSolver: a solver for Packing Problems

In this article, we introduce PackingSolver, a new solver for two-dimens...
04/02/2020 ∙ by Florian Fontan, et al. ∙ 0 ∙ share

read it
An algorithmic framework for colouring locally sparse graphs

We develop an algorithmic framework for graph colouring that reduces the...
04/15/2020 ∙ by Ewan Davies, et al. ∙ 0 ∙ share

read it
An anytime tree search algorithm for two-dimensional two- and three-staged guillotine packing problems

[libralesso_anytime_2020] proposed an anytime tree search algorithm for ...
04/02/2020 ∙ by Florian Fontan, et al. ∙ 0 ∙ share

read it
The (2,k)-connectivity augmentation problem: Algorithmic aspects

Durand de Gevigney and Szigeti <cit.> have recently given a min-max theo...
04/18/2020 ∙ by Florian Hoersch, et al. ∙ 0 ∙ share

read it
On the use of Data-Driven Cost Function Identification in Parametrized NMPC

In this paper, a framework with complete numerical investigation is prop...
05/08/2020 ∙ by Mazen Alamir, et al. ∙ 0 ∙ share

read it
Cross-Attention in Coupled Unmixing Nets for Unsupervised Hyperspectral Super-Resolution

The recent advancement of deep learning techniques has made great progre...
07/10/2020 ∙ by Jing Yao, et al. ∙ 0 ∙ share

read it
Coupled Convolutional Neural Network with Adaptive Response Function Learning for Unsupervised Hyperspectral Super-Resolution

Due to the limitations of hyperspectral imaging systems, hyperspectral i...
07/28/2020 ∙ by Ke Zheng, et al. ∙ 0 ∙ share

read it
What the Future Brings: Investigating the Impact of Lookahead for Incremental Neural TTS

In incremental text to speech synthesis (iTTS), the synthesizer produces...
09/04/2020 ∙ by Brooke Stephenson, et al. ∙ 0 ∙ share

read it
Connectivity of orientations of 3-edge-connected graphs

We attempt to generalize a theorem of Nash-Williams stating that a graph...
12/06/2020 ∙ by Florian Hörsch, et al. ∙ 0 ∙ share

read it
Enhancing ensemble learning and transfer learning in multimodal data analysis by adaptive dimensionality reduction

Modern data analytics take advantage of ensemble learning and transfer l...
05/08/2021 ∙ by Andrea Marinoni, et al. ∙ 0 ∙ share

read it

Grenoble Institute of Technology

Featured Researchers