1. Define Spatial Resolution. Sampling is the principal factor determining the spatial resolution of an image.

Basically spatial resolution is the smallest discernible detail in an image. As an example suppose we construct a chart with vertical lines of width W, and with space between the lines also having width W. A line-pair consists of one such line and its adjacent space. Thus width of line pair is and there are line-pairs per unit distance. A widely used definition of resolution is simply the smallest number of discernible line pairs per unit distance; for es 100 line pairs/mm. 2. Define Gray Level Resolution.

Gray level resolution: This refers to the smallest discernible change in gray level. The measurement of discernible changes in gray level is a highly subjective process.

3. List any 4 image transforms.

DCT, DFT, Haar, Haadamard, Slant, KL, Radon, SVD

4. State the need for transforms.

The need for transform is most of the signals or images are time domain signal (ie) signals can be measured with a function of time. This representation is not always best. For most image processing applications anyone of the mathematical transformation are applied to the signal or images to obtain further information from that signal.

5. Give the equation for 2D DFT of an image f(m,n).

N-1

N-1

F(u,v) =
n=0

m=0

f(m,n) e j2um/N e j2nv/N u,v=0,1,2.N-1

6. Give the equation for DFT of a finite duration sequence x(n).

n-1

X(k) =
n=0

x(n) e j2nk/N k= 0,1,2.N-1

7. What is the 2D DCT of a signal f (x,y) ?

C(u,v)= (u) (v) x=0N-1 y=0N-1f(x,y)cos[(2x+1)u/2N]cos[(2y+1)v/2N] for u,v=0,1,2,.N-1 (u)=1/N for u=0 and 2/N for u=1,2,.N-1

8. Define radon transform of a function f(x,y).

9. Give the classification of image enhancement in spatial domain

Point Processing Mask Processing

10. Define linear gray level transformation. A linear transformation of an image is a function that maps each pixel gray level value into another gray level at the same position according to a linear function. The input (argument) is a gray level f = f(m,n) at location (m,n) and the output is a new gray level g = g(m,n) defined at the same position (m,n). Linear mappings have the form g(m,n) = T[f(m,n)] . 11. Give the transfer function of 2D Butterworth low pass filter.

1 i fD v( u)D0, H (u, v) = 0 i fD v( >u)D0,

12. Define Histogram of an image.

H (u, v) =

1+ [

D (u , v) / D 0 ]

2n

The histogram of a digital image with gray levels in the range [0, L-1] is a discrete function h(rk)=nk. (or ) A plot between Gray level vs. No. of occurrence of tat gray level. rk-kth gray level , nk-number of pixels in the image having gray level rk.

13. State the limitations of averaging filter.

Image Gets Blurred when the mask size is increased in case of averaging filter.

14. Give the transfer function of 2D Butterworth high pass filter.

0 i fD v( u)D0, H (u, v) = 1 i fD v( >u)D0,

H (u, v ) =

1 + [ D0

1 2n D(u , v )]

Explain the Properties of 2D discrete Fourier Transform 1. Separability F(u, v)=1/N x=0N-1y=0N-1f(x,y)exp[-j2(ux +vy)/N] for u, v=0,1,2,.N-1 f(x, y)=x=0N-1y=0N-1F(u,v)exp[j2(ux+vy)/N] for x, y=0,1,2,.N-1 F(u,v)=1/N x=0N-1F(x,v)exp[-j2ux/N] where F(x,v)=N[1/Ny=0N-1f(x,y)exp[-j2vy/N 2. Translation The translation properties of the Fourier Transorm pair are f(x,y)exp[-j2(u0x +v0y)/N] F(u-u0,v-v0) are Fourier Transform pair. And f(x-x0,y-y0) F(u,v)exp[-j2(ux0 +vy0)/N] Where the double arrow indicates the correspondence between a function and its Fourier transform. 3. Periodicity and Conjugate Symmetry Periodicity: The Discrete Fourier Transform and its inverse are periodic with period N; that is, F(u,v)=F(u+N,v)=F(u,v+N)=F(u+N,v+N) Conjugate symmetry: If f(x,y) is real, the Fourier transform also exhibits conjugate symmetry, F(u,v)=F*(-u,-v) or F(u,v) =F(-u,-v) where F*(u,v) is the complex conjugate of F(u,v) 4. Rotation Polar Coordinates x=rcos, y=rsin, u=wsin, v=wsin then f(x,y) and F(u,v) become f(r,) and F(w,) respectively. Rotating f(x,y) by an angle 0 rotates F(u,v) by the same angle. Similarly rotating F(u,v) rotates f(x,y) by the same angle. i.e, f(r,+ 0) F(w,+ 0) 5. Distributivity and scaling Distributivity: The Discrete Fourier Transform and its inverse are distributive over addition but not over multiplication. F[f1(x,y)+f2(x,y)]=F[f1(x,y)]+F[f2(x,y)] F[f1(x,y).f2(x,y)]F[f1(x,y)].F[f2(x,y)] Scaling For the two scalars a and b, Af(x,y) aF(u,v) and f(ax,by) 1/abF(u/a,v/b) 6. Laplacian The Laplacian of a two variable function f(x,y) is defined as 2f(x,y)=2f/x2+2f/y2 7. Convolution and Correlation Convolution The convolution of two functions f(x) and g(x) denoted by f(x)*g(x) and is defined by the integral, f(x)*g(x)=-f()g(x-)d where is a dummy variable. Convolution of two functions F(u) and G(u) in the frequency domain =multiplication of their inverse f(x) and g(x) respectively. Ie, f(x)*g(x) F(u)G(u) Correlation The correlation of two functions f(x) and g(x) denoted by f(x)g(x) and is defined by the integral, f(x)g(x)=-f*()g(x+)d where is a dummy variable. For the discrete case fe(x)ge(x)= 1/M M=0M-1f*(m)g(x+m)

fe(x)= {f(x), 0xA-1, {0 , AxM-1 ge(x)= {g(x), 0xB-1, {0 , BxN-1