On the Recursions of Robust COMET Algorithm for Convexly Structured Shape Matrix - Ifsttar Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

On the Recursions of Robust COMET Algorithm for Convexly Structured Shape Matrix

Résumé

This paper addresses robust estimation of structured shape (normalized covariance) matrices. Shape matrices most often own a particular structure depending on the application of interest and taking this structure into account improves estimation accuracy. In the framework of robust estimation, we introduce a recursive robust shape matrix estimation technique based on Tyler's M-estimate for convexly structured shape matrices. We prove that the proposed estimator is consistent, asymptotically efficient and Gaussian distributed and we notice that it reaches its asymptotic regime faster as the number of recursions increases. Finally, in the particular wide spreaded case of Hermitian persymmetric structure, we study the convergence of the recursions of the proposed algorithm.
Fichier principal
Vignette du fichier
V7.pdf (366.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02155905 , version 1 (14-06-2019)

Identifiants

Citer

Bruno Meriaux, Chengfang Ren, Arnaud Breloy, Mohammed Nabil El Korso, P Forster, et al.. On the Recursions of Robust COMET Algorithm for Convexly Structured Shape Matrix. 27th European Signal Processing Conference (EUSIPCO 2019), Sep 2019, A Coruña, Spain. ⟨10.23919/eusipco.2019.8903167⟩. ⟨hal-02155905⟩
141 Consultations
145 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More