| dc.contributor.advisor |
Alan S. Willsky. |
en_US |
| dc.contributor.author |
Kreidl, O. Patrick |
en_US |
| dc.contributor.other |
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. |
en_US |
| dc.date.accessioned |
2009-07-01T16:53:08Z |
|
| dc.date.available |
2009-07-01T16:53:08Z |
|
| dc.date.copyright |
2008 |
en_US |
| dc.date.issued |
2008 |
en_US |
| dc.identifier.uri |
http://dspace.mit.edu/handle/1721.1/43061 |
en_US |
| dc.identifier.uri |
http://hdl.handle.net/1721.1/43061 |
|
| dc.description |
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008. |
en_US |
| dc.description |
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. |
en_US |
| dc.description |
Includes bibliographical references (p. [201]-210). |
en_US |
| dc.description.abstract |
Inference problems, typically posed as the computation of summarizing statistics (e.g., marginals, modes, means, likelihoods), arise in a variety of scientific fields and engineering applications. Probabilistic graphical models provide a scalable framework for developing efficient inference methods, such as message-passing algorithms that exploit the conditional independencies encoded by the given graph. Conceptually, this framework extends naturally to a distributed network setting: by associating to each node and edge in the graph a distinct sensor and communication link, respectively, the iterative message-passing algorithms are equivalent to a sequence of purely-local computations and nearest-neighbor communications. Practically, modern sensor networks can also involve distributed resource constraints beyond those satisfied by existing message-passing algorithms, including e.g., a fixed small number of iterations, the presence of low-rate or unreliable links, or a communication topology that differs from the probabilistic graph. The principal focus of this thesis is to augment the optimization problems from which existing message-passing algorithms are derived, explicitly taking into account that there may be decision-driven processing objectives as well as constraints or costs on available network resources. The resulting problems continue to be NP-hard, in general, but under certain conditions become amenable to an established team-theoretic relaxation technique by which a new class of efficient message-passing algorithms can be derived. From the academic perspective, this thesis marks the intersection of two lines of active research, namely approximate inference methods for graphical models and decentralized Bayesian methods for multi-sensor detection. |
en_US |
| dc.description.abstract |
(cont)The respective primary contributions are new message-passing algorithms for (i) "online" measurement processing in which global decision performance degrades gracefully as network constraints become arbitrarily severe and for (ii) "offline" strategy optimization that remain tractable in a larger class of detection objectives and network constraints than previously considered. From the engineering perspective, the analysis and results of this thesis both expose fundamental issues in distributed sensor systems and advance the development of so-called "self-organizing fusion-layer" protocols compatible with emerging concepts in ad-hoc wireless networking. |
en_US |
| dc.description.provenance |
Made available in DSpace on 2009-07-01T16:53:08Z (GMT). No. of bitstreams: 2
244102978.pdf: 2187037 bytes, checksum: 846cb9f34de1ad236998d4dda8f45ba0 (MD5)
244102978-MIT.pdf: 2200057 bytes, checksum: fbac61681586d5da874dbd17fc0f0ecd (MD5)
Previous issue date: 2008 |
en |
| dc.description.statementofresponsibility |
by O. Patrick Kreidl. |
en_US |
| dc.format.extent |
210 p. |
en_US |
| dc.language.iso |
eng |
en_US |
| dc.publisher |
Massachusetts Institute of Technology |
en_US |
| dc.rights |
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission. |
en_US |
| dc.rights.uri |
http://dspace.mit.edu/handle/1721.1/43061 |
en_US |
| dc.rights.uri |
http://dspace.mit.edu/handle/1721.1/7582 |
en_US |
| dc.subject |
Electrical Engineering and Computer Science. |
en_US |
| dc.title |
Graphical models and message-passing algorithms for network-constrained decision problems |
en_US |
| dc.type |
Thesis |
en_US |
| dc.description.degree |
Ph.D. |
en_US |
| dc.contributor.department |
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. |
en_US |
| dc.identifier.oclc |
244102978 |
en_US |
