0% found this document useful (0 votes)
121 views39 pages

Sampling and Aliasing

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1/ 39

ADC

• Generally signals are analog in nature (eg:speech,weather


signals).
• To process the analog signal by digital means, it is essential
to convert them to discrete-time signal , and then convert
them to a sequence of numbers.
• The process of converting an analog to digital signal is
‘Analog-to-Digital Conversion’.
• The ADC involves three steps which are:
1)Sampling
2)Quantization
3)coding
TYPES OF SIGNALS
• Analog signals: continuous in time and amplitude
– Example: voltage, current, temperature,…
• Digital signals: discrete both in time and amplitude
– Example: attendance of this class, digitizes analog
signals,…
• Discrete-time signal: discrete in time, continuous in
amplitude
– Example: hourly change of temperature in
Austin
• During sampling process, a continuous-time signal is
converted into discrete -time signals by taking samples
of continuous-time signal at discrete time intervals.

x(nTs)  x(t)
T=Sampling Interval
x (t)=Analog input signal
•Sampling theorem gives the criteria for minimum number
of samples that should be taken.
•Sampling criteria:-”Sampling frequency must be
twice of the highest frequency”

fs=2W
fs=sampling frequency
w=higher frequency content
2w also known as Nyquist rate
In fact, Shannon’s Sampling Theorem shows that the minimum
sampling (Oppenheim and Schafer 1996; Oppenheim, Schafer,
and Buck 1999) rate required to reconstruct a signal from its
instantaneous samples must be at least twice the highest
frequency,

fs ≥ 2fmax.
The maximum frequency in a signal is known as the Nyquist
frequency and
The inverse of the minimum sampling frequency rs = 1/fs is
known as the Nyquist rate.
The minimum rate at which a signal can be sampled
without introducing errors, which is twice the highest
frequency present in the signal- Nyquist frequency
•Nyquist rate is defined as the minimum sampling rate for the
perfect reconstruction of the continuous time signals from
samples.
•Nyquist rate=2*highest frequency component
=2*W
•So sampling rate must be greater than or equal to nyquist
rate

2/6/2015
•There are two parts,
representation of x(t) in its samples
reconstruction of x(t)
 Representation of x(t) in its samples
1.Define x∂(t)
2. Take fourier transform of x∂(t))
(i.e) x∂(f)
3. Relation between x(f) and x∂(f)
4. Relation between x(t) and
x(nTs)

2/6/2015
 Reconstruction of x(t)
1. Take inverse fourier transform of x∂(f)
2.Show that x(t) is obtained back with the help of
interpolation function

2/6/2015
•While providing sampling theorem we considered fs=2W
•Consider the case that fs < 2W

2/6/2015
.“Signals that travel in disguise as
other frequencies are called aliased
signals.”
 Effects of Aliasing,
1. Distortion.
2. The data is lost and it cannot be recovered.
 To avoid Aliasing,
1. sampling rate must be fs>=2W.

2.strictly bandlimit the signal to ’W’.

2/6/2015
point spread function (PSF) describes the response of an imaging
system to a point source or point object. A more general term for the
PSF is a system's impulse response, the PSF being the impulse
response of a focused optical system.

which represents the response of a particular pixel sensor to an


ideal point light source.
Examples of such operators include brightness
Examples of such operators include brightness
and contrast adjustments (as well as color
and contrast adjustments (Figure 3.2) as well
correction and transformation
as color correction and transformation
Pixel transforms
A general image processing operator is a function that
takes one or more input images and produces an output
image. In the continuous domain, this can be denoted
as g(x) = h(f(x)) or g(x) = h(f0(x),...,fn(x)),

For discrete (sampled) images, the domain consists of a


finite number of pixel locations, x = (i, j), and we can
write g(i, j) = h(f(i, j)).
Two commonly used point processes are multiplication
and addition with a constant, g(x) = af(x) + b

The parameters a > 0 and b are often called the gain


and bias parameters

The bias and gain parameters can also be spatially


varying,
g(I,j)=a .f(I,j)+b
g(x) = a(x)f(x) + b(x),

Multiplicative gain (both global and spatially varying) is


a linear operation, since it obeys the superposition
principle, h(f0 + f1) = h(f0) + h(f1).
An interesting dyadic (two-input) operator is
the linear blend operator:
g(x)=(1−α)f0(x)+αf1(x)
By varying α from 0→1 this operator can
be used to perform a temporal cross-
dissolve between two images or videos

Fo and f1 are two source images .Since we


are adding src1 and src2, they both have to be of
the same size (width and height) and type.

α- blending ratio
Gamma correction
g(x)=[f(x)]1/γ ,
where a gamma value of γ ≈ 2.2 is a
reasonable fit for most digital cameras.

Used to remove the non-linear mapping


between input radiance and quantized pixel
values .

You might also like