Thomas Oberlin

Thomas Oberlin

Auto-generated profile, based on publicly available information

Thomas Oberlin

Fédération ENAC ISAE-SUPAERO ONERA, Université de Toulouse

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 October 2013 in IEEE Signal Processing Magazine
Verified
Journal Article
Closed access
Francois AUGERFrancois AUGER
Francois AUGER
PFPatrick Flandrin
Patrick Flandrin
YLYu-Ting Lin
Yu-Ting Lin
SMStephen McLaughlin
Stephen McLaughlin
SMSylvain Meignen
Sylvain Meignen
HWHau-tieng Wu
Hau-tieng Wu
This article provides a general overview of time-frequency (T-F) reassignment and synchrosqueezing techniques applied to multicomponent signals, covering the theoretical background and applications. We explain how synchrosqueezing can be viewed as a special case of reassignment enabling mode reconstruction and place emphasis on the interest of using such T-F distributions throughout with illustrative examples.

12 January 2015 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
TOThomas Oberlin
Thomas Oberlin
SMSylvain Meignen
Sylvain Meignen
VPValerie Perrier
Valerie Perrier
This paper considers the analysis of multicomponent signals, defined as superpositions of real or complex modulated waves. It introduces two new post-transformations for the short-time Fourier transform that achieve a compact time-frequency representation while allowing for the separation and the reconstruction of the modes. These two new transformations thus benefit from both the synchrosqueezing transform (which allows for reconstruction) and the reassignment method (which achieves a compact time-frequency representation). Numerical experiments on real and synthetic signals demonstrate the efficiency of these new transformations, and illustrate their differences.

1 September 2018 in Applied and Computational Harmonic Analysis
Verified
Journal Article
Closed access
RBRATIKANTA BEHERA
RATIKANTA BEHERA
SMSylvain Meignen
Sylvain Meignen
TOThomas Oberlin
Thomas Oberlin

10 August 2012 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
SMSylvain Meignen
Sylvain Meignen
TOThomas Oberlin
Thomas Oberlin
SMStephen McLaughlin
Stephen McLaughlin
In this paper, we address the problem of the retrieval of the components from a multicomponent signal using ideas from the synchrosqueezing framework. The emphasis is on the wavelet choice and we propose a novel algorithm based first on the detection of components followed by their reconstruction. Simulations illustrate how the proposed procedure compares with the empirical mode decomposition and other related methods in terms of mode-mixing. We conclude the paper by studying the sensitivity of the proposed technique to sampling and an application to signal denoising.

6 February 2012 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
TOThomas Oberlin
Thomas Oberlin
SMSylvain Meignen
Sylvain Meignen
VPValérie Perrier
Valérie Perrier
The Empirical Mode Decomposition (EMD) is a relatively new adaptive method for multicomponent signal representation which allows for analyzing nonlinear and nonstationary signals. In spite of its lack of mathematical foundations, very few papers are dedicated to defining new decompositions that would preserve the interesting properties of the EMD while improving the mathematical setting. The new decomposition based on direct constrained optimization we introduce in this article is an attempt in that direction.

27 January 2021 in Remote Sensing
Verified
Journal Article
Open access
PDF file
VOVinicius Alves de Oliveira
Vinicius Alves de Oliveira
MCmarie chabert
marie chabert
TOThomas Oberlin
Thomas Oberlin
CPCharly Poulliat
Charly Poulliat
MBMickael Bruno
Mickael Bruno
RCRoberto Camarero
Roberto Camarero
Recently, convolutional neural networks have been successfully applied to lossy image compression. End-to-end optimized autoencoders, possibly variational, are able to dramatically outperform traditional transform coding schemes in terms of rate-distortion trade-off; however, this is at the cost of a higher computational complexity. An intensive training step on huge databases allows autoencoders to learn jointly the image representation and its probability distribution, possibly using a non-parametric density model or a hyperprior auxiliary autoencoder to eliminate the need for prior knowledge. However, in the context of on board satellite compression, time and memory complexities are submitted to strong constraints. The aim of this paper is to design a complexity-reduced variational autoencoder in order to meet these constraints while maintaining the performance. Apart from a network dimension reduction that systematically targets each parameter of the analysis and synthesis transforms, we propose a simplified entropy model that preserves the adaptability to the input image. Indeed, a statistical analysis performed on satellite images shows that the Laplacian distribution fits most features of their representation. A complex non parametric distribution fitting or a cumbersome hyperprior auxiliary autoencoder can thus be replaced by a simple parametric estimation. The proposed complexity-reduced autoencoder outperforms the Consultative Committee for Space Data Systems standard (CCSDS 122.0-B) while maintaining a competitive performance, in terms of rate-distortion trade-off, in comparison with the state-of-the-art learned image compression schemes.