CSC321 Image Processing
CSC321 Image Processing
Course Description: This course covers the investigation, creation and manipulation of digital
images by computer. The course consists of theoretical material introducing the mathematics
of images and imaging. Topics include representation of two-dimensional data, time and
frequency domain representations, filtering and enhancement, the Fourier transform,
convolution, interpolation. The student will become familiar with Image Enhancement, Image
Restoration, Image Compression, Morphological Image Processing, Image Segmentation,
Representation and Description, and Object Recognition.
Course Objectives: The objective of this course is to make students able to:
Ø develop a theoretical foundation of Digital Image Processing concepts.
Ø provide mathematical foundations for digital manipulation of images; image
acquisition; preprocessing; segmentation; Fourier domain processing; and compression.
Ø gain experience and practical techniques to write programs for digital manipulation of
images; image acquisition; pre-processing; segmentation; Fourier domain processing;
and compression.
Detail Syllabus:
Unit 1 Introduction Teaching
Hours (5)
Digital Image, A Definition of digital image, pixels, representation 1 hr
Simple Image Model of digital image in spatial domain as well as in
matrix form.
Smoothing Frequency Ideal Low Pass Filter, Butterworth Low Pass Filter, 1 hr
Domain Filters Gaussian Low Pass Filter
Fast Fourier Transform Computing and Visualizing the 2D DFT (Time 2 hrs.
Complexity of DFT), Derivation of 1-D Fast
Fourier Transform, Time Complexity of FFT,
Concept of Convolution, Correlation and Padding.
Laboratory Works:
Students are required to develop programs in related topics using suitable programming
languages such as MatLab or Python or other similar programming languages.
Text Books:
1. Rafael C. Gonzalez and Richard E. Woods, “Digital Image Processing”, Pearson Edition,
Latest Edition.
Reference Books:
1. I. Pitas, "Digital Image Processing Algorithms", Prentice Hall, Latest Edition.
2. A. K. Jain, “Fundamental of Digital Image processing”, Prentice Hall of India Pvt. Ltd.,
Latest Edition.
3. K. Castlemann, “Digital image processing”, Prentice Hall of India Pvt. Ltd., Latest Edition.
4. P. Monique and M. Dekker, “Fundamentals of Pattern recognition”, Latest Edition.
Model Question
Section A
Attempt any two questions. (2 × 10 = 20)
1. Differentiate between Discrete Fourier Transform (DFT) and Fast Fourier Transform
(FFT). Explain the FFT algorithm for one-dimensional case. [3+7=10]
2. Given the following frequency table obtained from the histogram of a 16 X 16, 8 level
image.
M 0 1 2 3 4 5 6 7
NM 15 6 70 16 31 35 32 51
Where M = gray level and NM = pixels having Mth gray level.
Construct Huffmann code for each gray level. Calculate the compression ratio and the
relative data redundancy assuming if 3-bit code is used to code the gray level instead of
Huffmann code. [7+3 =10]
3. What is an edge detection filter? Differentiate between the first derivative and second
derivative filter? Derive the filter mask for laplacian filter and write the algorithm for its
implementation. [1+2+7=10]
Section B
Attempt any eight questions. (8 × 5 = 40)
1. How many images of size 1024×768 with 256 gray levels can be stored in a 2048 MB
storage space?
2. Write short notes on dilation and erosion.
3. Explain the contra-harmonic mean filters used in image restoration.
4. Explain the Bit plane slicing technique for image enhancement.
5. Explain how Hough transform is useful in line detection?
6. Describe in brief that how do you implement Gaussian High Pass Frequency domain filter
for image smoothing in the frequency domain?
7. Explain lossy predictive coding in brief.
8. Explain the region growing technique for image segmentation.
9. Explain how can a neural network be applied in digital image processing with the help of
a simple perceptron.