Fast LOT with unequal length basis functions: realization and application in subband image coding

Takayuki Nagai, Masaaki Ikehara

Research output: Contribution to journalArticle

6 Citations (Scopus)

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 2A/ and short basis of length M, while the lengths of all bases of the conventional LOT are 2JU. 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 (DOT) 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.

Original languageEnglish
Pages (from-to)825-834
Number of pages10
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE82-A
Issue number5
Publication statusPublished - 1999
Externally publishedYes

Fingerprint

Image Coding
Image coding
Unequal
Basis Functions
Mathematical transformations
Transform
Discrete cosine transforms
Coding Gain
Computational complexity
Discrete Cosine Transform
Fast Algorithm
Computational Complexity

Keywords

  • Fast algorithm
  • Lapped transform
  • Subband image coding

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

@article{99c84eaf1d3f4c14af1dc873dd3adf61,
title = "Fast LOT with unequal length basis functions: realization and application in subband image coding",
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 2A/ and short basis of length M, while the lengths of all bases of the conventional LOT are 2JU. 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 (DOT) 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 = "Fast algorithm, Lapped transform, Subband image coding",
author = "Takayuki Nagai and Masaaki Ikehara",
year = "1999",
language = "English",
volume = "E82-A",
pages = "825--834",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "5",

}

TY - JOUR

T1 - Fast LOT with unequal length basis functions

T2 - realization and application in subband image coding

AU - Nagai, Takayuki

AU - Ikehara, Masaaki

PY - 1999

Y1 - 1999

N2 - 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 2A/ and short basis of length M, while the lengths of all bases of the conventional LOT are 2JU. 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 (DOT) 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.

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 2A/ and short basis of length M, while the lengths of all bases of the conventional LOT are 2JU. 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 (DOT) 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.

KW - Fast algorithm

KW - Lapped transform

KW - Subband image coding

UR - http://www.scopus.com/inward/record.url?scp=0032634942&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032634942&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0032634942

VL - E82-A

SP - 825

EP - 834

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 5

ER -