Improved Cramer-Rao Inequality for Randomly Censored Data
نویسنده
چکیده مقاله:
As an application of the improved Cauchy-Schwartz inequality due to Walker (Statist. Probab. Lett. (2017) 122:86-90), we obtain an improved version of the Cramer-Rao inequality for randomly censored data derived by Abdushukurov and Kim (J. Soviet. Math. (1987) pp. 2171-2185). We derive a lower bound of Bhattacharya type for the mean square error of a parametric function based on randomly censored data.
منابع مشابه
The Cramer-rao Inequality for Star Bodies
Associated with each body K in Euclidean n-space Rn is an ellipsoid 02K called the Legendre ellipsoid of K . It can be defined as the unique ellipsoid centered at the body’s center of mass such that the ellipsoid’s moment of inertia about any axis passing through the center of mass is the same as that of the body. In an earlier paper the authors showed that corresponding to each convex body K ⊂...
متن کاملNote for Cramer-Rao Bounds
• (z)r and (z)i denote the real and imaginary part of z. II. CONSTRAINED CRAMER-RAO BOUND A. Problem Statement Problem statement and notation are based on [1]. • a: a K × 1 non-random vector which are to be estimated. • r: an observation of a random vector . • â (R): an estimate of a basing on the observed vector r . It is required that â (R) satisfies M nonlinear equality constraints (M < K), ...
متن کاملCramer-Rao Bounds for Nonparametric Surface Reconstruction from Range Data
The Cramer-Rao error bound provides a fundamental limit on the expected performance of a statistical estimator. The error bound depends on the general properties of the system, but not on the specific properties of the estimator or the solution. The Cramer-Rao error bound has been applied to scalarand vector-valued estimators and recently to parametric shape estimators. However, nonparametric, ...
متن کاملCramer-Rao lower bounds for atomic decomposition
In a previous paper [1] we presented a method for atomic decomposition with chirped, Gabor functions based on maximum likelihood estimation. In this paper we present the Cramér-Rao lower bounds for estimating the seven chirp parameters, and the results of a simulation showing that our sub-optimal, but computationally tractable, estimators perform well in comparison to the bound at low signal-to...
متن کاملComputing Constrained Cramer Rao Bounds
We revisit the problem of computing submatrices of the Cramér-Rao bound (CRB), which lower bounds the variance of any unbiased estimator of a vector parameter θ. We explore iterative methods that avoid direct inversion of the Fisher information matrix, which can be computationally expensive when the dimension of θ is large. The computation of the bound is related to the quadratic matrix program...
متن کاملCramer-Rao bounds for deterministic modal analysis
How accurately can deterministic modes be identified from a finite record of noisy data? In this paper we answer this question by computing the Cramer-Rao bound on the error covariance matrix of any unbiased estimator of mode parameters. The bound is computed for many of the standard parametric descriptions of a mode, including autoregressive and moving average parameters, poles and residues, a...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 17 شماره None
صفحات 1- 12
تاریخ انتشار 2018-12
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023