{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/101583"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/101583","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Globally optimal algorithms for multiple-transform signal compression","abstract":"In video compression, a single transform such as the DCT is typically used. Multiple-transforms such as directional 1-D DCTs have been proposed to exploit the different statistical characteristics of motion compensation residuals. Many issues are associated with this scenario. In this thesis, we will focus on the issue of selecting the appropriate number of coefficients and transforms to be allocated for each block of the signal to optimize the energy compaction. We propose two new methods to select optimal transforms for different blocks in a signal. The first method is based on thresholding, while the second method is based on dynamic programming and related to the multiple-choice knapsack problem. These algorithms are then compared to two other previous algorithms. We analyze the energy compaction performance of these algorithms in terms of different block-sizes and different input characteristics. We then extend all of these algorithms to quantizated coefficients being transmitted, as well as to take a bit-rate constraint into account.","abstract_html":"In video compression, a single transform such as the DCT is typically used. Multiple-transforms such as directional 1-D DCTs have been proposed to exploit the different statistical characteristics of motion compensation residuals. Many issues are associated with this scenario. In this thesis, we will focus on the issue of selecting the appropriate number of coefficients and transforms to be allocated for each block of the signal to optimize the energy compaction. We propose two new methods to select optimal transforms for different blocks in a signal. The first method is based on thresholding, while the second method is based on dynamic programming and related to the multiple-choice knapsack problem. These algorithms are then compared to two other previous algorithms. We analyze the energy compaction performance of these algorithms in terms of different block-sizes and different input characteristics. We then extend all of these algorithms to quantizated coefficients being transmitted, as well as to take a bit-rate constraint into account.","abstract_has_math":false,"creators":["Nissenbaum, Lucas"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Jae S. Lim."],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015","date_published":"2015","updated_at":"2026-07-22T22:21:32Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"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/101583","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Jae S. Lim."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Nissenbaum, Lucas"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2016-03-03T21:10:26Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2016-03-03T21:10:26Z"]},{"key":"dc:date.issued","label":"Date","values":["2015"]},{"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":["eng"]},{"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/101583"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 75-77)."]},{"key":"dc:description.abstract","label":"Abstract","values":["In video compression, a single transform such as the DCT is typically used. Multiple-transforms such as directional 1-D DCTs have been proposed to exploit the different statistical characteristics of motion compensation residuals. Many issues are associated with this scenario. In this thesis, we will focus on the issue of selecting the appropriate number of coefficients and transforms to be allocated for each block of the signal to optimize the energy compaction. We propose two new methods to select optimal transforms for different blocks in a signal. The first method is based on thresholding, while the second method is based on dynamic programming and related to the multiple-choice knapsack problem. These algorithms are then compared to two other previous algorithms. We analyze the energy compaction performance of these algorithms in terms of different block-sizes and different input characteristics. We then extend all of these algorithms to quantizated coefficients being transmitted, as well as to take a bit-rate constraint into account."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:title","label":"Title","values":["Globally optimal algorithms for multiple-transform signal compression"]}]}],"canonical_facts":{"dc:contributor.advisor":["Jae S. Lim."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:creator":["Nissenbaum, Lucas"],"dc:date.accessioned":["2016-03-03T21:10:26Z"],"dc:date.available":["2016-03-03T21:10:26Z"],"dc:date.issued":["2015"],"dc:description":["Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 75-77)."],"dc:description.abstract":["In video compression, a single transform such as the DCT is typically used. Multiple-transforms such as directional 1-D DCTs have been proposed to exploit the different statistical characteristics of motion compensation residuals. Many issues are associated with this scenario. In this thesis, we will focus on the issue of selecting the appropriate number of coefficients and transforms to be allocated for each block of the signal to optimize the energy compaction. We propose two new methods to select optimal transforms for different blocks in a signal. The first method is based on thresholding, while the second method is based on dynamic programming and related to the multiple-choice knapsack problem. These algorithms are then compared to two other previous algorithms. We analyze the energy compaction performance of these algorithms in terms of different block-sizes and different input characteristics. We then extend all of these algorithms to quantizated coefficients being transmitted, as well as to take a bit-rate constraint into account."],"dc:description.degree":["S.M."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/101583"],"dc:language.iso":["eng"],"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":["Globally optimal algorithms for multiple-transform signal compression"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:32Z"}