Large Deviations Analysis for the Detection of 2D Hidden Gauss-Markov Random Fields Using Sensor Networks
Youngchul Sung, H. Vincent Poor, Heejung Yu
备注：
To appear in the Proceedings of the 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, Las Vegas, NV, March 30 - April 4, 2008
The detection of hidden two-dimensional Gauss-Markov random fields using sensor networks is considered. Under a conditional autoregressive model, the error exponent for the Neyman-Pearson detector satisfying a fixed level constraint is obtained using the large deviations principle. For a symmetric first order autoregressive model, the error exponent is given explicitly in terms of the SNR and an edge dependence factor (field correlation). The behavior of the error exponent as a function of correlation strength is seen to divide into two regions depending on the value of the SNR. At high SNR, uncorrelated observations maximize the error exponent for a given SNR, whereas there is non-zero optimal correlation at low SNR. Based on the error exponent, the energy efficiency (defined as the ratio of the total information gathered to the total energy required) of ad hoc sensor network for detection is examined for two sensor deployment models: an infinite area model and and infinite density model. For a fixed sensor density, the energy efficiency diminishes to zero at rate O(area^{-1/2}) as the area is increased. On the other hand, non-zero efficiency is possible for increasing density depending on the behavior of the physical correlation as a function of the link length.
Context Tree Estimation in Variable Length Hidden Markov Models
我们解决了可变长度隐马尔可夫模型中的上下文树估计问题。我们提出了一个估计的上下文树的隐马尔可夫过程，它不需要事先上界的深度上下文树。我们证明了估计量是强相合的。这一方法使用了Finesso和Lorenzo（Consistent estimation of the order for Markov and hidden Markov chains（1990））和E.Gassiat和S.Boucheron（Optimal error exponents in hidden Markov model order estimation（2003））的信息论混合不等式。我们提出了一种算法来有效地计算估计，并提供模拟研究，以支持我们的结果。
