The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Lower bounds for parametric estimation with constraints
Abstract
A Chapman-Robbins form of the Barankin bound is used to derive a multiparameter Cramer-Rao (CR) type lower bound on estimator error covariance when the parameter theta in R/sup n/ is constrained to lie in a subset of the parameter space. A simple form for the constrained CR bound is obtained when the constraint set Theta /sub C/, can be expressed as a smooth functional inequality constraint. It is shown that the constrained CR bound is identical to the unconstrained CR bound at the regular points of Theta /sub C/, i.e. where no equality constraints are active. On the other hand, at those points theta in Theta /sub C/ where pure equality constraints are active the full-rank Fisher information matrix in the unconstrained CR bound must be replaced by a rank-reduced Fisher information matrix obtained as a projection of the full-rank Fisher matrix onto the tangent hyperplane of the full-rank Fisher matrix onto the tangent hyperplane of the constraint set at theta . A necessary and sufficient condition involving the forms of the constraint and the likelihood function is given for the bound to be achievable, and examples for which the bound is achieved are presented. In addition to providing a useful generalization of the CR bound, the results permit analysis of the gain in achievable MSE performance due to the imposition of particular constraints on the parameter space without the need for a global reparameterization.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Linear Statistical Inference and its Applications: Second Editon
Rao, C. R. (1973) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316436 · Cited by 10,489
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Optimization by Vector Space Methods
(1970) · Students Quarterly Journal · doi:10.1049/sqj.1970.0088 · Cited by 6,004
Deimling, K. (1985) · Springer eBooks · doi:10.1007/978-3-662-00547-7 · Cited by 5,029
Detection, Estimation, and Modulation Theory, Part I
Van Trees, H. L. (2001) · John Wiley & Sons, Inc. eBooks · doi:10.1002/0471221082 · Cited by 3,891
Riesz, F. (1955) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,001
Asymptotic Methods in Statistical Decision Theory
Cam, L. L. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4612-4946-7 · Cited by 1,317
Chaghaghi, F. S., & Billingsley, P. (1986) · The Statistician · doi:10.2307/2987970 · Cited by 1,217
Estimating the Angles of Arrival of Multiple Plane Waves
Kumaresan, R., & Tufts, D. W. (1983) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.1983.309427 · Cited by 849
Cited by
Improved Method for Accurate and Efficient Quantification of MRS Data with Use of Prior Knowledge
Vanhamme, L., van den Boogaart, A., & Van Huffel, S. (1997) · Journal of Magnetic Resonance · doi:10.1006/jmre.1997.1244 · Cited by 1,627
Tensor Decomposition for Signal Processing and Machine Learning
Sidiropoulos, N. D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E. E., & Faloutsos, C. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2690524 · Cited by 1,617
Nonlinear Unmixing of Hyperspectral Images: Models and Algorithms
Dobigeon, N., Tourneret, J.-Y., Richard, C., Bermudez, J. C. M., McLaughlin, S., & Hero, A. O. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2279274 · Cited by 420
Self-citationLiu, J., & Moulin, P. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.967393 · Cited by 265
Geolocation of a known altitude object from TDOA and FDOA measurements
Ho, K. C., & Chan, Y. T. (1997) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.599239 · Cited by 264
Metadata
- Authors
- Gorman, J. D., & Hero, A. O.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1990
- Volume
- 36
- Issue
- 6
- Pages
- 1285-1301
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2128203095
- Cited by
- 332
- References
- 20
- FWCI
- 2.16
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Lower bounds for parametric estimation with constraints. https://app.cochat.ai/papers/10.1109/18.59929
- The paper
- Gorman, J. D., & Hero, A. O. (1990). Lower bounds for parametric estimation with constraints. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.59929
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.