By Topic

Regularity-constrained pre- and post-filtering for block DCT-based systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wei Dai ; Dept. of Electr. & Comput. Eng., Johns Hopkins Univ., Baltimore, MD, USA ; T. D. Tran

It is well known that the traditional block transform can only have at most one degree of regularity. In other words, by retaining only one subband, these transforms, including the popular discrete cosine transform (DCT), can only capture the constant signal. The ability to capture polynomials of higher orders is critical in smooth signal approximation, minimizing blocking effects. This paper presents the theory, design, and fast implementation of regularity constrained pre-/post-filters for block-based decomposition systems. We demonstrate that simple pre-/post-filtering modules added to the current block-based infrastructure can help the block transform capture not only the constant signal but the ramp signal as well. Moreover, our proposed framework can be used to generate various fast symmetric M-band wavelets with up to two degrees of regularity.

Published in:

IEEE Transactions on Signal Processing  (Volume:51 ,  Issue: 10 )