Homework II Fast Discrete Cosine Transform Jain-Yi Lu ( 呂健益 ) Visual Communications Laboratory Department of Communication Engineering National Central.

Slides:



Advertisements
Similar presentations
A COMPARATIVE STUDY OF DCT AND WAVELET-BASED IMAGE CODING & RECONSTRUCTION Mr. S Majumder & Dr. Md. A Hussain Department of Electronics & Communication.
Advertisements

Fourier Transform and its Application in Image Processing
MPEG-2 to H.264/AVC Transcoding Techniques Jun Xin Xilient Inc. Cupertino, CA.
Computer Vision Lecture 7: The Fourier Transform
Fourier Transforms and Their Use in Data Compression
Parallel Fast Fourier Transform Ryan Liu. Introduction The Discrete Fourier Transform could be applied in science and engineering. Examples: ◦ Voice recognition.
Caifeng Shan, Member, IEEE IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 21, NO. 1, JANUARY 2012.
A Matlab Playground for JPEG Andy Pekarske Nikolay Kolev.
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Computer Graphics Recitation 7. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
New Image Encryption and Compression Method Based on Independent Component Analysis.
A New Scheme for Progressive Image Transmission and Flexible Reconstruction with DCT Minqing Xing and Xue Dong Yang Department of Computer Science University.
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F(  ) is the spectrum of the function.
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
Image Fourier Transform Faisal Farooq Q: How many signal processing engineers does it take to change a light bulb? A: Three. One to Fourier transform the.
Fourier Analysis Without Tears : Computational Photography Alexei Efros, CMU, Fall 2005 Somewhere in Cinque Terre, May 2005.
Digital Image Processing HW#1 Hsueh-Han Lai Visual Communications Lab Department of Communication Engineering National Central University Jhongli, Taiwan.
Hao Jiang Computer Science Department Sept. 27, 2007
Motion Estimation Using Low- Band-Shift Method for Wavelet- Based Moving Picture Hyun-Wook Park, Senior Member, IEEE, and Hyung-Sun Kim IEEE Transactions.
Case Study ARM Platform-based JPEG Codec HW/SW Co-design
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU A New Algorithm to Compute the Discrete Cosine Transform VLSI Signal Processing 台灣大學電機系.
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Fourier Transform Basic idea.
Requirements Determine processor core Determine the number of hardware profiles and the benefits of each profile Determine functionality of each profile.
Introduction to JPEG Alireza Shafaei ( ) Fall 2005.
EE 5359: MULTIMEDIA PROCESSING PROJECT PERFORMANCE ANALYSIS OF INTEGER DCT OF DIFFERENT BLOCK SIZES. Guided by Dr. K.R. Rao Presented by: Suvinda Mudigere.
1 Spatial Frequency or How I learned to love the Fourier Transform Jean Baptiste Joseph Fourier.
Digital Image Processing Homework II Fast Fourier Transform 2012/03/28 Chih-Hung Lu ( 呂志宏 ) Visual Communications Laboratory Department of Communication.
DCT-Domain Watermarking Chiou-Ting Hsu and Ja-Ling Wu, "Hidden digital watermarks in images," IEEE Trans. On Image Processing, vol. 8, No. 1, January 1999.
Performance Enhancement of Video Compression Algorithms using SIMD Valia, Shamik Jamkar, Saket.
R. Ray and K. Chen, department of Computer Science engineering  Abstract The proposed approach is a distortion-specific blind image quality assessment.
DCT cs195g: Computational Photography James Hays, Brown, Spring 2010 Somewhere in Cinque Terre, May 2005 Slides from Alexei Efros.
Directional DCT Presented by, -Shreyanka Subbarayappa, Sadaf Ahamed, Tejas Sathe, Priyadarshini Anjanappa K. R. RAO 1.
09/19/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Dithering.
Hardware/Software Codesign Case Study : JPEG Compression.
Digital Image Processing Image Compression
Digital Image Processing Chapter 4 Image Enhancement in the Frequency Domain Part I.
Computer Vision – Enhancement(Part III) Hanyang University Jong-Il Park.
October 29, 2013Computer Vision Lecture 13: Fourier Transform II 1 The Fourier Transform In the previous lecture, we discussed the Hough transform. There.
Math 3360: Mathematical Imaging Prof. Ronald Lok Ming Lui Department of Mathematics, The Chinese University of Hong Kong Lecture 9: More about Discrete.
Discrete Fourier Transform in 2D – Chapter 14. Discrete Fourier Transform – 1D Forward Inverse M is the length (number of discrete samples)
Fast Fourier Transform & Assignment 2
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
Practical Image Processing1 Chap7 Image Transformation  Image and Transformed image Spatial  Transformed domain Transformation.
02/05/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Mach Banding –Humans exaggerate sharp boundaries, but not fuzzy ones.
Program Homework Implementation of the Improved Spread Spectrum Watermarking System.
HOW JEPG WORKS Presented by: Hao Zhong For 6111 Advanced Algorithm Course.
Chapter 8 Lossy Compression Algorithms. Fundamentals of Multimedia, Chapter Introduction Lossless compression algorithms do not deliver compression.
Lecture 4-1CS251: Intro to AI/Lisp II Where did that edge go? April 29th, 1999.
Chapter 8 Lossy Compression Algorithms
The content of lecture This lecture will cover: Fourier Transform
Section II Digital Signal Processing ES & BM.
Last update on June 15, 2010 Doug Young Suh
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F() is the spectrum of the function.
Discrete Cosine Transform (DCT)
Hybrid Architecture of DCT/DFT/Wavelet Transform (HWT)
Image Enhancement in the
Image Processing, Leture #14
Intensity Transformation and Spatial Filtering
2D DCT in ARM-based JPEG Processor
Fast Hierarchical Back Projection
12/5/2018.
1-D DISCRETE COSINE TRANSFORM DCT
Fourier Analysis Without Tears
Research Institute for Future Media Computing
Reduction of blocking artifacts in DCT-coded images
Digital Image Procesing Discrete CosineTrasform (DCT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL.
Lecture 4 Image Enhancement in Frequency Domain
Discrete Fourier Transform
BASIC IMAGE PROCESSING OPERATIONS FOR COMPUTER VISION
The Frequency Domain Any wave shape can be approximated by a sum of periodic (such as sine and cosine) functions. a--amplitude of waveform f-- frequency.
Presentation transcript:

Homework II Fast Discrete Cosine Transform Jain-Yi Lu ( 呂健益 ) Visual Communications Laboratory Department of Communication Engineering National Central University ChungLi, Taiwan

 Implement Fast Discrete Cosine Transform  Implement Fast Discrete Cosine Inverse Transform 2

3 N : 1-D Sequence Length : 0,1,2…N-1 (u=0 -> DC) f(x) : Spatial Domain Intensity C(u) : Frequency Domain intensity            )12( cos)()()( N x N ux xfuauC  u

DCT Spatial Domain Frequency Domain Spatial Domain IDCT 4

5

 W. H. Chen, C. H. Smith and S. C. Fralick, “A Fast Computational Algorithm for the Discrete Cosine Transform,” IEEE Trans. Communications, Vol. COM- 25, No. 9, September

Stage1 Stage2 Stage3 Stage4 Initial Signal Result 7

Stage1 Stage2 Stage3 Stage4 8

9

10

Stage1 Stage2 Stage3 Stage4 11

12

 We will provide grayscale Lena 512×512 pixels image.  Your program (Image size, bugs, some questions) (2 points)  The accuracy (2 points)  Computation perplexity (Bonus)  Other comment (Bonus) 13

14