Globally optimal algorithms for multiple-transform signal compression

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.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2015

Author dc:creator

• Nissenbaum, Lucas

Advisor dc:contributor.advisor

• Jae S. Lim.

• Electrical Engineering and Computer Science.

Statement 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/101583

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/101583