A fast scheme for image size change in the compressed domain

Rakesh Dugad, Narendra Ahuja

Research output: Contribution to journalArticle

Abstract

Given a video frame in terms of its 8 × 8 block-DCT coefficients, we wish to obtain a downsized or upsized version of this frame also in terms of 8 × 8 block-DCT coefficients. The DCT being a linear unitary transform is distributive over matrix multiplication. This fact has been used for downsampling video frames in the DCT domain. However, this involves matrix multiplication with the DCT of the downsampling matrix. This multiplication can be costly enough to trade off any gains obtained by operating directly in the compressed domain. We propose an algorithm for downsampling and also upsampling in the compressed domain which is computationally much faster, produces visually sharper images, and gives significant improvements in PSNR (typically 4-dB better compared to bilinear interpolation). Specifically the downsampling method requires 1.25 multiplications and 1.25 additions per pixel of original image compared to 4.00 multiplications and 4.75 additions required by the method of Chang et al. Moreover, the downsampling and upsampling schemes combined together preserve all the low-frequency DCT coefficients of the original image. This implies tremendous savings for coding the difference between the original frame (unsampled image) and its prediction (the upsampled image). This is desirable for many applications based on scalable encoding of video. The method presented can also be used with transforms other than DCT, such as Hadamard or Fourier.

Original languageEnglish (US)
Pages (from-to)461-474
Number of pages14
JournalIEEE Transactions on Circuits and Systems for Video Technology
Volume11
Issue number4
DOIs
StatePublished - Apr 1 2001

Fingerprint

Interpolation
Pixels

Keywords

  • Compressed domain processing
  • DCT
  • Downsampling
  • Image size change
  • Superresolution
  • Upsampling

ASJC Scopus subject areas

  • Media Technology
  • Electrical and Electronic Engineering

Cite this

A fast scheme for image size change in the compressed domain. / Dugad, Rakesh; Ahuja, Narendra.

In: IEEE Transactions on Circuits and Systems for Video Technology, Vol. 11, No. 4, 01.04.2001, p. 461-474.

Research output: Contribution to journalArticle

@article{3a0ab8b634c9456586ad80d2d6a8f6f7,
title = "A fast scheme for image size change in the compressed domain",
abstract = "Given a video frame in terms of its 8 × 8 block-DCT coefficients, we wish to obtain a downsized or upsized version of this frame also in terms of 8 × 8 block-DCT coefficients. The DCT being a linear unitary transform is distributive over matrix multiplication. This fact has been used for downsampling video frames in the DCT domain. However, this involves matrix multiplication with the DCT of the downsampling matrix. This multiplication can be costly enough to trade off any gains obtained by operating directly in the compressed domain. We propose an algorithm for downsampling and also upsampling in the compressed domain which is computationally much faster, produces visually sharper images, and gives significant improvements in PSNR (typically 4-dB better compared to bilinear interpolation). Specifically the downsampling method requires 1.25 multiplications and 1.25 additions per pixel of original image compared to 4.00 multiplications and 4.75 additions required by the method of Chang et al. Moreover, the downsampling and upsampling schemes combined together preserve all the low-frequency DCT coefficients of the original image. This implies tremendous savings for coding the difference between the original frame (unsampled image) and its prediction (the upsampled image). This is desirable for many applications based on scalable encoding of video. The method presented can also be used with transforms other than DCT, such as Hadamard or Fourier.",
keywords = "Compressed domain processing, DCT, Downsampling, Image size change, Superresolution, Upsampling",
author = "Rakesh Dugad and Narendra Ahuja",
year = "2001",
month = "4",
day = "1",
doi = "10.1109/76.915353",
language = "English (US)",
volume = "11",
pages = "461--474",
journal = "IEEE Transactions on Circuits and Systems for Video Technology",
issn = "1051-8215",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - A fast scheme for image size change in the compressed domain

AU - Dugad, Rakesh

AU - Ahuja, Narendra

PY - 2001/4/1

Y1 - 2001/4/1

N2 - Given a video frame in terms of its 8 × 8 block-DCT coefficients, we wish to obtain a downsized or upsized version of this frame also in terms of 8 × 8 block-DCT coefficients. The DCT being a linear unitary transform is distributive over matrix multiplication. This fact has been used for downsampling video frames in the DCT domain. However, this involves matrix multiplication with the DCT of the downsampling matrix. This multiplication can be costly enough to trade off any gains obtained by operating directly in the compressed domain. We propose an algorithm for downsampling and also upsampling in the compressed domain which is computationally much faster, produces visually sharper images, and gives significant improvements in PSNR (typically 4-dB better compared to bilinear interpolation). Specifically the downsampling method requires 1.25 multiplications and 1.25 additions per pixel of original image compared to 4.00 multiplications and 4.75 additions required by the method of Chang et al. Moreover, the downsampling and upsampling schemes combined together preserve all the low-frequency DCT coefficients of the original image. This implies tremendous savings for coding the difference between the original frame (unsampled image) and its prediction (the upsampled image). This is desirable for many applications based on scalable encoding of video. The method presented can also be used with transforms other than DCT, such as Hadamard or Fourier.

AB - Given a video frame in terms of its 8 × 8 block-DCT coefficients, we wish to obtain a downsized or upsized version of this frame also in terms of 8 × 8 block-DCT coefficients. The DCT being a linear unitary transform is distributive over matrix multiplication. This fact has been used for downsampling video frames in the DCT domain. However, this involves matrix multiplication with the DCT of the downsampling matrix. This multiplication can be costly enough to trade off any gains obtained by operating directly in the compressed domain. We propose an algorithm for downsampling and also upsampling in the compressed domain which is computationally much faster, produces visually sharper images, and gives significant improvements in PSNR (typically 4-dB better compared to bilinear interpolation). Specifically the downsampling method requires 1.25 multiplications and 1.25 additions per pixel of original image compared to 4.00 multiplications and 4.75 additions required by the method of Chang et al. Moreover, the downsampling and upsampling schemes combined together preserve all the low-frequency DCT coefficients of the original image. This implies tremendous savings for coding the difference between the original frame (unsampled image) and its prediction (the upsampled image). This is desirable for many applications based on scalable encoding of video. The method presented can also be used with transforms other than DCT, such as Hadamard or Fourier.

KW - Compressed domain processing

KW - DCT

KW - Downsampling

KW - Image size change

KW - Superresolution

KW - Upsampling

UR - http://www.scopus.com/inward/record.url?scp=0035309033&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035309033&partnerID=8YFLogxK

U2 - 10.1109/76.915353

DO - 10.1109/76.915353

M3 - Article

AN - SCOPUS:0035309033

VL - 11

SP - 461

EP - 474

JO - IEEE Transactions on Circuits and Systems for Video Technology

JF - IEEE Transactions on Circuits and Systems for Video Technology

SN - 1051-8215

IS - 4

ER -