Welcome to the InfoSci Platform
Fast Vector Quantization Encoding Algorithms for Image Compression

Fast Vector Quantization Encoding Algorithms for Image Compression

Ahmed Swilem
Copyright: © 2009 |Volume: 1 |Issue: 1 |Pages: 13
ISSN: 1937-9412|EISSN: 1937-9404|ISSN: 1937-9412|EISBN13: 9781615204120|EISSN: 1937-9404|DOI: 10.4018/jmcmc.2009010102
Cite Article Cite Article

MLA

Swilem, Ahmed. "Fast Vector Quantization Encoding Algorithms for Image Compression." IJMCMC vol.1, no.1 2009: pp.16-28. http://doi.org/10.4018/jmcmc.2009010102

APA

Swilem, A. (2009). Fast Vector Quantization Encoding Algorithms for Image Compression. International Journal of Mobile Computing and Multimedia Communications (IJMCMC), 1(1), 16-28. http://doi.org/10.4018/jmcmc.2009010102

Chicago

Swilem, Ahmed. "Fast Vector Quantization Encoding Algorithms for Image Compression," International Journal of Mobile Computing and Multimedia Communications (IJMCMC) 1, no.1: 16-28. http://doi.org/10.4018/jmcmc.2009010102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Vector quantization (VQ) is a well-known compression method. In the encoding phase, given a block represented as a vector, searching the closest codeword in the codebook is a time-consuming task. In this article, two fast encoding algorithms for VQ are proposed. To reduce the search area and accelerate the search process, the first algorithm utilizes three significant features of a vector that are, the norm, andtwo projection angles to two projection axes. The second algorithm uses the first two features as in the first algorithm with the projection value of the vector to the second projection axe. The algorithms allow significant acceleration in the encoding process. Experimental results are presented on image block data. These results confirm the effectiveness of the proposed algorithms.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.