Euclid: Non-parametric point spread function field recovery through interpolation on a Graph Laplacian

 

Authors: M.A. Schmitz, J.-L. Starck, F. Ngole Mboula, N. Auricchio, J. Brinchmann, R.I. Vito Capobianco, R. Clédassou, L. Conversi, L. Corcione, N. Fourmanoit, M. Frailis, B. Garilli, F. Hormuth, D. Hu, H. Israel, S. Kermiche, T. D. Kitching, B. Kubik, M. Kunz, S. Ligori, P.B. Lilje, I. Lloro, O. Mansutti, O. Marggraf, R.J. Massey, F. Pasian, V. Pettorino, F. Raison, J.D. Rhodes, M. Roncarelli, R.P. Saglia, P. Schneider, S. Serrano, A.N. Taylor, R. Toledo-Moreo, L. Valenziano, C. Vuerli, J. Zoubian
Journal: submitted to A&A
Year: 2019
Download:  arXiv

 


Abstract

Context. Future weak lensing surveys, such as the Euclid mission, will attempt to measure the shapes of billions of galaxies in order to derive cosmological information. These surveys will attain very low levels of statistical error and systematic errors must be extremely well controlled. In particular, the point spread function (PSF) must be estimated using stars in the field, and recovered with high accuracy.
Aims. This paper's contributions are twofold. First, we take steps toward a non-parametric method to address the issue of recovering the PSF field, namely that of finding the correct PSF at the position of any galaxy in the field, applicable to Euclid. Our approach relies solely on the data, as opposed to parametric methods that make use of our knowledge of the instrument. Second, we study the impact of imperfect PSF models on the shape measurement of galaxies themselves, and whether common assumptions about this impact hold true in a Euclid scenario.
Methods. We use the recently proposed Resolved Components Analysis approach to deal with the undersampling of observed star images. We then estimate the PSF at the positions of galaxies by interpolation on a set of graphs that contain information relative to its spatial variations. We compare our approach to PSFEx, then quantify the impact of PSF recovery errors on galaxy shape measurements through image simulations.
Results. Our approach yields an improvement over PSFEx in terms of PSF model and on observed galaxy shape errors, though it is at present not sufficient to reach the required Euclid accuracy. We also find that different shape measurement approaches can react differently to the same PSF modelling errors.

Euclid preparation III. Galaxy cluster detection in the wide photometric survey, performance and algorithm selection

 

Authors: Euclid Collaboration, R. Adam, ..., S. Farrens, et al.
Journal: A&A
Year: 2019
Download: ADS | arXiv


Abstract

Galaxy cluster counts in bins of mass and redshift have been shown to be a competitive probe to test cosmological models. This method requires an efficient blind detection of clusters from surveys with a well-known selection function and robust mass estimates. The Euclid wide survey will cover 15000 deg2 of the sky in the optical and near-infrared bands, down to magnitude 24 in the H-band. The resulting data will make it possible to detect a large number of galaxy clusters spanning a wide-range of masses up to redshift ∼2. This paper presents the final results of the Euclid Cluster Finder Challenge (CFC). The objective of these challenges was to select the cluster detection algorithms that best meet the requirements of the Euclid mission. The final CFC included six independent detection algorithms, based on different techniques, such as photometric redshift tomography, optimal filtering, hierarchical approach, wavelet and friend-of-friends algorithms. These algorithms were blindly applied to a mock galaxy catalog with representative Euclid-like properties. The relative performance of the algorithms was assessed by matching the resulting detections to known clusters in the simulations. Several matching procedures were tested, thus making it possible to estimate the associated systematic effects on completeness to <3%. All the tested algorithms are very competitive in terms of performance, with three of them reaching >80% completeness for a mean purity of 80% down to masses of 1014 M⊙ and up to redshift z=2. Based on these results, two algorithms were selected to be implemented in the Euclid pipeline, the AMICO code, based on matched filtering, and the PZWav code, based on an adaptive wavelet approach.

Measuring Gravity at Cosmological Scales

Measuring Gravity at Cosmological Scales

 

Authors:  Luca Amendola , Dario Bettoni, Ana Marta Pinho Santiago Casas,
Journal: Review Paper
Year: 02/2019
Download: Inspire| Arxiv


Abstract

This paper is a pedagogical introduction to models of gravity and how to constrain them through cosmological observations. We focus on the Horndeski scalar-tensor theory and on the quantities that can be measured with a minimum of assumptions. Alternatives or extensions of General Relativity have been proposed ever since its early years. Because of Lovelock theorem, modifying gravity in four dimensions typically means adding new degrees of freedom. The simplest way is to include a scalar field coupled to the curvature tensor terms. The most general way of doing so without incurring in the Ostrogradski instability is the Horndeski Lagrangian and its extensions. Testing gravity means therefore, in its simplest term, testing the Horndeski Lagrangian. Since local gravity experiments can always be evaded by assuming some screening mechanism or that baryons are decoupled, or even that the effects of modified gravity are visible only at early times, we need to test gravity with cosmological observations in the late universe (large-scale structure) and in the early universe (cosmic microwave background). In this work we review the basic tools to test gravity at cosmological scales, focusing on model-independent measurements.

logfsigma8

 

Future constraints on the gravitational slip with the mass profiles of galaxy clusters


Abstract

The gravitational slip parameter is an important discriminator between large classes of gravity theories at cosmological and astrophysical scales. In this work we use a combination of simulated information of galaxy cluster mass profiles, inferred by Strong+Weak lensing analyses and by the study of the dynamics of the cluster member galaxies, to reconstruct the gravitational slip parameter η and predict the accuracy with which it can be constrained with current and future galaxy cluster surveys. Performing a full-likelihood statistical analysis, we show that galaxy cluster observations can constrain η down to the percent level already with a few tens of clusters. We discuss the significance of possible systematics, and show that the cluster masses and numbers of galaxy members used to reconstruct the dynamics mass profile have a mild effect on the predicted constraints.

Determining thermal dust emission from Planck HFI data using a sparse, parametric technique

 

Authors: M.O. Irfan, J.Bobin, M-A.Miville-Deschenes, I.Grenier 
Journal: A&A
Year: 2018
Download: ADS | arXiv


Abstract

Context: The Planck data releases have provided the community with sub-millimetre and radio observations of the full-sky at unprecedented resolutions. We make use of the Planck 353, 545 and 857 GHz maps alongside the IRAS 3000 GHz map. These maps contain information on the cosmic microwave background (CMB), cosmic infrared background (CIB), extragalactic point sources and diffuse thermal dust emission. Aims: We aim to determine the modified black body (MBB) model parameters of thermal dust emission in total intensity and produce all sky maps of pure thermal dust, having separated this Galactic component from the CMB and CIB. Methods: This separation is completed using a new, sparsity-based, parametric method which we refer to as premise. The method comprises of three main stages: 1) filtering of the raw data to reduce the effect of the CIB on the MBB fit. 2) fitting an MBB model to the filtered data across super-pixels of various sizes determined by the algorithm itself and 3) refining these super-pixel estimates into full resolution maps of the MBB parameters. Results: We present our maps of MBB temperature, spectral index and optical depth at 5 arcmin resolution and compare our estimates to those of GNILC as well as the two-step MBB fit presented by the Planck collaboration in 2013. Conclusions: By exploiting sparsity we avoid the need for smoothing, enabling us to produce the first full resolution MBB parameter maps from intensity measurements of thermal dust emission.We consider the premise parameter estimates to be competitive with the existing state-of-the-art solutions, outperforming these methods within low signal-to-noise regions as we account for the CIB without removing thermal dust emission through over-smoothing.

Blind separation of a large number of sparse sources

 

Authors: C. Kervazo, J. Bobin, C. Chenot
Journal: Signal Processing
Year: 2018
Download: Paper


Abstract

Blind Source Separation (BSS) is one of the major tools to analyze multispectral data with applications that range from astronomical to biomedical signal processing. Nevertheless, most BSS methods fail when the number of sources becomes large, typically exceeding a few tens. Since the ability to estimate large number of sources is paramount in a very wide range of applications, we introduce a new algorithm, coined block-Generalized Morphological Component Analysis (bGMCA) to specifically tackle sparse BSS problems when large number of sources need to be estimated. Sparse BSS being a challenging nonconvex inverse problem in nature, the role played by the algorithmic strategy is central, especially when many sources have to be estimated. For that purpose, the bGMCA algorithm builds upon block-coordinate descent with intermediate size blocks. Numerical experiments are provided that show the robustness of the bGMCA algorithm when the sources are numerous. Comparisons have been carried out on realistic simulations of spectroscopic data.

A Distributed Learning Architecture for Scientific Imaging Problems

 

Authors: A. Panousopoulou, S. Farrens, K. Fotiadou, A. Woiselle, G. Tsagkatakis, J-L. Starck,  P. Tsakalides
Journal: arXiv
Year: 2018
Download: ADS | arXiv


Abstract

Current trends in scientific imaging are challenged by the emerging need of integrating sophisticated machine learning with Big Data analytics platforms. This work proposes an in-memory distributed learning architecture for enabling sophisticated learning and optimization techniques on scientific imaging problems, which are characterized by the combination of variant information from different origins. We apply the resulting, Spark-compliant, architecture on two emerging use cases from the scientific imaging domain, namely: (a) the space variant deconvolution of galaxy imaging surveys (astrophysics), (b) the super-resolution based on coupled dictionary training (remote sensing). We conduct evaluation studies considering relevant datasets, and the results report at least 60\% improvement in time response against the conventional computing solutions. Ultimately, the offered discussion provides useful practical insights on the impact of key Spark tuning parameters on the speedup achieved, and the memory/disk footprint.

Scale-invariant alternatives to general relativity. The inflation–dark-energy connection


Abstract

We discuss the cosmological phenomenology of biscalar--tensor models
displaying a maximally symmetric Einstein--frame kinetic sector and
constructed on the basis of scale symmetry and volume--preserving
diffeomorphisms. These theories contain a single dimensionful
parameter $\Lambda_0$---associated with the invariance under the
aforementioned restricted coordinate transformations---and a massless
dilaton field. At large field values these scenarios lead to inflation
with no generation of isocurvature perturbations. The corresponding
predictions depend only on two dimensionless parameters, which
characterize the curvature of the field--manifold and the leading
order behavior of the inflationary potential. For $\Lambda_0=0$ the
scale symmetry is unbroken and the dilaton admits only derivative
couplings to matter, evading all fifth force constraints. For
$\Lambda_0\neq 0$ the field acquires a run-away potential that can
support a dark energy dominated era at late times. We confront a
minimalistic realization of this appealing framework with observations
using a Markov-Chain-Monte-Carlo approach, with likelihoods from
present BAO, SNIa and CMB data. A Bayesian model comparison indicates
a preference for the considered model over $\Lambda$CDM, under certain
assumptions for the priors. The impact of possible consistency
relations among the early and late Universe dynamics that can appear
within this setting is discussed with the use of correlation
matrices. The results indicate that a precise determination of the
inflationary observables and the dark energy equation--of--state could
significantly constraint the model parameters.

Distinguishing standard and modified gravity cosmologies with machine learning

 

Authors: A. Peel, F. Lalande, J.-L. Starck, V. Pettorino, J. Merten,  C. Giocoli, M. Meneghetti,  M. Baldi
Journal: Submitted to PRL
Year: 2018
Download: ADS | arXiv


Abstract

We present a convolutional neural network to identify distinct cosmological scenarios based on the weak-lensing maps they produce. Modified gravity models with massive neutrinos can mimic the standard concordance model in terms of Gaussian weak-lensing observables, limiting a deeper understanding of what causes cosmic acceleration. We demonstrate that a network trained on simulated clean convergence maps, condensed into a novel representation, can discriminate between such degenerate models with 83%-100% accuracy. Our method outperforms conventional statistics by up to 40% and is more robust to noise.

On the dissection of degenerate cosmologies with machine learning

 

Authors: J. Merten,  C. Giocoli, M. Baldi, M. Meneghetti, A. Peel, F. Lalande, J.-L. Starck, V. Pettorino
Journal: Submitted to MNRAS
Year: 2018
Download: ADS | arXiv


Abstract

Based on the DUSTGRAIN-pathfinder suite of simulations, we investigate observational degeneracies between nine models of modified gravity and massive neutrinos. Three types of machine learning techniques are tested for their ability to discriminate lensing convergence maps by extracting dimensional reduced representations of the data. Classical map descriptors such as the power spectrum, peak counts and Minkowski functionals are combined into a joint feature vector and compared to the descriptors and statistics that are common to the field of digital image processing. To learn new features directly from the data we use a Convolutional Neural Network (CNN). For the mapping between feature vectors and the predictions of their underlying model, we implement two different classifiers; one based on a nearest-neighbour search and one that is based on a fully connected neural network. We find that the neural network provides a much more robust classification than the nearest-neighbour approach and that the CNN provides the most discriminating representation of the data. It achieves the cleanest separation between the different models and the highest classification success rate of 59% for a single source redshift. Once we perform a tomographic CNN analysis, the total classification accuracy increases significantly to 76% with no observational degeneracies remaining. Visualising the filter responses of the CNN at different network depths provides us with the unique opportunity to learn from very complex models and to understand better why they perform so well.