This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'99) - Volume 1
A Fast Scheme for Altering Resolution in the Compressed Domain
Fort Collins, Colorado
June 23-June 25
ISBN: 0-7695-0149-4
Rakesh Dugad, University of Illinois at Urbana
Narendra Ahuja, University of Illinois at Urbana
Given a video frame or image in terms of its 8x8 block-DCT coefficients we wish to obtain a downsized (lower resolution) or upsized (higher resolution) version of this frame also in terms of 8x8 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.
Citation:
Rakesh Dugad, Narendra Ahuja, "A Fast Scheme for Altering Resolution in the Compressed Domain," cvpr, vol. 1, pp.1213, 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'99) - Volume 1, 1999
Usage of this product signifies your acceptance of the Terms of Use.