Abstract
Given a video frame or image in terms of its 8×8 block-DCT coefficients we wish to obtain a downsized (lower resolution) or upsized (higher resolution) version of this frame also in terms of 8×8 block-DCT coefficients. We propose an algorithm for achieving this directly 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 other compressed domain methods based on bilinear interpolation). The downsampling and upsampling schemes combined together preserve all the low-frequency DCT coefficients of the original signal. This implies tremendous savings for coding the difference between the original (unsampled image) and its prediction (the upsampled image). This is desirable for many applications based on scalable encoding of video.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 213-218 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition |
| Volume | 1 |
| State | Published - 1999 |
| Event | Proceedings of the 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'99) - Fort Collins, CO, USA Duration: Jun 23 1999 → Jun 25 1999 |
ASJC Scopus subject areas
- Software
- Computer Vision and Pattern Recognition