Near-lossless image compression and multi-track (d,k) modulation codes.

Persistent Link:
http://hdl.handle.net/10150/187430
Title:
Near-lossless image compression and multi-track (d,k) modulation codes.
Author:
Ke, Ligang.
Issue Date:
1995
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
This dissertation addresses two important topics in digital communication systems. Namely, near-lossless image compression and multi-track (d, k) modulation codes in applications of magnetic/optical recording channels. On the first topic, a near-lossless image compression scheme is presented. It is essentially a differential pulse code modulation (DPCM) system with a mechanism incorporated to minimize the entropy of the quantized prediction error sequence. With a "near-lossless" criterion of no more than a d gray level error for each pixel, where d is a small nonnegative integer, trellises describing all allowable quantized prediction error sequences are constructed. A set of "contexts" is defined for the conditioning prediction error model and an algorithm that produces minimum entropy conditioned on the contexts is presented. Finally, experimental results are given. On the second topic, a new construction for n-track (d, k) codes with redundancy r, referred to as (d, k; n, r) codes, is presented. This construction applies single-track (d, k + Δk) codes (with certain extra constraints and appropriate amounts of delay) on each of the 11 tracks. This construction achieves a large part of the capacity increases possible when using (d, k; n, r) codes, has simple encoders and decoders, and exhibits considerable robustness to faulty tracks. It is shown that under this construction, (d, k; n, r) codes can achieve at least (n - l' - 1)/n * 100% of the gap in capacity between conventional (d, k) and (d, ∞) codes. Several practical examples of (d, k; n, r) codes constructed using our method are presented.
Type:
text; Dissertation-Reproduction (electronic)
Degree Name:
Ph.D.
Degree Level:
doctoral
Degree Program:
Electrical and Computer Engineering; Graduate College
Degree Grantor:
University of Arizona
Committee Chair:
Marcellin, Michael W.

Full metadata record

DC FieldValue Language
dc.language.isoenen_US
dc.titleNear-lossless image compression and multi-track (d,k) modulation codes.en_US
dc.creatorKe, Ligang.en_US
dc.contributor.authorKe, Ligang.en_US
dc.date.issued1995en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractThis dissertation addresses two important topics in digital communication systems. Namely, near-lossless image compression and multi-track (d, k) modulation codes in applications of magnetic/optical recording channels. On the first topic, a near-lossless image compression scheme is presented. It is essentially a differential pulse code modulation (DPCM) system with a mechanism incorporated to minimize the entropy of the quantized prediction error sequence. With a "near-lossless" criterion of no more than a d gray level error for each pixel, where d is a small nonnegative integer, trellises describing all allowable quantized prediction error sequences are constructed. A set of "contexts" is defined for the conditioning prediction error model and an algorithm that produces minimum entropy conditioned on the contexts is presented. Finally, experimental results are given. On the second topic, a new construction for n-track (d, k) codes with redundancy r, referred to as (d, k; n, r) codes, is presented. This construction applies single-track (d, k + Δk) codes (with certain extra constraints and appropriate amounts of delay) on each of the 11 tracks. This construction achieves a large part of the capacity increases possible when using (d, k; n, r) codes, has simple encoders and decoders, and exhibits considerable robustness to faulty tracks. It is shown that under this construction, (d, k; n, r) codes can achieve at least (n - l' - 1)/n * 100% of the gap in capacity between conventional (d, k) and (d, ∞) codes. Several practical examples of (d, k; n, r) codes constructed using our method are presented.en_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
thesis.degree.namePh.D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineElectrical and Computer Engineeringen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.chairMarcellin, Michael W.en_US
dc.contributor.committeememberSchooley, Larry C.en_US
dc.contributor.committeememberChugg, Keithen_US
dc.identifier.proquest9624135en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.