arXiv subjects

André Ferrari

Publications and source records attributed to André Ferrari.

At least 19 recordsLinked to original sources

arXiv2026

Weak Lensing with the SKAO: Radio Shear Measurement

Cosmic shear measurements have traditionally been dominated by optical surveys, which offer higher resolution, better sensitivity, higher galaxy number density, and wider area coverage than their radio counterparts. With the advent of upcoming radio surveys, particularly those planned with the SKA-Mid, we would reach the high sensitivity and resolution required for weak lensing studies, allowing radio observations to begin competing with optical surveys in this domain. However, radio observations are affected by fundamentally different instrumental and astrophysical systematics, meaning that shape and shear measurement techniques developed for optical surveys cannot be straightforwardly applied. Fully realizing the weak lensing potential of these next generation radio surveys therefore requires the development and validation of methods tailored specifically for radio datasets. In this chapter, we present a simulation pipeline to generate realistic observations of isolated radio galaxies based on the SKA-Mid AA4 array configuration. We apply three recent radio shape measurement techniques: SuperCALS, RadioLensfit, and DeepShape, to assess their performance on these simulations. Our results show that RadioLensfit and DeepShape yield the most accurate shape estimates, although RadioLensfit is significantly more computationally intensive. We also perform shear recovery on simulated data using RadioLensfit and DeepShape, finding multiplicative and additive shear biases of order a few $10^{-2}$ and $10^{-4}$, respectively. Finally, we highlight the challenge of source separation, which will play a critical role in the success of future radio weak lensing analyses.

astro-ph.GA↗

arXiv2025

Diffusion models for polarimetric reconstruction of circumstellar environments

In this paper, we propose an approach combining diffusion models and inverse problems for the reconstruction of circumstellar disk images. Our method builds upon the Rhapsodie framework for polarimetric imaging, substituting its classical prior with a diffusion model trained on synthetic data. Our formulation explicitly incorporates stellar leakage while efficiently handling missing data and high level noise inherent to high-contrast polarimetric imaging. Experiments show significant improvement over conventional methods within our framework of assumptions, opening new perspectives for studying circumstellar environments.

astro-ph.IM↗

arXiv2024

A comparison of solar and stellar coronagraphs that make use of external occulters

Solar and stellar externally occulted coronagraphs share similar concepts, but are actually very different because of geometric characteristics. Solar occulters were first developed with a simple geometric model of diffraction perpendicular to the occulter edges. We apply this mere approach to starshades, and introduce a simple shifted circular integral of the occulter which allows to illustrate the influence of the number of petals on the extent of the deep central dark zone. We illustrate the reasons for the presence of an internal coronagraph in the solar case and its absence in the exoplanet case.

astro-ph.IM↗

arXiv2024

Computation of the Fresnel diffraction of starshades based on a polygonal approximation

The design of starshades, i.e. external occulters for stellar coronography, relies on the fast and precise computation of their associated diffraction patterns of incoming plane waves in the telescope aperture plane. We present here a method based on a polygonal approximation of the occulter's shape, that allows fast computation of their diffraction patterns in the Fresnel approximation, without aliasing artefacts. It is competitive with respect to methods based on direct 2D Fourier transforms, or Boundary Diffraction Wave algorithms.

astro-ph.IM↗

arXiv2021

Online change-point detection with kernels

Change-points in time series data are usually defined as the time instants at which changes in their properties occur. Detecting change-points is critical in a number of applications as diverse as detecting credit card and insurance frauds, or intrusions into networks. Recently the authors introduced an online kernel-based change-point detection method built upon direct estimation of the density ratio on consecutive time intervals. This paper further investigates this algorithm, making improvements and analyzing its behavior in the mean and mean square sense, in the absence and presence of a change point. These theoretical analyses are validated with Monte Carlo simulations. The detection performance of the algorithm is illustrated through experiments on real-world data and compared to state of the art methodologies.

eess.SP↗

arXiv2020

Concentration bounds for linear Monge mapping estimation and optimal transport domain adaptation

This article investigates the quality of the estimator of the linear Monge mapping between distributions. We provide the first concentration result on the linear mapping operator and prove a sample complexity of $n^{-1/2}$ when using empirical estimates of first and second order moments. This result is then used to derive a generalization bound for domain adaptation with optimal transport. As a consequence, this method approaches the performance of theoretical Bayes predictor under mild conditions on the covariance structure of the problem. We also discuss the computational complexity of the linear mapping estimation and show that when the source and target are stationary the mapping is a convolution that can be estimated very efficiently using fast Fourier transforms. Numerical experiments reproduce the behavior of the proven bounds on simulated and real data for mapping estimation and domain adaptation on images.

stat.ML↗

arXiv2020

Online Graph-Based Change Point Detection in Multiband Image Sequences

The automatic detection of changes or anomalies between multispectral and hyperspectral images collected at different time instants is an active and challenging research topic. To effectively perform change-point detection in multitemporal images, it is important to devise techniques that are computationally efficient for processing large datasets, and that do not require knowledge about the nature of the changes. In this paper, we introduce a novel online framework for detecting changes in multitemporal remote sensing images. Acting on neighboring spectra as adjacent vertices in a graph, this algorithm focuses on anomalies concurrently activating groups of vertices corresponding to compact, well-connected and spectrally homogeneous image regions. It fully benefits from recent advances in graph signal processing to exploit the characteristics of the data that lie on irregular supports. Moreover, the graph is estimated directly from the images using superpixel decomposition algorithms. The learning algorithm is scalable in the sense that it is efficient and spatially distributed. Experiments illustrate the detection and localization performance of the method.

eess.SP↗

arXiv2019

Distributed Change Detection in Streaming Graph Signals

Detecting abrupt changes in streaming graph signals is relevant in a variety of applications ranging from energy and water supplies, to environmental monitoring. In this paper, we address this problem when anomalies activate localized groups of nodes in a network. We introduce an online change-point detection algorithm, which is fully distributed across nodes to monitor large-scale dynamic networks. We analyze the detection statistics for controlling the probability of a global type 1 error. Finally we illustrate the detection and localization performance with simulated data.

eess.SP↗

arXiv2019

A parallel & automatically tuned algorithm for multispectral image deconvolution

In the era of big data, radio astronomical image reconstruction algorithms are challenged to estimate clean images given limited computing resources and time. This article is driven by the need for large scale image reconstruction for the future Square Kilometre Array (SKA), which will become in the next decades the largest low and intermediate frequency radio telescope in the world. This work proposes a scalable wideband deconvolution algorithm called MUFFIN, which stands for "MUlti Frequency image reconstruction For radio INterferometry". MUFFIN estimates the sky images in various frequency bands given the corresponding dirty images and point spread functions. The reconstruction is achieved by minimizing a data fidelity term and joint spatial and spectral sparse analysis regularization terms. It is consequently non-parametric w.r.t. the spectral behaviour of radio sources. MUFFIN algorithm is endowed with a parallel implementation and an automatic tuning of the regularization parameters, making it scalable and well suited for big data applications such as SKA. Comparisons between MUFFIN and the state-of-the-art wideband reconstruction algorithm are provided.

astro-ph.IM↗

arXiv2018

Robust distributed calibration of radio interferometers with direction dependent distortions

In radio astronomy, accurate calibration is of crucial importance for the new generation of radio interferometers. More specifically, because of the potential presence of outliers which affect the measured data, robustness needs to be ensured. On the other hand, calibration is improved by taking advantage of these new instruments and exploiting the known structure of parameters of interest across frequency. Therefore, we propose in this paper an iterative robust multi-frequency calibration algorithm based on a distributed and consensus optimization scheme which aims to estimate the complex gains of the receivers and the directional perturbations caused by the ionosphere. Numerical simulations reveal that the proposed distributed calibration technique outperforms the conventional non-robust algorithm and per-channel calibration.

astro-ph.IM↗

arXiv2018

Robust Calibration of Radio Interferometers in Multi-Frequency Scenario

This paper investigates calibration of sensor arrays in the radio astronomy context. Current and future radio telescopes require computationally efficient algorithms to overcome the new technical challenges as large collecting area, wide field of view and huge data volume. Specifically, we study the calibration of radio interferometry stations with significant direction dependent distortions. We propose an iterative robust calibration algorithm based on a relaxed maximum likelihood estimator for a specific context: i) observations are affected by the presence of outliers and ii) parameters of interest have a specific structure depending on frequency. Variation of parameters across frequency is addressed through a distributed procedure, which is consistent with the new radio synthesis arrays where the full observing bandwidth is divided into multiple frequency channels. Numerical simulations reveal that the proposed robust distributed calibration estimator outperforms the conventional non-robust algorithm and/or the mono-frequency case.

stat.AP↗

arXiv2018

Bayesian Calibration using Different Prior Distributions: an Iterative Maximum A Posteriori Approach for Radio Interferometers

In this paper, we aim to design robust estimation techniques based on the compound-Gaussian (CG) process and adapted for calibration of radio interferometers. The motivation beyond this is due to the presence of outliers leading to an unrealistic traditional Gaussian noise assumption. Consequently, to achieve robustness, we adopt a maximum a posteriori (MAP) approach which exploits Bayesian statistics and follows a sequential updating procedure here. The proposed algorithm is applied in a multi-frequency scenario in order to enhance the estimation and correction of perturbation effects. Numerical simulations assess the performance of the proposed algorithm for different noise models, Student's t, K, Laplace, Cauchy and inverse-Gaussian compound-Gaussian distributions w.r.t. the classical non-robust Gaussian noise assumption.

stat.AP↗

arXiv2017

Proximity Operators for Phase Retrieval

We present a new formulation of a family of proximity operators that generalize the projector step for phase retrieval. These proximity operators for noisy intensity measurements can replace the classical "noise free" projection in any projection-based algorithm. They are derived from a maximum likelihood formulation and admit closed form solutions for both the Gaussian and the Poisson cases. In addition, we extend these proximity operators to undersampled intensity measurements. To assess their performance, these operators are exploited in a classical Gerchberg Saxton algorithm. We present numerical experiments showing that the reconstructed complex amplitudes with these proximity operators perform always better than using the classical intensity projector while their computational overhead is moderate.

astro-ph.IM↗

arXiv2017

Diffusion LMS for Multitask Problems with Local Linear Equality Constraints

We consider distributed multitask learning problems over a network of agents where each agent is interested in estimating its own parameter vector, also called task, and where the tasks at neighboring agents are related according to a set of linear equality constraints. Each agent possesses its own convex cost function of its parameter vector and a set of linear equality constraints involving its own parameter vector and the parameter vectors of its neighboring agents. We propose an adaptive stochastic algorithm based on the projection gradient method and diffusion strategies in order to allow the network to optimize the individual costs subject to all constraints. Although the derivation is carried out for linear equality constraints, the technique can be applied to other forms of convex constraints. We conduct a detailed mean-square-error analysis of the proposed algorithm and derive closed-form expressions to predict its learning behavior. We provide simulations to illustrate the theoretical findings. Finally, the algorithm is employed for solving two problems in a distributed manner: a minimum-cost flow problem over a network and a space-time varying field reconstruction problem.

cs.MA↗

arXiv2017

Distributed Deblurring of Large Images of Wide Field-Of-View

Image deblurring is an economic way to reduce certain degradations (blur and noise) in acquired images. Thus, it has become essential tool in high resolution imaging in many applications, e.g., astronomy, microscopy or computational photography. In applications such as astronomy and satellite imaging, the size of acquired images can be extremely large (up to gigapixels) covering wide field-of-view suffering from shift-variant blur. Most of the existing image deblurring techniques are designed and implemented to work efficiently on centralized computing system having multiple processors and a shared memory. Thus, the largest image that can be handle is limited by the size of the physical memory available on the system. In this paper, we propose a distributed nonblind image deblurring algorithm in which several connected processing nodes (with reasonable computational resources) process simultaneously different portions of a large image while maintaining certain coherency among them to finally obtain a single crisp image. Unlike the existing centralized techniques, image deblurring in distributed fashion raises several issues. To tackle these issues, we consider certain approximations that trade-offs between the quality of deblurred image and the computational resources required to achieve it. The experimental results show that our algorithm produces the similar quality of images as the existing centralized techniques while allowing distribution, and thus being cost effective for extremely large images.

math.OC↗

arXiv2017

Multi-frequency image reconstruction for radio-interferometry with self-tuned regularization parameters

As the world's largest radio telescope, the Square Kilometer Array (SKA) will provide radio interferometric data with unprecedented detail. Image reconstruction algorithms for radio interferometry are challenged to scale well with TeraByte image sizes never seen before. In this work, we investigate one such 3D image reconstruction algorithm known as MUFFIN (MUlti-Frequency image reconstruction For radio INterferometry). In particular, we focus on the challenging task of automatically finding the optimal regularization parameter values. In practice, finding the regularization parameters using classical grid search is computationally intensive and nontrivial due to the lack of ground- truth. We adopt a greedy strategy where, at each iteration, the optimal parameters are found by minimizing the predicted Stein unbiased risk estimate (PSURE). The proposed self-tuned version of MUFFIN involves parallel and computationally efficient steps, and scales well with large- scale data. Finally, numerical results on a 3D image are presented to showcase the performance of the proposed approach.

cs.CV↗

arXiv2016

Multitask diffusion adaptation over asynchronous networks

The multitask diffusion LMS is an efficient strategy to simultaneously infer, in a collaborative manner, multiple parameter vectors. Existing works on multitask problems assume that all agents respond to data synchronously. In several applications, agents may not be able to act synchronously because networks can be subject to several sources of uncertainties such as changing topology, random link failures, or agents turning on and off for energy conservation. In this work, we describe a model for the solution of multitask problems over asynchronous networks and carry out a detailed mean and mean-square error analysis. Results show that sufficiently small step-sizes can still ensure both stability and performance. Simulations and illustrative examples are provided to verify the theoretical findings. The framework is applied to a particular application involving spectral sensing.

eess.SY↗

arXiv2016

Proximal Multitask Learning over Networks with Sparsity-inducing Coregularization

In this work, we consider multitask learning problems where clusters of nodes are interested in estimating their own parameter vector. Cooperation among clusters is beneficial when the optimal models of adjacent clusters have a good number of similar entries. We propose a fully distributed algorithm for solving this problem. The approach relies on minimizing a global mean-square error criterion regularized by non-differentiable terms to promote cooperation among neighboring clusters. A general diffusion forward-backward splitting strategy is introduced. Then, it is specialized to the case of sparsity promoting regularizers. A closed-form expression for the proximal operator of a weighted sum of $\ell_1$-norms is derived to achieve higher efficiency. We also provide conditions on the step-sizes that ensure convergence of the algorithm in the mean and mean-square error sense. Simulations are conducted to illustrate the effectiveness of the strategy.

eess.SY↗