betaFeedback

WorksPhysics and Astronomy

Learning a model of non-stationary nuisances with non-local correlations for object detection

Abstract

We tackle the problem of detecting faint objects in multivariate data corrupted by a strong and spatially correlated nuisance component in the low-sample regime. Standard covariance-based models often yield unstable or ill-conditioned estimators of the nuisance statistics, severely degrading detection performance. We propose a data-driven approach based on sparse precision matrix modeling, where the precision matrix is approximated through a pivoted sparse Cholesky factorization whose non-zeros coefficients are learned by maximum likelihood. This yields a low-complexity yet expressive statistical model of the nuisance. Building on this model, we derive a generalized likelihood ratio test for faint source detection enabling direct control of the false alarm rate. The approach is evaluated on an astrophysical application: the detection of exoplanets by high contrast imaging, where it achieves state-of-the-art performance.

Introduction

Detecting faint objects in multivariate data corrupted by a structured nuisance component is a central problem in various applications, including biomedical imaging, remote sensing, and astronomy. Many detection methods rely on second-order statistics to model the nuisance, but in practice the number of available samples is often limited. This low-sample, high-dimensional regime leads to unstable or singular covariance estimators, severely degrading maximum likelihood-based inference and detection performance. Achieving a bias–variance trade-off is thus a key challenge in such inverse problems exploiting measurement statistics.

A possible solution is to calibrate the nuisance statistics using additional data independent of the observations of interest. However, this is often impractical, as the statistics can vary significantly across datasets (e.g., due to changing conditions of observation over time in radar imaging or astronomy). Self-calibrating approaches address this challenge through covariance regularization. These include diagonal loading and shrinkage methods [1], [2], which stabilize the estimator by combining the sample covariance with another estimator of lower variance, as well as approaches that impose predefined covariance structures, such as block-diagonal or banded models, when long-range correlations are assumed negligible [3]. Hybrid strategies combining structural assumptions and nonlinear shrinkage have also been proposed [4]. While these methods improve numerical stability, they rely by construction on strong prior assumptions about the covariance structure. A more flexible alternative consists in directly modeling the inverse covariance matrix, or precision matrix, which often admits sparse representations [5]. In particular, sparse Cholesky factorizations provide a structured and computationally efficient way to approximate precision matrices while guaranteeing positive semidefiniteness [6]. However, defining the sparse structure, learning the corresponding non-zero coefficients in a fully data-driven manner, and integrating such models into an optimal detection framework remain challenging.

Our contributions. We propose a low-complexity, data-driven detection framework based on sparse precision matrix modeling of the nuisance component. The precision matrix is approximated by a pivoted sparse Cholesky factorization learned from the data by maximum likelihood, enabling stable estimation in the low-sample regime while capturing long-range (spatial) correlations (Sect. II). Building on this model, we derive a detection test with a constant false alarm rate (Sect. III). The model complexity is selected automatically via cross-validation (Sect. IV). We demonstrate the effectiveness of the proposed approach for exoplanet detection (Sect. V).

Low-Complexity Precision Matrix Model

Problem statement

We consider the general case of NN observations, where the nn-th data sample yn∈RP\boldsymbol{y}_n \in\mathbb{R}^{P} follows the forward model:

yn=fn(x)+sn,(∀n∈1 ⁣: ⁣N),(1)\boldsymbol{y}_n = f_n(\boldsymbol{x}) + \boldsymbol{s}_n,\qquad(\forall n \in1\!:\!N), \tag*{(1)}

where fn:RL→RPf_n: \mathbb{R}^{L} \to\mathbb{R}^{P} denotes a known (possibly nonlinear) mapping of the unknown parameters x∈RL\boldsymbol{x} \in\mathbb{R}^{L}, and sn\boldsymbol{s}_n is a nuisance component with sn≫fn(x)\boldsymbol{s}_n \gg f_n(\boldsymbol{x}). The mapping fnf_n depends on the considered task (object detection, image reconstruction, etc.). We also assume P≫NP \gg N, thus defining a low-sample regime.

Model of the nuisance component

We assume that the nuisance terms {sn}n∈1 ⁣: ⁣N\{\boldsymbol{s}_n\}_{n\in1\!:\!N} are random variables that are mutually independent (for n′≠nn' \ne n) but follow identical Gaussian distribution:

sn∼N(μ,Δ−1),(∀n∈1 ⁣: ⁣N).(2)\boldsymbol{s}_n \sim\mathcal{N}(\boldsymbol{\mu},\boldsymbol{\Delta}^{-1}),\qquad(\forall n \in1\!:\!N). \tag*{(2)}

with μ=defE(sn)\mu\overset{\mathrm{def}}{=} \mathbb{E}(\mathbf{s}_n) the expectation of the nuisance terms and Λ\mathbf{\Lambda} their precision matrix. We denote by Ω={μ,Λ}\mathbf{\Omega}=\{\mu,\mathbf{\Lambda}\} the nuisance statistics. Under forward model (1), the probability density function of the nn-th nuisance term is given by:

pdf⁡(sn∣Ω)=∣Λ2π∣1/2exp⁡(−12∥yn−fn(x)−μ∥Λ2),\operatorname{pdf}(\mathbf{s}_n\mid\mathbf{\Omega})=\left|\frac{\mathbf{\Lambda}}{2\pi}\right|^{1/2}\exp\left(-\frac{1}{2}\left\|\mathbf{y}_n-f_n(\mathbf{x})-\mu\right\|_{\mathbf{\Lambda}}^2\right),

where ∣Λ∣|\mathbf{\Lambda}| is the determinant of Λ\mathbf{\Lambda}, and ∥v∥Λ2=defvT⋅Λ⋅v\|\mathbf{v}\|_{\mathbf{\Lambda}}^2 \overset{\mathrm{def}}{=} \mathbf{v}^{\mathsf{T}}\cdot\mathbf{\Lambda}\cdot\mathbf{v} is the squared Mahalanobis norm. Under these assumptions, the co-log-likelihood of the data sequence {yn}n∈1:N\{\mathbf{y}_n\}_{n\in1:N} given x\mathbf{x} and Ω\mathbf{\Omega} writes:

L(x,Ω)=12∑n=1N∥yn−fn(x)−μ∥Λ2−N2log⁡(∣Λ∣)(3)\mathcal{L}(\mathbf{x},\mathbf{\Omega})=\frac{1}{2}\sum_{n=1}^{N}\left\|\mathbf{y}_n-f_n(\mathbf{x})-\mu\right\|_{\mathbf{\Lambda}}^2-\frac{N}{2}\log\left(|\mathbf{\Lambda}|\right) \tag*{(3)}

up to an irrelevant additive constant. We address in Sects. II-C-III how to accurately estimate all the unknown parameters, x\mathbf{x} and Ω\mathbf{\Omega}, from the finite set of NN data samples.

Maximum likelihood nuisance statistics

Under the models of Sects. II-A-II-B, the maximum likelihood estimators of the statistics Ω\mathbf{\Omega} knowing x\mathbf{x} reduce to the sample estimators:

μ^(x)=argmin⁡μ L(x,Ω)=1N∑n=1N(yn−fn(x)),(4)\widehat{\mu}(\mathbf{x})=\underset{\mu}{\operatorname{argmin}}\ \mathcal{L}(\mathbf{x},\mathbf{\Omega})=\frac{1}{N}\sum_{n=1}^{N}\left(\mathbf{y}_n-f_n(\mathbf{x})\right), \tag*{(4)}
Λ^(x)=argmin⁡Λ L(x,Ω)=(1N∑n=1Nrn(x)rn(x)T)−1=C^(x)−1(5)\widehat{\mathbf{\Lambda}}(\mathbf{x})=\underset{\mathbf{\Lambda}}{\operatorname{argmin}}\ \mathcal{L}(\mathbf{x},\mathbf{\Omega})=\left(\frac{1}{N}\sum_{n=1}^{N}\mathbf{r}_n(\mathbf{x})\mathbf{r}_n(\mathbf{x})^{\mathsf{T}}\right)^{-1}=\widehat{\mathbf{C}}(\mathbf{x})^{-1} \tag*{(5)}

with the residuals {rn(x)=yn−fn(x)−μ}n∈1:N\{\mathbf{r}_n(\mathbf{x})=\mathbf{y}_n-f_n(\mathbf{x})-\mu\}_{n\in1:N}. Since the rank2 of C^\widehat{\mathbf{C}} is at most NN, a consistent covariance estimate requires N≫PN\gg P. In the considered low-sample regime (P≫NP\gg N), C^\widehat{\mathbf{C}} is therefore singular, preventing direct estimation of the precision matrix Λ^\widehat{\mathbf{\Lambda}} by inversion of C^\widehat{\mathbf{C}}. To cope with this issue, we propose to use a matrix with a lower complexity such as the matrices of A family of Sparse Approximations for whitening and Preconditioning (ASAP, [7]) as an estimator of the precision matrix. We thus approximate Λ\mathbf{\Lambda} by:

Λ≈ST⋅S=PT⋅RT⋅R⋅P,(6)\mathbf{\Lambda}\approx\mathbf{S}^{\mathsf{T}}\cdot\mathbf{S}=\mathbf{P}^{\mathsf{T}}\cdot\mathbf{R}^{\mathsf{T}}\cdot\mathbf{R}\cdot\mathbf{P}, \tag*{(6)}

where S\mathbf{S} is the composition of a sparse lower triangular matrix R\mathbf{R} and of a permutation matrix P\mathbf{P}, with PT=P−1\mathbf{P}^{\mathsf{T}}=\mathbf{P}^{-1}. The symmetric and non-negative semi-definite precision matrix Λ\mathbf{\Lambda} defined in Eq. (6) can be seen as a pivoted sparse Cholesky factorization [5].

Building the sparse structure and learning its coefficients

We decompose the construction of the precision matrix estimator Λ\mathbf{\Lambda} in (6) into two steps: (i) definition of the sparse structure, and (ii) estimation of the associated coefficients.

Construction of the sparse structure: The structure of S\mathbf{S} is defined by (i) the ordering of the nodes (e.g., the pixels) and (ii), for each node, the set of connected preceding nodes. The ordering is specified by the permutation matrix P\mathbf{P}, while the connectivity is defined by:

Si={j∈1:i∣(i,j)∈S},(∀i∈1:P),(7)\mathcal{S}_i=\{j\in1:i\mid(i,j)\in\mathcal{S}\},\qquad(\forall i\in1:P), \tag*{(7)}

where Si\mathcal{S}_i denotes the set of nodes connected to node ii, and S\mathcal{S} is the sparsity pattern of R\mathbf{R}, that is the set of index pairs (i,j)(i,j) of the structural non-zeros of R\mathbf{R}. The model complexity MM is defined as the mean number of structural non-zeros per row of S\mathbf{S} and thus set the sparsity level of the model statistics. There is a variety of choices to define an ordered sparse structure S\mathcal{S} that differ by the sampling considered. A first solution is to assume P=IP\mathbf{P}=\mathbf{I}_P (i.e., no permutation) and to select, in lexicographic order, for each node ii, the previous nodes that are closest to the node ii:

Silex={j∈1:i∣j≤i,D(i,j)≤ρ},(8)\mathcal{S}_i^{\mathrm{lex}}=\{j\in1:i\mid j\leq i,\mathcal{D}(i,j)\leq\rho\}, \tag*{(8)}

where D(i,j)\mathcal{D}(i,j) is a distance (e.g., Euclidean) between nodes ii and jj, and ρ≥0\rho\geq0 controls the sparsity that is the number Mi=∣Si∣M_i=|\mathcal{S}_i| of nodes connected to the ii-th one. A finer strategy uses an ordered random sparse structure based on a random permutation and in which a node ii is simply connected to the MiM_i nearest preceding nodes. A related multi-scale structure provides a more homogeneous spatial coverage by constructing the permutation so that the density of the NN first nodes is approximately uniform whatever n∈1:Nn\in1:N.

Learning the sparse coefficients: For a fixed sparsity pattern S\mathcal{S}, the matrix S\mathbf{S} can be learned from the sample covariance (5) in the maximum likelihood sense as:

S^(x)=argmin⁡S∈S L(x,Ω)s.t.Λ=ST⋅S,(9)\widehat{\mathbf{S}}(\mathbf{x})=\underset{\mathbf{S}\in\mathcal{S}}{\operatorname{argmin}}\ \mathcal{L}(\mathbf{x},\mathbf{\Omega})\quad\text{s.t.}\quad\mathbf{\Lambda}=\mathbf{S}^{\mathsf{T}}\cdot\mathbf{S}, \tag*{(9)}
=argmin⁡S∈Str⁡(C^STS)−log⁡(∣STS∣),(10)=\underset{\mathbf{S}\in\mathcal{S}}{\operatorname{argmin}}\operatorname{tr}\left(\widehat{\mathbf{C}}\mathbf{S}^{\mathsf{T}}\mathbf{S}\right)-\log\left(|\mathbf{S}^{\mathsf{T}}\mathbf{S}|\right), \tag*{(10)}

where S\mathcal{S} denotes the set of pivoted sparse Cholesky factors with given permutation P\mathbf{P} and sparsity pattern S\mathcal{S}. Problem (10) can also be interpreted as the minimization of the Kullback–Leibler divergence between two centered Gaussian distributions, one with covariance C^\widehat{\mathbf{C}} and the other with covariance (STS)−1(\mathbf{S}^{\mathsf{T}}\mathbf{S})^{-1}. Given the sparse structure S\mathcal{S}, Problem (10) has a closed-form solution for the structural non-zero of R\mathbf{R} [7]:

RSi,i=±((C^Si,Si)−1)Si,1:Mi((C^Si,Si)−1)Mi,Mi,(∀i∈1:P),(11)\mathbf{R}_{\mathcal{S}_i,i}=\frac{\pm\left(\left(\widehat{\mathbf{C}}_{\mathcal{S}_i,\mathcal{S}_i}\right)^{-1}\right)_{\mathcal{S}_i,1:M_i}}{\sqrt{\left(\left(\widehat{\mathbf{C}}_{\mathcal{S}_i,\mathcal{S}_i}\right)^{-1}\right)_{M_i,M_i}}},\qquad(\forall i\in1:P), \tag*{(11)}

where C~(x)=(1/N)∑n=1N(Prn(x))⋅(Prn(x))T\widetilde{\mathbf{C}}(\mathbf{x})=(1/N)\sum_{n=1}^{N}(\mathbf{P}\mathbf{r}_n(\mathbf{x}))\cdot(\mathbf{P}\mathbf{r}_n(\mathbf{x}))^{\mathsf{T}} denotes the sample covariance of the permuted residuals, and C^Si,Si∈RMi×Mi\widehat{\mathbf{C}}_{\mathcal{S}_i,\mathcal{S}_i}\in\mathbb{R}^{M_i\times M_i} its restriction to the set Si\mathcal{S}_i of column indices of the structural non-zeros of the ii-th row of the sparse factor R\mathbf{R} (also corresponding to the nodes directly connected to node ii in the sparse structure). Equation (11) assumes that index ii is the last entry of Si\mathcal{S}_i, hence, at position MiM_i in this set of node indices. The sign ambiguity in (11) does not affect the resulting approximation of Λ\mathbf{\Lambda} in (6).

Detection of Faint Objects

The statistical model of the nuisance introduced in Sect. II-C is general and independent of the specific form of the forward model fn(x)f_n(x) in Eq. (1). We now specialize this model to the detection of objects parametrized by x={α,θ}x = \{\alpha, \theta\}, with α\alpha the object brightness and θ\theta its 2-dimensional position. In this setting, the forward model writes fn(x)=α pn(θ)f_n(x) = \alpha\,p_n(\theta) with pn(θ)p_n(\theta) the (known) footprint in the image yny_n of an object at position θ\theta.

Maximum likelihood brightness and uncertainty

The maximum likelihood estimator of the object brightness α\alpha knowing its position θ\theta and the statistics Ω\Omega is:

α^(θ,Ω)=arg⁡min⁡α≥0 L(α,θ,Ω)=max⁡(b(θ,Ω),0)a(θ,Ω)(12)\widehat{\alpha}(\theta,\Omega) = \underset{\alpha\ge0}{\arg\min}\ \mathcal{L}(\alpha,\theta,\Omega) = \frac{\max(b(\theta,\Omega),0)}{a(\theta,\Omega)} \tag*{(12)}

with:

a(θ,Ω)=∑n=1N∥pn(θ)∥Λ2,(13)a(\theta,\Omega) = \sum_{n=1}^{N} \lVert p_n(\theta)\rVert_{\Lambda}^{2}, \tag*{(13)}
b(θ,Ω)=∑n=1Npn(θ)⊤⋅Λ⋅(yn−μ).(14)b(\theta,\Omega) = \sum_{n=1}^{N} p_n(\theta)^{\top} \cdot\Lambda\cdot(y_n-\mu). \tag*{(14)}

The statistic bb corresponds to a cross-correlation term, while aa is a normalization factor. They provide sufficient statistics for the estimation problem. Indeed, under the Gaussian assumption with precision matrix Λ\Lambda, Var⁡[b(θ,Ω)]≈pn(θ)⊤⋅Λ⋅pn(θ)=a(θ,Ω)\operatorname{Var}[b(\theta,\Omega)] \approx p_n(\theta)^{\top}\cdot\Lambda\cdot p_n(\theta) = a(\theta,\Omega). It follows that the estimator of the flux standard-deviation is:

σ^α(θ,Ω)=1/a(θ,Ω).(15)\widehat{\sigma}_{\alpha}(\theta,\Omega) = 1/\sqrt{a(\theta,\Omega)}. \tag*{(15)}

Detection criterion

Assuming that the nuisance statistics Ω\Omega are known, detection is performed by the generalized likelihood ratio test (GLRT):

Γ(θ,Ω)=b(θ,Ω)a(θ,Ω)=α^(θ,Ω)σ^(θ,Ω)≷H1H0τ.(16)\Gamma(\theta,\Omega) = \frac{b(\theta,\Omega)}{\sqrt{a(\theta,\Omega)}} = \frac{\widehat{\alpha}(\theta,\Omega)}{\widehat{\sigma}(\theta,\Omega)} \underset{\mathcal{H}_0}{\overset{\mathcal{H}_1}{\gtrless}} \tau. \tag*{(16)}

Under the null hypothesis H0\mathcal{H}_0 and the assumed multivariate Gaussian nuisance model, Γ(θ,Ω)\Gamma(\theta,\Omega) follows a standard normal distribution N(0,1)\mathcal{N}(0,1), independently of θ\theta. A single threshold τ>0\tau> 0 thus ensures a constant false alarm rate (CFAR) detector and yields a natural interpretation of the detection criterion as a signal-to-noise ratio (SNR). Detection is performed by exhaustively evaluating (16) over a discretized (possibly subpixel) grid of candidate positions. Since the sought sources are usually faint, nuisance statistics Ω\Omega are estimated under H0\mathcal{H}_0 by assuming α=0\alpha= 0. After detection, the source flux and position are locally refined by jointly re-estimating the nuisance statistics and source parameters through a fixed-point iterative scheme, alternating closed-form flux updates (12) and continuous position optimization maximizing (16).

Unsupervised Model Complexity Selection

The performance of the proposed detector critically depends on the nuisance model complexity MM, which governs a bias–variance trade-off. If MM is too small, the model fails to capture correlations in the data. If MM is too large, the model may overfit the finite sample set and partially absorb the signal of interest into the estimated nuisance statistics Ω^\widehat{\Omega}. To set MM in an unsupervised manner, we assess how well the nuisance model predicts unseen data rather than how well it fits the training samples. We thus select MM by maximizing a leave-one-out cross-validated predictive log-likelihood (LOOCV), defined as the sum of the co-log-likelihoods of each sample yny_n evaluated under a model learned from all remaining samples.

C(M)=12∑n=1N{∥yn−μ^[n]∥Λ^[n]2−log⁡(∣Λ^[n]∣+)},(17)\mathcal{C}(M) = \frac{1}{2}\sum_{n=1}^{N}\left\{\lVert y_n-\widehat{\mu}^{[n]}\rVert_{\widehat{\Lambda}^{[n]}}^{2}-\log\left(\left\lvert\widehat{\Lambda}^{[n]}\right\rvert_{+}\right)\right\}, \tag*{(17)}

where Ω^[n]={μ^[n],Λ^[n]}\widehat{\Omega}^{[n]} = \{\widehat{\mu}^{[n]},\widehat{\Lambda}^{[n]}\} are the nuisance statistics learned with model complexity MM from the training set {yn′[n]∣n′∈1 ⁣: ⁣N,n′≠n}\{y_{n'}^{[n]} \mid n' \in1\!:\!N,n' \ne n\}, i.e., excluding sample yny_n. The LOOCV criterion C(M)\mathcal{C}(M) therefore quantifies how well a model of complexity MM generalizes to unseen data. To avoid contamination by real (bright) sources, C(M)\mathcal{C}(M) must be computed in an unbiased manner: pixels potentially affected by sources are masked when learning and/or evaluating the nuisance statistics Ω^[n]\widehat{\Omega}^{[n]}. In practice, a preliminary detection map Γ\Gamma is computed using a low-complexity model (M=2M=2 or 33) and thresholded at a high level τ\tau to conservatively identify and mask brighter sources, which are then treated as invalid data in the LOOCV procedure. The optimal model complexity M^LOOCV\widehat{M}_{\mathrm{LOOCV}} and the corresponding best sparse structure (lexicographic, random, or multiscale) are finally selected as the minimizers of the LOOCV criterion.

Results on Astronomical Data

Considered modality: direct imaging at high-contrast

We consider high-contrast imaging [8], which aims at detecting exoplanets appearing as unresolved point sources around an observed star. The data were acquired with the SPHERE instrument at the Very Large Telescope, combining adaptive optics and a coronagraph mask to suppress part of the starlight. This yields spatio-temporal data cubes {yn}n∈1:N⊂RN×P\{y_n\}_{n \in1:N} \subset\mathbb{R}^{N \times P} with typically N≃50N \simeq50 frames of P≃106P \simeq10^6 pixels. Detection is challenging due to a strong, spatially correlated nuisance caused by residual stellar leakage and optical aberrations, with exoplanet-to-star flux ratio (i.e., contrast) of order 10−510^{-5} to 10−610^{-6} before optical correction and still below 10−310^{-3} in the recorded images. This nuisance is both non-stationary and correlated at multiple spatial scales (local speckles + extended structures). During the acquisition, astrophysical sources follow a known rotation induced by Earth’s rotation, while the nuisance remains quasi-static. In the forward model, pn(θ)p_n(\theta) thus accounts for this rotation and represents the spatial signature in the nn-th frame of a source located at the 2D sky position θ\theta.

State-of-the-art detection methods exploit this signal diversity by learning a nuisance model directly from the data cube {yn}n∈1:N\{y_n\}_{n \in1:N}. Baseline approaches [9] rely on empirical modeling, such as image combination (cADI) or low-rank approximations via truncated PCA (KLIP), assuming a quasi-static nuisance across exposures. However, as shown in Figure 1(top), the nuisance is not strictly stationary across exposures: subtracting the empirical mean μ^\widehat{\mu} leaves strong correlated residuals. More advanced methods, such as PACO [10], use matched filtering and explicitly model these correlations at a local (patch) scale under a Gaussian assumption, approximating the nuisance covariance by block-diagonal structures regularized by shrinkage. The hybrid deep PACO [11] approach further combines this statistical model with a deep-learning detector trained in a supervised way.

Examples of real and synthetic residual samples

Figure 1. Top row: examples of real residual samples. Other rows: examples of synthetic samples generated from the learned nuisance model. Optimal model complexity MM has been used for rows (c–e).

Unsupervised setting and reliability of the nuisance model

We assess the relevance of the proposed unsupervised and unbiased LOOCV criterion for selecting the nuisance model complexity MM by comparing the resulting estimate M^LOOCV\widehat{M}_{\mathrm{LOOCV}} with a supervised reference M^ROC\widehat{M}_{\mathrm{ROC}}. The latter is obtained by maximizing the area under the ROC curve (AUC), which summarizes the precision–recall trade-off via the true positive rate (TPR) and false discovery rate (FDR). The AUC is computed from extensive simulations involving the injection of synthetic sources into real data using model (1). These simulations

are realistic, as the nuisance component comes from real observations and the PSF model is accurately calibrated from instrumental data. Figure 2 shows on 13 datasets that M^LOOCV\widehat{M}_{\mathrm{LOOCV}} agrees well with M^ROC\widehat{M}_{\mathrm{ROC}} when LOOCV is implemented in an unbiased manner (see Sect. IV). The LOOCV criterion also enables comparison of sparse structures, with the multi-scale structure generally performing best. In the following, both the sparse structure and the model complexity are selected fully unsupervised using LOOCV.

Unsupervised model complexity selection using LOOCV

Figure 2. Unsupervised model complexity selection using LOOCV. (a) LOOCV criterion C(M)C(M) without (left) and with (right) unbiasing, for different structures of the sparse precision matrix factor R\mathbf{R}. (b) Comparison between M^LOOCV\widehat{M}_{\mathrm{LOOCV}} and M^ROC\widehat{M}_{\mathrm{ROC}}; error bars indicate model complexities yielding detection performance (AUC) within 10% of the optimum.

Beyond model selection, we qualitatively assess the expressivity of the proposed Gaussian nuisance model. Using nuisance statistics Ω^\widehat{\Omega} learned from real data, Figure 1 compares synthetic residual samples r^n=S^Tcn\widehat{\mathbf{r}}_n=\widehat{\mathbf{S}}^{\mathsf{T}}\mathbf{c}_n generated by correlating i.i.d. Gaussian vectors cn∈RP\mathbf{c}_n\in\mathbb{R}^{P} with the learned sparse precision matrix factor ST\mathbf{S}^{\mathsf{T}}. Ignoring correlations, or modeling them only locally (local covariance or with the lexicographic structure of the sparse precision matrix factor), fails to reproduce the large-scale structures observed in real data. In contrast, the random and multi-scale structures of the sparse precision matrix factor generate very realistic samples, demonstrating the ability of the proposed model to capture both local and long-range correlations.

Performance assessment

We assess the detection performance of the proposed approach by comparing it with the state-of-the-art methods described in Sect. V-A on 13 datasets acquired under various instrumental configurations and observing conditions. Figure 3 shows representative detection maps, while Table I reports quantitative results in terms of average AUC and TPR at a low FDR (0.005), a regime of particular interest in practice. Metrics are computed on datasets processed by all algorithms for both real sources (72 in total) and synthetic sources generated as described in Sect. V-B, allowing evaluation over a wide range of fluxes and positions. The proposed method is highly competitive with respect to state-of-the-art approaches, and often achieves the best performance in the low-FDR regime which is of particular interest for astronomers.

Detection maps on real data for cADI, PCA, PACO, deep PACO, and the proposed method

Figure 3. Detection maps Γ(θ)\Gamma(\theta) on real data. Top: 200 ×\times 200 pixel region centered on the star. Bottom: full field of view for dataset #2, shown for the three best-performing algorithms. The detection threshold is set to τ=5\tau= 5 for cADI, PCA, PACO, and the proposed method (SNR-based maps), and to τ=0.5\tau= 0.5 for deep PACO (pseudo-probability map), corresponding to comparable targeted FDRs. deep PACO could not be applied to dataset #12 acquired in a spectral mode inducing highly structured nuisance patterns making the training procedure unstable.

Metric / Algo.cADIPCAPACOdeep PACOproposed
Real sources
AUC0.640.600.810.860.83
TPR (FDR=0.005)0.530.500.750.750.78
Simulated synthetic sources in real nuisance data
AUC0.590.550.740.900.89
TPR (FDR=0.005)0.520.490.720.770.86

Table 1. Detection metrics on a 200 ×\times 200 pixel ROI centered on the star. Best scores are shown in bold, second best underlined.

Using the same set of simulated sources, Figure 4 evaluates flux estimation accuracy by comparing α^\hat{\alpha} to the ground-truth αGT\alpha_{\mathrm{GT}} as a function of separation. The estimates are unbiased and in excellent agreement for sources detected at SNR Γ≥3\Gamma\ge3. At lower detection confidence, the estimation degrades, particularly close to the star, where stronger stellar residuals

Estimation metric showing the ratio of estimated to ground-truth source flux as a function of source flux and distance to the star

Figure 4. Estimation metric: color-coded ratio α^/αGT\hat{\alpha}/\alpha_{\mathrm{GT}} as a function of the groundtruth source flux αGT\alpha_{\mathrm{GT}} and of the distance to the star. Overlaid curves indicate sensitivity limits at Γ≥5\Gamma\ge5, 4, and 3 (solid, dashed, and dotted). Sources above these contours are detected with equal or higher confidence.

and reduced signal diversity induced by the limited apparent rotation of the sources make the unmixing task more difficult.

Conclusions and Perspectives

We proposed a data-driven approach to model correlated multivariate data in the low-sample regime. A low-complexity model is learned through a sparse decomposition of the precision matrix, with the model complexity selected via an unsupervised procedure. Integrating this statistical model into a detection framework yields a CFAR detector achieving state-of-the-art performance, particularly at low FDR. Future work will extend this approach to other imaging modalities and tasks, such as multi-spectral high-contrast imaging.

References

  1. [1]Y. Chen, A. Wiesel, Y.C. Eldar, and A.O. Hero, “Shrinkage algorithms for MMSE covariance estimation,” IEEE TSP, 2010.DOI
  2. [2]E. Ollila and E. Raninen, “Optimal shrinkage covariance matrix estimation under random sampling from elliptical distributions,” IEEE TSP, 2019.DOI
  3. [3]P. J. Bickel and E. Levina, “Regularized estimation of large covariance matrices,” 2008.
  4. [4]O. Ledoit and M. Wolf, “Analytical nonlinear shrinkage of large-dimensional covariance matrices,” The Annals of Statistics, vol. 48, no. 5, pp. 3043–3065, 2020.
  5. [5]N. J. Higham, “Cholesky factorization,” Wiley interdisciplinary reviews: computational statistics, vol. 1, no. 2, pp. 251–254, 2009.DOI
  6. [6]F. Schafer, M. Katzfuss, and H. Owhadi, “Sparse Cholesky factorization by Kullback–Leibler minimization,” SIAM ISC, 2021.arxiv.org/abs/2004.14455
  7. [7]E. Thiébaut, M. Tallon, L. Denis et al., “Beyond FRiM, ASAP: a family of sparse approximation for covariance matrices and preconditioners,” in Adaptive Optics Systems VIII, SPIE, 2022.DOI
  8. [8]L. Pueyo, “Direct imaging as a detection technique for exoplanets,” Handbook of Exoplanets, 2018.
  9. [9]C.A. Gomez Gonzalez, O. Wertz, et al., “VIP: Vortex image processing package for high-contrast direct imaging,” AJ, 2017.
  10. [10]O. Flasseur, L. Denis, É. Thiébaut, and M. Langlois, “Exoplanet detection in angular differential imaging by statistical learning of the nonstationarity patch covariances - The PACO algorithm,” A&A, 2018.DOI
  11. [11]O. Flasseur, T. Bodrito, J. Mairal et al., “deep PACO: Combining statistical models with deep learning for exoplanet detection and characterization in direct imaging at high contrast,” MNRAS, 2024.arxiv.org/abs/2303.02461

Paper details

vlnc:W_5vxr8zxk
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents