LLEC: An image coder with low-complexity and low-memory requirement. A Low-complexity and Low-memory Entropy Coder (LLEC) for image compression is proposed in this paper. The two key elements in LLEC are zerotree coding and Golomb-Rice codes. Zerotree coding exploits the zerotree structure of transformed coefficients for higher compression efficiency. Golomb-Rice codes are used to code the remaining coefficients in a VLC/VLI manner for low complexity and low memory. The experimental results show that the compression efficiency of DCT- and DWT-based LLEC outperforms baseline JPEG and EZW at the given bit rates, respectively. When compared with SPIHT, LLEC is inferior by 0.3 dB on average for the tested images but superior in terms of computational complexity and memory requirement. In addition, LLEC has other desirable features such as parallel processing support, ROI (Region Of Interest) coding and as a universal entropy coder for DCT and DWT.

References in zbMATH (referenced in 5 articles , 1 standard article )

Showing results 1 to 5 of 5.
Sorted by year (citations)

  1. Liu, Hui; Huang, Ke-Kun: Zerotree wavelet image compression with weighted sub-block-trees and adaptive coding order (2016)
  2. Huu, Phat Nguyen; Tran-Quang, Vinh; Miyoshi, Takumi: Video compression schemes using edge feature on wireless video sensor networks (2012) ioport
  3. Wu, Bing-Fei; Huang, Hao-Yu; Chen, Yen-Lin: The single-pass perceptual embedded zero-tree coding implementation on DSP (2012)
  4. Zhao, Debin; Chan, Y. K.; Gao, Wen: Low-complexity and low-memory entropy coder for image compression. (2001) ioport
  5. Zhao, Debin; Gao, Wen; Shan, Shiguang; Chan, Y. K.: LLEC: An image coder with low-complexity and low-memory requirement (2001)