Globally optimal algorithms for multiple-transform signal compression
Name
940973860-MIT.pdf
Description
Full printable version
Size
6.61 MB
Format
Adobe PDF
Checksum (MD5)
cdcec7a49a8b99797dcd862b75c4f61c
Author(s)
Nissenbaum, Lucas
Advisor(s)
Jae S. Lim.
Date Issued
2015
Publisher
Massachusetts Institute of Technology
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.
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).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
