Asset Details
Do you wish to reserve the book?
Reduced memory, low complexity embedded image compression algorithm using hierarchical listless discrete Tchebichef transform
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Reduced memory, low complexity embedded image compression algorithm using hierarchical listless discrete Tchebichef transform
Do you wish to request the book?
Reduced memory, low complexity embedded image compression algorithm using hierarchical listless discrete Tchebichef transform
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Reduced memory, low complexity embedded image compression algorithm using hierarchical listless discrete Tchebichef transform
2014
Overview
Listless set partitioning embedded block (LSK) and set partitioning embedded block (SPECK) are known for their low complexity and simple implementation. However, the drawback is that these block-based algorithms encode each insignificant subband by a zero. This generates many zeros at earlier passes because the number of significant coefficients at higher bitplanes is likely to be very few in a transformed image. An improved LSK (ILSK) algorithm that codes a single zero to several insignificant subbands is proposed. This reduces the length of the output bit string, encoding/decoding time and dynamic memory requirement at early passes. Furthermore, ILSK algorithm is coupled with discrete Tchebichef transform (DTT). This gives rise to a novel coder named as hierarchical listless DTT (HLDTT). The proposed HLDTT has desirable attributes like full embeddedness for progressive transmission, precise rate control for constant bit rate traffic and low complexity for low power applications. The performance of HLDTT is assessed using peak-signal-to-noise-ratio (PSNR) and structural-similarity-index-metric (SSIM). Extensive simulation conducted on various standard test images shows that HLDTT exhibits significant improvement in PSNR values from lower to medium bit rates. At the same time, HLDTT shows improvement in SSIM values on all bit rates.
Publisher
The Institution of Engineering and Technology,Institution of Engineering and Technology,The Institution of Engineering & Technology
Subject
/ Blocking
/ Detection, estimation, filtering, equalization, prediction
/ Exact sciences and technology
/ hierarchical listless discrete Tchebichef transform
/ HLDTT
/ Information, signal and communications theory
/ listless set partitioning embedded block
/ low complexity embedded image compression algorithm
/ PSNR
/ reduced memory image compression algorithm
/ set partitioning embedded block
/ Signal and communications theory
/ SPECK
/ SSIM
/ Strings
/ structural‐symmetric‐index‐metric
