Grenoble Institute of Technology

research

∙ 08/18/2021

Multi-patch Feature Pyramid Network for Weakly Supervised Object Detection in Optical Remote Sensing Images

Object detection is a challenging task in remote sensing because objects...

Pourya Shamsolmoali, et al. ∙

research

∙ 08/27/2021

Predicting the Factuality of Reporting of News Media Using Observations About User Attention in Their YouTube Channels

We propose a novel framework for predicting the factuality of reporting ...

Krasimira Bozhanova, et al. ∙

research

∙ 02/17/2019

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

Image colorization achieves more and more realistic results with the inc...

Weize Quan, et al. ∙

research

∙ 07/04/2022

BERT, can HE predict contrastive focus? Predicting and controlling prominence in neural TTS using a language model

Several recent studies have tested the use of transformer language model...

Brooke Stephenson, et al. ∙

research

∙ 04/11/2018

Dynamic Multi-Scale Semantic Segmentation based on Dilated Convolutional Networks

Semantic segmentation requires methods capable of learning high-level fe...

Keiller Nogueira, et al. ∙

research

∙ 06/02/2020

Convergence and Stability of Graph Convolutional Networks on Large Random Graphs

We study properties of Graph Convolutional Networks (GCNs) by analyzing ...

Nicolas Keriven, et al. ∙

research

∙ 09/18/2017

Coupled Ensembles of Neural Networks

We investigate in this paper the architecture of deep convolutional netw...

Anuvabh Dutt, et al. ∙

research

∙ 03/04/2013

Multivariate Temporal Dictionary Learning for EEG

This article addresses the issue of representing electroencephalographic...

Quentin Barthélemy, et al. ∙

research

∙ 02/28/2012

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

Imaging spectrometers measure electromagnetic energy scattered in their ...

Jose M. Bioucas-Dias, et al. ∙

research

∙ 12/12/2017

On some Graphs with a Unique Perfect Matching

We show that deciding whether a given graph G of size m has a unique per...

S. Chaplick, et al. ∙

research

∙ 03/09/2011

Efficient and Playful Tools to Teach Unix to New Students

Teaching Unix to new students is a common tasks in many higher schools. ...

Matthieu Moy, et al. ∙

research

∙ 02/11/2018

Separation choosability and dense bipartite induced subgraphs

We study a restricted form of list colouring, for which every pair of li...

Louis Esperet, et al. ∙

research

∙ 02/15/2018

Distributed coloring in sparse graphs with fewer colors

This paper is concerned with efficiently coloring sparse graphs in the d...

Pierre Aboulker, et al. ∙

research

∙ 03/05/2018

EPTAS for Max Clique on Disks and Unit Balls

We propose a polynomial-time algorithm which takes as input a finite set...

Marthe Bonamy, et al. ∙

research

∙ 03/29/2018

Least conflict choosability

Given a multigraph, suppose that each vertex is given a local assignment...

Zdeněk Dvořák, et al. ∙

research

∙ 04/26/2018

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

Robust estimators of large covariance matrices are considered, comprisin...

Nicolas Auguin, et al. ∙

research

∙ 09/04/2018

Handwriting styles: benchmarks and evaluation metrics

Evaluating the style of handwriting generation is a challenging problem,...

Omar Mohammed, et al. ∙

research

∙ 09/14/2018

Reconfiguration of graphs with connectivity constraints

A graph G realizes the degree sequence S if the degrees of its vertices ...

Nicolas Bousquet, et al. ∙

research

∙ 09/21/2018

Distributed coloring of graphs with an optimal number of colors

This paper studies sufficient conditions to obtain efficient distributed...

Étienne Bamas, et al. ∙

research

∙ 09/28/2018

Online Localization and Tracking of Multiple Moving Speakers in Reverberant Environments

This paper addresses the problem of online multiple-speaker localization...

Xiaofei Li, et al. ∙

research

∙ 11/24/2018

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-...

Arash Haddadan, et al. ∙

research

∙ 12/09/2018

Rounding semidefinite programs for large-domain problems via Brownian motion

We present a new simple method for rounding a semidefinite programming r...

Kevin L. Chang, et al. ∙

research

∙ 12/10/2018

Style Transfer and Extraction for the Handwritten Letters Using Deep Learning

How can we learn, transfer and extract handwriting styles using deep neu...

Omar Mohammed, et al. ∙

research

∙ 12/20/2018

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...

Antoine Dailly, et al. ∙

research

∙ 02/13/2019

Local approximation of the Maximum Cut in regular graphs

This paper is devoted to the distributed complexity of finding an approx...

Étienne Bamas, et al. ∙

research

∙ 03/13/2019

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...

Nicolas Bousquet, et al. ∙

research

∙ 11/24/2018

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-...

Arash Haddadan, et al. ∙

research

∙ 04/10/2019

Planar graphs have bounded nonrepetitive chromatic number

A colouring of a graph is "nonrepetitive" if for every path of even orde...

Vida Dujmovic, et al. ∙

research

∙ 06/04/2019

An Introduction to Deep Morphological Networks

The recent impressive results of deep learning-based methods on computer...

Keiller Nogueira, et al. ∙

research

∙ 07/01/2019

Quantization in Compressive Sensing: A Signal Processing Approach

Influence of the finite-length registers and quantization effects on the...

Isidora Stanković, et al. ∙

research

∙ 07/03/2019

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...

Nicolas Bousquet, et al. ∙

research

∙ 07/04/2019

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...

Grigori German, et al. ∙

research

∙ 07/03/2019

Towards improving Christofides algorithm for half-integer TSP

We study the traveling salesman problem (TSP) in the case when the objec...

Arash Haddadan, et al. ∙

research

∙ 04/17/2015

Hyperspectral pansharpening: a review

Pansharpening aims at fusing a panchromatic image with a multispectral o...

Laetitia Loncan, et al. ∙

research

∙ 11/25/2019

Tree search algorithms for the Sequential Ordering Problem

We present a study of several generic tree search techniques applied to ...

Luc Libralesso, et al. ∙

research

∙ 01/03/2020

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...

Li Liu, et al. ∙

research

∙ 01/06/2020

A note on the simultaneous edge coloring

Let G=(V,E) be a graph. A (proper) k-edge-coloring is a coloring of the ...

Nicolas Bousquet, et al. ∙

research

∙ 01/13/2020

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...

Nicolas Bousquet, et al. ∙

research

∙ 01/03/2020

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...

Li Liu, et al. ∙

research

∙ 02/25/2020

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

In this paper, we bound the integrality gap and the approximation ratio ...

Naveen Garg, et al. ∙

research

∙ 03/17/2020

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...

Pierre-Amaury Grumiaux, et al. ∙

research

∙ 04/02/2020

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...

Luc Libralesso, et al. ∙

research

∙ 04/02/2020

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

In this paper we address the problem of change detection in multi-spectr...

David Alejandro Jimenez Sierra, et al. ∙

research

∙ 04/02/2020

PackingSolver: a solver for Packing Problems

In this article, we introduce PackingSolver, a new solver for two-dimens...

Florian Fontan, et al. ∙

research

∙ 04/15/2020

An algorithmic framework for colouring locally sparse graphs

We develop an algorithmic framework for graph colouring that reduces the...

Ewan Davies, et al. ∙

research

∙ 04/02/2020

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 ...

Florian Fontan, et al. ∙

research

∙ 04/18/2020

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

Durand de Gevigney and Szigeti <cit.> have recently given a min-max theo...

Florian Hoersch, et al. ∙

research

∙ 05/08/2020

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

In this paper, a framework with complete numerical investigation is prop...

Mazen Alamir, et al. ∙

research

∙ 07/10/2020

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

The recent advancement of deep learning techniques has made great progre...

Jing Yao, et al. ∙

research

∙ 07/28/2020

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

Due to the limitations of hyperspectral imaging systems, hyperspectral i...

Ke Zheng, et al. ∙

Grenoble Institute of Technology

Featured Researchers