2016 Annual Conference on Information Science and Systems (CISS) 2016
DOI: 10.1109/ciss.2016.7460514
|View full text |Cite
|
Sign up to set email alerts
|

Estimation information bounds using the I-MMSE formula and Gaussian mixture models

Abstract: We derive a method to bound the mutual information between a noisy and noiseless measurement exploiting the I-MMSE estimation and information theory connection. Modeling the source distribution as a Gaussian mixture model, a closed form expression for upper and lower bounds of the minimum mean square error is found using recent results. Using the connection between rate of information relative to SNR and the minimum mean square error of the estimator, the mutual information can be bounded as well for arbitrary… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…This is important, as our predicted mutual information depends solely on the Markov tracking distributions. Therefore, as long as distributions can be formulated for a given scenario, the mutual information can be computed, or at least bounded [48], enabling the CIR to modulate revisit time.…”
Section: Target Measurement Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…This is important, as our predicted mutual information depends solely on the Markov tracking distributions. Therefore, as long as distributions can be formulated for a given scenario, the mutual information can be computed, or at least bounded [48], enabling the CIR to modulate revisit time.…”
Section: Target Measurement Modelmentioning
confidence: 99%
“…More general tracking solutions can have complex distributions where the mutual information can be difficult to compute or estimate. In these cases, the CIR scheduling algorithm may still be used by applying reasonably tight bounds that can be formulated by modeling the filtering distributions as Gaussian mixture models GMMs [48] if the perturbative distributions are independent and additive.…”
Section: Algorithm 1 Revisit Time Modulation (Solving For T)mentioning
confidence: 99%