{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/18543"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/18543","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Probabilistic inference via sum-product algorithms on binary pairwise Gibbs random fields with applications to multiple fault diagnosis","abstract":"In this dissertation, we consider probabilistic inference problems on binary pairwise Gibbs random fields (BPW-GRFs), which belong to a class of Markov random fields with applications to a large variety of systems, including computer vision, statistical mechanics, modeling of neural functions, and others. In particular, we study the application of iterative heuristic sum-product algorithms (SPAs) to the underlying graphs for solving the marginal problem on BPW-GRFs. These algorithms operate on the BPW-GRF graph by propagating messages along the edges and by using them to update the beliefs at each node of the graph; these beliefs then serve as suboptimal solutions to the marginal problem. SPAs offer several advantages such as complexity that is polynomial in the number of nodes and edges in the graph and the ability to operate in a distributed fashion (determined by the structure of the underlying graph). In general, the analysis of SPAs can be categorized into (i) finding conditions under which the SPAs converge, and (ii) determining the correctness of the marginal solutions provided by the SPAs with respect to the true marginals. In this dissertation, we consider both problems. For each problem, we first review existing results and then present our specific contribution within the class of BPW-GRFs. Finally, we extend our analysis of SPAs on BPW-GRFs to the application of multiple fault diagnosis (note that the equivalent GRFs for fault diagnosis systems are typically non-binary). In particular, we establish tighter bounds over previous results, and show that fault diagnosis using SPA beliefs (as suboptimal solutions to the true marginals) can detect multiple faults with very high accuracy.","abstract_html":"In this dissertation, we consider probabilistic inference problems on binary pairwise Gibbs random fields (BPW-GRFs), which belong to a class of Markov random fields with applications to a large variety of systems, including computer vision, statistical mechanics, modeling of neural functions, and others. In particular, we study the application of iterative heuristic sum-product algorithms (SPAs) to the underlying graphs for solving the marginal problem on BPW-GRFs. These algorithms operate on the BPW-GRF graph by propagating messages along the edges and by using them to update the beliefs at each node of the graph; these beliefs then serve as suboptimal solutions to the marginal problem. SPAs offer several advantages such as complexity that is polynomial in the number of nodes and edges in the graph and the ability to operate in a distributed fashion (determined by the structure of the underlying graph). In general, the analysis of SPAs can be categorized into (i) finding conditions under which the SPAs converge, and (ii) determining the correctness of the marginal solutions provided by the SPAs with respect to the true marginals. In this dissertation, we consider both problems. For each problem, we first review existing results and then present our specific contribution within the class of BPW-GRFs. Finally, we extend our analysis of SPAs on BPW-GRFs to the application of multiple fault diagnosis (note that the equivalent GRFs for fault diagnosis systems are typically non-binary). In particular, we establish tighter bounds over previous results, and show that fault diagnosis using SPA beliefs (as suboptimal solutions to the true marginals) can detect multiple faults with very high accuracy.","abstract_has_math":false,"creators":["Le, Tung"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Hadjicostis, Christoforos N.","Basar, Tamer","Tatikonda, Sekhar C.","Veeravalli, Venugopal V."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-01-21T22:45:18Z","date_published":"2011-01-21T22:45:18Z","updated_at":"2026-07-22T22:25:11Z","subjects":["Probabilistic inference","marginal problems","marginal bounds","graphical models","Markov random fields","Gibbs random fields","binary pairwise Gibbs random fields","belief propagation","sum-product algorithms","fault diagnosis"],"languages":["en"],"rights":["Copyright 2010 Tung Le"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/18543","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hadjicostis, Christoforos N.","Basar, Tamer","Tatikonda, Sekhar C.","Veeravalli, Venugopal V."]},{"key":"dc:creator","label":"Author","values":["Le, Tung"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-01-21T22:45:18Z","2013-01-22T11:00:23Z","2010-12"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Probabilistic inference","marginal problems","marginal bounds","graphical models","Markov random fields","Gibbs random fields","binary pairwise Gibbs random fields","belief propagation","sum-product algorithms","fault diagnosis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2010 Tung Le"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/18543"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In this dissertation, we consider probabilistic inference problems on binary pairwise Gibbs random fields (BPW-GRFs), which belong to a class of Markov random fields with applications to a large variety of systems, including computer vision, statistical mechanics, modeling of neural functions, and others. In particular, we study the application of iterative heuristic sum-product algorithms (SPAs) to the underlying graphs for solving the marginal problem on BPW-GRFs. These algorithms operate on the BPW-GRF graph by propagating messages along the edges and by using them to update the beliefs at each node of the graph; these beliefs then serve as suboptimal solutions to the marginal problem. SPAs offer several advantages such as complexity that is polynomial in the number of nodes and edges in the graph and the ability to operate in a distributed fashion (determined by the structure of the underlying graph). In general, the analysis of SPAs can be categorized into (i) finding conditions under which the SPAs converge, and (ii) determining the correctness of the marginal solutions provided by the SPAs with respect to the true marginals. In this dissertation, we consider both problems. For each problem, we first review existing results and then present our specific contribution within the class of BPW-GRFs. Finally, we extend our analysis of SPAs on BPW-GRFs to the application of multiple fault diagnosis (note that the equivalent GRFs for fault diagnosis systems are typically non-binary). In particular, we establish tighter bounds over previous results, and show that fault diagnosis using SPA beliefs (as suboptimal solutions to the true marginals) can detect multiple faults with very high accuracy.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-11-30T19:20:08Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Le_Tung.pdf: 5414187 bytes, checksum: 4c5827056d3462ef3253acb67145a4ca (MD5)","Made available in DSpace on 2011-01-21T22:45:18Z (GMT). No. of bitstreams: 2 Le_Tung.pdf: 5414187 bytes, checksum: 4c5827056d3462ef3253acb67145a4ca (MD5) license.txt: 4056 bytes, checksum: ae61fb1118ea8e2b8fb48cd23fc0d0a3 (MD5)","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by William Ingram (wingram2@illinois.edu) on 2011-01-21T22:48:09Z Item is restricted until 2013-01-21T22:47:37Z","Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2013-01-22T11:00:23Z Item was in collections: Dissertations and Theses - Electrical and Computer Engineering (ID: 446) University of Illinois Dissertations and Theses (ID: 204) No. of bitstreams: 3 Le_Tung.pdf.txt: 283220 bytes, checksum: 79305d539754e1e36bf611c61c5e5228 (MD5) Le_Tung.pdf: 5414187 bytes, checksum: 4c5827056d3462ef3253acb67145a4ca (MD5) license.txt: 4056 bytes, checksum: ae61fb1118ea8e2b8fb48cd23fc0d0a3 (MD5)","Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2013-01-22T11:00:23Z"]},{"key":"dc:title","label":"Title","values":["Probabilistic inference via sum-product algorithms on binary pairwise Gibbs random fields with applications to multiple fault diagnosis"]}]}],"canonical_facts":{"dc:contributor":["Hadjicostis, Christoforos N.","Basar, Tamer","Tatikonda, Sekhar C.","Veeravalli, Venugopal V."],"dc:creator":["Le, Tung"],"dc:date":["2011-01-21T22:45:18Z","2013-01-22T11:00:23Z","2010-12"],"dc:description":["In this dissertation, we consider probabilistic inference problems on binary pairwise Gibbs random fields (BPW-GRFs), which belong to a class of Markov random fields with applications to a large variety of systems, including computer vision, statistical mechanics, modeling of neural functions, and others. In particular, we study the application of iterative heuristic sum-product algorithms (SPAs) to the underlying graphs for solving the marginal problem on BPW-GRFs. These algorithms operate on the BPW-GRF graph by propagating messages along the edges and by using them to update the beliefs at each node of the graph; these beliefs then serve as suboptimal solutions to the marginal problem. SPAs offer several advantages such as complexity that is polynomial in the number of nodes and edges in the graph and the ability to operate in a distributed fashion (determined by the structure of the underlying graph). In general, the analysis of SPAs can be categorized into (i) finding conditions under which the SPAs converge, and (ii) determining the correctness of the marginal solutions provided by the SPAs with respect to the true marginals. In this dissertation, we consider both problems. For each problem, we first review existing results and then present our specific contribution within the class of BPW-GRFs. Finally, we extend our analysis of SPAs on BPW-GRFs to the application of multiple fault diagnosis (note that the equivalent GRFs for fault diagnosis systems are typically non-binary). In particular, we establish tighter bounds over previous results, and show that fault diagnosis using SPA beliefs (as suboptimal solutions to the true marginals) can detect multiple faults with very high accuracy.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-11-30T19:20:08Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Le_Tung.pdf: 5414187 bytes, checksum: 4c5827056d3462ef3253acb67145a4ca (MD5)","Made available in DSpace on 2011-01-21T22:45:18Z (GMT). No. of bitstreams: 2 Le_Tung.pdf: 5414187 bytes, checksum: 4c5827056d3462ef3253acb67145a4ca (MD5) license.txt: 4056 bytes, checksum: ae61fb1118ea8e2b8fb48cd23fc0d0a3 (MD5)","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by William Ingram (wingram2@illinois.edu) on 2011-01-21T22:48:09Z Item is restricted until 2013-01-21T22:47:37Z","Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2013-01-22T11:00:23Z Item was in collections: Dissertations and Theses - Electrical and Computer Engineering (ID: 446) University of Illinois Dissertations and Theses (ID: 204) No. of bitstreams: 3 Le_Tung.pdf.txt: 283220 bytes, checksum: 79305d539754e1e36bf611c61c5e5228 (MD5) Le_Tung.pdf: 5414187 bytes, checksum: 4c5827056d3462ef3253acb67145a4ca (MD5) license.txt: 4056 bytes, checksum: ae61fb1118ea8e2b8fb48cd23fc0d0a3 (MD5)","Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2013-01-22T11:00:23Z"],"dc:identifier":["http://hdl.handle.net/2142/18543"],"dc:language":["en"],"dc:rights":["Copyright 2010 Tung Le"],"dc:subject":["Probabilistic inference","marginal problems","marginal bounds","graphical models","Markov random fields","Gibbs random fields","binary pairwise Gibbs random fields","belief propagation","sum-product algorithms","fault diagnosis"],"dc:title":["Probabilistic inference via sum-product algorithms on binary pairwise Gibbs random fields with applications to multiple fault diagnosis"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:11Z"}