Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gilles Hénaff

dblp:172/9618 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
3since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 7 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Image recognition and object detection · 62% Learning paradigms · 38%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Image recognition and object detection
object detection
0.722019
End-to-End Learning of Latent Deformable Part-Based Representations for Object Detection · Int. J. Comput. Vis. 2019
Revisiting Multi-Task Learning with ROCK: a Deep Residual Auxiliary Block for Visual Detection · NeurIPS 2018
Computer vision › Image recognition and object detection › object detection › part-based object detection
deformable part-based object detection
0.412019
End-to-End Learning of Latent Deformable Part-Based Representations for Object Detection · Int. J. Comput. Vis. 2019
Machine learning › Learning paradigms › multi-task learning
auxiliary task learning
0.312018
Revisiting Multi-Task Learning with ROCK: a Deep Residual Auxiliary Block for Visual Detection · NeurIPS 2018
Machine learning › Learning paradigms
multi-task learning
0.312018
Revisiting Multi-Task Learning with ROCK: a Deep Residual Auxiliary Block for Visual Detection · NeurIPS 2018

Methods — techniques the papers use, named apart from their topics

latent part representations · 0.4end-to-end learning · 0.4residual connections · 0.3pooling operators · 0.3multimodal fusion · 0.3
YearPublicationVenuePosition
2024 Semantic augmentation by mixing contents for semi-supervised learning
Rémy Sun, Clément Masson, Gilles Hénaff, Nicolas Thome, Matthieu Cord
Pattern Recognit.3
2022 Look Beyond Bias with Entropic Adversarial Data Augmentation
abstract
Deep neural networks do not discriminate between spurious and causal patterns, and will only learn the most predictive ones while ignoring the others. This shortcut learning behaviour is detrimental to a network’s ability to generalize to an unknown test-time distribution in which the spurious correlations do not hold anymore. Debiasing methods were developed to make networks robust to such spurious biases but require to know in advance if a dataset is biased and make heavy use of minority counter-examples that do not display the majority bias of their class. In this paper, we argue that such samples should not be necessarily needed because the “hidden” causal information is often also contained in biased images. To study this idea, we propose 3 publicly released synthetic classification benchmarks, exhibiting predictive classification shortcuts, each of a different and challenging nature, without any minority samples acting as counter-examples. First, we investigate the effectiveness of several state-of-the-art strategies on our benchmarks and show that they do not yield satisfying results on them. Then, we propose an architecture able to succeed on our benchmarks, despite their unusual properties, using an entropic adversarial data augmentation training scheme. An encoder-decoder architecture is tasked to produce images that are not recognized by a classifier, by maximizing the conditional entropy of its outputs, and keep as much as possible of the initial content. A precise control of the information destroyed, via a disentangling process, enables us to remove the shortcut and leave everything else intact. Furthermore, results competitive with the state-of-the-art on the BAR dataset ensure the applicability of our method in real-life situations.
Thomas Duboudin, Emmanuel Dellandréa, Corentin Abgrall, Gilles Hénaff, Liming Chen 0002
ICPR4
2022 Swapping Semantic Contents for Mixing Images
abstract
Deep architecture have proven capable of solving many tasks provided a sufficient amount of labeled data. In fact, the amount of available labeled data has become the principal bottleneck in low label settings such as Semi-Supervised Learning. Mixing Data Augmentations do not typically yield new labeled samples, as indiscriminately mixing contents creates between-class samples. In this work, we introduce the SciMix framework that can learn to replace the global semantic content from one sample. By teaching a StyleGan generator to embed a semantic style code into image backgrounds, we obtain new mixing scheme for data augmentation. We then demonstrate that SciMix yields novel mixed samples that inherit many characteristics from their non-semantic parents. Afterwards, we verify those samples can be used to improve the performance semi-supervised frameworks like Mean Teacher or Fixmatch, and even fully supervised learning on a small labeled dataset.
Rémy Sun, Clément Masson, Gilles Hénaff, Nicolas Thome, Matthieu Cord
ICPR3
2019 End-to-End Learning of Latent Deformable Part-Based Representations for Object Detection
Taylor Mordan, Nicolas Thome, Gilles Hénaff, Matthieu Cord
Int. J. Comput. Vis.3
2018 Revisiting Multi-Task Learning with ROCK: a Deep Residual Auxiliary Block for Visual Detection
abstract
Multi-Task Learning (MTL) is appealing for deep learning regularization. In this paper, we tackle a specific MTL context denoted as primary MTL, where the ultimate goal is to improve the performance of a given primary task by leveraging several other auxiliary tasks. Our main methodological contribution is to introduce ROCK, a new generic multi-modal fusion block for deep learning tailored to the primary MTL context. ROCK architecture is based on a residual connection, which makes forward prediction explicitly impacted by the intermediate auxiliary representations. The auxiliary predictor's architecture is also specifically designed to our primary MTL context, by incorporating intensive pooling operators for maximizing complementarity of intermediate representations. Extensive experiments on NYUv2 dataset (object detection with scene classification, depth prediction, and surface normal estimation as auxiliary tasks) validate the relevance of the approach and its superiority to flat MTL approaches. Our method outperforms state-of-the-art object detection models on NYUv2 dataset by a large margin, and is also able to handle large-scale heterogeneous inputs (real and synthetic images) with missing annotation modalities.
Taylor Mordan, Nicolas Thome, Gilles Hénaff, Matthieu Cord
NeurIPS3
2018 Classifying low-resolution images by integrating privileged information in deep CNNs
Marion Chevalier, Nicolas Thome, Gilles Hénaff, Matthieu Cord
Pattern Recognit. Lett.3
2017 Deformable Part-based Fully Convolutional Network for Object Detection
Taylor Mordan, Nicolas Thome, Gilles Hénaff, Matthieu Cord
BMVC3
2015 LR-CNN for fine-grained classification with varying resolution
abstract
In this work, we present an extended study of image representations for fine-grained classification with respect to image resolution. Understudied in literature, this parameter yet presents many practical and theoretical interests, e.g. in embedded systems where restricted computational resources prevent treating high-resolution images. It is thus interesting to figure out which representation provides the best results in this particular context. On this purpose, we evaluate Fisher Vectors and deep representations on two significant finegrained oriented datasets: FGVC Aircraft [1] and PPMI [2]. We also introduce LR-CNN, a deep structure designed for classification of low-resolution images with strong semantic content. This net provides rich compact features and outperforms both pre-trained deep features and Fisher Vectors.
Marion Chevalier, Nicolas Thome, Matthieu Cord, Jérôme Fournier, Gilles Hénaff, Elodie Dusch
ICIP5