Show simple item record

dc.contributor.authorLe, T.en
dc.contributor.authorHadjicostis, Christoforos N.en
dc.creatorLe, T.en
dc.creatorHadjicostis, Christoforos N.en
dc.description.abstractIn this paper, we study marginal problems for a class of binary pairwise Gibbs random fields (BPW-GRFs). Given a BPW-GRF associated with a family of binary positive pairwise potentials, finding the exact marginal for each random variable is typically an NP-hard problem. In this paper, we develop upper and lower bounds of the true marginals in BPW-GRFs. Our bounds can be easily computed via an iteration on appropriate trees that are constructed from the corresponding BPW-GRF graphs. We prove that these marginal bounds outperform existing bounds. We also show via simulations that this improvement is significant on graphs with weak potentials. © 2011 IEEE.en
dc.sourceIEEE International Conference on Automation Science and Engineeringen
dc.sourceIEEE International Conference on Automation Science and Engineeringen
dc.subjectComputational complexityen
dc.subjectUpper and lower boundsen
dc.subjectTrees (mathematics)en
dc.subjectGibbs random fielden
dc.subjectMarginal analysisen
dc.subjectNp-hard problemen
dc.subjectRandom variablesen
dc.titleMarginal analysis on binary pairwise Gibbs random fieldsen
dc.description.endingpage321Πολυτεχνική Σχολή / Faculty of EngineeringΤμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering
dc.type.uhtypeConference Objecten
dc.contributor.orcidHadjicostis, Christoforos N. [0000-0002-1706-708X]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record