Professional Documents
Culture Documents
LECTURE 1:
M-D SIGNALS AND TRANSFORMS
• M-D Signals
– Finite-Extent Signals and Periodic Signals
– Symmetric Signals
– Special signals
• M-D Transforms
– MD-FT for Continuous Signals
– MD-FT for Discrete Signals
– MD-DFT
– MD-DCT
– MD-Wavelet
Chapter 1 Multi-dimensional Signals and Systems 1
Prof. A. Murat Tekalp Digital Video Processing, 2E, Prentice Hall, 2015
Finite-Extent Signals
Finite-extent signals are defined over a finite support.
• Quarter-plane (QP) support
• Half-plane (HP) support
• Non-symmetric half-plane (NSHP) support
• Wedge support
n2
n1
Periodic Signals
• Definition: ̃ ̃
| and
• Arbitrary periodicity
• Rectangular-periodicity: diagonal
̃ , ,
Symmetric Signals
• Two-fold (NSHP) symmetry
, ,
• Circular symmetry
– A signal , is circularly symmetric if it is only a
function of distance from the origin. Circular
symmetry implies four-fold symmetry.
Separable Signals
• An MD signal (function) is separable if
, ,⋯, ⋯
• A finite support 2D signal , can be represented by
a matrix . If the signal is separable, then the matrix can
be written as the outer product , where the
vectors and denote samples of 1D signals
and , respectively.
• While a general matrix has degrees of
freedom, the outer product has degrees of
freedom.
• MD Kronecker-delta signal
1 ⋯ 0
, ,⋯,
0 otherwise
n1
, ,
,
• Inverse transform
1
, ,
2 ,
• MD Fourier transform is complex
, , , , ,
• Frequency variables
2 , cycles/mm, radians/mm
• Translation: 1, 0.
, ,
• Rotation: 0, cos, sin,; where
1.
, cos sin , sin cos
Chapter 1 Multi-dimensional Signals and Systems 11
Prof. A. Murat Tekalp Digital Video Processing, 2E, Prentice Hall, 2015
, ,0
, ,
• Inverse transform
1
, ,
2
• Properties:
– , real implies , has conjugate symmetry.
– , is two‐fold symmetric implies , is real
, ∗ , → , ∗ ,
Chapter 1 Multi-dimensional Signals and Systems 14
Prof. A. Murat Tekalp Digital Video Processing, 2E, Prentice Hall, 2015
, ,
, ,
where
, ,
Computation of 2D IDFT
• Inverse 2D DFT can be computed using the forward FFT algorithm
by first conjugating , , then computing 2D forward DFT,
and again taking the complex conjugate of the result, since we have
1
, ,
∗
1 ∗
,
• Circular Convolution
, ⊛⊛ , ↔ , ,
• Parseval’s Theorem:
1
, ,