Exp 1 simultaneous contrast and machband contrast

Simultaneous contrast

When two colours side by side interact with one another and change our perception accordingly.
This effect of interaction is called as simultaneous contrast.

Simultaneous contrast is most intense when the two colours are complementary colours.

Simultaneous contrast refers to the way in which two different colours affect each other. The theory
is that one colour can change how we perceive the tone and due to another, when the two are
placed side by side. The actual colours themselves do not change, but we see them as altered.

Mach band contrast

Mach band describes an effect where the human mind subconsciously increase the contrast
between two surfaces with different luminance.

Mach band is an optical illusion. It exaggerates the contrast between edges of the slightly differing
shades of gray, as soon as they contact one another by triggering edge detection in the human visual
system.

Exp-2 2-D convolution.

Linear and shift Invariant

Size of X is NxN points

Size of H is MxM points
Then size of Y=(M+N-1,M+N-1)
So, if we use direct convolution computation No. of arithmetic operations = [(N+M-1)M]^2
2D convolution using 1D convolution:

If h(n1,n2) is separable sequence

h(n1,n2) = h1(n1,). h2(n2)
then

Advantages of separable sequene

1.1D algorithm can be applied for 2D convolution
2. Computation is reduced.
Exp 3 arithmetic and logical operations

Arithmetic operations:

Addition- P+Q

Subtraction - P-Q

Multiplication - PxQ

Division - P/Q

Logical operations:

AND- PQ

OR- P+Q

NOT- p’= p

Exp 4 image averaging

Addition - It is used in image averaging to reduce noise.

if the average of N image frames is to be computed, then intensity values A(N, x, y) of pixels located
at coordinates (x, y) in the averaged digital image will be expressed by the equation:

Exp 5a,b Histogram Equalization

Histogram is a graph indicating the number of times each gray level occurs in the image

There are two ways of making an image a highly contrast image.

1. Histogram/contrast stretching

2. Histogram equalization.

Histogram equalization:

(i) for continuous range:

Let r represents the gray levels in the image to be enhanced normalized in the range [0,1]

Let s=T(r) be transformation

Let Pr(r) be original gray level pdf and Ps(s) be transformed gray level pdf
Solving gives, Ps(s)=1

(ii) for discrete range

Cdf-

Exp 6 DFT

Discrete time input signal = x(n)

Discrete Fourier transform = X(k)

DFT-

IDFT-

And 2D-DFT of an image x(m,n) Is given by-

Computation of 2D-DFT can be reduced by separability. That means, perform 1D-DFT along the
column followed by 1D-DFT of the rows of resulting matrix.

Exp 7 DCT, Exp-8 IDCT

 DCT coefficients are purely real.

 DCT has never optimal property for energy compaction.
  DCT can be computed efficiently using fast algorithms.

1D-DCT: The discrete cosine transform of a list of n real numbers s(x), x = 0, ..., n - 1, is the list of
length n given by

The list s(x) can be recovered from its transform S(u) by applying the inverse discrete cosine
transform (IDCT):

2D-DCT: For an n x m matrix s, the 1D DCT is applied to each row of s and then to each column of the
result. Thus, the transform of s is given by

Exp 9 – image enhancement

Spatial filtering:

(i) Linear filtering

 LPF
 HPF

Smoothing filter is used for blurring and noise reduction.

Low pass spatial filter (Linear): it blurs the edge and sharp details

3x3 sharpening filter

High pass filtering:

3x3 sharpening filter

(ii) Non-linear filtering:

 Median filter: Noise reduction such as salt and pepper noise.

 Min-max filter
 Geometric mean filter