Looking for Equivalence between Maximum Likelihood and Sparse DOA Estimators

Sparse Direction-of-Arrival estimators depend on the regularization parameter <tex>$\lambda$</tex> which is often empirically tuned. In this work, conducted under the vectorized covariance matrix model, we are looking for theoretical equivalence between the Maximum Likelihood (ML) and sparse estimators. We show that under mild conditions, <tex>$\lambda$</tex> can be chosen thanks to the distribution of the minimum of the ML criterion in the case of two impinging sources. We derive this distribution under complex non-circular Gaussian noise. The corresponding <tex>$\lambda$</tex> choice is <tex>$\theta{-}$</tex> invariant, only requiring an upper bound on the number of sources. Furthermore, it guarantees the global minimum of the sparse <tex>$\ell_{0}$</tex> -regularized criterion to be the ML solution. Numerical experiments confirm that, for the proposed <tex>$\lambda$</tex>, sparse and ML estimators yield the same statistical performance.

Authors

Institutions

Publication Details

Published
2024-08-26
DOI
https://doi.org/10.23919/eusipco63174.2024.10715091
Citations
3
Primary Topic
Rough Sets and Fuzzy Logic
Type
article
Field-Weighted Citation Impact
1.08
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Looking for Equivalence between Maximum Likelihood and Sparse DOA Estimators

Anne Ferréol, Alice Delmer, Thomas Aussaguès, Pascal Larzabal
3 citations
Rough Sets and Fuzzy Logic
1.08
article

Looking for Equivalence between Maximum Likelihood and Sparse DOA Estimators

Anne Ferréol, Alice Delmer, Thomas Aussaguès, Pascal Larzabal
article en
3 citations

Abstract

Sparse Direction-of-Arrival estimators depend on the regularization parameter <tex>$\lambda$</tex> which is often empirically tuned. In this work, conducted under the vectorized covariance matrix model, we are looking for theoretical equivalence between the Maximum Likelihood (ML) and sparse estimators. We show that under mild conditions, <tex>$\lambda$</tex> can be chosen thanks to the distribution of the minimum of the ML criterion in the case of two impinging sources. We derive this distribution under complex non-circular Gaussian noise. The corresponding <tex>$\lambda$</tex> choice is <tex>$\theta{-}$</tex> invariant, only requiring an upper bound on the number of sources. Furthermore, it guarantees the global minimum of the sparse <tex>$\ell_{0}$</tex> -regularized criterion to be the ML solution. Numerical experiments confirm that, for the proposed <tex>$\lambda$</tex>, sparse and ML estimators yield the same statistical performance.

Université Paris-Saclay (FR), Laboratoire des systèmes et applications des technologies de l'information et de l'énergie (FR), Thales (France) (FR)
Openalex Percentile: Top 21%
Rough Sets and Fuzzy Logic
1.08
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.