arXiv subjects

Jerome Bobin

Publications and source records attributed to Jerome Bobin.

13 recordsLinked to original sources

arXiv2020

Shear measurement bias I: dependencies on methods, simulation parameters and measured parameters

We present a study of the dependencies of shear bias on simulation (input) and measured (output) parameters, noise, point-spread function anisotropy, pixel size, and the model bias coming from two different and independent galaxy shape estimators. We used simulated images from Galsim based on the GREAT3 control-space-constant branch, and we measured shear bias from a model-fitting method (gFIT) and a moment-based method (Kaiser-Squires-Broadhurst). We show the bias dependencies found on input and output parameters for both methods, and we identify the main dependencies and causes. Most of the results are consistent between the two estimators, an interesting result given the differences of the methods. We also find important dependences on orientation and morphology properties such as flux, size, and ellipticity. We show that noise and pixelization play an important role in the bias dependencies on the output properties and galaxy orientation. We show some examples of model bias that produce a bias dependence on the Sersic index n as well as a different shear bias between galaxies consisting of a single Sersic profile and galaxies with a disc and a bulge. We also see an important coupling between several properties on the bias dependences. Because of this, we need to study several measured properties simultaneously in order to properly understand the nature of shear bias. This paper serves as a first step towards a companion paper that describes a machine learning approach to modelling shear bias as a complex function of many observed properties.

astro-ph.CO↗

arXiv2020

Shear measurement bias II: a fast machine learning calibration method

We present a new shear calibration method based on machine learning. The method estimates the individual shear responses of the objects from the combination of several measured properties on the images using supervised learning. The supervised learning uses the true individual shear responses obtained from copies of the image simulations with different shear values. On simulated GREAT3data, we obtain a residual bias after the calibration compatible with 0 and beyond Euclid requirements for a signal-to-noise ratio > 20 within ~15 CPU hours of training using only ~10^5 objects. This efficient machine-learning approach can use a smaller data set because the method avoids the contribution from shape noise. The low dimensionality of the input data also leads to simple neural network architectures. We compare it to the recently described method Metacalibration, which shows similar performances. The different methods and systematics suggest that the two methods are very good complementary methods. Our method can therefore be applied without much effort to any survey such as Euclid or the Vera C. Rubin Observatory, with fewer than a million images to simulate to learn the calibration function.

astro-ph.CO↗

arXiv2018

Heuristics for Efficient Sparse Blind Source Separation

Sparse Blind Source Separation (sparse BSS) is a key method to analyze multichannel data in fields ranging from medical imaging to astrophysics. However, since it relies on seeking the solution of a non-convex penalized matrix factorization problem, its performances largely depend on the optimization strategy. In this context, Proximal Alternating Linearized Minimization (PALM) has become a standard algorithm which, despite its theoretical grounding, generally provides poor practical separation results. In this work, we propose a novel strategy that combines a heuristic approach with PALM. We show its relevance on realistic astrophysical data.

cs.LG↗

arXiv2018

A highly precise shear bias estimator independent of the measured shape noise

We present a new method to estimate shear measurement bias in image simulations that significantly improves the precision with respect to current techniques. Our method is based on measuring the shear response for individual images. We generated sheared versions of the same image to measure how the galaxy shape changes with the small applied shear. This shear response is the multiplicative shear bias for each image. In addition, we also measured the individual additive bias. Using the same noise realizations for each sheared version allows us to compute the shear response at very high precision. The estimated shear bias of a sample of galaxies is then the average of the individual measurements. The precision of this method leads to an improvement with respect to previous methods concerned with the precision of estimates of multiplicative bias since our method is not affected by noise from shape measurements, which until now has been the dominant uncertainty. As a consequence, the method does not require shape-noise suppression for a precise estimation of shear multiplicative bias. Our method can be readily used for numerous applications such as shear measurement validation and calibration, reducing the number of necessary simulated images by a few orders of magnitude to achieve the same precision.

astro-ph.CO↗

arXiv2017

Sparse estimation of model-based diffuse thermal dust emission

Component separation for the Planck HFI data is primarily concerned with the estimation of thermal dust emission, which requires the separation of thermal dust from the cosmic infrared background (CIB). For that purpose, current estimation methods rely on filtering techniques to decouple thermal dust emission from CIB anisotropies, which tend to yield a smooth, low- resolution, estimation of the dust emission. In this paper we present a new parameter estimation method, premise: Parameter Recovery Exploiting Model Informed Sparse Estimates. This method exploits the sparse nature of thermal dust emission to calculate all-sky maps of thermal dust temperature, spectral index and optical depth at 353 GHz. premise is evaluated and validated on full-sky simulated data. We find the percentage difference between the premise results and the true values to be 2.8, 5.7 and 7.2 per cent at the 1σ level across the full sky for thermal dust temperature, spectral index and optical depth at 353 GHz, respectively. Comparison between premise and a GNILC-like method over selected regions of our sky simulation reveals that both methods perform comparably within high signal-to-noise regions. However outside of the Galactic plane premise is seen to outperform the GNILC-like method with increasing success as the signal-to-noise ratio worsens.

astro-ph.CO↗

arXiv2017

Unsupervised feature-learning for galaxy SEDs with denoising autoencoders

With the increasing number of deep multi-wavelength galaxy surveys, the spectral energy distribution (SED) of galaxies has become an invaluable tool for studying the formation of their structures and their evolution. In this context, standard analysis relies on simple spectro-photometric selection criteria based on a few SED colors. If this fully supervised classification already yielded clear achievements, it is not optimal to extract relevant information from the data. In this article, we propose to employ very recent advances in machine learning, and more precisely in feature learning, to derive a data-driven diagram. We show that the proposed approach based on denoising autoencoders recovers the bi-modality in the galaxy population in an unsupervised manner, without using any prior knowledge on galaxy SED classification. This technique has been compared to principal component analysis (PCA) and to standard color/color representations. In addition, preliminary results illustrate that this enables the capturing of extra physically meaningful information, such as redshift dependence, galaxy mass evolution and variation over the specific star formation rate. PCA also results in an unsupervised representation with physical properties, such as mass and sSFR, although this representation separates out. less other characteristics (bimodality, redshift evolution) than denoising autoencoders.

astro-ph.IM↗

arXiv2016

Robust Sparse Blind Source Separation

Blind Source Separation is a widely used technique to analyze multichannel data. In many real-world applications, its results can be significantly hampered by the presence of unknown outliers. In this paper, a novel algorithm coined rGMCA (robust Generalized Morphological Component Analysis) is introduced to retrieve sparse sources in the presence of outliers. It explicitly estimates the sources, the mixing matrix, and the outliers. It also takes advantage of the estimation of the outliers to further implement a weighting scheme, which provides a highly robust separation procedure. Numerical experiments demonstrate the efficiency of rGMCA to estimate the mixing matrix in comparison with standard BSS techniques.

stat.AP↗

arXiv2015

Polarized CMB recovery with sparse component separation

The polarization modes of the cosmological microwave background are an invaluable source of information for cosmology, and a unique window to probe the energy scale of inflation. Extracting such information from microwave surveys requires disentangling between foreground emissions and the cosmological signal, which boils down to solving a component separation problem. Component separation techniques have been widely studied for the recovery of CMB temperature anisotropies but quite rarely for the polarization modes. In this case, most component separation techniques make use of second-order statistics to discriminate between the various components. More recent methods, which rather emphasize on the sparsity of the components in the wavelet domain, have been shown to provide low-foreground, full-sky estimate of the CMB temperature anisotropies. Building on sparsity, the present paper introduces a new component separation technique dubbed PolGMCA (Polarized Generalized Morphological Component Analysis), which refines previous work to specifically tackle the estimation of the polarized CMB maps: i) it benefits from a recently introduced sparsity-based mechanism to cope with partially correlated components, ii) it builds upon estimator aggregation techniques to further yield a better noise contamination/non-Gaussian foreground residual trade-off. The PolGMCA algorithm is evaluated on simulations of full-sky polarized microwave sky simulations using the Planck Sky Model (PSM), which show that the proposed method achieve a precise recovery of the CMB map in polarization with low noise/foreground contamination residuals. It provides improvements with respect to standard methods, especially on the galactic center where estimating the CMB is challenging.

astro-ph.CO↗

arXiv2014

Sparsity and adaptivity for the blind separation of partially correlated sources

Blind source separation (BSS) is a very popular technique to analyze multichannel data. In this context, the data are modeled as the linear combination of sources to be retrieved. For that purpose, standard BSS methods all rely on some discrimination principle, whether it is statistical independence or morphological diversity, to distinguish between the sources. However, dealing with real-world data reveals that such assumptions are rarely valid in practice: the signals of interest are more likely partially correlated, which generally hampers the performances of standard BSS methods. In this article, we introduce a novel sparsity-enforcing BSS method coined Adaptive Morphological Component Analysis (AMCA), which is designed to retrieve sparse and partially correlated sources. More precisely, it makes profit of an adaptive re-weighting scheme to favor/penalize samples based on their level of correlation. Extensive numerical experiments have been carried out which show that the proposed method is robust to the partial correlation of sources while standard BSS techniques fail. The AMCA algorithm is evaluated in the field of astrophysics for the separation of physical components from microwave data.

stat.AP↗

arXiv2013

Hyperspectral fluorescence microscopy based on Compressive Sampling

The mathematical theory of compressed sensing (CS) asserts that one can acquire signals from measurements whose rate is much lower than the total bandwidth. Whereas the CS theory is now well developed, challenges concerning hardware implementations of CS-based acquisition devices-especially in optics-have only started being addressed. This paper presents an implementation of compressive sensing in fluorescence microscopy and its applications to biomedical imaging. Our CS microscope combines a dynamic structured wide-field illumination and a fast and sensitive single-point fluorescence detection to enable reconstructions of images of fluorescent beads, cells, and tissues with undersampling ratios (between the number of pixels and number of measurements) up to 32. We further demonstrate a hyperspectral mode and record images with 128 spectral channels and undersampling ratios up to 64, illustrating the potential benefits of CS acquisition for higher-dimensional signals, which typically exhibits extreme redundancy. Altogether, our results emphasize the interest of CS schemes for acquisition at a significantly reduced rate and point to some remaining challenges for CS fluorescence microscopy.

cs.IT↗

arXiv2012

Compressive Fluorescence Microscopy for Biological and Hyperspectral Imaging

The mathematical theory of compressed sensing (CS) asserts that one can acquire signals from measurements whose rate is much lower than the total bandwidth. Whereas the CS theory is now well developed, challenges concerning hardware implementations of CS-based acquisition devices---especially in optics---have only started being addressed. This paper presents an implementation of compressive sensing in fluorescence microscopy and its applications to biomedical imaging. Our CS microscope combines a dynamic structured wide-field illumination and a fast and sensitive single-point fluorescence detection to enable reconstructions of images of fluorescent beads, cells and tissues with undersampling ratios (between the number of pixels and number of measurements) up to 32. We further demonstrate a hyperspectral mode and record images with 128 spectral channels and undersampling ratios up to 64, illustrating the potential benefits of CS acquisition for higher dimensional signals which typically exhibits extreme redundancy. Altogether, our results emphasize the interest of CS schemes for acquisition at a significantly reduced rate and point out to some remaining challenges for CS fluorescence microscopy.

stat.AP↗

arXiv2009

NESTA: A Fast and Accurate First-order Method for Sparse Recovery

Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the recent field of compressed sensing is already quite immense. Inspired by recent breakthroughs in the development of novel first-order methods in convex optimization, most notably Nesterov's smoothing technique, this paper introduces a fast and accurate algorithm for solving common recovery problems in signal processing. In the spirit of Nesterov's work, one of the key ideas of this algorithm is a subtle averaging of sequences of iterates, which has been shown to improve the convergence properties of standard gradient-descent algorithms. This paper demonstrates that this approach is ideally suited for solving large-scale compressed sensing reconstruction problems as 1) it is computationally efficient, 2) it is accurate and returns solutions with several correct digits, 3) it is flexible and amenable to many kinds of reconstruction problems, and 4) it is robust in the sense that its excellent performance across a wide range of problems does not depend on the fine tuning of several parameters. Comprehensive numerical experiments on realistic signals exhibiting a large dynamic range show that this algorithm compares favorably with recently proposed state-of-the-art methods. We also apply the algorithm to solve other problems for which there are fewer alternatives, such as total-variation minimization, and convex programs seeking to minimize the l1 norm of Wx under constraints, in which W is not diagonal.

math.OC↗

arXiv2009

Astronomical Data Analysis and Sparsity: from Wavelets to Compressed Sensing

Wavelets have been used extensively for several years now in astronomy for many purposes, ranging from data filtering and deconvolution, to star and galaxy detection or cosmic ray removal. More recent sparse representations such ridgelets or curvelets have also been proposed for the detection of anisotropic features such cosmic strings in the cosmic microwave background. We review in this paper a range of methods based on sparsity that have been proposed for astronomical data analysis. We also discuss what is the impact of Compressed Sensing, the new sampling theory, in astronomy for collecting the data, transferring them to the earth or reconstructing an image from incomplete measurements.

astro-ph.IM↗