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

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

Contributor : Bruno Meriaux <>
Submitted on : Friday, June 14, 2019 - 8:36:30 AM
Last modification on : Friday, July 19, 2019 - 2:46:54 PM


Files produced by the author(s)


  • HAL Id : hal-02155905, version 1


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. ⟨hal-02155905⟩



Record views


Files downloads