{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd-6350"},"canonical_url":"https://search.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd-6350","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"Application of Image Data Compression Using Vector Quantization","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Karam, Walid Philip"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis - University Access Only","degree_discipline":"Electrical Engineering","degree_department":null,"school":null,"contributors":["Robert G. Finch"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T09:02:16Z","subjects":["Electrical and Computer Engineering","Engineering"],"languages":["English"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://openprairie.sdstate.edu/etd/5336","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://openprairie.sdstate.edu/etd/5336","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://openprairie.sdstate.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopenprairie.sdstate.edu%3Aetd-6350","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Robert G. Finch"]},{"key":"dc:creator","label":"Author","values":["Karam, Walid Philip"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2021-06-01T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["1990-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - University Access Only"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical and Computer Engineering","Engineering"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://openprairie.sdstate.edu/etd/5336"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Application of Image Data Compression Using Vector Quantization"]}]}],"canonical_facts":{"dc:contributor":["Robert G. Finch"],"dc:creator":["Karam, Walid Philip"],"dc:date.available":["2021-06-01T07:00:00Z"],"dc:date.created":["1990-01-01T08:00:00Z"],"dc:description.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."],"dc:identifier":["https://openprairie.sdstate.edu/etd/5336"],"dc:language":["English"],"dc:subject":["Electrical and Computer Engineering","Engineering"],"dc:title":["Application of Image Data Compression Using Vector Quantization"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["Thesis - University Access Only"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T09:02:16Z"}