DocumentCode :
3522213
Title :
Joint source decoding in large scale sensor networks using Markov random field models
Author :
Yahampath, Pradeepa
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Manitoba, Winnipeg, MB
fYear :
2009
fDate :
19-24 April 2009
Firstpage :
2769
Lastpage :
2772
Abstract :
Scalable joint decoding of correlated observations transmitted using distributed quantization in a sensor-network is considered. In particular, quantized observations are modeled as a Markov-random field (MRF), from which we construct a factor-graph for implementing the decoder using the well known sum-product algorithm. An attractive property of this approach is that the decoder complexity can be controlled by the choice of the clique structure used to define the Gibbs distribution of the MRF model. The experimental results obtained with a widely used correlated Gaussian observation model is presented, which demonstrate that substantial performance gains can be achieved by joint decoding based on simple clique structures and potential functions.
Keywords :
Markov processes; decoding; wireless sensor networks; Gaussian observation model; Gibbs distribution; Markov random field models; clique structure; decoder complexity; distributed quantization; factor-graph; joint source decoding; large scale sensor networks; scalable joint decoding; sum-product algorithm; Computational complexity; Decoding; Intelligent networks; Large-scale systems; Markov random fields; Performance gain; Quantization; Source coding; Sum product algorithm; Wireless sensor networks; Distributed quantization; Markov-random fields; factor-graphs; sum-product algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on
Conference_Location :
Taipei
ISSN :
1520-6149
Print_ISBN :
978-1-4244-2353-8
Electronic_ISBN :
1520-6149
Type :
conf
DOI :
10.1109/ICASSP.2009.4960197
Filename :
4960197
Link To Document :
بازگشت