← Search

Arnaud Breloy

11 accepted papers

2024

Sparse PCA with False Discovery Rate Controlled Variable Selection

ICASSP 2024accepted

Sparse principal component analysis (PCA) aims at mapping large dimensional data to a linear subspace of lower dimension. By imposing loading vectors to be sparse, it performs the double duty of dimension reduction and variable selection. Sparse PCA algorithms are usually expressed as a trade-off be…

Cited by 0SourceScholar
2024

Through-The-Wall Radar Imaging With Wall Clutter Removal Via Riemannian Optimization On The Fixed-Rank Manifold

ICASSP 2024accepted

We introduce a new method for Through-the-Wall Radar Imaging (TWRI) that detects the location of stationary targets hidden by a wall. A crucial step is the mitigation of wall returns which obscure the scene and which are characterized by their low-rankedness given the radar measurement setup. Wherea…

Cited by 0SourceScholar
2023

Robust and Globally Sparse Pca via Majorization-Minimization and Variable Splitting

ICASSP 2023accepted

This paper addresses the problem of robust and sparse PCA. We consider a formulation combining a M-estimation type robust subspace recovery term and a mixed norm that promotes structured sparsity in the basis vectors, which is especially interesting for joint dimension reduction and variable selecti…

Cited by 0SourceScholar
2022

On the Use of Geodesic Triangles between Gaussian Distributions for Classification Problems

ICASSP 2022accepted

This paper presents a new classification framework for both first and second order statistics, i.e. mean/location and covariance matrix. In the last decade, several covariance matrix classification algorithms have been proposed. They often leverage the Riemannian geometry of symmetric positive defin…

Cited by 0SourceScholar
2021

A Tyler-Type Estimator of Location and Scatter Leveraging Riemannian Optimization

ICASSP 2021accepted

We consider the problem of jointly estimating the location and scatter matrix of a Compound Gaussian distribution with unknown deterministic texture parameters. When the location is known, the Maximum Likelihood Estimator (MLE) of the scatter matrix corresponds to Tyler’s M-estimator, which can be c…

Cited by 0SourceScholar
2020

Riemannian Framework for Robust Covariance Matrix Estimation in Spiked Models

ICASSP 2020accepted

This paper aims at providing an original Riemannian geometry to derive robust covariance matrix estimators in spiked models (i.e. when the covariance matrix has a low-rank plus identity structure). The considered geometry is the one induced by the product of the Stiefel manifold and the manifold of…

Cited by 0SourceScholar
2020

Riemannian Geometry and Cramér-rao Bound for Blind Separation of Gaussian Sources

ICASSP 2020accepted

We consider the optimal performance of blind separation of Gaussian sources. In practice, this estimation problem is solved by a two-step procedure: estimation of a set of covariance matrices from the observed data and approximate joint diagonalization of this set to find the unmixing matrix. Rather…

Cited by 0SourceScholar
2018

Efficient Estimation of Scatter Matrix with Convex Structure Under $T$ -Distribution

ICASSP 2018accepted

This paper addresses structured covariance matrix estimation under t -distribution. Covariance matrices frequently reveal a particular structure due to the considered application and taking into account this structure usually improves estimation accuracy. In the framework of robust estimation, the t…

Cited by 0SourceScholar
2017

A subspace approach for shrinkage parameter selection in undersampled configuration for Regularised Tyler Estimators

ICASSP 2017accepted

Regularized Tyler Estimator's (RTE) have raised attention over the past years due to their attractive performance over a wide range of noise distributions and their natural robustness to outliers. Developing adaptive methods for the selection of the regularisation parameter α is currently an active…

Cited by 0SourceScholar