M-LTW: A fast and efficient intra video codec
Image Communication
A new integer image coding technique based on orthogonal polynomials
Image and Vision Computing
Low-complexity TTCM based distributed video coding architecture
PSIVT'07 Proceedings of the 2nd Pacific Rim conference on Advances in image and video technology
E-LTW: an enhanced LTW encoder with sign coding and precise rate control
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
On the use of genetic algorithms to improve wavelet sign coding performance
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
Low bit-rate video coding with 3d lower trees (3D-LTW)
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
Rate Control Algorithms for Non-Embedded Wavelet-Based Image Coding
Journal of Signal Processing Systems
Video compression schemes using edge feature on wireless video sensor networks
Journal of Electrical and Computer Engineering
Fast 3D wavelet transform on multicore and many-core computing platforms
The Journal of Supercomputing
| Hi-index | 0.00 |
In this paper, a new image compression algorithm is proposed based on the efficient construction of wavelet coefficient lower trees. The main contribution of the proposed lower-tree wavelet (LTW) encoder is the utilization of coefficient trees, not only as an efficient method of grouping coefficients, but also as a fast way of coding them. Thus, it presents state-of-the-art compression performance, whereas its complexity is lower than the one presented in other wavelet coders, like SPIHT and JPEG 2000. Fast execution is achieved by means of a simple two-pass coding and one-pass decoding algorithm. Moreover, its computation does not require additional lists or complex data structures, so there is no memory overhead. A formal description of the algorithm is provided, while reference software is also given. Numerical results show that our codec works faster than SPIHT and JPEG 2000 (up to three times faster than SPIHT and fifteen times faster than JPEG 2000), with similar coding efficiency