Detection of Gauss-Markov Random Field on Nearest-Neighbor Graph

The problem of hypothesis testing against independence for a Gauss-Markov random field (GMRF) with nearest-neighbor dependency graph is analyzed. The sensors measuring samples from the signal field are placed IID according to the uniform distribution. The asymptotic performance of Neyman-Pearson detection is characterized through the large-deviation theory. An expression for the error exponent is derived using a special law of large numbers for graph functionals. The exponent is analyzed for different values of the variance ratio and correlation. It is found that a more correlated GMRF has a higher exponent (improved detection performance) at low values of the variance ratio, whereas the opposite is true at high values of the ratio.

[1]  H. Rue,et al.  Norges Teknisk-naturvitenskapelige Universitet Approximating Hidden Gaussian Markov Random Fields Approximating Hidden Gaussian Markov Random Fields , 2003 .

[2]  David J. Spiegelhalter,et al.  Probabilistic Networks and Expert Systems , 1999, Information Science and Statistics.

[3]  H. Vincent Poor,et al.  Detection of Stochastic Processes , 1998, IEEE Trans. Inf. Theory.

[4]  Sergio VerdÂ,et al.  Statistical Inference Under Multiterminal Data Compression , 2000 .

[5]  José M. F. Moura,et al.  Block matrices with L-block-banded inverse: inversion algorithms , 2005, IEEE Transactions on Signal Processing.

[6]  P. Brooker,et al.  INACCURACIES ASSOCIATED WITH ESTIMATING RANDOM MEASUREMENT ERRORS , 1997 .

[7]  H. Vincent Poor,et al.  Neyman-Pearson Detection of Gauss-Markov Signals in Noise: Closed-Form Error Exponent and Properties , 2005, ISIT.

[8]  J. Yukich,et al.  Limit theory for random sequential packing and deposition , 2002 .

[9]  H. Rue,et al.  Fitting Gaussian Markov Random Fields to Gaussian Fields , 2002 .

[10]  Ananthram Swami,et al.  Energy Efficient Routing for Statistical Inference of Markov Random Fields , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[11]  H. Vincent Poor,et al.  Neyman-pearson detection of gauss-Markov signals in noise: closed-form error exponentand properties , 2005, IEEE Transactions on Information Theory.

[12]  Ananthram Swami,et al.  Detection of Gauss–Markov Random Fields With Nearest-Neighbor Dependency , 2007, IEEE Transactions on Information Theory.

[13]  Leonhard Held,et al.  Gaussian Markov Random Fields: Theory and Applications , 2005 .

[14]  David Eppstein,et al.  On Nearest-Neighbor Graphs , 1992, ICALP.

[15]  Nikhil Balram,et al.  Recursive structure of noncausal Gauss-Markov random fields , 1992, IEEE Trans. Inf. Theory.