Data-Representation: DFT-and-DCT

# Data-Representation: DFT-and-DCT

``` Page 1

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

The Lecture Contains:
Fourier analysis
Discrete Fourier Transform (DFT)
Properties
Coefficients
Dimensionality reduction
Discrete Cosine Transform (DCT)

Page 2

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

The Lecture Contains:
Fourier analysis
Discrete Fourier Transform (DFT)
Properties
Coefficients
Dimensionality reduction
Discrete Cosine Transform (DCT)

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

Fourier analysis
Fourier analysis represents a periodic wave as a sum of (infinite) sine and cosine waves
Way to analyze the frequency components in a signal
Fourier transform is a transformation from time domain  to frequency domain
can be obtained from g(u) by the inverse transformation
and  form a Fourier transform pair

Page 3

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

The Lecture Contains:
Fourier analysis
Discrete Fourier Transform (DFT)
Properties
Coefficients
Dimensionality reduction
Discrete Cosine Transform (DCT)

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

Fourier analysis
Fourier analysis represents a periodic wave as a sum of (infinite) sine and cosine waves
Way to analyze the frequency components in a signal
Fourier transform is a transformation from time domain  to frequency domain
can be obtained from g(u) by the inverse transformation
and  form a Fourier transform pair

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

Discrete Fourier Transform (DFT)
For discrete case, assume vector x has N components
DFT of x, denoted by X, has N components given by
Inverse transformation (IDFT) is given by
To avoid using separate scaling factors, both can be taken as

Page 4

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

The Lecture Contains:
Fourier analysis
Discrete Fourier Transform (DFT)
Properties
Coefficients
Dimensionality reduction
Discrete Cosine Transform (DCT)

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

Fourier analysis
Fourier analysis represents a periodic wave as a sum of (infinite) sine and cosine waves
Way to analyze the frequency components in a signal
Fourier transform is a transformation from time domain  to frequency domain
can be obtained from g(u) by the inverse transformation
and  form a Fourier transform pair

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

Discrete Fourier Transform (DFT)
For discrete case, assume vector x has N components
DFT of x, denoted by X, has N components given by
Inverse transformation (IDFT) is given by
To avoid using separate scaling factors, both can be taken as

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

Properties
Parseval's theorem: , i.e., length of vectors is preserved
When both scaling factors are
Contractive mapping
Invertible, linear transformation
Essentially, a rotation in N-dimensional space

Page 5

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

The Lecture Contains:
Fourier analysis
Discrete Fourier Transform (DFT)
Properties
Coefficients
Dimensionality reduction
Discrete Cosine Transform (DCT)

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

Fourier analysis
Fourier analysis represents a periodic wave as a sum of (infinite) sine and cosine waves
Way to analyze the frequency components in a signal
Fourier transform is a transformation from time domain  to frequency domain
can be obtained from g(u) by the inverse transformation
and  form a Fourier transform pair

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

Discrete Fourier Transform (DFT)
For discrete case, assume vector x has N components
DFT of x, denoted by X, has N components given by
Inverse transformation (IDFT) is given by
To avoid using separate scaling factors, both can be taken as

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

Properties
Parseval's theorem: , i.e., length of vectors is preserved
When both scaling factors are
Contractive mapping
Invertible, linear transformation
Essentially, a rotation in N-dimensional space

Objectives_template
Module 7:Data Representation
Lecture 34: DFT and DCT

Coefficients
Expanding ,

First coefficient is (scaled) sum or average
Other coefficients define the frequency components (cosine and sine) at frequencies
for

```

## FAQs on Data-Representation: DFT-and-DCT

 1. What is the difference between DFT and DCT? Ans. The Discrete Fourier Transform (DFT) and the Discrete Cosine Transform (DCT) are both mathematical techniques used for data representation. The main difference between them is that DFT focuses on representing signals in terms of their frequency components, while DCT specifically focuses on representing signals in terms of their cosine components. DFT uses complex numbers, while DCT uses only real numbers. DFT is commonly used in signal processing and image compression, while DCT is widely used in video and image compression algorithms like JPEG.
 2. How does the DFT work? Ans. The DFT is a transformation that converts a signal from its time domain representation to its frequency domain representation. It does this by decomposing the signal into a sum of complex sinusoids of different frequencies. The DFT algorithm involves calculating the inner product of the signal with a set of complex exponential functions at different frequencies. This process yields a set of complex numbers, representing the signal's frequency components. The DFT can be performed efficiently using algorithms such as the Fast Fourier Transform (FFT), which reduces the computational complexity.
 3. What are the applications of DCT? Ans. The Discrete Cosine Transform (DCT) has various applications in signal and image processing. Some of the most common applications include: 1. Image and video compression: DCT is widely used in compression algorithms like JPEG and MPEG, where it helps to reduce the amount of data required to represent images and videos while maintaining acceptable quality. 2. Audio compression: DCT is also used in audio compression algorithms like MP3, enabling the storage and transmission of high-quality audio with reduced file sizes. 3. Watermarking: DCT can be utilized in digital watermarking techniques to embed and extract copyright information or other data within images or audio signals. 4. Pattern recognition: DCT coefficients can be used as features for pattern recognition tasks, such as face recognition or speech recognition, where they capture important characteristics of the input signals. 5. Cryptography: DCT has been employed in some image encryption schemes to enhance the security and robustness of encrypted data.
 4. How does the DCT differ from the Fourier Transform? Ans. The Discrete Cosine Transform (DCT) and the Fourier Transform (FT) are both used for signal analysis and data representation, but they differ in several ways: 1. Basis functions: The DCT uses cosine functions as its basis functions, while the FT uses complex exponential functions. This difference in basis functions leads to different mathematical properties and characteristics in terms of frequency representation. 2. Real vs. complex: The DCT only produces real-valued coefficients, which makes it more suitable for real-world signals like images and audio. In contrast, the FT produces complex-valued coefficients, which are useful for analyzing signals with both amplitude and phase information. 3. Energy compaction: The DCT tends to concentrate most of the signal energy into a few low-frequency coefficients, making it well-suited for compression applications. The FT distributes the signal energy across all frequency components, making it more suitable for tasks like spectral analysis. 4. Symmetry: The DCT has even symmetry, while the FT does not exhibit any specific symmetry properties. This symmetry property of the DCT simplifies its implementation and allows for efficient algorithms like the Fast Cosine Transform (FCT). 5. Applications: While both transforms have various applications, the DCT is commonly used in image and video compression, whereas the FT is used in fields such as signal processing, communications, and spectrum analysis.
 5. What are some limitations of the DFT and DCT? Ans. The DFT and DCT have certain limitations that should be considered in their applications: 1. Computational complexity: The DFT and DCT algorithms can be computationally intensive, especially for large input signals or high-resolution images. However, efficient algorithms like the FFT and FCT have been developed to address this issue. 2. Leakage effect: The DFT suffers from a phenomenon called spectral leakage, where the frequency components of a signal can spread into neighboring frequency bins, leading to distortion in the frequency representation. Windowing techniques can be applied to mitigate this effect. 3. Boundary effects: Both transforms assume periodicity of the input signal, which can cause artifacts at the boundaries of finite-length signals. Various windowing functions can be employed to reduce these boundary effects. 4. Sensitivity to noise: The DCT is highly sensitive to noise, especially at high-frequency components. This sensitivity can affect the quality of compressed images or audio signals. 5. Information loss: Both transforms involve a loss of information due to the quantization process in compression algorithms. This loss can result in a trade-off between compression ratio and signal quality, requiring careful selection of compression parameters.
 Explore Courses for exam 