By Topic

Distributed propagation of a-priori constraints in a Bayesian network of Markov random fields

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Regazzoni, C.S. ; Dept. of Biophys. & Electron. Eng., Genoa Univ., Italy ; Murino, V. ; Vernazza, G.

Bayesian networks of Markov random fields (BN-MRFs) are proposed as a technique for representing and applying a-priori knowledge at different abstraction levels inside a distributed image processing framework. It is shown that this approach, thanks to the common probabilistic basis of the two techniques, is able to combine in a natural way causal inference properties at different abstraction levels as provided by Bayesian networks with optimisation criteria usually applied to find the best configuration for an MRF. Examples of two-level BN-MRFs are given, where each node uses a coupled Markov random field which has to solve a coupled restoration and segmentation problem. Experiments are concerned with expert-driven registered segmentation and tracking of regions from image sequences.<>

Published in:

Communications, Speech and Vision, IEE Proceedings I  (Volume:140 ,  Issue: 1 )