0% found this document useful (0 votes)
182 views

n-1 n-1 -j2πnk/N n=0: Explain the Properties of 2D discrete Fourier Transform 1. Separability

1. The document discusses various image processing and computer vision concepts including spatial resolution, gray level resolution, transforms like DCT and DFT, and image enhancement techniques. 2. It provides definitions and equations for transforms like 2D DFT, DFT of a finite sequence, and 2D DCT. 3. Properties of the 2D discrete Fourier transform are explained including separability, translation, periodicity, rotation, distributivity, scaling, and convolution.

Uploaded by

Arun Ece
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
182 views

n-1 n-1 -j2πnk/N n=0: Explain the Properties of 2D discrete Fourier Transform 1. Separability

1. The document discusses various image processing and computer vision concepts including spatial resolution, gray level resolution, transforms like DCT and DFT, and image enhancement techniques. 2. It provides definitions and equations for transforms like 2D DFT, DFT of a finite sequence, and 2D DCT. 3. Properties of the 2D discrete Fourier transform are explained including separability, translation, periodicity, rotation, distributivity, scaling, and convolution.

Uploaded by

Arun Ece
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

1. Define Spatial Resolution. 2. Define Gray Level Resolution. 3. List any 4 image transforms.

DCT, DFT, Haar, Haadamard, Slant, KL, Radon, SVD 4. State the need for transforms.

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


n-1 n-1

F(u,v) =

n=0

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

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


n-1

X(k) =

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

n=0

7. What is the 2D DCT of a signal f (m,n) ? 2-D DCT is defined as 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 Inverse DCT is defined as f(x,y)=u=0N-1 v=0N-1 (u) (v)C(u,v)cos[(2x+1)u/2N] cos[(2y+1)u/2N] for x,y=0,1,2,.N-1 In both cases (u)=1/N for u=0 and 2/N for u=1,2,.N-1 8. Define radon transform of a function f(m,n). 9. Give the classification of image enhancement in spatial domain. 10. Define linear gray level transformation. 11. Give the transfer function of 2D Butterworth low pass filter. 12. Define Histogram of an image. 13. State the limitations of averaging filter. 14. Give the transfer function of 2D Butterworth high pass filter.

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

UNIT III

1. Specify the objective of image enhancement technique. The objective of enhancement technique is to process an image so that the result is more suitable than the original image for a particular application. 2. List the 2 categories of image enhancement. Spatial domain refers to image plane itself & approaches in this category are based on direct manipulation of picture image. Frequency domain methods based on modifying the image by fourier transform. 3. What is the purpose of image averaging? An important application of image averaging is in the field of astronomy, where imaging with very low light levels is routine, causing sensor noise frequently to render single images virtually useless for analysis. 4. What is meant by masking? Mask is the small 2-D array in which the values of mask co-efficient determines the nature of process. The enhancement technique based on this type of approach is referred to as mask processing.

5. Define histogram. The histogram of a digital image with gray levels in the range [0, L-1] is a discrete function h(rk)=nk. rk-kth gray level nk-number of pixels in the image having gray level rk. 6.What is meant by histogram equalization?

k k Sk= T(rk) = Pr(rj) = nj/n where k=0,1,2,.L-1 j=0 j=0 This transformation is called histogram equalization. 7.Differentiate linear spatial filter and non-linear spatial filter. s.no. 1. Linear spatial filter Response is a sum of products of the filter co-efficient. R = w(-1,-1) f(x-1,y-1) + w(-1,0) f(x-1,y) + + w(0,0) f(x,y) + + w(1,0) f(x+1,y) + w(1,1) f(x+1,y+1). Non-linear spatial filter They do not explicitly use coefficients in the sum-of-products. R = w1z1 + w2z2 + +w9z9 9 = wizi i=1

2.

8. Give the mask used for high boost filtering.

0 -1 0

-1 A+4 -1

0 -1 0

-1 -1 -1

-1 A+8 -1

-1 -1 -1

9. What is meant by laplacian filter? The laplacian for a function f(x,y) of 2 variables is defined as,
2 2 2 2 2

f = f / x + f / y

10.

Write the steps involved in frequency domain filtering. 1. Multiply the input image by (-1) to center the transform. 2. Compute F(u,v), the DFT of the image from (1). 3. Multiply F(u,v) by a filter function H(u,v). 4. Compute the inverse DFT of the result in (3). 5. Obtain the real part of the result in (4). 6. Multiply the result in (5) by (-1)

11. What do you mean by Point processing? Image enhancement at any Point in an image depends only on the gray level at that point is often referred to as Point processing. 12. Define Derivative filter? For a function f (x, y), the gradient f at co-ordinate (x, y) is defined as the vector f = f/x f/y f = mag (f) = {[(f/x) 2 +(f/y) 2 ]} 1/2 13. Define spatial filtering Spatial filtering is the process of moving the filter mask from point to point in an image. For linear spatial filter, the response is given by a sum of products of the filter coefficients, and the corresponding image pixels in the area spanned by the filter mask. 14. What is a Median filter? The median filter replaces the value of a pixel by the median of the gray levels in the neighborhood of that pixel. 15. What is maximum filter and minimum filter? The 100th percentile is maximum filter is used in finding brightest points in an image. The 0th percentile filter is minimum filter used for finding darkest points in an image. 16. Write the application of sharpening filters 1. Electronic printing and medical imaging to industrial application

2. Autonomous target detection in smart weapons. 17. Name the different types of derivative filters 1. Perwitt operators 2. Roberts cross gradient operators 3. Sobel operators Explain Spatial Filtering The use of spatial mask for the image processing usually called spatial filtering and spatial mask are spatial filters. The linear filter classified into o Low pass o High pass o Band pass filtering Consider 3*3 mask W1 W4 W7 W2 W5 W8 W3 W6 W9

Denoting the gray level of pixels under the mask at any location by z1,z2,z3,z9, the response of a linear mask is R=w1z1+ w2z2 +..+w9z9

Smoothing Filters Lowpass Spatial filtering: The filter has to have positive coefficient. The response would be the sum of gray levels of nine pixels which could cause R to be out of the gray level range. The solution is to scale the sum by dividing R by 9.The use of the form of mask are called neighborhood averaging 1 1 1 1/9 1 1 1 1 1 1

Median filtering: To achive noise reduction rather than blurring. The gray level of each pixel is replaced by the median of the gray level in the neighbourhood of that pixel Sharpening Filters Basic highpass spatial filtering: The filter should be positive ecoefficient near the center and negative in the outer periphery. The sum of the coefficient are 0. This eliminate the zero- frequency term reducing significantly the global contrast of the image -1 -1 -1

-1 1/9* -1

8 -1

-1 -1

High_boost filtering: The definition is High-boost=(A)(Original)-Lowpass =(A-1) (Original)+ Original Lowpass =(A-1) (Original)+Hignpass Derivative Filters: Averaging is anlog to integration , differentiation can be expected to have opposite effect and thus sharpen the image

3. Explain the Geometric Transformations used in image restoration. Geometric transformations are used for image restoration, modify the spatial relationship between the pixels in an image. Geometric transformations are often called rubber sheet transformations, because they are may be viewed as the process of printing an image on a sheet of rubber. The geometric transformations consists of two basic operations: (1) Spatial transformation (2) Gray level interpolation 1.Spatial transformations:An image f of pixel coordinates(x,y) undergoes geometric distortion to produce an image g with coordinates(x,y).this transformation may be expressed as x=r(x,y) y=s(x,y) where r(x,y) and s(x,y) are the spatial transformations that produced the geometrically distorted image g(x,y). If r(x,y) and s(x,y) were known analytically recovering f(x,y) from the distorted image g(x,y) by applying the transformations in reverse might possible theoretically. The method used most frequently to formulate the spatial relocation of pixels by the use of tiepoints,which are a subset of pixels whose location in the input and output image is known precisely. The vertices of the quadrilaterals are corresponding tiepoints. r(x,y)=c1x+c2y+c3xy+c4 S(x,y)=c5x+c6y+c7xy+c8 x=c1x+c2y+c3xy+c4 y=c5x+c6y+c7xy+c8 Since there are a total of eight known tiepoints these equations can be solved for eight coefficients ci,i=1,2,8. The coefficient constitute the geometric distortion model used to transform all pixels within the quadrilateral region defined by the tiepoints used to obtain the coefficients. Tiepoints are established by a number of different techniques depending on the application. 2. Gray level Interpolation: Depending on the values of coefficients ci equations can yield noninteger values for x and y. Because the distorted image g is digital ,its pixel values are defined only at integer co ordinates . Thus using non integer values for x, y causes a mapping into locations of g for which no gray levels are defined. The technique is used to accomplish this is called gray level interpolation.

You might also like