{"id":{"repo_id":"utc","oai_identifier":"oai:scholar.utc.edu:theses-1064"},"canonical_url":"https://search.dev.ndltd.org/etd/utc/oai:scholar.utc.edu:theses-1064","repository":{"repo_id":"utc","name":"University of Tennessee - Chattanooga","base_url":"https://scholar.utc.edu/do/oai/"},"display":{"title":"Compressive sensing based imaging via belief propagation","abstract":"Multiple description coding (MDC) using Compressive Sensing (CS) mainly aims at restoring an image from a small subset of samples with reasonable accuracy using an iterative message passing decoding algorithm commonly known as Belief Propagation (BP). The CS technique can accurately recover any compressible or sparse signal from a lesser number of non-adaptive, randomized linear projection samples than that specified by the Nyquist rate. In this work, we demonstrate how CS-based encoding generates measurements from the sparse image signal and the measurement matrix. Then we demonstrate how a BP decoding algorithm reconstructs the image from the measurements generated. In our work, the CS-BP algorithm assumes that all the unknown variables have the same prior distribution as we do not have any knowledge of the side information available during the initiation of the decoding process. Thus, we prove that this algorithm is effective even in the absence of side information.","abstract_html":"Multiple description coding (MDC) using Compressive Sensing (CS) mainly aims at restoring an image from a small subset of samples with reasonable accuracy using an iterative message passing decoding algorithm commonly known as Belief Propagation (BP). The CS technique can accurately recover any compressible or sparse signal from a lesser number of non-adaptive, randomized linear projection samples than that specified by the Nyquist rate. In this work, we demonstrate how CS-based encoding generates measurements from the sparse image signal and the measurement matrix. Then we demonstrate how a BP decoding algorithm reconstructs the image from the measurements generated. In our work, the CS-BP algorithm assumes that all the unknown variables have the same prior distribution as we do not have any knowledge of the side information available during the initiation of the decoding process. Thus, we prove that this algorithm is effective even in the absence of side information.","abstract_has_math":false,"creators":["Ramachandra, Preethi Modur"],"institution":"University of Tennessee at Chattanooga","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Sartipi, Mina","Craven, Stephen D.; Yaqub, Raziq","College of Engineering and Computer Science"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-07-24T05:46:02Z","subjects":["Computer algorithms","Data structures (Computer science)","Signal processing -- Digital techniques"],"languages":["English","eng"],"rights":[],"rights_urls":["https://rightsstatements.org/page/InC/1.0/?language=en"],"identifier_entries":[]},"links":{"outbound_url":"https://scholar.utc.edu/theses/62","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Sartipi, Mina","Craven, Stephen D.; Yaqub, Raziq","College of Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Ramachandra, Preethi Modur"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2012-05-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["University of Tennessee at Chattanooga","Chattanooga (Tenn.)"]},{"key":"dc:relation","label":"Dc Relation","values":["Masters Theses and Doctoral Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["Masters theses","Text"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer algorithms","Data structures (Computer science)","Signal processing -- Digital techniques"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English","eng"]},{"key":"dc:rights","label":"Dc Rights","values":["https://rightsstatements.org/page/InC/1.0/?language=en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholar.utc.edu/theses/62"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Dept. of Electrical Engineering","M. S.; A thesis submitted to the faculty of the University of Tennessee at Chattanooga in partial fulfillment of the requirements of the degree of Master of Science."]},{"key":"dc:description.abstract","label":"Abstract","values":["Multiple description coding (MDC) using Compressive Sensing (CS) mainly aims at restoring an image from a small subset of samples with reasonable accuracy using an iterative message passing decoding algorithm commonly known as Belief Propagation (BP). The CS technique can accurately recover any compressible or sparse signal from a lesser number of non-adaptive, randomized linear projection samples than that specified by the Nyquist rate. In this work, we demonstrate how CS-based encoding generates measurements from the sparse image signal and the measurement matrix. Then we demonstrate how a BP decoding algorithm reconstructs the image from the measurements generated. In our work, the CS-BP algorithm assumes that all the unknown variables have the same prior distribution as we do not have any knowledge of the side information available during the initiation of the decoding process. Thus, we prove that this algorithm is effective even in the absence of side information."]},{"key":"dc:title","label":"Title","values":["Compressive sensing based imaging via belief propagation"]}]}],"canonical_facts":{"dc:contributor":["Sartipi, Mina","Craven, Stephen D.; Yaqub, Raziq","College of Engineering and Computer Science"],"dc:creator":["Ramachandra, Preethi Modur"],"dc:date":["2012-05-01T07:00:00Z"],"dc:description":["Dept. of Electrical Engineering","M. S.; A thesis submitted to the faculty of the University of Tennessee at Chattanooga in partial fulfillment of the requirements of the degree of Master of Science."],"dc:description.abstract":["Multiple description coding (MDC) using Compressive Sensing (CS) mainly aims at restoring an image from a small subset of samples with reasonable accuracy using an iterative message passing decoding algorithm commonly known as Belief Propagation (BP). The CS technique can accurately recover any compressible or sparse signal from a lesser number of non-adaptive, randomized linear projection samples than that specified by the Nyquist rate. In this work, we demonstrate how CS-based encoding generates measurements from the sparse image signal and the measurement matrix. Then we demonstrate how a BP decoding algorithm reconstructs the image from the measurements generated. In our work, the CS-BP algorithm assumes that all the unknown variables have the same prior distribution as we do not have any knowledge of the side information available during the initiation of the decoding process. Thus, we prove that this algorithm is effective even in the absence of side information."],"dc:identifier":["https://scholar.utc.edu/theses/62"],"dc:language":["English","eng"],"dc:publisher":["University of Tennessee at Chattanooga","Chattanooga (Tenn.)"],"dc:relation":["Masters Theses and Doctoral Dissertations"],"dc:rights":["https://rightsstatements.org/page/InC/1.0/?language=en"],"dc:subject":["Computer algorithms","Data structures (Computer science)","Signal processing -- Digital techniques"],"dc:title":["Compressive sensing based imaging via belief propagation"],"dc:type":["Masters theses","Text"]},"updated_at":"2026-07-24T05:46:02Z"}