Discrete Cosine Transform

Jul 13, 2014

380 likes | 1.5k Views

Discrete Cosine Transform. The forward equation, for image A, is. The inverse equation, for image B, is. Here . Discrete Cosine Transform. Basic idea of JPEG: Convert image to YIQ color space (luminance-hue-saturation model used for TV transmission)

Share Presentation

Embed Code

Link

jpeg compression interface
tv transmission
color plane
entropy encoder dct quantizer
preset quantization values
quantizertable

varden

Download Presentation

Discrete Cosine Transform

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

Discrete Cosine Transform • The forward equation, for image A, is • The inverse equation, for image B, is • Here
Discrete Cosine Transform Basic idea of JPEG: • Convert image to YIQ color space (luminance-hue-saturation model used for TV transmission) • Each color plane is partitioned into 8x8 blocks • Apply DCT to each block • Values are quantized by dividing with preset quantization values (in a table) • Values are then rounded to nearest integer
JPEG Compression Interface COMPRESSED IMAGE 8 X 8 BLOCK ENTROPY ENCODER DCT QUANTIZER (0,0) QUANTIZERTABLE
Basis function of DCT

The Discrete Cosine Transform (DCT)

Christopher Mitchell CDA 6938, Spring 2009. The Discrete Cosine Transform (DCT). The Discrete Cosine Transform. In the same family as the Fourier Transform Converts data to frequency domain. Represents data via summation of variable frequency cosine waves.

370 views • 21 slides

A New Algorithm to Compute the Discrete Cosine Transform

A New Algorithm to Compute the Discrete Cosine Transform. VLSI Signal Processing 台灣大學電機系吳安宇. 1. B. G. Lee “A new algorithm to compute the discrete cosine trnsform,” IEEE Trans. Acoust., Speech, Signal Processing , vol. ASSP-32, pp.1243-1245, Dec. 84

409 views • 18 slides

Discrete Fourier Transform

Discrete Fourier Transform. Prof. Siripong Potisuk. Summary of Spectral Representations. Computation of DTFT. Computer implementation can be accomplished by: Truncate the summation so that it ranges over finite limits  x [ n ] is a finite-length sequence. Discretize w to w k

748 views • 11 slides

Discrete Fourier Transform

g( x ) is a function of value for. We can only examine g( x ) over a limited time frame,. Discrete Fourier Transform. Assume the spectrum of g( x ) is approximately bandlimited; no frequencies > B Hz. Note: this is an approximation; a function can not be both time-limited and bandlimited.

1.28k views • 9 slides

COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL

COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL. Presented by 2006/8. Outline. 1. Introduction. 2. Feature Extraction. 3. Distance Measurement. 4. Screening Scheme. 5. Experimental Results. 6. Conclusions. 1. Introduction. Two approaches for image retrieval:

457 views • 27 slides

Discrete Fourier Transform

Discrete Fourier Transform. Multiply element-by-element. Cumulative sum shows:. 2 signals of same frequency and phase. Multiply element-by-element. Non-zero cumulative sum. Same frequency but  /2 phase difference. Element-by element product with both sine and cosine waves.

444 views • 25 slides

:: Milestone 8 2-D Discrete Cosine Transform

:: Milestone 8 2-D Discrete Cosine Transform. Group M2: Tommy Taylor Brandon Hsiung Changshi Xiao Bongkwan Kim Project Manager: Yaping Zhan. Team Paradigm. Design Goals. Project Status. Still Speed but also Reduction of size. Design Proposal (Done) Architecture Proposal (Done)

289 views • 17 slides

Coarse Classification via Discrete Cosine Transform and Quantization

Coarse Classification via Discrete Cosine Transform and Quantization. Presented by Te-Wei Chiang July 18, 2005. Outline. Introduction Feature Extraction and Quantization Statistical Coarse Classification Experimental Results Conclusion. 1 Introduction.

416 views • 25 slides

1-D DISCRETE COSINE TRANSFORM DCT

1-D DISCRETE COSINE TRANSFORM DCT. 1-D INVERSE DISCRETE COSINE TRANSFORM IDCT. 1-D Basis Functions N= 8. 1-D Basis Functions N= 16. Example: 1D signal. 2-D DISCRETE COSINE TRANSFORM DCT. ADVANTAGES. Notice that the DCT is a real transform.

1.83k views • 18 slides

Introduction to Discrete Cosine Transform and Quantization

Introduction to Discrete Cosine Transform and Quantization. DSP TA: Wei-Nien Chen 2007/05/09. Typical Transform coding scheme. Discrete cosine transform. Any signal= Σ cosine of various frequencise. Decompose signals into combinations of DCT basis vectors. 1-D DCT. 2-D DCT (8x8). Why DCT.

565 views • 22 slides

Image Fusion in Discrete Cosine Transform Domain using Masking Techniques

Image Fusion in Discrete Cosine Transform Domain using Masking Techniques. CONTENTS. Image fusion Fusion techniques Literature survey Proposed techniques Mask Rectangular mask Triangular mask Fan shaped mask Strip mask Image fusion in transform domain using masking

818 views • 31 slides

Discrete Cosine Transform.

Discrete Cosine Transform. Take our sampled signal and transform it. How? Why?. Basis functions. Like an identi-kit. A series of shapes to create the original waveform. Express the waveform as an amount of the given shapes. The amount of the given shapes is called the co-efficient.

537 views • 14 slides

:: Final Presentation 2-D Discrete Cosine Transform

:: Final Presentation 2-D Discrete Cosine Transform. The Future. Team Paradigm (Group M2): Tommy Taylor Brandon Hsiung Changshi Xiao Bongkwan Kim Project Manager: Yaping Zhan. Team Paradigm. The Future of Technology. Strategic Applications. High-resolution Digital Television (HDTV)

772 views • 60 slides

Content-Based Image Retrieval Using Block Discrete Cosine Transform

Content-Based Image Retrieval Using Block Discrete Cosine Transform. Presented by Te-Wei Chiang Department of Information Networking Technology Chihlee Institute of Technology 2005/12/19. Outline. 1. Introduction. 2. Problem Formulation. 3. Proposed Image Retrieval System.

493 views • 28 slides

:: Milestone 4 2-D Discrete Cosine Transform

:: Milestone 4 2-D Discrete Cosine Transform. Group M2: Tommy Taylor Brandon Hsiung Changshi Xiao Bongkwan Kim Project Manager: Yaping Zhan. Team Paradigm. Project status. Design Proposal (Complete) Architecture Proposal (Complete) Behavioral Verilog and test bench (Done)

301 views • 20 slides

Discrete Fourier Transform

Discrete Fourier Transform. In a 2-variable case, the discrete FT pair is:. For u=0,1,2,…,M-1 and v=0,1,2,…,N-1. AND:. For x=0,1,2,…,M-1 and y=0,1,2,…,N-1. Basic Properties. Common practice: F(0,0) is at u=M/2 and v=N/2

538 views • 12 slides

Discrete Transform

Discrete Transform. Introduction. A transform maps image data into a different mathematical space via a transformation equation. One example of transform that we had encountered before is the transform from one color space to another color space. RGB to SCT (spherical coordinate transform).

1.2k views • 89 slides

The Discrete Cosine Transform

The Discrete Cosine Transform. The 1-D discrete cosine transform (DCT) is defined as: DCT belongs to the family of sinusoidal transforms. Its basis functions are sinusoidal waveforms. It can be computed from the DFT. Therefore it has fast algorithm derived from the FFT.

781 views • 1 slides

Chapter 18 Discrete Cosine Transform

Chapter 18 Discrete Cosine Transform. Learning Objectives. Introduction to the DCT and IDCT. Decomposition of a 2-D DCT to two 1-D DCTs. Implementation of a 2-D DCT using a 1-D DCT. Introduction.

411 views • 14 slides

Discrete-Time Fourier Transform Discrete Fourier Transform z-Transform

Discrete-Time Fourier Transform Discrete Fourier Transform z-Transform. Tania Stathaki 811b t.stathaki@imperial.ac.uk. Joseph Fourier (1768-1830). Discrete-Time Fourier Transform. Definition - The Discrete-Time Fourier Transform ( DTFT ) of a sequence x [ n ] is given by

2.73k views • 239 slides

Discrete Fourier Transform

Discrete Fourier Transform. FFT and Its Applications.

232 views • 8 slides

Discrete Fourier Transform

Discrete Fourier Transform. The DFT pair was given as Baseline for computational complexity: Each DFT coefficient requires N complex multiplications N-1 complex additions All N DFT coefficients require N 2 complex multiplications N(N-1) complex additions

275 views • 12 slides

More Related