Fast DCT block smoothing algorithm

Rensheng Horng; Albert J. Ahumada Jr.

doi:10.1117/12.206752

21 April 1995 Fast DCT block smoothing algorithm

Rensheng Horng, Albert J. Ahumada Jr.

Proceedings Volume 2501, Visual Communications and Image Processing '95; (1995) https://doi.org/10.1117/12.206752
Event: Visual Communications and Image Processing '95, 1995, Taipei, Taiwan

Abstract

Image compression based on quantizing the image in the discrete cosine transform (DCT) domain can generate blocky artifacts in the output image. It is possible to reduce these artifacts and RMS error by adjusting measures of block edginess and image roughness, while restricting the DCT coefficient values to values that would have been quantized to those of the compressed image. This paper presents a fast algorithm to replace our gradient search method for RMS error reduction and image smoothing after adjustment of DCT coefficient amplitude.

Citation Download Citation

Rensheng Horng and Albert J. Ahumada Jr. "Fast DCT block smoothing algorithm", Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); https://doi.org/10.1117/12.206752

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available