csc321

Image Processing

Hard Exam Preparation: 30 Hours
Subject Code CSC 321
Credit Hours 3 Hours
Nature Theory + Lab
Full Marks 60 + 20 + 20
Pass Marks 24 + 8 + 8
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.

Objective

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.

Course Contents

Introduction

5 Hours

Definition of digital image, pixels, representation of digital image in spatial domain as well as in matrix form, Block diagram of fundamentals steps in digital image processing, Application of digital image processing system, Elements of Digital Image Processing systems, Structure of the Human Eye, Image Formation in the Eye, Brightness Adaptation and Discrimination, Basic Concepts in Sampling and Quantization, Representing Digital Images, Spatial and Gray-Level Resolution, Neighbors of a Pixel, Adjacency, Connectivity, Regions, and Boundaries, Distance Measures between pixels

Image Enhancement and Filter in Spatial Domain

8 Hours

Point operations, Contrast stretching, clipping and thresholding, digital negative, Intensity level slicing, log transformation, power log transformation, bit plane slicing, Unnormalized and Normalized Histogram, Histogram Equalization, Use of Histogram Statistics for Image Enhancement, Basics of Spatial Filtering, Linear filters, Spatial Low pass smoothing filters, Averaging, Weighted Averaging, Non-Linear filters, Median filter, Maximum and Minimum filters, High pass sharpening filters, High boost filter, high frequency emphasis filter, Gradient based filters, Robert Cross Gradient Operators, Prewitt filters, Sobel filters, Second Derivative filters, Laplacian filters, Magnification by replication and interpolation

Image Enhancement in the Frequency Domain

8 Hours

Introduction to Fourier Transform and the frequency Domain, 1-D and 2-D Continuous and Discrete Fourier transform, Properties: Logarithmic, Separability, Translation, Periodicity, Ideal, Butterworth, and Gaussian Low Pass Filters, Ideal, Butterworth, and Gaussian High Pass Filters, Laplacian Filter, Computing and Visualizing the 2D DFT, Derivation of 1-D FFT, Time Complexity of DFT and FFT, Concept of Convolution, Correlation and Padding, Hadamard transform, Haar transform and Discrete Cosine transform

Image Restoration and Compression

8 Hours

Models for Image degradation and restoration process, Noise Models (Gaussian, Rayleigh, Erlang, Exponential, Uniform and Impulse), Estimation of Noise Parameters, Mean Filters (Arithmetic, Geometric, Harmonic and Contraharmonic), Order Statistics Filters (Median, Min, Max, Midpoint, Alpha trimmed), Band pass and Band Reject filters (Ideal, Butterworth, Gaussian), Compression Ratio, Relative Data Redundancy, Average Length of Code, Coding Redundancy (Huffman), Interpixel Redundancy (Run Length), Psychovisual Redundancy (IGS Coding), Lossless and Lossy Predictive Model

Introduction to Morphological Image Processing

2 Hours

Logic Operations involving binary images, Definition of Fit and Hit, Dilation and Erosion, Opening and Closing

Image Segmentation

8 Hours

Similarity and Discontinuity based techniques, Point, Line, and Edge Detection, Mexican Hat Filters, Edge Linking and Boundary Detection, Hough Transform, Thresholding: Global, Local and Adaptive, Region Based Segmentation: Region Growing, Region Split and Merge

Representations, Description and Recognition

5 Hours

Chain codes, Signatures, Shape Numbers, Fourier Descriptors, Patterns and pattern classes, Decision-Theoretic Methods, Introduction to Neural Networks and Neural Network based Image Recognition, Overview of Pattern Recognition with block diagram

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.

Books

Textbooks

Rafael C. Gonzalez and Richard E. Woods, “Digital Image Processing”, Pearson Edition, Latest Edition.

Reference Books

I. Pitas, "Digital Image Processing Algorithms", Prentice Hall, Latest Edition.
A. K. Jain, “Fundamental of Digital Image processing”, Prentice Hall of India Pvt. Ltd., Latest Edition.
K. Castlemann, “Digital image processing”, Prentice Hall of India Pvt. Ltd., Latest Edition.
P. Monique and M. Dekker, “Fundamentals of Pattern recognition”, Latest Edition.