South Dakota State University
Application of Image Data Compression Using Vector Quantization
Abstract
dc:description.abstractData compression is essential for transmission and storage of images due to the amount of image data acquired every day. Many techniques have been suggested in the literature in the past two decades for the purpose of image compression. Vector quantization is a widely used scheme for image compression, and it is theoretically the best method since, according to Shannon’s source coding theorems, better results can be achieved by quantizing vectors instead of scalars [54]. A vector quantizer is a system that maps a vector space into a binary sequence. This sequence is transmitted or stored using fewer bits, achieving thus the compression desired. Many variations of vector quantization exist. The pairwise nearest neighbor clustering algorithm was implemented and tested at the EROS Data Center in Sioux Falls, SD. Compression ratios of 8 to 32 were achieved, with an encoding bit rate of 0.15 to 1.15. Reconstructed image quality was studied and encoding and decoding run times were recorded.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis - University Access Only
- Discipline thesis:degree_discipline
- Electrical Engineering
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Karam, Walid Philip
- Contributors dc:contributor
-
- Robert G. Finch
Subjects
dc:subject × 2Rights
- Language dc:language
- English
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://openprairie.sdstate.edu/etd/5336