Dynamic Algorithm for Constructing the Optimal Subband Decomposition

Bong-Keun CHOI; Won-Ha KIM

Dynamic Algorithm for Constructing the Optimal Subband Decomposition

Bong-Keun CHOI, Won-Ha KIM

Full Text Views

0

Share
Cite this

Summary :

In this paper, we develop a fast dynamic programming technique to construct the subband decomposition yielding the maximum coding gain. We first derive a unified coding gain applicable to arbitrary subband decompositions and arbitrary filter bases. Then, we prove that the unified coding gains are monotonically increasing function for the implementation complexities. Based on this phenomenon, we treat the implementation complexity and the coding gain in the same way as the rate and distortion function. Finally, we applied the developed algorithm to the wavelet packet based image coding, so as to verify coding performance improvement by the proposed algorithm.

Publication: IEICE TRANSACTIONS on Information Vol.E86-D No.3 pp.633-640

Publication Date: 2003/03/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Image Processing, Image Pattern Recognition

Cite this

Copy

Bong-Keun CHOI, Won-Ha KIM, "Dynamic Algorithm for Constructing the Optimal Subband Decomposition" in IEICE TRANSACTIONS on Information, vol. E86-D, no. 3, pp. 633-640, March 2003, doi: .
Abstract: In this paper, we develop a fast dynamic programming technique to construct the subband decomposition yielding the maximum coding gain. We first derive a unified coding gain applicable to arbitrary subband decompositions and arbitrary filter bases. Then, we prove that the unified coding gains are monotonically increasing function for the implementation complexities. Based on this phenomenon, we treat the implementation complexity and the coding gain in the same way as the rate and distortion function. Finally, we applied the developed algorithm to the wavelet packet based image coding, so as to verify coding performance improvement by the proposed algorithm.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e86-d_3_633/_p

Copy

@ARTICLE{e86-d_3_633,
author={Bong-Keun CHOI, Won-Ha KIM, },
journal={IEICE TRANSACTIONS on Information},
title={Dynamic Algorithm for Constructing the Optimal Subband Decomposition},
year={2003},
volume={E86-D},
number={3},
pages={633-640},
abstract={In this paper, we develop a fast dynamic programming technique to construct the subband decomposition yielding the maximum coding gain. We first derive a unified coding gain applicable to arbitrary subband decompositions and arbitrary filter bases. Then, we prove that the unified coding gains are monotonically increasing function for the implementation complexities. Based on this phenomenon, we treat the implementation complexity and the coding gain in the same way as the rate and distortion function. Finally, we applied the developed algorithm to the wavelet packet based image coding, so as to verify coding performance improvement by the proposed algorithm.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Dynamic Algorithm for Constructing the Optimal Subband Decomposition
T2 - IEICE TRANSACTIONS on Information
SP - 633
EP - 640
AU - Bong-Keun CHOI
AU - Won-Ha KIM
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E86-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2003
AB - In this paper, we develop a fast dynamic programming technique to construct the subband decomposition yielding the maximum coding gain. We first derive a unified coding gain applicable to arbitrary subband decompositions and arbitrary filter bases. Then, we prove that the unified coding gains are monotonically increasing function for the implementation complexities. Based on this phenomenon, we treat the implementation complexity and the coding gain in the same way as the rate and distortion function. Finally, we applied the developed algorithm to the wavelet packet based image coding, so as to verify coding performance improvement by the proposed algorithm.
ER -