Abstract
We study Cramér-Rao bounds (CRB's) for estimation problems on Riemannian manifolds. In [S. T. Smith, “Covariance, Subspace, and Intrinsic Cramér-Rao bounds,” IEEE Trans. Signal Process., vol. 53, no. 5, 1610-1630, 2005], the author gives intrinsic CRB's in the form of matrix inequalities relating the covariance of estimators and the Fisher information of estimation problems. We focus on estimation problems whose parameter space <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">P̅</i> is a Riemannian submanifold or a Riemannian quotient manifold of a parent space <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">P</i> , that is, estimation problems on manifolds with either deterministic constraints or ambiguities. The CRB's in the aforementioned reference would be expressed w.r.t. bases of the tangent spaces to P̅. In some cases though, it is more convenient to express covariance and Fisher information w.r.t. bases of the tangent spaces to <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">P</i> . We give CRB's w.r.t. such bases expressed in terms of the geodesic distances on the parameter space. The bounds are valid even for singular Fisher information matrices. In two examples, we show how the CRB's for synchronization problems (including a type of sensor network localization problem) differ in the presence or absence of anchors, leading to bounds for estimation on either submanifolds or quotient manifolds with very different interpretations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.