Related papers: Cramer-Rao Bounds for Laplacian Matrix Estimation
In this paper, the Cram\'{e}r-Rao Bounds (CRB) for the simultaneous estimation of power system electromechanical modes and forced oscillations (FO) are derived. Two cases are considered; in the first case only the steady-state response to…
The linear regression model with a random variable (RV) measurement matrix, where the mean of the random measurement matrix has full column rank, has been extensively studied. In particular, the quasiconvexity of the maximum likelihood…
Graph signals arise from physical networks, such as power and communication systems, or as a result of a convenient representation of data with complex structure, such as social networks. We consider the problem of general graph signal…
Performance bounds for parameter estimation play a crucial role in statistical signal processing theory and applications. Two widely recognized bounds are the Cram\'{e}r-Rao bound (CRB) in the non-Bayesian framework, and the Bayesian CRB…
A lower bound is an important tool for predicting the performance that an estimator can achieve under a particular statistical model. Bayesian bounds are a kind of such bounds which not only utilizes the observation statistics but also…
We revisit the problem of computing submatrices of the Cram\'er-Rao bound (CRB), which lower bounds the variance of any unbiased estimator of a vector parameter $\vth$. We explore iterative methods that avoid direct inversion of the Fisher…
In this paper, we consider the problem of blind estimation of states and topology (BEST) in power systems. We use the linearized DC model of real power measurements with unknown voltage phases (i.e. states) and an unknown admittance matrix…
This letter aims at extending the Constrained Semiparametric Cramer-Rao Bound (CSCRB) for the joint estimation of mean vector and scatter matrix of Real Elliptically Symmetric (RES) distributions to Complex Elliptically Symmetric (CES)…
Completely random measures (CRMs) are fundamental to Bayesian nonparametric models, with applications in clustering, feature allocation, and network analysis. A key quantity of interest is the Laplace exponent, whose asymptotic behavior…
A Cram\'er-Rao bound (CRB) optimization framework for near-field sensing (NISE) with continuous-aperture arrays (CAPAs) is proposed. In contrast to conventional spatially discrete arrays (SPDAs), CAPAs emit electromagnetic (EM) probing…
This paper derives a general expression for the Cram\'er-Rao bound (CRB) of wireless localization algorithms using range measurements subject to bias corruption. Specifically, the a priori knowledge about which range measurements are…
This paper presents a new performance bound for estimation problems where the parameter to estimate lies in a Riemannian manifold (a smooth manifold endowed with a Riemannian metric) and follows a given prior distribution. In this setup,…
Using methods from algebraic graph theory and convex optimization, we study the relationship between local structural features of a network and spectral properties of its Laplacian matrix. In particular, we derive expressions for the…
This paper presents a Cramer-Rao lower bound (CRLB) on the variance of unbiased estimates of factor matrices in Canonical Polyadic (CP) or CANDECOMP/PARAFAC (CP) decompositions of a tensor from noisy observations, (i.e., the tensor plus a…
We extend the traditional framework for estimating subspace bases that maximize the preserved signal energy to additionally preserve the Cram\'er-Rao bound (CRB) of the biophysical parameters and, ultimately, improve accuracy and precision…
Neural networks are increasingly used to estimate parameters in quantitative MRI, in particular in magnetic resonance fingerprinting. Their advantages over the gold standard non-linear least square fitting are their superior speed and their…
Synchronization of rotations is the problem of estimating a set of rotations R_i in SO(n), i = 1, ..., N, based on noisy measurements of relative rotations R_i R_j^T. This fundamental problem has found many recent applications, most…
We consider the problem of learning a sparse undirected graph underlying a given set of multivariate data. We focus on graph Laplacian-related constraints on the sparse precision matrix that encodes conditional dependence between the random…
This paper is mainly dedicated to an extension of the Slepian-Bangs formula to non-circular complex elliptical symmetric (NC-CES) distributions, which is derived from a new stochastic representation theorem. This formula includes the…
A generic modular array architecture is proposed, featuring uniform/non-uniform subarray layouts that allows for flexible deployment. The bistatic near-field sensing system is considered, where the target is located in the near-field of the…