<I>M</I>-Channel Fast Hartley Transform Based Integer DCT for Lossy-to-Lossless Image Coding

Taizo SUZUKI; Hirotomo ASO

doi:10.1587/transfun.E96.A.762

M-Channel Fast Hartley Transform Based Integer DCT for Lossy-to-Lossless Image Coding

Taizo SUZUKI, Hirotomo ASO

Full Text Views

0

Share
Cite this

Summary :

This paper presents an M-channel (M=2ⁿ (n ∈ N)) integer discrete cosine transforms (IntDCTs) based on fast Hartley transform (FHT) for lossy-to-lossless image coding which has image quality scalability from lossy data to lossless data. Many IntDCTs with lifting structures have already been presented to achieve lossy-to-lossless image coding. Recently, an IntDCT based on direct-lifting of DCT/IDCT, which means direct use of DCT and inverse DCT (IDCT) to lifting blocks, has been proposed. Although the IntDCT shows more efficient coding performance than any conventional IntDCT, it entails many computational costs due to an extra information that is a key point to realize its direct-lifting structure. On the other hand, the almost conventional IntDCTs without an extra information cannot be easily expanded to a larger size than the standard size M=8, or the conventional IntDCT should be improved for efficient coding performance even if it realizes an arbitrary size. The proposed IntDCT does not need any extra information, can be applied to size M=2ⁿ for arbitrary n, and shows better coding performance than the conventional IntDCTs without any extra information by applying the direct-lifting to the pre- and post-processing block of DCT. Moreover, the proposed IntDCT is implemented with a half of the computational cost of the IntDCT based on direct-lifting of DCT/IDCT even though it shows the best coding performance.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E96-A No.4 pp.762-768

Publication Date: 2013/04/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E96.A.762

Type of Manuscript: PAPER

Category: Digital Signal Processing

Cite this

Copy

Taizo SUZUKI, Hirotomo ASO, "M-Channel Fast Hartley Transform Based Integer DCT for Lossy-to-Lossless Image Coding" in IEICE TRANSACTIONS on Fundamentals, vol. E96-A, no. 4, pp. 762-768, April 2013, doi: 10.1587/transfun.E96.A.762.
Abstract: This paper presents an M-channel (M=2ⁿ (n ∈ N)) integer discrete cosine transforms (IntDCTs) based on fast Hartley transform (FHT) for lossy-to-lossless image coding which has image quality scalability from lossy data to lossless data. Many IntDCTs with lifting structures have already been presented to achieve lossy-to-lossless image coding. Recently, an IntDCT based on direct-lifting of DCT/IDCT, which means direct use of DCT and inverse DCT (IDCT) to lifting blocks, has been proposed. Although the IntDCT shows more efficient coding performance than any conventional IntDCT, it entails many computational costs due to an extra information that is a key point to realize its direct-lifting structure. On the other hand, the almost conventional IntDCTs without an extra information cannot be easily expanded to a larger size than the standard size M=8, or the conventional IntDCT should be improved for efficient coding performance even if it realizes an arbitrary size. The proposed IntDCT does not need any extra information, can be applied to size M=2ⁿ for arbitrary n, and shows better coding performance than the conventional IntDCTs without any extra information by applying the direct-lifting to the pre- and post-processing block of DCT. Moreover, the proposed IntDCT is implemented with a half of the computational cost of the IntDCT based on direct-lifting of DCT/IDCT even though it shows the best coding performance.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E96.A.762/_p

Copy

@ARTICLE{e96-a_4_762,
author={Taizo SUZUKI, Hirotomo ASO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={M-Channel Fast Hartley Transform Based Integer DCT for Lossy-to-Lossless Image Coding},
year={2013},
volume={E96-A},
number={4},
pages={762-768},
abstract={This paper presents an M-channel (M=2ⁿ (n ∈ N)) integer discrete cosine transforms (IntDCTs) based on fast Hartley transform (FHT) for lossy-to-lossless image coding which has image quality scalability from lossy data to lossless data. Many IntDCTs with lifting structures have already been presented to achieve lossy-to-lossless image coding. Recently, an IntDCT based on direct-lifting of DCT/IDCT, which means direct use of DCT and inverse DCT (IDCT) to lifting blocks, has been proposed. Although the IntDCT shows more efficient coding performance than any conventional IntDCT, it entails many computational costs due to an extra information that is a key point to realize its direct-lifting structure. On the other hand, the almost conventional IntDCTs without an extra information cannot be easily expanded to a larger size than the standard size M=8, or the conventional IntDCT should be improved for efficient coding performance even if it realizes an arbitrary size. The proposed IntDCT does not need any extra information, can be applied to size M=2ⁿ for arbitrary n, and shows better coding performance than the conventional IntDCTs without any extra information by applying the direct-lifting to the pre- and post-processing block of DCT. Moreover, the proposed IntDCT is implemented with a half of the computational cost of the IntDCT based on direct-lifting of DCT/IDCT even though it shows the best coding performance.},
keywords={},
doi={10.1587/transfun.E96.A.762},
ISSN={1745-1337},
month={April},}

Copy

TY - JOUR
TI - M-Channel Fast Hartley Transform Based Integer DCT for Lossy-to-Lossless Image Coding
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 762
EP - 768
AU - Taizo SUZUKI
AU - Hirotomo ASO
PY - 2013
DO - 10.1587/transfun.E96.A.762
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E96-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2013
AB - This paper presents an M-channel (M=2ⁿ (n ∈ N)) integer discrete cosine transforms (IntDCTs) based on fast Hartley transform (FHT) for lossy-to-lossless image coding which has image quality scalability from lossy data to lossless data. Many IntDCTs with lifting structures have already been presented to achieve lossy-to-lossless image coding. Recently, an IntDCT based on direct-lifting of DCT/IDCT, which means direct use of DCT and inverse DCT (IDCT) to lifting blocks, has been proposed. Although the IntDCT shows more efficient coding performance than any conventional IntDCT, it entails many computational costs due to an extra information that is a key point to realize its direct-lifting structure. On the other hand, the almost conventional IntDCTs without an extra information cannot be easily expanded to a larger size than the standard size M=8, or the conventional IntDCT should be improved for efficient coding performance even if it realizes an arbitrary size. The proposed IntDCT does not need any extra information, can be applied to size M=2ⁿ for arbitrary n, and shows better coding performance than the conventional IntDCTs without any extra information by applying the direct-lifting to the pre- and post-processing block of DCT. Moreover, the proposed IntDCT is implemented with a half of the computational cost of the IntDCT based on direct-lifting of DCT/IDCT even though it shows the best coding performance.
ER -