UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Prediction-based incremental refinement for binomially-factorized discrete wavelet transforms

Andreopoulos, Y; Jiang, D; Demosthenous, A; (2010) Prediction-based incremental refinement for binomially-factorized discrete wavelet transforms. IEEE Transactions on Signal Processing , 58 (8) 4441 -4447. 10.1109/TSP.2010.2048707. Green open access

[thumbnail of T-SP-09192-2009_Andreopoulos_Jiang_Demosthenous_1col_DoubleSpace.pdf]
Preview
PDF
T-SP-09192-2009_Andreopoulos_Jiang_Demosthenous_1col_DoubleSpace.pdf

Download (514kB)

Abstract

It was proposed recently that quantized representations of the input source (e. g., images, video) can be used for the computation of the two-dimensional discrete wavelet transform (2D DWT) incrementally. The coarsely quantized input source is used for the initial computation of the forward or inverse DWT, and the result is successively refined with each new refinement of the source description via an embedded quantizer. This computation is based on the direct two-dimensional factorization of the DWT using the generalized spatial combinative lifting algorithm. In this correspondence, we investigate the use of prediction for the computation of the results, i.e., exploiting the correlation of neighboring input samples (or transform coefficients) in order to reduce the dynamic range of the required computations, and thereby reduce the circuit activity required for the arithmetic operations of the forward or inverse transform. We focus on binomial factorizations of DWTs that include (amongst others) the popular 9/7 filter pair. Based on an FPGA arithmetic co-processor testbed, we present energy-consumption results for the arithmetic operations of incremental refinement and prediction-based incremental refinement in comparison to the conventional (nonrefinable) computation. Our tests with combinations of intra and error frames of video sequences show that the former can be 70% more energy efficient than the latter for computing to half precision and remains 15% more efficient for full-precision computation.

Type: Article
Title: Prediction-based incremental refinement for binomially-factorized discrete wavelet transforms
Open access status: An open access version is available from UCL Discovery
DOI: 10.1109/TSP.2010.2048707
Publisher version: http://dx.doi.org/10.1109/TSP.2010.2048707
Language: English
Additional information: © 2010 IEEE. Personal use of this material (accepted version) is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Keywords: Approximate signal processing, Discrete wavelet transform, Energy consumption, Incremental refinement of computation, Lifting scheme, Computation, Image
UCL classification: UCL
UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Electronic and Electrical Eng
URI: https://discovery.ucl.ac.uk/id/eprint/409285
Downloads since deposit
145Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item