Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Multi-disciplinary Studies | en_US |
| dc.contributor | Department of Electronic Engineering | en_US |
| dc.creator | Chan, Cheuk-fai | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/315 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Image coding based on vector quantization in vector transform domain | en_US |
| dcterms.abstract | Image coding is an essential part of many applications such as digital television transmission, video conferencing, facsimile, image database, etc. There are many techniques to achieve this objective. The simplest technique is PCM which encodes individual pixels of an image in a memoryless way. Another technique is the Predictive coding. It quantizes the difference between a pixel and a prediction of the pixel from its neighbour pixels. In transform coding, a block of data samples is transformed from the image domain to the transform domain using an orthogonal transform, such as DCT. All of these techniques perform coding on scalars, either in image or transform domain. As Shannon's rate distortion theory [1] states that better performance can be achieved by coding vectors instead of scalars, many Vector Quantization (VQ) techniques have been developed. In 1991, a Vector Transform Vector Quantization (VTVQ) image coder was proposed by Li [4]. In his proposed VTVQ, image data vectors are first transformed into another set of vectors in the vector transform domain. VQ is then performed in the vector transform domain. The output of the vector transform domain VQ is transmitted or stored. At the reproduction end, a set of tables are used to reproduce quantized transform vectors. The corresponding inverse vector transform is used to reproduce the image. Similar to scalar transform coding, this vector transform coding techniques consists of two parts. The first part is the vector transform that has the decorrelation and energy packing properties. The second part is the VQ coding algorithm in vector transform domain. In this project, several new VTVQ image coding techniques are proposed and implemented. Their performance are also evaluated and summarized. Results show that all the proposed coders gain higher PSNR and better image quality than the Li's VTVQ coder for bpp higher than 0.25. When compared with the Li's VTVQ, the time and memory requirement for the codebook generation is largely reduced and the computation requirement for my proposed algorithms are also much superior than the Li's VTVQ algorithm. | en_US |
| dcterms.extent | iii, 87 leaves : ill. ; 30 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 1997 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Image processing -- Digital techniques | en_US |
| dcterms.LCSH | Coding theory | en_US |
| dcterms.LCSH | Vector processing (Computer science) | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b14033410.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 3.64 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/315