CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Super Resolution Transcoding Algorithm in DCT domain using DFT Domain

by Ankit Garg, Khalid Hussain
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 56 - Number 3
Year of Publication: 2012
Authors: Ankit Garg, Khalid Hussain
10.5120/8875-2855

Ankit Garg, Khalid Hussain . Super Resolution Transcoding Algorithm in DCT domain using DFT Domain. International Journal of Computer Applications. 56, 3 ( October 2012), 42-46. DOI=10.5120/8875-2855

@article{ 10.5120/8875-2855,
author = { Ankit Garg, Khalid Hussain },
title = { Super Resolution Transcoding Algorithm in DCT domain using DFT Domain },
journal = { International Journal of Computer Applications },
issue_date = { October 2012 },
volume = { 56 },
number = { 3 },
month = { October },
year = { 2012 },
issn = { 0975-8887 },
pages = { 42-46 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume56/number3/8875-2855/ },
doi = { 10.5120/8875-2855 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:57:57.322318+05:30
%A Ankit Garg
%A Khalid Hussain
%T Super Resolution Transcoding Algorithm in DCT domain using DFT Domain
%J International Journal of Computer Applications
%@ 0975-8887
%V 56
%N 3
%P 42-46
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper we have presented a transcoding algorithm to perform super-resolution of sub-sampled images. First of all we used 1D case in the fourier domain (DFT). Then we extended the same approach for the 2D case. After presenting the results for this we looked at the possibility of improving the performance of our algorithm. This was done by removing the need to perform matrix inversions (highly computation expensive operation). To map the operation to the DCT domain, we began by exploring the relationship between the DFT coefficients of a sequence with the DCT coefficients. Once the relationships were established we were able to extend our DFT approach to the DCT domain as well.

References
  1. R. Y. Tsai and T. S. Huang, "Multiframe Image Restoration and Registration, Chapter 7", in Advances in Computer Vision and Image Processing (T. S. Huang, ed. ), JAI Press Inc. , 1984.
  2. Y. Altunbasak, A. J. Patti, and R. M. Mersereau, "Super-Resolution Still and Video Reconstruction from MPEG-Coded Video", IEEE Transactions on Circuits and Systems for Video Technology, Vol. 12, No. 4, April 2002.
  3. Altunbasak, Y. ; Patti, A. J. ; Mersereau, R. M. "Super-resolution still and video reconstruction from MPEG-coded video", IEEE Transactions on Circuits and Systems for Video Technology, Volume: 12, Issue: 4, 2002.
  4. Gilman, A. ; Bailey, D. G. ; Marsland, S. R. "Interpolation Models for Image Super-resolution", Electronic Design, Test and Applications, 2008, Publication Year: 2008.
  5. Yao Wang, Jorn Ostermann, and Ya-Qin Zhang. "Video Processing and Communication" Prentice Hall Signal Processing Series, pp. 406-454, 2002.
  6. Vetro, A. ; Christopoulos, C. ; Huifang Sun,"Video transcoding architectures and techniques:an overview" Signal Processing Magazine, IEEE Volume: 20 , Issue: 2 , 2003.
  7. HyunWook Park, Senior Member IEEE, YoungSeo Park and Seung-Kyun Oh, "L/M-fold Image Resizing in Block-DCT Domain using Symmetric Convolution", IEEE Transactions on Image Processing, Vol. 12, No. 9, Sep 2003
Index Terms

Computer Science
Information Sciences

Keywords

DFT DCT MPEG

Powered by PhDFocusTM