In this paper, the Lapped Orthogonal Transform (LOT) with unequal length basis function is considered. The proposed unequal length LOT (ULLOT) has both long basis of length 2M and short basis of length M, while the lengths of all bases of the conventional LOT are 2M. A new class of LOT can be constructed with some modifications of Malvar's Fast LOT. Therefore, the fast algorithm for the Discrete Cosine Transform (DCT) will surely facilitate the computation of the ULLOT. Although the computational complexity of the ULLOT is always lower than that of the LOT, there exist some cases where the coding gain of the ULLOT becomes slightly higher than that of the LOT. Its ability to reduce ringing artifacts is an attractive feature as well. The size-limited structure for the finite length signal is investigated and the ULLOTs are tested on image coding application. The simulation results confirm the validity of the proposed ULLOT.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Takayuki NAGAI, Masaaki IKEHARA, "Fast LOT with Unequal Length Basis Functions: Realization and Application in Subband Image Coding" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 5, pp. 825-834, May 1999, doi: .
Abstract: In this paper, the Lapped Orthogonal Transform (LOT) with unequal length basis function is considered. The proposed unequal length LOT (ULLOT) has both long basis of length 2M and short basis of length M, while the lengths of all bases of the conventional LOT are 2M. A new class of LOT can be constructed with some modifications of Malvar's Fast LOT. Therefore, the fast algorithm for the Discrete Cosine Transform (DCT) will surely facilitate the computation of the ULLOT. Although the computational complexity of the ULLOT is always lower than that of the LOT, there exist some cases where the coding gain of the ULLOT becomes slightly higher than that of the LOT. Its ability to reduce ringing artifacts is an attractive feature as well. The size-limited structure for the finite length signal is investigated and the ULLOTs are tested on image coding application. The simulation results confirm the validity of the proposed ULLOT.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_5_825/_p
Copy
@ARTICLE{e82-a_5_825,
author={Takayuki NAGAI, Masaaki IKEHARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Fast LOT with Unequal Length Basis Functions: Realization and Application in Subband Image Coding},
year={1999},
volume={E82-A},
number={5},
pages={825-834},
abstract={In this paper, the Lapped Orthogonal Transform (LOT) with unequal length basis function is considered. The proposed unequal length LOT (ULLOT) has both long basis of length 2M and short basis of length M, while the lengths of all bases of the conventional LOT are 2M. A new class of LOT can be constructed with some modifications of Malvar's Fast LOT. Therefore, the fast algorithm for the Discrete Cosine Transform (DCT) will surely facilitate the computation of the ULLOT. Although the computational complexity of the ULLOT is always lower than that of the LOT, there exist some cases where the coding gain of the ULLOT becomes slightly higher than that of the LOT. Its ability to reduce ringing artifacts is an attractive feature as well. The size-limited structure for the finite length signal is investigated and the ULLOTs are tested on image coding application. The simulation results confirm the validity of the proposed ULLOT.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Fast LOT with Unequal Length Basis Functions: Realization and Application in Subband Image Coding
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 825
EP - 834
AU - Takayuki NAGAI
AU - Masaaki IKEHARA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 1999
AB - In this paper, the Lapped Orthogonal Transform (LOT) with unequal length basis function is considered. The proposed unequal length LOT (ULLOT) has both long basis of length 2M and short basis of length M, while the lengths of all bases of the conventional LOT are 2M. A new class of LOT can be constructed with some modifications of Malvar's Fast LOT. Therefore, the fast algorithm for the Discrete Cosine Transform (DCT) will surely facilitate the computation of the ULLOT. Although the computational complexity of the ULLOT is always lower than that of the LOT, there exist some cases where the coding gain of the ULLOT becomes slightly higher than that of the LOT. Its ability to reduce ringing artifacts is an attractive feature as well. The size-limited structure for the finite length signal is investigated and the ULLOTs are tested on image coding application. The simulation results confirm the validity of the proposed ULLOT.
ER -