Navigation
  • Home
  • Recent
  • Most Active
  • Popular
  • Blog
  • Credits
  • RSS
  •   Interaction
  • Register
  • Statistics
  •   Help
  • Suggestions
  • Contact Us
  • How to Edit
  • Help



  • [Edit]


    Estimation theory is a branch of statistics and signal processing that deals with estimating the values of parameters based on measured/empirical data. The parameters describe the physical scenario or object that answers a question posed by the estimator.
    For example, it is desired to estimate the proportion of a population of voters who will vote for a particular candidate. That proportion is the unobservable parameter; the estimate is based on a small random sample of voters.

    Or, for example, in radar the goal is to estimate the location of objects (airplanes, boats, etc.) by analyzing the received echo and a possible question to be posed is "where are the airplanes?"
    To answer where the airplanes are, it is necessary to estimate the distance the airplanes are at from the radar station, which can provide an absolute location if the absolute location of the radar station is known.

    In estimation theory, it is assumed that the desired information is embedded into a noisy signal.
    Noise adds uncertainty and if there was no uncertainty then there would be no need for estimation.


        Estimation theory
            Fields that use estimation theory
            Estimation process
            Basics
            Estimators
            Example: DC gain in white Gaussian noise








                Maximum likelihood







                Cramér-Rao lower bounds






            Books
            See also

    top

    Fields that use estimation theory
    There are numerous fields that require the use of estimation theory.
    Some of these fields include (but by no means limited to):

    The measured data is likely to be subject to noise or uncertainty and it is through statistical probability that optimal solutions are sought to extract as much information from the data.

    top

    Estimation process
    The entire purpose of estimation theory is to arrive at an estimator, and preferably an implementable one that could actually be used.
    The estimator takes the measured data as input and produces an estimate of the parameters.

    It is also preferable to derive an estimator that exhibits optimality.
    An optimal estimator would indicate that all available information in the measured data has been extracted, for if there was unused information in the data then the estimator would not be optimal.

    These are the general steps to arrive at an estimator:
      In order to arrive at a desired estimator for estimating a single or multiple parameters, it is first necessary to determine a model for the system. This model should incorporate the process being modeled as well as points of uncertainty and noise. The model describes the physical scenario in which the parameters apply.
      After deciding upon a model, it is helpful to find the limitations placed upon an estimator. This limitation, for example, can be found through the Cramér-Rao inequality.
      Next, an estimator needs to be developed or applied if an already known estimator is valid for the model. The estimator needs to be tested against the limitations to determine if it is an optimal estimator (if so, then no other estimator will perform better).
      Finally, experiments or simulations can be run using the estimator to test its performance.

    After arriving at an estimator, real data might show that the model used to derive the estimator is incorrect, which may require repeating these steps to find a new estimator.
    A non-implementable or infeasible estimator may need to be scrapped and the process start anew.

    In summary, the estimator estimates the parameters of a physical model based on measured data.

    top

    Basics
    To build a model, several statistical "ingredients" need to be known.
    These are needed to ensure the estimator has some mathematical tractability instead of being based on "good feel".

    The first is a set of statistical samples taken from a random vector (RV) of size N. Put into a vector,

    mathbf = egin x0 \ x1 \ vdots \ xN-1 end.


    Secondly, we have the corresponding M parameters

    mathbf = egin heta_1 \ heta_2 \ vdots \ heta_M end,


    which need to be established with their probability density function (pdf) or probability mass function (pmf)

    p(mathbf | mathbf).


    It is also possible for the parameters themselves to have a probability distribution (e.g., Bayesian statistics). It is then necessary to define the epistemic probability

    pi( mathbf).


    After the model is formed, the goal is to estimate the parameters, commonly denoted hat, where the "hat" indicates the estimate.

    One common estimator is the minimum mean squared error (MMSE) estimator, which utilizes the error between the estimated parameters and the actual value of the parameters

    mathbf = hat - mathbf


    as the basis for optimality.
    This error term is then squared and minimized for the MMSE estimator.

    top

    Estimators
    This list is some of the more common estimators used, and some topics related to them:

    top

    Example: DC gain in white Gaussian noise
    Consider a received discrete signal, xn, of N independent samples that consists of a DC gain A with Additive white Gaussian noise wn with known variance sigma^2 (i.e., mathcal(0, sigma^2)).
    Since the variance is known then the only unknown parameter is A.

    The model for the signal is then
    xn = A + wn quad n=0, 1, dots, N-1


    Two possible (of many) estimators are:
      hat_1 = x0

    Both of these estimators have a mean of A, which can be shown through taking the expected value of each estimator

    mathrmlefthat{A}_1 ight = mathrmleft x0 ight = A

    and

    mathrmleft hat{A}_2 ight

    top


    mathrmleft rac{1}{N} sum_{n=0}^{N-1} xn ight

    top


    rac left sum_{n=0}^{N-1} mathrm{E}left xn ight ight

    top


    rac left N A ight

    top


    A


    At this point, these two estimators would appear to perform the same.
    However, the difference between them becomes apparent when comparing the variances.

    mathrm left( hat_1

    ight) = mathrm left( x0
    ight) = sigma^2
    and

    mathrm left( hat_2
    ight)

    top


    mathrm left( rac sum_^ xn
    ight)

    top


    rac left sum_{n=0}^{N-1} mathrm{var} (xn) ight

    top


    rac left N sigma^2 ight

    top


    rac


    It would seem that the sample mean is a better estimator since, as N o infty, the variance goes to zero.

    top

    Maximum likelihood
    Continuing the example using the maximum likelihood estimator, the probability density function (pdf) of the noise for one sample wn is

    p(wn) = rac expleft(- rac wn^2

    ight)

    and the probability of xn becomes (xn can be thought of a mathcal(A, sigma^2))

    p(xn; A) = rac expleft(- rac (xn - A)^2

    ight)

    By independence, the probability of mathbf becomes


    p(mathbf; A)

    top


    prod_^ p(xn; A)

    top


    rac
    expleft(- rac sum_^(xn - A)^2
    ight)


    Taking the natural logarithm of the pdf


    ln p(mathbf; A)

    top


    -N ln left(sigma sqrt
    ight)
    - rac sum_^(xn - A)^2


    and the maximum likelihood estimator is

    hat = arg max ln p(mathbf; A)


    Taking the first derivative of the log-likelihood function


    rac ln p(mathbf; A)

    top


    rac left sum_{n=0}^{N-1}(xn - A) ight

    top


    rac left sum_{n=0}^{N-1}xn - N A ight


    and setting it to zero


    0

    top


    rac left sum_{n=0}^{N-1}xn - N A ight

    top


    sum_^xn - N A


    This results in the maximum likelihood estimator


    hat = rac sum_^xn


    which is simply the sample mean.
    From this example, it was found that the sample mean is the maximum likelihood estimator for N samples of AWGN with a fixed, unknown DC gain.

    top

    Cramér-Rao lower bounds
    To find the Cramér-Rao lower bounds (CRLB) of the sample mean estimator, it is first necessary to find the Fisher information number


    mathcal(A)

    top


    mathrm
    left(
    left rac{partial}{partial heta} ln p(mathbf{x}; A) ight^2

    ight)

    top


    -mathrm
    left rac{partial^2}{partial heta^2} ln p(mathbf{x}; A) ight


    and copying from above


    rac ln p(mathbf; A)

    top


    rac left sum_{n=0}^{N-1}xn - N A ight


    Taking the second derivative

    rac ln p(mathbf; A)

    top


    rac (- N)

    top


    rac


    and finding the negative expected value is trivial since it is now a deterministic constant

    -mathrm
    left rac{partial^2}{partial A^2} ln p(mathbf{x}; A) ight

    top


    rac


    Finally, putting the Fisher information into


    mathrmleft( hat
    ight)
    geq
    rac


    results in


    mathrmleft( hat
    ight)
    geq
    rac


    Comparing this to the variance of the sample mean (determined previously) shows that the sample mean is equal to the Cramér-Rao lower bounds for all values of N and A.
    The sample mean is the minimum variance unbiased estimator (MVUE) in addition to being the maximum likelihood estimator.

    This example of DC gain + WGN is a recurring example in Kay's Fundamentals of Statistical Signal Processing.

    top

    Books
      Fundamentals of Statistical Signal Processing: Estimation Theory by Steven M. Kay (ISBN 0-13-345711-7)
      An Introduction to Signal Detection and Estimation by H. Vincent Poor (ISBN 0-38-794173-8)
      Detection, Estimation, and Modulation Theory, Part 1 by Harry L. Van Trees (ISBN 0-47-109517-6; website)
      Optimal State Estimation: Kalman, H-infinity, and Nonlinear Approaches by Dan Simon website

    top

    See also





     
    Search more:
     

       
    Source Privacy License Download Contact Us Atlas
    Scientus.org Dictionary (Yet Another Wiki) RC : 1.39
    This article is licensed under the GNU Free Documentation License [copyleft]. It uses material from the Wikipedia article "Estimation theory". link