arXiv subjects

Jean-Luc Starck

Publications and source records attributed to Jean-Luc Starck.

At least 73 records · Page 4Linked to original sources

arXiv2018

Breaking degeneracies in modified gravity with higher (than 2nd) order weak-lensing statistics

General relativity (GR) has been well tested up to solar system scales, but it is much less certain that standard gravity remains an accurate description on the largest, that is, cosmological, scales. Many extensions to GR have been studied that are not yet ruled out by the data, including by that of the recent direct gravitational wave detections. Degeneracies among the standard model ($Λ$CDM) and modified gravity (MG) models, as well as among different MG parameters, must be addressed in order to best exploit information from current and future surveys and to unveil the nature of dark energy. We propose various higher-order statistics in the weak-lensing signal as a new set of observables able to break degeneracies between massive neutrinos and MG parameters. We have tested our methodology on so-called $f(R)$ models, which constitute a class of viable models that can explain the accelerated universal expansion by a modification of the fundamental gravitational interaction. We have explored a range of these models that still fit current observations at the background and linear level, and we show using numerical simulations that certain models which include massive neutrinos are able to mimic $Λ$CDM in terms of the 3D power spectrum of matter density fluctuations. We find that depending on the redshift and angular scale of observation, non-Gaussian information accessed by higher-order weak-lensing statistics can be used to break the degeneracy between $f(R)$ models and $Λ$CDM. In particular, peak counts computed in aperture mass maps outperform third- and fourth-order moments.

astro-ph.CO↗

arXiv2018

Learning sparse representations on the sphere

Many representation systems on the sphere have been proposed in the past, such as spherical harmonics, wavelets, or curvelets. Each of these data representations is designed to extract a specific set of features, and choosing the best fixed representation system for a given scientific application is challenging. In this paper, we show that we can learn directly a representation system from given data on the sphere. We propose two new adaptive approaches: the first is a (potentially multi-scale) patch-based dictionary learning approach, and the second consists in selecting a representation among a parametrized family of representations, the α-shearlets. We investigate their relative performance to represent and denoise complex structures on different astrophysical data sets on the sphere.

astro-ph.IM↗

arXiv2018

Convolutional Neural Networks for Spectroscopic Redshift Estimation on Euclid Data

In this paper, we address the problem of spectroscopic redshift estimation in Astronomy. Due to the expansion of the Universe, galaxies recede from each other on average. This movement causes the emitted electromagnetic waves to shift from the blue part of the spectrum to the red part, due to the Doppler effect. Redshift is one of the most important observables in Astronomy, allowing the measurement of galaxy distances. Several sources of noise render the estimation process far from trivial, especially in the low signal-to-noise regime of many astrophysical observations. In recent years, new approaches for a reliable and automated estimation methodology have been sought out, in order to minimize our reliance on currently popular techniques that heavily involve human intervention. The fulfilment of this task has evolved into a grave necessity, in conjunction with the insatiable generation of immense amounts of astronomical data. In our work, we introduce a novel approach based on Deep Convolutional Neural Networks. The proposed methodology is extensively evaluated on a spectroscopic dataset of full spectral energy galaxy distributions, modelled after the upcoming Euclid satellite galaxy survey. Experimental analysis on observations of idealistic and realistic conditions demonstrate the potent capabilities of the proposed scheme.

astro-ph.IM↗

arXiv2018

Wasserstein Dictionary Learning: Optimal Transport-based unsupervised non-linear dictionary learning

This paper introduces a new nonlinear dictionary learning method for histograms in the probability simplex. The method leverages optimal transport theory, in the sense that our aim is to reconstruct histograms using so-called displacement interpolations (a.k.a. Wasserstein barycenters) between dictionary atoms; such atoms are themselves synthetic histograms in the probability simplex. Our method simultaneously estimates such atoms, and, for each datapoint, the vector of weights that can optimally reconstruct it as an optimal transport barycenter of such atoms. Our method is computationally tractable thanks to the addition of an entropic regularization to the usual optimal transportation problem, leading to an approximation scheme that is efficient, parallel and simple to differentiate. Both atoms and weights are learned using a gradient-based descent method. Gradients are obtained by automatic differentiation of the generalized Sinkhorn iterations that yield barycenters with entropic smoothing. Because of its formulation relying on Wasserstein barycenters instead of the usual matrix product between dictionary and codes, our method allows for nonlinear relationships between atoms and the reconstruction of input data. We illustrate its application in several different image processing settings.

stat.ML↗

arXiv2017

Sparse reconstruction of the merging A520 cluster system

Merging galaxy clusters present a unique opportunity to study the properties of dark matter in an astrophysical context. These are rare and extreme cosmic events in which the bulk of the baryonic matter becomes displaced from the dark matter halos of the colliding subclusters. Since all mass bends light, weak gravitational lensing is a primary tool to study the total mass distribution in such systems. Combined with X-ray and optical analyses, mass maps of cluster mergers reconstructed from weak-lensing observations have been used to constrain the self-interaction cross-section of dark matter. The dynamically complex Abell 520 (A520) cluster is an exceptional case, even among merging systems: multi-wavelength observations have revealed a surprising high mass-to-light concentration of dark mass, the interpretation of which is difficult under the standard assumption of effectively collisionless dark matter. We revisit A520 using a new sparsity-based mass-mapping algorithm to independently assess the presence of the puzzling dark core. We obtain high-resolution mass reconstructions from two separate galaxy shape catalogs derived from Hubble Space Telescope observations of the system. Our mass maps agree well overall with the results of previous studies, but we find important differences. In particular, although we are able to identify the dark core at a certain level in both data sets, it is at much lower significance than has been reported before using the same data. As we cannot confirm the detection in our analysis, we do not consider A520 as posing a significant challenge to the collisionless dark matter scenario.

astro-ph.CO↗

arXiv2017

Joint Multichannel Deconvolution and Blind Source Separation

Blind Source Separation (BSS) is a challenging matrix factorization problem that plays a central role in multichannel imaging science. In a large number of applications, such as astrophysics, current unmixing methods are limited since real-world mixtures are generally affected by extra instrumental effects like blurring. Therefore, BSS has to be solved jointly with a deconvolution problem, which requires tackling a new inverse problem: deconvolution BSS (DBSS). In this article, we introduce an innovative DBSS approach, called DecGMCA, based on sparse signal modeling and an efficient alternative projected least square algorithm. Numerical results demonstrate that the DecGMCA algorithm performs very well on simulations. It further highlights the importance of jointly solving BSS and deconvolution instead of considering these two problems independently. Furthermore, the performance of the proposed DecGMCA algorithm is demonstrated on simulated radio-interferometric data.

stat.AP↗

arXiv2017

Space variant deconvolution of galaxy survey images

Removing the aberrations introduced by the Point Spread Function (PSF) is a fundamental aspect of astronomical image processing. The presence of noise in observed images makes deconvolution a nontrivial task that necessitates the use of regularisation. This task is particularly difficult when the PSF varies spatially as is the case for the Euclid telescope. New surveys will provide images containing thousand of galaxies and the deconvolution regularisation problem can be considered from a completely new perspective. In fact, one can assume that galaxies belong to a low-rank dimensional space. This work introduces the use of the low-rank matrix approximation as a regularisation prior for galaxy image deconvolution and compares its performance with a standard sparse regularisation technique. This new approach leads to a natural way to handle a space variant PSF. Deconvolution is performed using a Python code that implements a primal-dual splitting algorithm. The data set considered is a sample of 10 000 space-based galaxy images convolved with a known spatially varying Euclid-like PSF and including various levels of Gaussian additive noise. Performance is assessed by examining the deconvolved galaxy image pixels and shapes. The results demonstrate that for small samples of galaxies sparsity performs better in terms of pixel and shape recovery, while for larger samples of galaxies it is possible to obtain more accurate estimates of the galaxy shapes using the low-rank approximation.

astro-ph.IM↗

arXiv2016

Cosmological constraints with weak lensing peak counts and second-order statistics in a large-field survey

Peak statistics in weak lensing maps access the non-Gaussian information contained in the large-scale distribution of matter in the Universe. They are therefore a promising complement to two-point and higher-order statistics to constrain our cosmological models. To prepare for the high-precision data of next-generation surveys, we assess the constraining power of peak counts in a simulated Euclid-like survey on the cosmological parameters $Ω_\mathrm{m}$, $σ_8$, and $w_0^\mathrm{de}$. In particular, we study how the Camelus model--a fast stochastic algorithm for predicting peaks--can be applied to such large surveys. We measure the peak count abundance in a mock shear catalogue of ~5,000 sq. deg. using a multiscale mass map filtering technique. We then constrain the parameters of the mock survey using Camelus combined with approximate Bayesian computation (ABC). We find that peak statistics yield a tight but significantly biased constraint in the $σ_8$-$Ω_\mathrm{m}$ plane, indicating the need to better understand and control the model's systematics. We calibrate the model to remove the bias and compare results to those from the two-point correlation functions (2PCF) measured on the same field. In this case, we find the derived parameter $Σ_8=σ_8(Ω_\mathrm{m}/0.27)^α=0.76_{-0.03}^{+0.02}$ with $α=0.65$ for peaks, while for 2PCF the value is $Σ_8=0.76_{-0.01}^{+0.02}$ with $α=0.70$. We therefore see comparable constraining power between the two probes, and the offset of their $σ_8$-$Ω_\mathrm{m}$ degeneracy directions suggests that a combined analysis would yield tighter constraints than either measure alone. As expected, $w_0^\mathrm{de}$ cannot be well constrained without a tomographic analysis, but its degeneracy directions with the other two varied parameters are still clear for both peaks and 2PCF. (abridged)

astro-ph.CO↗

arXiv2016

High Resolution Weak Lensing Mass-Mapping Combining Shear and Flexion

We propose a new mass-mapping algorithm, specifically designed to recover small-scale information from a combination of gravitational shear and flexion. Including flexion allows us to supplement the shear on small scales in order to increase the sensitivity to substructures and the overall resolution of the convergence map without relying on strong lensing constraints. In order to preserve all available small scale information, we avoid any binning of the irregularly sampled input shear and flexion fields and treat the mass-mapping problem as a general ill-posed inverse problem, regularised using a robust multi-scale wavelet sparsity prior. The resulting algorithm incorporates redshift, reduced shear, and reduced flexion measurements for individual galaxies and is made highly efficient by the use of fast Fourier estimators. We test our reconstruction method on a set of realistic weak lensing simulations corresponding to typical HST/ACS cluster observations and demonstrate our ability to recover substructures with the inclusion of flexion which are lost if only shear information is used. In particular, we can detect substructures at the 15$^{\prime \prime}$ scale well outside of the critical region of the clusters. In addition, flexion also helps to constrain the shape of the central regions of the main dark matter halos. Our mass-mapping software, called Glimpse2D, is made freely available at http://www.cosmostat.org/software/glimpse .

astro-ph.CO↗

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↗

arXiv2015

Weak lensing reconstructions in 2D & 3D: implications for cluster studies

We compare the efficiency with which 2D and 3D weak lensing mass mapping techniques are able to detect clusters of galaxies using two state-of-the-art mass reconstruction techniques: MRLens in 2D and GLIMPSE in 3D. We simulate otherwise-empty cluster fields for 96 different virial mass-redshift combinations spanning the ranges $3\times10^{13}h^{-1}M_\odot \le M_{vir}\le 10^{15}h^{-1}M_\odot$ and $0.05 \le z_{\rm cl} \le 0.75$, and for each generate 1000 realisations of noisy shear data in 2D and 3D. For each field, we then compute the cluster (false) detection rate as the mean number of cluster (false) detections per reconstruction over the sample of 1000 reconstructions. We show that both MRLens and GLIMPSE are effective tools for the detection of clusters from weak lensing measurements, and provide comparable quality reconstructions at low redshift. At high redshift, GLIMPSE reconstructions offer increased sensitivity in the detection of clusters, yielding cluster detection rates up to a factor of $\sim 10\times$ that seen in 2D reconstructions using MRLens. We conclude that 3D mass mapping techniques are more efficient for the detection of clusters of galaxies in weak lensing surveys than 2D methods, particularly since 3D reconstructions yield unbiased estimators of both the mass and redshift of the detected clusters directly.

astro-ph.CO↗

arXiv2015

Cosmic Dawn and Epoch of Reionization Foreground Removal with the SKA

The exceptional sensitivity of the SKA will allow observations of the Cosmic Dawn and Epoch of Reionization (CD/EoR) in unprecedented detail, both spectrally and spatially. This wealth of information is buried under Galactic and extragalactic foregrounds, which must be removed accurately and precisely in order to reveal the cosmological signal. This problem has been addressed already for the previous generation of radio telescopes, but the application to SKA is different in many aspects. In this chapter we summarise the contributions to the field of foreground removal in the context of high redshift and high sensitivity 21-cm measurements. We use a state-of-the-art simulation of the SKA Phase 1 observations complete with cosmological signal, foregrounds and frequency-dependent instrumental effects to test both parametric and non-parametric foreground removal methods. We compare the recovered cosmological signal using several different statistics and explore one of the most exciting possibilities with the SKA --- imaging of the ionized bubbles. We find that with current methods it is possible to remove the foregrounds with great accuracy and to get impressive power spectra and images of the cosmological signal. The frequency-dependent PSF of the instrument complicates this recovery, so we resort to splitting the observation bandwidth into smaller segments, each of a common resolution. If the foregrounds are allowed a random variation from the smooth power law along the line of sight, methods exploiting the smoothness of foregrounds or a parametrization of their behaviour are challenged much more than non-parametric ones. However, we show that correction techniques can be implemented to restore the performances of parametric approaches, as long as the first-order approximation of a power law stands.

astro-ph.IM↗

arXiv2015

Overview of Complementarity and Synergy with Other Wavelengths in Cosmology in the SKA era

We give an overview of complementarity and synergy in cosmology between the Square Kilometre Array and future survey projects in other wavelengths. In the SKA era, precision cosmology will be limited by systematic errors and cosmic variance, rather than statistical errors. However, combining and/or cross-correlating multi-wavelength data, from the SKA to the cosmic microwave background, optical/infrared and X-ray, substantially reduce these limiting factors. In this chapter, we summarize future survey projects and show highlights of complementarity and synergy, which can be very powerful to probe major cosmological problems such as dark energy, modified gravity and primordial non-Gaussianity.

astro-ph.CO↗

arXiv2015

Testing foundations of modern cosmology with SKA all-sky surveys

Continuum and HI surveys with the Square Kilometre Array (SKA) will allow us to probe some of the most fundamental assumptions of modern cosmology, including the Cosmological Principle. SKA all-sky surveys will map an enormous slice of space-time and reveal cosmology at superhorizon scales and redshifts of order unity. We illustrate the potential of these surveys and discuss the prospects to measure the cosmic radio dipole at high fidelity. We outline several potentially transformational tests of cosmology to be carried out by means of SKA all-sky surveys.

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↗

arXiv2014

Super-resolution method using sparse regularization for point-spread function recovery

In large-scale spatial surveys, such as the forthcoming ESA Euclid mission, images may be undersampled due to the optical sensors sizes. Therefore, one may consider using a super-resolution (SR) method to recover aliased frequencies, prior to further analysis. This is particularly relevant for point-source images, which provide direct measurements of the instrument point-spread function (PSF). We introduce SPRITE, SParse Recovery of InsTrumental rEsponse, which is an SR algorithm using a sparse analysis prior. We show that such a prior provides significant improvements over existing methods, especially on low SNR PSFs.

cs.CV↗

arXiv2014

NMF with Sparse Regularizations in Transformed Domains

Non-negative blind source separation (non-negative BSS), which is also referred to as non-negative matrix factorization (NMF), is a very active field in domains as different as astrophysics, audio processing or biomedical signal processing. In this context, the efficient retrieval of the sources requires the use of signal priors such as sparsity. If NMF has now been well studied with sparse constraints in the direct domain, only very few algorithms can encompass non-negativity together with sparsity in a transformed domain since simultaneously dealing with two priors in two different domains is challenging. In this article, we show how a sparse NMF algorithm coined non-negative generalized morphological component analysis (nGMCA) can be extended to impose non-negativity in the direct domain along with sparsity in a transformed domain, with both analysis and synthesis formulations. To our knowledge, this work presents the first comparison of analysis and synthesis priors ---as well as their reweighted versions--- in the context of blind source separation. Comparisons with state-of-the-art NMF algorithms on realistic data show the efficiency as well as the robustness of the proposed algorithms.

stat.ML↗

arXiv2013

Sparse and Non-Negative BSS for Noisy Data

Non-negative blind source separation (BSS) has raised interest in various fields of research, as testified by the wide literature on the topic of non-negative matrix factorization (NMF). In this context, it is fundamental that the sources to be estimated present some diversity in order to be efficiently retrieved. Sparsity is known to enhance such contrast between the sources while producing very robust approaches, especially to noise. In this paper we introduce a new algorithm in order to tackle the blind separation of non-negative sparse sources from noisy measurements. We first show that sparsity and non-negativity constraints have to be carefully applied on the sought-after solution. In fact, improperly constrained solutions are unlikely to be stable and are therefore sub-optimal. The proposed algorithm, named nGMCA (non-negative Generalized Morphological Component Analysis), makes use of proximal calculus techniques to provide properly constrained solutions. The performance of nGMCA compared to other state-of-the-art algorithms is demonstrated by numerical experiments encompassing a wide variety of settings, with negligible parameter tuning. In particular, nGMCA is shown to provide robustness to noise and performs well on synthetic mixtures of real NMR spectra.

stat.ML↗