{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/27086"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/27086","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Approximate inference methods for grid-structured MRFs","abstract":"In this thesis, I compared the mean field, belief propagation, and graph cuts methods for performing approximate inference on an MRF. I developed a method by which the memory requirements for belief propagation could be significantly reduced. I also developed a modification of the graph cuts algorithm that allows it to work on MRFs with very general potential functions. These changes make it possible to use any of the three algorithms on medical imaging problems. The three algorithms were then tested on simulated problems so that their accuracy and efficiency could be compared.","abstract_html":"In this thesis, I compared the mean field, belief propagation, and graph cuts methods for performing approximate inference on an MRF. I developed a method by which the memory requirements for belief propagation could be significantly reduced. I also developed a modification of the graph cuts algorithm that allows it to work on MRFs with very general potential functions. These changes make it possible to use any of the three algorithms on medical imaging problems. The three algorithms were then tested on simulated problems so that their accuracy and efficiency could be compared.","abstract_has_math":false,"creators":["Battocchi, Keith, 1980-"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Leslie Kaelbling."],"committee_chairs":[],"committee_members":[],"year":2004,"date_issued":"2004","date_published":"2004","updated_at":"2026-07-22T22:21:55Z","subjects":["Electrical Engineering and Computer Science."],"languages":["en_US"],"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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/27086","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Leslie Kaelbling."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Battocchi, Keith, 1980-"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-09-06T21:40:17Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-09-06T21:40:17Z"]},{"key":"dc:date.issued","label":"Date","values":["2004"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/27086"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.","Includes bibliographical references (p. 43-44)."]},{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, I compared the mean field, belief propagation, and graph cuts methods for performing approximate inference on an MRF. I developed a method by which the memory requirements for belief propagation could be significantly reduced. I also developed a modification of the graph cuts algorithm that allows it to work on MRFs with very general potential functions. These changes make it possible to use any of the three algorithms on medical imaging problems. The three algorithms were then tested on simulated problems so that their accuracy and efficiency could be compared."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng.and S.B."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Approximate inference methods for grid-structured MRFs"]}]}],"canonical_facts":{"dc:contributor.advisor":["Leslie Kaelbling."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Battocchi, Keith, 1980-"],"dc:date.accessioned":["2005-09-06T21:40:17Z"],"dc:date.available":["2005-09-06T21:40:17Z"],"dc:date.issued":["2004"],"dc:description":["Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.","Includes bibliographical references (p. 43-44)."],"dc:description.abstract":["In this thesis, I compared the mean field, belief propagation, and graph cuts methods for performing approximate inference on an MRF. I developed a method by which the memory requirements for belief propagation could be significantly reduced. I also developed a modification of the graph cuts algorithm that allows it to work on MRFs with very general potential functions. These changes make it possible to use any of the three algorithms on medical imaging problems. The three algorithms were then tested on simulated problems so that their accuracy and efficiency could be compared."],"dc:description.degree":["M.Eng.and S.B."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/27086"],"dc:language.iso":["en_US"],"dc:publisher":["Massachusetts Institute of Technology"],"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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Approximate inference methods for grid-structured MRFs"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:55Z"}