Computer Vision And Pattern Analysis Laboratory Home Page  Home
People  People
Publications  Publications
Publications  Databases
Contact Information  Contact
Supported Research Projects  Supported Research Projects
Research Activites  Research Activites
Research Groups
SPIS - Signal Processing and Information Systems Lab.SPIS - Signal Processing and Information Systems Lab.
Medical Vision and Analysis Group  Medical Research Activities
Biometrics Research Group  Biometrics Research Group
SPIS - Signal Processing and Information Systems Lab.MISAM - Machine Intelligence for Speech Audio and Multimedia.
Knowledge Base
  Paper Library
Decentralized Random-Field Estimation Under Communication Constraints
Authors: Murat Üney and Müjdat Çetin
Published in: The 17th Conference on Signal Processing, Communications, and their Applications, SIU 2009 (in Turkish)
Publication year: 2009
Abstract: Tukish title: İletişim Kısıtları Altında Dağıtık Rasgele-Alan Kestirimi English title: Decentralized Random-Field Estimation Under Communication Constraints
note: received the 2^nd place award in IEEE student paper competition
We consider the problem of decentralized estimation of a random-field under communication constraints in a Bayesian setting. The underlying system is composed of sensor nodes which collect measurements due to random variables they are associated with and which can communicate through finite-rate channels in accordance with a directed acyclic topology. After receiving the incoming messages if any, each node evaluates its local rule given its measurement and these messages, producing an estimate as well as outgoing messages to child nodes. A rigorous problem definition is achieved by constraining the feasible set through this structure in order to optimize a Bayesian risk function that captures the costs due to both communications and estimation errors. We adopt an iterative solution through a Team Decision Theoretic treatment previously proposed for decentralized detection. However, for the estimation problem, the iterations contain expressions with integral operators that have no closed form solutions in general. We propose approximations to these expressions through Monte Carlo methods. The result is an approximate computational scheme for optimization of distributed estimation networks under communication constraints. In an example scenario, we increase the price of communications and present the degrading estimation performance of the converged rules.
  download full paper

Home Back