The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 길이가 다른 기저 함수를 갖는 LOT(Lapped Orthogonal Transform)을 고려합니다. 제안된 불평등 길이 LOT(ULLOT)은 길이 2의 긴 기저를 모두 갖습니다.M 그리고 길이의 짧은 기초 M, 기존 LOT의 모든 베이스 길이는 2입니다.M. Malvar의 Fast LOT를 일부 수정하여 새로운 LOT 클래스를 구성할 수 있습니다. 따라서 DCT(Discrete Cosine Transform)에 대한 빠른 알고리즘은 확실히 ULLOT 계산을 용이하게 합니다. ULLOT의 계산 복잡도는 항상 LOT보다 낮지만, ULLOT의 코딩 이득이 LOT보다 약간 높아지는 경우도 있습니다. 링잉 아티팩트를 줄이는 기능도 매력적인 기능입니다. 유한 길이 신호에 대한 크기 제한 구조를 조사하고 ULLOT을 이미지 코딩 응용 프로그램에서 테스트했습니다. 시뮬레이션 결과는 제안된 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.
부
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
부
@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},}
부
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 -