The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Covariance, subspace, and intrinsic Crame/spl acute/r-Rao bounds
Abstract
Crame/spl acute/r-Rao bounds on estimation accuracy are established for estimation problems on arbitrary manifolds in which no set of intrinsic coordinates exists. The frequently encountered examples of estimating either an unknown subspace or a covariance matrix are examined in detail. The set of subspaces, called the Grassmann manifold, and the set of covariance (positive-definite Hermitian) matrices have no fixed coordinate system associated with them and do not possess a vector space structure, both of which are required for deriving classical Crame/spl acute/r-Rao bounds. Intrinsic versions of the Crame/spl acute/r-Rao bound on manifolds utilizing an arbitrary affine connection with arbitrary geodesics are derived for both biased and unbiased estimators. In the example of covariance matrix estimation, closed-form expressions for both the intrinsic and flat bounds are derived and compared with the root-mean-square error (RMSE) of the sample covariance matrix (SCM) estimator for varying sample support K. The accuracy bound on unbiased covariance matrix estimators is shown to be about (10/log 10)n/K/sup 1/2/ dB, where n is the matrix order. Remarkably, it is shown that from an intrinsic perspective, the SCM is a biased and inefficient estimator and that the bias term reveals the dependency of estimation accuracy on sample support observed in theory and practice. The RMSE of the standard method of estimating subspaces using the singular value decomposition (SVD) is compared with the intrinsic subspace Crame/spl acute/r-Rao bound derived in closed form by varying both the signal-to-noise ratio (SNR) of the unknown p-dimensional subspace and the sample support. In the simplest case, the Crame/spl acute/r-Rao bound on subspace estimation accuracy is shown to be about (p(n-p))/sup 1/2-1/2/SNR/sup -1/2/ rad for p-dimensional subspaces. It is seen that the SVD-based method yields accuracies very close to the Crame/spl acute/r-Rao bound, establishing that the principal invariant subspace of a random sample provides an excellent estimator of an unknown subspace. The analysis approach developed is directly applicable to many other estimation problems on manifolds encountered in signal processing and elsewhere, such as estimating rotation matrices in computer vision and estimating subspace basis vectors in blind source separation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Differential-Geometrical Methods in Statistics
Amari, S.-I. (1985) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-5056-2 · Cited by 1,673
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
Riemannian center of mass and mollifier smoothing
Karcher, H. (1977) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160300502 · Cited by 995
Covariance and Fisher information in quantum mechanics
Petz, D. (2002) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/35/4/305 · Cited by 132 · cited 2×
“There are abundant treatments of the CRB in its classical form [60], [78], its geometry [61], the case of a constrained parameter space [29], [75], [80], and several generalizations of the CRB to arbitrary Riemannian manifolds [11], [34], [43], [52], [53], [68], [79] and statistical manifolds [5].”
BackgroundMethod
Cited by
Multiclass Brain–Computer Interface Classification by Riemannian Geometry
Barachant, A., Bonnet, S., Congedo, M., & Jutten, C. (2012) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2011.2172210 · Cited by 878
Stochastic Gradient Descent on Riemannian Manifolds
Bonnabel, S. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2254619 · Cited by 540
Trust-Region Methods on Riemannian Manifolds
Absil, P.-A., Baker, C. G., & Gallivan, K. A. (2007) · Foundations of Computational Mathematics · doi:10.1007/s10208-005-0179-9 · Cited by 461
Metadata
- Authors
- Smith, S. T.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2005-05
- Volume
- 53
- Issue
- 5
- Pages
- 1610-1630
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W1983104971
- Cited by
- 245
- References
- 4
- FWCI
- 10.24
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.