Off-campus South Dakota State University users: To download campus access theses, please use the following link to log into our proxy server with your South Dakota State University ID and password.

Non-South Dakota State University users: Please talk to your librarian about requesting this thesis through interlibrary loan.

Document Type

Thesis - University Access Only

Award Date

1990

Degree Name

Master of Science (MS)

Department / School

Electrical Engineering

First Advisor

Robert G. Finch

Abstract

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

Library of Congress Subject Headings

Data compression (Telecommunications)
Data compression (Computer science)
Vector spaces
Algorithms

Format

application/pdf

Number of Pages

137

Publisher

South Dakota State University

Download

Share

COinS