A fast Discrete Wavelet Transform algorithm for visual processing applications

doi:10.1016/j.sigpro.2011.06.009

Return

A fast Discrete Wavelet Transform algorithm for visual processing applications

2012-01-01

PRE

Chih‐Hsien Hsia

Jing-Ming Guo *

Jen‐Shiun Chiang

DOI：10.1016/j.sigpro.2011.06.009

Original

Original request for help

Save

Abstract

En 中文

For visual processing applications, the two-dimensional (2-D) Discrete Wavelet Transform (DWT) can be used to decompose an image into four-subband images. However, when a single band is required for a specific application, the four-band decomposition demands a huge complexity and transpose time. This work presents a fast algorithm, namely 2-D Symmetric Mask-based Discrete Wavelet Transform (SMDWT), to address some critical issues of the 2-D DWT. Unlike the traditional DWT involving dependent decompositions, the SMDWT itself is subband processing independent, which can significantly reduce complexity. Moreover, DWT cannot directly obtain target subbands as mentioned, which leads to an extra wasting in transpose memory, critical path, and operation time. These problems can be fully improved with the proposed SMDWT. Nowadays, many applications employ DWT as the core transformation approach, the problems indicated above have motivated researchers to develop lower complexity schemes for DWT. The proposed SMDWT has been proved as a highly efficient and independent processing to yield target subbands, which can be applied to real-time visual applications, such as moving object detection and tracking, texture segmentation, image/video compression, and any possible DWT-based applications. (C) 2011 Elsevier B.V. All rights reserved.

Keywords:

Discrete Wavelet Transform

Symmetric Mask-based Discrete Wavelet

Transform

Transpose memory

Critical path