QML blind deconvolution: Asymptotic analysis

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Blind deconvolution is considered as a problem of quasi maximum likelihood (QML) estimation of the restoration kernel. Simple closed-form expressions for the asymptotic estimation error are derived. The asymptotic performance bounds coincide with the Cramér-Rao bounds, when the true ML estimator is used. Conditions for asymptotic stability of the QML estimator are derived. Special cases when the estimator is super-efficient are discussed. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Bronstein, A. M., Bronstein, M. M., Zibulevsky, M., & Zeevi, Y. Y. (2004). QML blind deconvolution: Asymptotic analysis. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3195, 677–684. https://doi.org/10.1007/978-3-540-30110-3_86

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free