IMAGEPROCESSING-FULL SchemeandSyllabus

APJ ABDUL KALAM
TECHNOLOGICAL
UNIVERSITY
(KOLAM CLUSTER - 02)
SCHEME AND SYLLABI

of
M. TECH Computer Science
Specialization in
IMAGE PROCESSING
OFFERING DEPARTMENT
COMPUTER SCIENCE AND

ENGINEERING
CLUSTER LEVEL GRADUATE PROGRAM COMMITTEE
NO MEMBER
1 Dr. S. Mohan, Professor, IIT Madras, Chennai
2 Principal, TKM College of Engineering, Kollam
3 Principal, Baselios Mathews II College of Engineering, Sasthamcotta, Kollam
4 Principal, College of Engineering, Karunagapally, Kollam
5 Principal, College of Engineering, Perumon, Kollam
6 Principal, Pinnacle School of Engineering and Technology, Anchal, Kollam
7 Principal, Shahul Hameed Memorial Engineering College, Kadakkal, Kollam
8 Principal, TKM Institute of Technology, Ezhukone, Kollam
9 Principal, Travancore Engineering College, Parippally, Kollam
10 Principal, Younus College of Engineering and Technology, Pallimukku, Kollam
Page 1
CERTIFICATE
This is to certify that
1. The scheme and syllabi are prepared in accordance with the regulations and
guidelines issued by the KTU from time to time and also as per the decisions made in
the CGPC meetings.
2. The suggestions/modifications suggested while presenting the scheme and syllabi

before CGPC on 8.6.2015 have been incorporated.
3. There is no discrepancy among the soft copy in MS word format, PDF and hard copy
of the syllabi submitted to the CGPC.
4. The document has been verified by all the constituent colleges
Coordinator in charge of syllabus revision of the programme
Binu V P
As so c iat e Professor and Head
Department of Computer Science and Engg.
Dr. Hari V S College of Engineering, Karunagappally
Principal
College of Engineering, Karunagappally
Principals of the colleges in which the programme is offered
No Name of the college Principal’s Name Signature

1 College of Engineering, Dr. Hari V S
Karunagappally
Date: Dr S. Mohan,
Place: Professor, IIT, Madras
Chairman
Page 2
VISION and MISSION of the Department
Vision
To graduate professionally excellent, technically
competent, socially committed computer engineers
by providing Value based Quality Education
Mission
To inculcate spirit of ethical values and social

responsibilities to make the individuals good
citizens. To enlighten the individuals with the
transformations in the recent technologies of the
fast growing computing environment. To apply
innovations in the field of Computer Science
and Engineering.
VISION and MISSION of the Program
VISION
To enlighten the perception of the individuals in
the field of computer science and image
processing and motivate them to research
MISSION
Provide excellent learning environment and
motivate them in research through application
oriented assignments and find solution to real
life problems.
PROGRAM EDUCATIONAL OBJECTIVES
(PEOs)
PEO1: To facilitate easy understanding of mathematical basis for image
processing.
PEO2: To analyze problem and find its solution using mathematical and technical
knowledge
PEO3: To motivate graduates in research field of image processing
PEO4: To understand how to prepare and execute a feasible research project
PEO5: To apply image processing modalities in storage, transmission, biomedical
and security areas of image processing

PROGRAM OUTCOMES (POs)
1. Enhance knowledge in understanding and analyzing
problems
2. Develop solutions to live problems
3. Understanding professional responsibilities

Course Structure & Syllabus for
M. Tech Computer Science with specialization in

Image Processing
First Semester (Credit : 23)
Internal Ext. Total

Course Code Name of Course Credits
Marks Marks Marks
Mathematical foundation for Image

02CS6411 40 60 100 4
Processing
02CS6421 Advanced Data Structures and Algorithms 40 60 100 4
02CS6431 Digital Image Processing 40 60 100 4
02CS6441 Random Process 40 60 100 3
02CS6451 Elective 1 40 60 100 3
02CA6001 Research methodology 100 0 100 2
02CS6461 Seminar 100 0 100 2
02CS6471 Image Processing Lab -I 100 0 100 1
Total Credits 23
Second Semester (Total Credits: 19)
Internal Ext. Total

Name of Course Credits
Marks Marks Marks
02CS6412 Advanced Data Mining 40 60 100 4
Advance Image Processing & Computer

02CS6422 40 60 100 3
Vision
02CS6432 Pattern Recognition 40 60 100 3
02CS6442 Elective 2 40 60 100 3

02CS6452 Elective 3 40 60 100 3
02CS6462 Image Processing Lab II 100 0 100 1
02CS6472 Mini Project 100 0 100 2
Total Credits 19
Third Semester (Total Credits : 14)
Internal Ext. Total

Marks Marks Marks
02CS7411 Elective 4 40 60 100 3
02CS7421 Elective 5 40 60 100 3
02CS7431 Seminar 100 100 2
02CS7441 Project (phase 1) 50 50 6
Total Credits 14
Fourth Semester (Total Credits: 12)
Internal Ext. Total

Marks Marks Marks
02CS7412 Project Dissertation Evaluation 70 30 100 12
Total Credits 12
Total Credits 68
List of Electives
Semester I – Elective 1
Internal Ext. Total

Marks Marks Marks
02CS6451.1 Advanced Computer Graphics 40 60 100 3
02CS6451.2 Machine Learning 40 60 100 3
02CS6451.3 Multimedia Systems 40 60 100 3
02CS6451.4 Advanced Software Engineering 40 60 100 3
02CS6451.5 Information Security 40 60 100 3
Semester II – Elective 2
Internal Ext. Total

Marks Marks Marks
02CS6442.1 Soft Computing 40 60 100 3
02CS6442.2 Biomedical Imaging 40 60 100 3
02CS6442.3 Advanced Computer Networks 40 60 100 3
02CS6442.4 Information Retrieval 40 60 100 3
02CS6442.5 Advance Operating System 40 60 100 3
Semester II – Elective 3
Internal Ext. Total

Marks Marks Marks
Wavelet Transform: Theory and

02CS6452.1 40 60 100 3
Applications
02CS6452.2 Data Compression 40 60 100 3

02CS6452.3 Fuzzy set theory and application 40 60 100 3
02CS6452.4 Network Security 40 60 100 3
Advance Database Management

02CS6452.5 40 60 100 3
System
Semester III – Elective 4
Internal Ext. Total

Marks Marks Marks
02CS7411.1 Bioinformatics 40 60 100 3
02CS7411.2 Ad-hoc sensor networks 40 60 100 3
02CS7411.3 Digital Video Processing 40 60 100 3
02CS7411.4 Cloud Computing 40 60 100 3
02CS7411.5 Advanced Computer Architecture 40 60 100 3
Semester III – Elective 5
Internal Ext. Total

Marks Marks Marks
02CS7421.1 Document Image Processing 40 60 100 3
02CS7421.2 Image Forensics and Security 40 60 100 3
Geographical Information System

02CS7421.3 40 60 100 3
and its Applications
Content based Image & video

02CS7421.4 40 60 100 3
Retrieval
02CS7421.5 Medical Image Analysis Techniques 40 60 100 3

Course No: 02CS6411
Course Title: Mathematical Foundation for Image Processing
Credits: 3-1-0: 4
Year: 2015
Pre-requisites: Nil
Course Objectives:
To facilitate easy understanding of mathematical basis for image processing.
Syllabus
Matrix algebra & Group Theory, Introduction to Linear transformation, Linear transformation,
Introduction to image transforms, Vector spaces and subspace, Statistical measures.
Course Outcome:
Amelioration of advanced subjects and concepts related to image processing
Text Books:
1. Linear Algebra and probability for computer science applications, Ernest Davis, CRC Press,
2012
2. Linear algebra and its applications, Ganesh A,CBS Publications, 2014
3. Statistics Murray R Spiegel, Larry J stephens, Third edition, 2004
References:
1. Linear algebra and its applications, Gilbert Strang, Fourth edition, 2005
2. Mathematical foundations for signal processing, communications and Networking, Erchin
Serpedin, Thomas Chen , Dinesh Rajan, CRC press, 2011
3. Linear Algebra, 2nd Edition Kenneth Hoffmann and Ray Kunze, 1975
4. Probalility, random variables and stochastic process” Athanasios Papoulis,S Unnikrishna Pillai,
Mcgraw Hill series, Fouth edition, 2002
5. Probability and statistics for computer scientist, Michael Baron, chapman and hall / CRC, Tailor
Fransis Group, 2013
COURSE PLAN
COURSE NO: 02CS6411 COURSE TITLE: Mathematical Foundation for Image Processing
(L-T-P : 4-0-0) CREDITS:4
MODULES Contact Sem.Exam

hours Marks;%
MODULE : 1 9 15
Matrix, types of matrices, matrix operations, determinant adjoint, inverse,
rank of matrix, System of linear equations, matrix diagonalization - eigen
values and eigen vectors, SVD. Groups, ring, fields.
MODULE : 2 8 15
Fields, Finding a solution set, Matrix product as linear combinations, matrix
form of linear system, row reduced Echelon Matrices, Invertible matrices,
LU decomposition, Homogeneous System of Linear Equations, Non
Homogenous Equations, properties of matrix exponents, Special matrices.
FIRST INTERNAL TEST
MODULE : 3 7 15
Introduction, Properties of Linear Transformation, Matrix of Linear
Transformation, Rank Nullity of Linear Transformation, Singular and Non-
Singular Linear transformation, Eigen values and Eigen vectors of Linear
transformation, Isomorphic vector spaces, Fourier Transformation, Z-
transformation, Cosine Transformation.
MODULE : 4 10 15
Vector spaces, Subspaces, null space, solution space and direct sums and
intersection of spaces, spanning and linear dependency, basis, dimension,
change of basis, fundamental subspaces, vector subspaces, Algebra of
subspaces, Linear Combination of Vectors, Coordinates, Summary of row
equivalence.
SECOND INTERNAL TEST
MODULE : 5 8 20
Inner products spaces, Norm or length of a vector, angle between vectors,
orthogonality:- orthogonal sets and Basis, projections, orthogonal bases,
Gram-schimi orthogonalization, QR Factorization, Least square problems,
Standard Euclidean Inner product
MODULE : 6 8 20
Basic Statistical measures, measures of dispersion and central tendency,
moment, skewness, and kurtosis. Elementary probability, Frequency
Distribution, Normal Distribution, Binomial and Poison distribution,
Elementary sampling Theory, Correlation Theory, covariance.
Course No: 02CS6421
Course Title: Advanced Data Structures and Algorithms
Credits: 4-0-0: 4
Year: 2015
Pre-requisites: Nil
Course Objectives:
 To understand about advanced data structures.
 To understand how to analyse and establish correctness of algorithms
 To understand theory behind various classes of algorithms.
Syllabus
Amortized analysis; Advanced data structures; Network flow algorithms and their analysis;
Probabilistic algorithms; Monte-Carlo algorithms; Geometric algorithms; Convex hull algorithms; Finding
closest pair of points; Number theoretic algorithms; Integer factorization; String matching; Overview of
complexity classes; Complexity classes in randomized algorithms.
Course Outcome:
The students are able to
 Explain the concepts of advanced data structures and their applications
 Compare various classes of algorithms.
 Design and analyze new algorithms
References:
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, “Introduction to algorithms”, Prentice-hall
of India Private Limited, New Delhi, 2010.
2. Sartaj Sahni, “Data Structures, Algorithms, and Applications in C++”, Mc-GrawHill, 1999.
3. Gilles Brassard and Paul Bratley, “Fundamentals of algorithms”, Prentice-hall of India Private
Limited, New Delhi, 2001.
4. R.C.T. Lee, S.S. Tesng, R.C. Cbang and Y.T. Tsai “Design and Analysis of Algorithms, A strategic
Approach”, TMH, 2010
5. Rajeev Motwani, Prabhakar Raghavan, “Randomized Algorithms”, Cambridge University Press, 2000.
6. Dexter C. Kozen, “The Design and Analysis of Algorithms”, Springer.
7. Jon Kleinberg and Eva Tardos, “Algorithm Design”, Pearson Education, 2006.
8. M. H. Alsuwaiyal, “Algorithms Design Techniques and Analysis”, World Scientific Publishing Co.
Beijing, 1999.
9. S. K. Basu, “Design Methods and Analysis of Algorithms”, Prentice Hall India, 2005.
COURSE PLAN
COURSE NO: 02CS6421 COURSE TITLE: Advanced Data Structures and Algorithms

hours Marks;%
MODULE : 1
Amortized Analysis – aggregate, accounting, potential methods- Case

7 15
studies. Advanced data structures: binomial heap, Fibonacci heap,
disjoint sets - applications.
MODULE : 2
Network flow algorithms: properties, Ford-Fulkerson method, maxflow-

mincut theorem, Edmonds-Karp heuristics, push-relabel, relabel-to-front 8 15
algorithms, maximum bipartite matching - analysis of associated
algorithms - applications.
FIRST INTERNAL TEST

MODULE : 3
Probabilistic algorithms: Numerical algorithms, integration, counting,

8 15
Monte-Carlo algorithms - verifying matrix multiplication, min-cut in a
network. Las Vegas algorithms, selection, quicksort, Dixon's factorization
MODULE : 4
Geometric Algorithms: Plane sweep technique, role of sweep- line -

status and event-point-schedule, line segment intersection problem. 9 15
Convex Hull: Graham’s scan algorithm, Jarvis march algorithm. Finding
closest pair of points, proof of correctness.

MODULE : 5
Number-Theoretic algorithms: GCD algorithm, primality testing, Miller-

10 20
Rabin test, integer factorization - Pollard Rho heuristic, string matching:
Rabin-Karp, Knuth-Morris-Pratt algorithms.
MODULE : 6
Overview of Complexity classes – P, NP, Co-NP, NP-hard, NP complete, 8 20

Space complexity. Complexity classes in randomized algorithms – RP, PP,
ZPP, BPP.
Course No: 02CS6431
Course Title: DIGITAL IMAGE PROCESSING
Credits: 4-0-0: 4
Year :2015
Pre-requisites: Students will be expected to be familiar with basic statistics, probability, calculus, and
linear algebra.
Course Objectives:
To give the Student:-
 Understand the basic principles and methods of digital image processing,

 Be able to formulate solutions to general image processing problems,
 Have a comprehensive background in image filtering,
 Be prepared for research in image processing.
Syllabus
Digital image fundamentals, Image Transformations, Image Enhancement techniques and

Filtering techniques both spatial and frequency domain, Image Restoration, Morphological Image
Processing, Image Segmentation and feature analysis.
Course Outcome:
Students who successfully complete this course will have demonstrated an ability to
understand the fundamental concepts of image processing; Apply the basic equation of
transformations to transform images into different domains; Use of enhancement and filtering
techniques in different domains and apply them in original images; Use of morphological
operations and usefulness in segmentation problems leads to solve research works.
References:
1. Digital Image Processing, Gonzalez.R.C & Woods. R.E., 3/e, Pearson Education, 2008.
2. Digital Image Processing, Kenneth R Castleman, Pearson Education,1995.
3. Digital Image Procesing, S. Jayaraman, S. Esakkirajan, T. Veerakumar, McGraw Hill
Education, 2009.
4. Fundamentals of Digital image Processing, Anil Jain.K, Prentice Hall of India, 1989.
5. Image Processing, Sid Ahmed, McGraw Hill, New York, 1995.
COURSE PLAN
COURSE NO: 02CS6431 COURSE TITLE: DIGITAL IMAGE PROCESSING

hours Marks;%
MODULE : 1
Introduction: Digital Image- Steps of Digital Image Processing Systems-
Elements of Visual Perception - Connectivity and Relations between Pixels.
Simple Operations- Arithmetic, Logical, Geometric Operations. 2D linear 10 15
Convolution – 2D linear Correlation.
MODULE : 2
Image Transforms: 2D Orthogonal and Unitary Transforms-Properties and
Examples. 2D DFT- DCT - Hadamard Transform - Haar Transform - Slant 9 15
Transform - KL Transform -Properties And Examples.

FIRST INTERNAL TEST
MODULE : 3
Image Enhancement- Histogram Equalization Technique- Point
Processing-Spatial Filtering-In Space and Frequency - Linear Filters, 9 15
Nonlinear Filtering-Use Of Different Masks.

MODULE : 4
Image Restoration: Image Observation And Degradation Model, Circulant
And Block Circulant Matrices and Its Application In Degradation Model -
Algebraic Approach to Restoration- linear filters, Inverse By Wiener 7 15
Filtering - Generalized Inverse-SVD And Interactive Methods - Blind
Deconvolution.

MODULE : 5
Morphology-Dilation, Erosion, Opening and Closing. Hit And Miss
Algorithms, Boundary extraction, Region filling, extraction of connected 7 20
components.
MODULE : 6
Image Segmentation: Point detection, Edge Detection - Line Detection -
Curve Detection - Edge Linking and Boundary Extraction, Thresholding,
8 20
Region based segmentation, watershed, clustering. Feature Analysis-
boundary descriptors, regional descriptors.
Course No:02CS6441
Course Title: RANDOM PROCESSES
Credits: 3-0-0: 3
Year :2015
Pre-requisites: Bases in Probability theory
Course Objectives:
This course provide the students to
Understand the principles of random signals and methods of characterizing systems having
random input signals.
Understand the elementary aspects of probability theory.
Understand the relative frequency definition of probability and also the axiomatic definition.
Syllabus
Probability theory & random variables, Random Processes, Morkov chains, States, Series
representations of random processes.
Course Outcome:
 Students have the basics of probability, events and random experiments.

 They can analyze that the random variable is always a numerical quantity.
 Students can use the multiple random variables and relate through examples to real problems.
 They have the concept of random processes in both deterministic and non deterministic types.
 Use the Power density spectrum and its properties and the types of noise
References:
1. Probability, Random Variables and Stochastic Processes, A. Papoulis and S. U. Pillai: 4th edition,
2002, McGraw Hill.
2. Probability and Random Processes, Geoffrey Grimmett: 3rd edition, 2001, Oxford University Press
3. Probability and Random Process, V. Krishnan: 2006, John Wiley & Sons
4. Probability and Random Processes for Electrical Engineering, Albert Leon Garcia: 1993, Prentice
Hall
COURSE PLAN
COURSE NO: 02CS6441 COURSE TITLE: RANDOM PROCESSES

hours Marks %
MODULE : 1
Probability axioms, conditional probability, discrete and continuous random
variables, cumulative distribution function (CDF), probability mass function
8 15
(PMF), probability density function (PDF), conditional PMF/PDF, expected
value, variance, functions of a random variable, expected value of the
derived random variable, multiple random variables, joint CDF/PMF/PDF
MODULE : 2
Functions of multiple random variables, multiple functions of multiple
random variables, independent/uncorrelated random variables, sums of
7 15
random variables, moment generating function, random sums of random
variables. The sample mean, laws of large numbers, central limit theorem,
convergence of sequence of random variables.
FIRST INTERNAL TEST
MODULE : 3
Introduction to random processes, specification of random processes, nth
order joint PDFs, independent increments, stationary increments, Markov
property, Markov process and martingales, Gaussian process, Poisson 7 15
process and Brownian motion, Mean and correlation of random
processes, stationary, wide sense stationary, ergodic processes, Mean-square
continuity, mean-square derivatives.
MODULE : 4
Random processes as inputs to linear time invariant systems: power spectral 6 15
density, Gaussian processes as inputs to LTI systems, white Gaussian noise.
MODULE : 5
Discrete-time Markov chains: state and n-step transition probabilities,
6 20
Chapman-Kolmogorov equations, first passage probabilities, classification of
states, limiting state probabilities.
MODULE : 6
Series representation of random process: Fourier series, Karhunen - Loeve
6 20
expansion, Mercer’s theorem, sampled band-limited processes, filtering using
series representation
Course No: 02CS6451.1
Course Title: Advanced Computer Graphics
Credits: 3-0-0: 3
Year: 2015
Pre-requisites: Nil
Course Objectives:
• To introduce geometric modelling and modelling transformations
• To learn different techniques for representing Solids
• To learn visible surface determination algorithms
• To learn concepts of global illumination modeling using advanced Ray tracing algorithms and
Radiosity methods
Syllabus
Geometric modelling - Modelling transformations, Hierarchical models, Interaction, Output features,
Optimizing display of hierarchical models, SPHIGS; User interface software; Solid modelling –
Regularized Boolean set of operations, Sweep representations, Boundary representations, Edge
representations; Visible surface determination algorithms; Illumination and shading; Radiosity methods;
Image manipulation and storage; Clipping polygons; Animation; Advanced raster graphics architecture;
Multiprocessor rasterization architecture; Image parallel rasterization.
Course Outcome:
• apply appropriate mathematical models to solve computer graphics problems.
References:
1. James D. Foley, Andries van Dam, Steven K. Feiner and F. Hughes John, “Computer Graphics,
principles and Practice in C”, 2/e, Pearson Education.
2. Donald Hearn and M. Pauline Baker, “ Computer Graphics”, Prentice Hall India
3. Alan Watt , “ 3D Computer Graphic
COURSE PLAN
COURSE NO: 02CS6451 (1) COURSE TITLE: Advanced Computer Graphics

hours Marks;%
MODULE : 1
Geometric modelling :Hierarchy in Geometric models, relationship
between model, application program and Graphical System, Defining and
Displaying structures, Modelling Transformations, Hierarchical structure 7 15
networks, Appearance attribute handling in hierarchy, Screen updating
and rendering modes, Interaction, Output features, Implementation
issues, Optimizing display of hierarchical models, Limitations of SPHIGS.
MODULE : 2
User Interface Software: Basic interaction handling models, Window
management systems, Output handling in window systems, Input
handling in window systems, User Interface Management systems.
Solid Modelling: Regularized Boolean set of operations, Sweep 7 15
representations, Boundary representations, Winged –Edged
representations, Boolean Set Operations, Spatial Partitioning
representations, Octrees, Constructive Solid Geometry, Comparisons of
representations.
FIRST INTERNAL TEST
MODULE : 3
Visible surface determination algorithms: Scan line algorithm, Area
6 15
subdivision algorithm, visible surface ray tracing. Algorithm for Octree,
algorithm for curved surface.
MODULE : 4
Illumination and shading: Illumination models, diffuse reflection and
Specular reflection, illumination models, Shading models for polygons. 7 15
Global illumination algorithms. Recursive ray tracing and distributed ray
tracing. Radiosity methods, Combining radiosity and ray tracing.
MODULE : 5
Image manipulation and storage : Geometric transformation of images,
Filtering, Multipass transforms, Generation of transformed image with
filtering, Image Compositing, Mechanism for image storage. Advanced 7 20
geometric and raster transforms: Clippingclipping polygon against
rectangles and other polygons. Animation: Conventional and computer
assisted animation, Methods of controlling animation.
MODULE : 6
Advanced Raster graphics architecture. Display processor system,
Standard graphics pipeline, Multiprocessor Graphics System. Multi 6 20
processor Rasterization Architectures. Image parallel rasterization.
Course Title: MACHINE LEARNING
Credits: 3-0-0: 3
Year: 2015
Pre-requisites: Basics of Artificial Neural Networks
Course Objectives:
Introduce the fundamental problems of machine learning.
Provide understanding of techniques, mathematical concepts, and algorithms used in machine learning
to facilitate further study in this area.
Provide understanding of the limitations of various machine learning algorithms and the way to evaluate
performance of machine learning algorithms.
Provide pointers into the literature and exercise a project based on literature search and one or more
research papers.
Practice software implementation of different concepts and algorithms covered in the course.
Syllabus
Introduction to machine learning, Dealing with uncertainty, Maximum likeliHood estimation
(MLE) theory and examples, Discriminative learning, Neural networks, Support vector machines,
Unsupervised Learning, Dimensionality Reductions
Course Outcome:
On successful completion of this module, the student will be able to:
Apply a range of machine learning techniques to solve industrial problems within the domain of digital
signal and image processing.
Evaluate the application of machine learning approaches to a wider set of data mining and classification
type problems.
Using a provided implementation, plan machine learning analysis on suitable forms of digital signal and
image processing data.
Explain the concepts and operation of a range of machine learning algorithms in order to facilitate re-
implementation in a software programming environment with which they are already familiar.
References:
1. Machine Learning, T. Mitchell, McGraw-Hill, 1997.
2. Elements of Statistical Learning, T. Hastie, R. Tibshirani and J. Friedman, Springer, 2001.
3. Machine Learning, E. Alpaydin, MIT Press, 2010.
4. Pattern Recognition and Machine Learning, C. Bishop, Springer, 2006.
5. Machine Learning: A Probabilistic Perspective, K. Murphy, MIT Press, 2012.
6. Pattern Classification, R. Duda, E. Hart, and D. Stork, Wiley-Interscience, 2000.
COURSE PLAN
COURSE NO: 02CS6451.2 COURSE TITLE: MACHINE LEARNING


hours Marks;%
MODULE : 1
Introduction to machine learning, Overview of target function
representations, Hypothesis class, version space, Types of ML techniques,
hypothesis selection through cross validation, Noise, bias-variance trade-
off, under-fitting and over-fitting concepts, types of features, data
8 15
normalization.
Bias variance trade-off using regression example, Correlation, covariance,
Mahalanobis distance, Minkowski distance, distance metric, Jaccard
coefficient, missing values, feature transformations, Geometrical
interpretation of Euclidean.
MODULE : 2
Dealing with uncertainty, Maximum likeliHood estimation (MLE) theory
and example using binomial distribution, Maximum likeliHood estimation
7 15
(MLE) of univariate Gaussian, generative vs discriminative models,
Maximum likelihood estimation of bivariate Gaussian distribution,
sufficient statistics, Bayesian Learning.
FIRST INTERNAL TEST
MODULE : 3
Discriminative Learning: linear discrimination, logistic regression, logic
and logistic functions, generalized linear models, softmax regression.
Neural Networks: the perceptron algorithm, multilayer perceptrons, 7 15
backpropagation, nonlinear regression, multiclass discrimination, training
procedures, localized network structure, dimensionality reduction
interpretation.
MODULE : 4
Support vector machines: functional and geometric margins, optimum
margin classifier, constrained optimization, Lagrange multipliers, 6 15
primal/dual problems, KKT conditions, dual of the optimum margin
classifier, soft margins, kernels, quadratic programming, SMO algorithm.
MODULE : 5
Unsupervised learning: K-means clustering, expectation maximization,
6 20
Gaussian mixture density estimation, mixture of naive Bayes, model
selection.
MODULE : 6
Dimensionality reduction: feature selection, principal component
6 20
analysis, linear discriminant analysis, factor analysis, independent
component analysis, multidimensional scaling, manifold learning.
Course Title: Multimedia Systems
Credits: 3-0-0: 3
Year :2015
Pre-requisites: Nil
Course Objectives:
• A foundation in the fundamentals of fluid mechanics;

• Practice in the analytical formulation of fluid mechanics problems using Newton’s Laws of
motion and thermodynamics;
• An introduction to experimental methods;
Syllabus
Defining the scope of multimedia, Multimedia File systems and information models, Digital Audio
Representation and processing, Digital Video and Image Compression, Distributed Multimedia systems,
Operating systems Support for Continuous Media Applications, Multimedia presentation and Authoring.
Course Outcome:
Students who successfully complete this course will have demonstrated an ability to
understand the fundamental concepts of Multimedia systems; Apply the basic methods used to
create sound, text, image and vedio; Use of compression in multimedia system and apply them;
Use of multimedia databases and applications in www.
References:
1. Multimedia Systems by Jhon F. Koegel Buford – Pearson Education,2001.

2. John Vince, “Virtual Reality systems”, Addison – Wesley, 1995
3. R. Carey and G. Bell, “The Annotated VRML 2.0 reference”, Addison Wesley, 1997
COURSE PLAN
COURSE NO: 02CS6451.3 COURSE TITLE: Multimedia Systems (L-T-P : 3-0-0)

CREDITS:3

hours Marks;%
MODULE : 1
Defining the scope of multimedia: Hypertext and Collaborative research-
Multimedia and personalized computing, Multimedia on the map,
emerging applications, Multimedia applications, Hybrid Devices,
Designers perspective, Key challenges ahead, Technical, regulatory, Social
7 15
issues Multimedia File systems and information models: The case for
multimedia information Models: The case for multimedia information
systems, The file system support for continuous Media, Data models for
multimedia and Hypermedia information, Content- based Retrieval of
Unstructured Data
MODULE : 2
Digital Audio Representation and processing : Uses of Audio in Computer
application Psychoacoustics, Digital representation of sound,
transmission of digital sound, Digital Audio signal processing, Digital
music making, Speech recognition and generation, digital audio and 7 15
computers Video Technology Raster Scanning Principles, Sensors for TCV
Cameras, colour Fundamentals, Colour Video, Video performance
Measurements, Analog video Artifacts, video equipments, Worldwide
television standards
FIRST INTERNAL TEST
MODULE : 3
Digital Video and Image Compression: Video Compression techniques,
standardization of algorithm, The JPEG Image Compression Standard,
ITU-T Recommendations, The EPEG Motion video Compression Standard,
DVU Technology Virtual reality, Virtual reality systems, Real time
computer graphics. The cirual world space Perspective projection, Stereo 7 15
vision, 3D clipping, Colour theory instruction to animation, the dynamics
of numbers, updating real-time graphics, shape and object in between,
free-form deformation. Simulation of physical systems, mathematical
modelling, collisions, projectiles, introduction to dynamics, motion
kinetmatics
MODULE : 4
Distributed Multimedia systems: Architectures and issues for Distributed
6 15
Multimedia systems Synchronization, and QOS Architecture, The role of
Standards, A frame work for Multimedia systems.
MODULE : 5
Operating systems Support for Continuous Media Applications :
7 20
Limitation of work station Operating systems, New OS support,
Experiments Using Real Time Mach Goals of Multimedia Systems services,
Multimedia systems services Architecture, Media stream protocol
Multimedia Devices, Presentation Services, and the User Interface. Client
control of continuous multimedia, Device control, Temporal coordination
and composition, toolkits, hyper applications.
MODULE : 6
Multimedia presentation and Authoring: Design paradigms and User
6 20
interface, barriers to wide spread use, research trends. Multimedia
Services over the Public Networks. Requirements. Architecture.
Course Title: Advanced Software Engineering
Credits: 3-0-0: 3
Year: 2015
Pre-requisites: Nil
Course Objectives:
 To gain knowledge about the issues and approaches in modeling, analyzing and testing software
systems.
Syllabus
Introduction to software engineering; Role of software engineer; Modelling the process and life
cycle; Software process models; Agile methods; Tools and techniques for process modelling; Process
models and project management; Project personnel and organization; Effort and schedule estimation;
Risk management; Capturing, eliciting, modelling, and reviewing requirements; Software architectures
and their evaluation; Software architecture documentation; Object oriented design; Types of testing;
Reliability, availability, and maintainability; predictive accuracy; Test documentation; Maintaining the
system.
Course Outcome:
 Use the principles of software engineering in modeling and testing.
 Explain different software architectures.
References:
1. Shari Lawrence Pfleeger, Joanne M Atlee, “Software Engineering Theory and Practice”, 4/e,
Pearson Education, 2011.
2. Software Engineering: A Practitioner's Approach, Roger S Pressman, 7/e,. McGraw Hill Int.Ed.,
2010.
3. Ian Somerville, “Software Engineering”, 8/e, Addison-Wesley 2007
4. Carlo Ghezzi, Mehdi Jazayeri, Dino Mandrioli, “Fundamentals of Software Engineering”, 2/e, PHI
Learning Private Ltd., 2010
5. Pankaj Jalote, “An Integrated Approach to Software Engineering”, 3/e, Springer 2005.
6. K.K Aggarwal & Yogesh Singh, “Software Engineering”, New Age International 2007.
7. Norman E Fenton, Shari Lawrence Pfleeger, “Software Metrics: A Rigorous and Practical
Approach. 1998
COURSE PLAN
COURSE NO: 02CS6451.4 COURSE TITLE: Advanced Software Engineering

hours Marks;%
MODULE : 1
Introduction: Role of Software Engineer- Quality of software process and
product – Systems Approach to Software Engineering – An Engineering
Approach to Software Engineering – How has Software Engineering 7 15
Changed? Modeling the Process and Life Cycle – Software Process Models
– Waterfall Model – V Model - Prototyping Model – Spiral Model – Agile
methods.
MODULE : 2
Tools and Techniques for Process Modeling – Planning and Managing the
Project - Tracking project progress - Project personnel and organization – 7 15
Effort and schedule estimation – Risk Management – Process Models and
Project Management .
FIRST INTERNAL TEST
MODULE : 3
Capturing the Requirement – Eliciting Requirements – Modelling
requirements – Reviewing
requirements to ensure quality – Documenting requirements – Designing 7 15
the architecture – Views of Software Architecture – Common
Architectural Patterns – Architecture Evaluation and Refinement Criteria
for evaluating and comparing design alternatives .
MODULE : 4
Software architecture documentation - Designing Modules – Design
Methodology – Design Principles – Object Oriented (OO) design –
7 15
Representing designs using UML – OO Design Patterns - OO
Measurement - Design Documentation Programming Standards and
Procedures – Programming Guidelines – Documentation.
MODULE : 5
Testing the Programs - Principles of System Testing - Function Testing -
Performance Testing – Reliability - Availability and Maintainability - Basics 6 20
of reliability theory - The Software Reliability Problem - Parametric
reliability growth models
MODULE : 6
Predictive accuracy - The recalibration of software- reliability growth
predictions - Acceptance Testing - Installation Testing – Automated
6 20
System Testing - Test Documentation - Testing Safety Critical Systems -
Maintaining the System – Evaluating Products, Processes, and Resources.
Course Title: Information Security
Credits: 3-0-0: 3
Year: 2015
Pre-requisites: Nil
Course Objectives:
 To understand the requirement and fundamental principles of Information security.
Syllabus
OS security; DB security; Software vulnerabilities; Malware viruses, worms, and Trojans;
Topological worms; Symmetric encryption principles; Public Key cryptography principles; SHA1; Discrete
log Diffie Hellman; Digital signature; Digital certificates; Steganography and watermarking; Symmetric
key distribution; One way and two way authentication; Needham Schroeder protocol; Kerberos;
Network layer security; Transport layer security; Web security consideration; Law and ethics.
Course Outcome:
 Discuss about information security, its significance and the domain specific security issues.
References:
1. Bernard Menezes, “Network security and Cryptography”, Cengage Learning India, 2010.
2. Behrouz A. Forouzan, “Cryptography and Network Security”, Special Indian Edition, Tata
McGraw Hill, 2007
3. William Stallings, “Cryptography and Network Security: Principles and Practice”, 6/e Pearson
Education, 2013.
4. Dieter Gollmann. “Computer Security”, John Wiley and Sons Ltd., 2006.
5. Whitman and Mattord, “Principles of Information Security”, Cengage Learning, 2006.
6. D. Bainbridge, “Introduction to Computer Law”, 5/e, Pearson Education, 2004.
7. C. Kaufman, R. Perlman and M. Speciner, “Network Security: Private Communication in a public
World”, 2/e, Prentice Hall, 2002.
8. W. Mao, “Modern Cryptography: Theory & Practice”, Pearson Education, 2004.
9. H. Delfs and H. Knebl, “Introduction to Cryptography: Principles and Applications”, Springer
Verlag, 2002.
COURSE PLAN
COURSE NO: 02CS6451.5 COURSE TITLE: Information Security


hours Marks;%
MODULE : 1 7 15
Security Models as basis for OS security, Introduction to DB Security,

Software vulnerabilities, Buffer and stack overflow, Phishing. Malware
Viruses, Worms and Trojans. Topological worms. Internet propagation
models for worms. Symmetric Encryption Principles, Public-Key
Cryptography Principles
MODULE : 2 7 15
Cryptography Topics: Introduction to Secure Hash Function and Digital

Signature ,
Cryptographic hash SHA1, Discrete Log Diffie Hellman, Digital certificates.
Steganography
watermarking. Symmetric Key Distribution Using Symmetric Encryption
FIRST INTERNAL TEST

MODULE : 3 6 15
Protocol topics: One way and two way authentication, Needham

Schroeder protocol, Kerberos basics, Biometrics for authentication.
MODULE : 4 7 15
Network security topics: Network layer security – IPSec – overview,

IP and IPv6, AH, ESP. Transport layer security SSL. Attacks DoS, DDoS, ARP
spoofing - firewalls.

MODULE : 5 7 20
Web Security Consideration, Secure Sockets Layer (SSL) and Transport

Layer Security (TLS), HTTPS, Secure Shell (SSH), Pretty Good Privacy (PGP),
S/MIME
MODULE : 6 6 20
Law and ethics: Intellectual property rights, computer software

copyrights, security policy, ethical hacking, security tools.
Course No: 02CA6001
Course Title: Research Methodology
Credits: 1-1-0: 2
Year: 2015
Pre-requisites: Nil
Course Objectives:
 To formulate a viable research question

 To distinguish probabilistic from deterministic explanations
 To analyze the benefits and drawbacks of different methodologies
 To understand how to prepare and execute a feasible research project
Syllabus
Introduction to research methodology; Objectives and types of research; Research formulation;

Selecting a problem; Literature review; Research design and methods; Development of models and
research plan; Data collection and analysis; Data processing and analysis strategies; Report and thesis
writing; Presentation; Application of results of research outcome; Commercialization of the work; Ethics;
Trade related aspects of Intellectual property rights.
Course Outcome:
 Students are exposed to the research concepts in terms of identifying the research problem,
collecting relevant data pertaining to the problem, to carry out the research and writing
research papers/thesis/dissertation.
References:
1. C.R Kothari, Research Methodology, Sultan Chand & Sons, New Delhi,1990.
2. Panneerselvam, “Research Methodology”, Prentice Hall of India, New Delhi, 2012.
3. J.W Bames,” Statistical Analysis for Engineers and Scientists”, McGraw Hill, New York.
4. Donald Cooper, “Business Research Methods”, Tata McGraw Hill, New Delhi.
5. Leedy P D, "Practical Research: Planning and Design", MacMillan Publishing Co.
6. Day R A, "How to Write and Publish a Scientific Paper", Cambridge University Press, 1989.
7. Manna, Chakraborti, “Values and Ethics in Business Profession”, Prentice Hall of India, New Delhi,
2012.
8. Sople,”Managing Intellectual Property: The Strategic Imperative”, Prentice Hall of India, New Delhi,
2012.
COURSE PLAN
COURSE NO: 02CA6001 COURSE TITLE: Research Methodology

hours Marks;%
MODULE : 1 6 15
Introduction to Research Methodology - Objectives and types of
research: Motivation towards research - Research methods vs.
Methodology. Type of research: Descriptive vs. Analytical, Applied vs.
Fundamental, Quantitative vs. Qualitative, and Conceptual vs. Empirical.
MODULE : 2 7 15
Research Formulation - Defining and formulating the research problem -
Selecting the problem - Necessity of defining the problem - Importance of
literature review in defining a problem. Literature review: Primary and
secondary sources - reviews, treatise, monographs, patents. Web as a
source: searching the web. Critical literature review - Identifying gap
areas from literature review - Development of working hypothesis.
FIRST INTERNAL TEST
MODULE : 3 7 15
Research design and methods: Research design - Basic Principles- Need
for research design — Features of a good design. Important concepts
relating to research design: Observation and Facts, Laws and Theories,
Prediction and explanation, Induction, Deduction. Development of
Models and research plans: Exploration, Description, Diagnosis,
Experimentation and sample designs.
MODULE : 4 6 15
Data Collection and analysis: Execution of the research - Observation and
Collection of data - Methods of data collection - Sampling Methods- Data
Processing and Analysis strategies - Data Analysis with Statistical
Packages - Hypothesis-Testing -Generalization and Interpretation.
MODULE : 5 6 20
Reporting and thesis writing - Structure and components of scientific
reports -Types of report - Technical reports and thesis - Significance -
Different steps in the preparation, Layout, structure and Language of
typical reports, Illustrations and tables, Bibliography, referencing and
footnotes. Presentation; Oral presentation - Planning - Preparation -
Practice - Making presentation - Use of audio-visual aids - Importance of
effective communication.
MODULE : 6 6 20
Application of results of research outcome: Environmental impacts –
Professional ethics – Ethical issues -ethical committees.
Commercialization of the work - Copy right - royalty - Intellectual
property rights and patent law - Trade Related aspects of Intellectual
Property Rights - Reproduction of published material - Plagiarism -
Citation and acknowledgement - Reproducibility and accountability.
Course No: 02CS6461
Course Title: Seminar
Credits: 0-0-2: 2
Year: 2015
Each student is required to select a topic on advanced technologies in Computer Science and allied
subject domains and get it approved by the faculty-in-charge of seminar. He/she should give a
presentation with good quality slides. An abstract of the seminar should be submitted to the faculty
members well in advance before the date of seminar. He/she should also prepare a well documented
report on the seminar in approved format and submit to the department
Course No: 02CS6471
Course Title: Image Processing Lab -I
Credits: 0-0-1: 1
Year: 2015
Pre-requisites: Nil
Syllabus
Image processing based experiments are to be implemented in this part using MATLAB. Without
using MATLAB functions are also encouraged to do experiments.
ntroductory Cycle to familiarize the working environment/tool.
Cycle 1: Digital Image Processing Basics
Cycle 2: Image Transforms
Cycle 3: Image Enhancement and Image Restoration and Denoising
Cycle 4: Binary Image Processing and Image segmentation
Laboratory Software to be used

MATLAB / OpenCV
Choice of any open-source tool is possible with prior permission from the department.
References:
1. R C Gonzalez, R E Woods, S L Eddins, Digital Image Processing using Matlab, 2e, Gatesmark
Publishing, 2009
2. Jayaraman S, Veerakumar T, Esakkirajan S, Digital Image Processing, Mc Graw Hill Education,
2009
3. Anil K Jain, Fundamentals of Digital Image Processing, Prentice Hall, 1989
4. Chris Soloman, Toby Breckon, Fundamentals of Digital Image Processing: A Practical Approach
with Examples in Matlab, Wiley-Blackwell, 2010
SEMESTER II
Course No: 02CS6412 Course Title: Advanced Data Mining Credits:

4-0-0: 4
Year: 2015
Pre-requisites: Nil
Course Objectives:
To understand
 the fundamental and advanced concepts Data Warehousing and Data Mining.
Syllabus
Data warehousing; OLAP operations; Data warehousing architecture; Data
warehousing to data mining; Data mining tasks; Data mining issues; Data pre-processing;
Concept hierarchy generation; Introduction to DMQL; Similarity measures; Classification
algorithms; Clustering algorithms; Association rules; Web mining; Spatial mining;
Temporal mining.
Course Outcome:
Conceptual understanding of:
 Data cleaning, analysis and visualization
 Data mining techniques
 Web mining and Spatial mining
References:
1. Margaret H Dunham, “Data Mining – Introductory and Advanced Topics”, Pearson India,
2005.
2. Ian H. Witten, Eibe Frank, Mark A. Hall,” Data Mining: Practical Machine Learning Tools
and Techniques”, 3/e, Morgan Kaufmann, 2011.
3. J. Han, M. Kamber, “Data Mining: Concepts and Techniques”, 2/e, Morgan Kaufman, 2006.
COURSE PLAN
COURSE NO: 02CS6412 COURSE TITLE: Advanced Data Mining

hours Marks;%
MODULE : 1 9 15
Data warehousing – Multidimensional data model, OLAP

operation, Warehouse schema, Data Warehousing architecture,
warehouse server, Metadata, OLAP engine, Data warehouse
Backend Process , Data Warehousing to Data Mining. Basic Data
Mining Tasks, Data Mining Issues, Data Mining Metrics, Data
Mining from a Database Perspective, Knowledge Discovery in
Database Vs Data mining.
MODULE : 2 8 15
Data Preprocessing: Preprocessing, Cleaning, Integration,

Transformation, Reduction, Discretization, Concept Hierarchy
Generation, Introduction to DMQL.
FIRST INTERNAL TEST
MODULE : 3 9 15
Similarity measures, Bayes Theorem, Classification -regression,

Bayesian classification, Decision tree based algorithm-ID3,
Neural network based algorithm- supervised learning, back
propagation, gradient-descent algorithm, Rule based algorithm-
IR, PRISM
MODULE : 4 8 15
Clustering algorithm – Hierarchical algorithm –Dendrograms-

Single link algorithm, Partitional algorithm-Minimum spanning
tree, squared error, K-means, PAM algorithm.

MODULE : 5 8 20
Association Rules : Apriori algorithm, Sampling algorithm,

Partitioning algorithm, Parallel and distributed algorithms
MODULE : 6 8 20
Web mining-web content mining, web structure mining, web

usage mining, Spatial mining- spatial queries, spatial data
structures, Generalization and specialization, spatial
classification, spatial clustering, Introduction to temporal
mining.
Course No: 02CS6422 Course Title: ADVANCE IMAGE PROCESSING & COMPUTER
VISION Credits: 3-0-0: 3 Year :2015
Pre-requisites: Basic knowledge of Digital Image Processing
Course Objectives:
 To understand processing of digital images

 To familiarize different mathematical structures
 To study detailed models of image formation
 To study image feature detection, matching, segmentation and recognition
 To understand classification and recognition of objects.
 To familiarize state-of-the-art problems in computer vision
Syllabus
Colour and multispectral image processing, Image Registration, Image formation

and Image model with Components of a vision system, Multiple images and the Geometry
of multiple views, High level vision, Verification, aspect graphs, registration and recognition
of objects.
Course Outcome:
Students who successfully complete this course will have an ability to understand
the fundamental steps of image processing; Apply the basic transformation in
different domain; Use of filtering and enhancement techniques provide to face the
noise in the image and how to apply them in practical problems; Use of
morphological operations helps to extract objects from an image.
References:
1. Digital Image Processing, Gonzalez.R.C & Woods. R.E., 3/e, Pearson Education, 2008.
2. Digital Image Processing, Kenneth R Castleman, Pearson Education,1995.
3. Digital Image Procesing, S. Jayaraman, S. Esakkirajan, T. Veerakumar, McGraw Hill
Education, 2009, Pvt Ltd, NewDelhi.
4. Computer vision – A modern Approach , David A forsyth & Jean ponce , Prentice
Hall ,2002.
5. Computer vision and Applications, Bernd Jahne and Horst HauBecker Academic
press, 2000.
6. Richard Hartley and Andrew Zisserman, Multiple View Geometry in Computer
Vision, Second Edition, Cambridge University Press, 2004.
7. Richard Szeliski, Computer Vision: Algorithms and Applications, Springer, 2010
COURSE PLAN
COURSE NO: 02CS6422 COURSE TITLE: ADVANCED IMAGE PROCESSING AND

COMPUTER VISION (L-T-P : 3-0-0)
CREDITS:3
hours Marks;%
MODULE : 1 15
Color Image Processing: Color Image-Processing Fundamentals,

RGB Models, HSI Models, Relationship Between Different 6
Models. Multispectral Image Analysis, Radon Transformation-
Color Image Processing, Three Dimensional Image Processing.
Human color perception-Representation of color- A model for
image color-Surface color from image color.
MODULE : 2 15
Image Registration: Introduction, Classification of registration

methods, Geometrical transformations - Rigid transformations, 8
Nonrigid transformations, Rectification. Point based methods-
Points in rigid transformations, in scaling transformations, in
perspective projections, in curved transformations, surface
based methods, Intensity based methods- similarity measures
and capture ranges and optimization.
FIRST INTERNAL TEST
MODULE : 3 15
Image formation and Image model-Components of a vision 6

system-Cameras-camera model and camera calibration-
Radiometry-Light in space-Light in surface - Sources, shadows
and shading.
MODULE : 4 15
Multiple images-The Geometry of multiple views- Stereopsis-

Affine structure from motion- Elements of Affine Geometry- 7
Affine structure and motion from two images-Affine structure
and motion from multiple images-From Affine to Euclidean
images.
MODULE : 5 20
High level vision-:Geometric methods-Model based vision- 6

Obtaining hypothesis by pose consistency, pose clustering and
using Invariants, Verification
MODULE : 6 20
Smooth surface and their outlines-Aspect graphs- Range data- 7

Range Data segmentation- Range image Registration and model
acquisition-Object Recognition.
Course No: 02CS6432 Course Title: PATTERN RECOGNITION
Credits: 3-0-0: 3 Year :2015
Pre-requisites: Base knowledge of Probability, Statistics and Data Mining.
Course Objectives
 Study the fundamental algorithms for pattern recognition

 To instigate the various classification techniques
 To originate the various structural pattern recognition and feature extraction
techniques.
Syllabus:
Basics of pattern recognition, Parametric and Non Parametric technique, Unsupervised

Methods, Linear discriminant based classifiers and tree classifiers, Regression, Graphical
methods, Recent Advances in Pattern Recognition.
Course Outcomes :
 Understand and apply various algorithms for pattern recognition

 Realize the clustering concepts and algorithms
 Bring out structural pattern recognition and feature extraction techniques Program
Outcomes (POs)
 Identify, analyze, formulate, and solve engineering problems
References
1. Pattern Classification, R.O.Duda, P.E.Hart and D.G.Stork, John Wiley, 2001
2. Pattern Recognition, S.Theodoridis and K.Koutroumbas, 4th Ed., Academic Press, 2009
3. Pattern Recognition and Machine Learning, C.M.Bishop, Springer, 2006
COURSE PLAN
COURSE NO: 02CS6432 COURSE TITLE: PATTERN RECOGNITION
hours Marks;%
MODULE : 1 15
Introduction to pattern and classification, supervised and 6

unsupervised learning, Clustering vs classification, Bayesian
Decision Theory-Minimum error rate classification Classifiers,
discriminant functions, decision surfaces -The normal density
and discriminant-functions for the Normal density
MODULE : 2 15
Parametric and Non Parametric technique
Parametric estimation Technique:-Maximum-Likelihood (ML) 6
estimation, Bayesian estimation, Non Parametric density

estimation:-Parzen-window method, K-Nearest Neighbour
method
FIRST INTERNAL TEST
MODULE : 3 15
Linear discriminant based classifiers and tree classifiers
Linear discriminant function based classifiers-Perceptron- 8
Minimum Mean Squared Error (MME) method, Support Vector

machine, Decision Trees: CART, C4.5, ID3
MODULE : 4 15
Unsupervised Methods
Component Analysis and Dimension Reduction:- The Curse of 6
Dimensionality ,Principal Component Analysis ,Fisher Linear
Discriminant analysis.Clustering:- Basics of Clustering;
similarity / dissimilarity measures; clustering criteria. Different
distance functions and similarity measures, K-means algorithm.
MODULE : 5 20
Regression, Graphical methods
Regression:- Introduction to Linear models for regression, 8
Polynomial regression and Bayesian regression, Graphical

Models:-Bayesian belief network and Hidden Markov Models.
MODULE : 6 20
Recent Advances in Pattern Recognition
Recent Advances:- Neural network structures for pattern 6
recognition - Self organizing networks - Fuzzy logic - Fuzzy

pattern classifiers -Pattern classification using Genetic
Algorithms.
COURSE NO: 02CS6442.1 COURSE TITLE: SOFT COMPUTING
Pre-requisites: Nil
Course Objectives:
 To familiarize the salient approaches in soft computing based on artificial neural

networks, fuzzy logic, and genetic algorithms.
 To introduce applications of soft computing to different research areas in Computer
Science / Information Technology.
Syllabus
Artificial neural network based concept of soft computing; Architectures; Different

learning methods; Models of neural network; Fuzzy sets and logic; Fuzzy versus crisp;
Fuzzy relations; Crisp logic; Predicate logic; Genetic algorithm based concept; Travelling
salesman problem; Graph coloring problem; Hybrid systems; Neuro fuzzy systems.
Course Outcome:
 Understand advantages and disadvantages of soft computing.

 Students will be able to apply soft computing techniques to research problems.
References:
1. S.N. Sivanandam, S.N. Deepa, “Principles of Soft Computing”, 2/e, John Wiley India, 2012
2. Simon Haykin, “Neural Networks- A Comprehensive Foundation”, 2/e, Pearson
Education.
3. T.S. Rajasekaran, G.A. Vijaylakshmi Pai, “Neural Networks, Fuzzy Logic & Genetic
Algorithms – Synthesis and Applications”, Prentice-Hall India
4. Sanchez, Takanori, Zadeh, “Genetic Algorithm and Fuzzy Logic System”, World Scientific
5. Goldberg David, “Genetic Algorithms”, Pearson Education
6. Zimmermann H. J , “Fuzzy Set Theory & Its Applications”, Allied Publishers Ltd.
COURSE PLAN
COURSE NO: 02CS6442.1 COURSE TITLE: Soft Computing
MODULES Contact Sem.

Exam
hours
Marks;%
MODULE : 1 6 15
Artificial Neural Network Basic concept of Soft Computing; Basic

concept of neural networks, Mathematical model, Properties of
neural network, Typical architectures: single layer , multilayer,
competitive layer
MODULE : 2 6 15
Different learning methods: Supervised, Unsupervised &

reinforced; Common activation functions; Feed forward,
Feedback & recurrent N.N; Application of N.N; Neuron.
FIRST INTERNAL TEST
MODULE : 3 7 15
Models Of Neural Network:Architecture, Algorithm &

Application of – McCullo h-Pitts, Hebb Net, Perceptron ( with
limitations & Perceptron learning rule Convergence theorem),
Back propagation NN, ADALINE, MADALINE, Discrete Hopfield
net, BAM, Maxnet , Kohonen Self Organizing Maps, ART1,ART2.
MODULE : 4 7 15
Fuzzy Sets & Logic : Fuzzy versus Crisp; Fuzzy sets—

membership function, linguistic variable, basic operators,
properties; Fuzzy relations—Cartesian product, Operations on
relations; Crisp logic—Laws of propositional logic, Inference;
Predicate logic— Interpretations, Inference; Fuzzy logic—
Quantifiers, Inference; Fuzzy Rule based system; Defuzzification
methods; FAM

MODULE : 5 7 20
Genetic Algorithm Basic concept; role of GA in optimization,

Fitness function, Selection of initial population, Cross
over(different types), Mutation, Inversion, Deletion, Constraints
Handling; Evolutionary Computation; Genetic Programming;
Schema theorem; Multiobjective & Multimodal optimization in
GA; Applications: Travelling Salesman Problem, Graph Coloring
problem.
MODULE : 6 7 20
Hybrid Systems : GA based BPNN(Weight determination,

Application); Neuro Fuzzy Systems—Fuzzy BPNN--fuzzy
Neuron, architecture, learning, application; Fuzzy Logic
controlled G.A.
COURSE NO: 02CS6442 .2 COURSE TITLE: BIOMEDICAL IMAGING
Credits: 3-0-0: 3 Year :2015
Pre-requisites: Basics of Digital Image Processing
Course Objectives
1. Identify and describe in qualitative terms the principles of x-ray generation, x-ray-tissue
interaction, and x-ray imaging
2. Describe the principles of Computed Tomography (CT) and the 2D/3D image
reconstruction methods involved
3. Describe in qualitative terms the principles of ultrasound, PET, SPECT and MRI imaging
4. Identify and describe image contrast, image resolution, and signal-to noise ratio involved
in biomedical imaging 5. Identify and describe the complementary nature of various
imaging techniques
Syllabus
X-ray imaging , computed tomography, ultrasonic imaging, Magnetic Resonance Imaging,
Nuclear Medicine and Infrared Imaging –principles, image characteristics, image
acquisition, clinical applications
Course Outcome:
Students who successfully complete this course will have a fundamental knowledge
in different aspects and application areas of Medical Imaging modalities; can
effectively and efficiently utilize the knowledge gained in one of the current
research areas in biomedical imaging for the final thesis work.
References :
1. Handbook of Medical Image Processing and Analysis (Second Edition), Issac N

Bankman, 2008 Elsevier Inc
2. Medical Image analysis, second edition, Atam P Dhawan, IEEE Press, 2011
3. Physics of Medical Imaging, S Webb , Adam Highler, Bristol,
4. The Essential Physics of Medical Imaging, 3rd edition, Jerrold T. Bushberg, J.
Anthony Seibert Lippincott Williams & Wilkins, 2011
5. Medical Imaging Signals and Systems, 2 edition , Jerry L. Prince, Jonathan, pearson
education, 2015
COURSE PLAN
COURSE NO: 02CS6442.2 COURSE TITLE: BIOMEDICAL IMAGING
hours Marks;%
MODULE : 1 15
General Principles of Imaging with X-Rays, X-Ray Production, 6

Interactions of X-Rays with Tissue, Linear and Mass Attenuation
Coefficients of X-Rays in Tissue, X-Ray Image Characteristics. X-
Ray Imaging Methods. Clinical Applications of X-Ray Imaging.
MODULE : 2 15
Computed Tomography- Image Processing for Computed 7

Tomography, Spiral/Helical Computed Tomography. Multislice
Spiral Computed Tomography. Image Reconstruction-
Backprojection and Filtered Backprojection. Clinical
Applications of Computed Tomography.
FIRST INTERNAL TEST
MODULE : 3 15
General Principles of Ultrasonic Imaging-Wave Propagation and

Characteristic Acoustic Impedance-Wave Reflection and 7
Refraction-Instrumentation-Diagnostic Scanning Modes.
Artifacts in Ultrasonic Imaging - Image Characteristics, Blood
Velocity Measurements Using Ultrasound, Clinical Applications
of Ultrasound.
MODULE : 4 15
General Principles of Magnetic Resonance Imaging, Nuclear

Magnetism, Gradient coils, RF pulses, Instrumentation, Imaging 8
Sequences, Image Characteristics, Concepts in Magnetic
Resonance Angiography, Diffusion Weighted Imaging and
Functional MRI. Clinical Applications of MRI
MODULE : 5 20
General Principles of Nuclear Medicine, Radioactivity, The

Production of Radionuclides, Types of Radioactive Decay, The 6
Gamma Camera, Image Characteristics, Single Photon Emission
Computed Tomography, Positron Emission Tomography,
Clinical Applications of Nuclear Medicine.
MODULE : 6 20
Infra red Imaging - Physics of thermography - Imaging systems -

Pyroelectric vidicon camera, clinical themography - liquid 6
crystal thermography.
COURSE NO: 02CS6442.3 COURSE TITLE: ADVANCED COMPUTER NETWORKS
Pre-requisites: Nil
Course Objectives:
 To impart a deeper understanding of :

 Networking design including media, protocols, quality control and congestion
management
 Multimedia networking issues and approaches.
Syllabus
General principles of network design; Network architecture and standardization;
Network characteristics; High speed LANs; Switched LANs; Wireless transmission;
Addressing in TCP/ IP networks; TCP/ IP protocol stack; Advanced features of IP routers;
Wide Area Networks; IP WANs; Congestion and traffic management; Secure transport
services; Multimedia networking.
Course Outcome:
 The student becomes aware of the theoretical and practical issues in networking.
References:
1. Natalia Olifer Victor Olifer,” Computer Networks - Principles, Technologies and Protocols
for Network Design”, - Wiley India(P) ltd. 2006.
2. William Stallings, “High Speed Networks and Internets – Performance and Quality of
Service”, Pearson India 2005 .
3. James F Kurose and Keith W Ross ,” Computer Networking- A Top Down Approach
Featuring Internet”, 2/e, Pearson Education.
COURSE PLAN
COURSE NO: 02CS6442.3 COURSE TITLE: Advanced Computer

Networks (L-T-P : 3-0-0) CREDITS:3
hours Marks;%
MODULE : 1 7 15
General Principles of Network Design – Network Architecture

and Standardization- Network Characteristics-High Speed LANs
: Fast Ethernet, Gigabit Ethernet and FDDI
MODULE : 2 6 15
Switched LANs : Basics and Advanced Features- Wireless

Transmission : Wireless Media, Wireless Systems, Spread
Spectrum Technology, WLANs
FIRST INTERNAL TEST
MODULE : 3 6 15
Addressing in TCP/IP Networks : Address Types, IP Address

Format (IPV4 and IPV6), Address Assignment, ARP, DNS, DHCP -
Internet Protocol - Packet Format, Routing, IPV6
MODULE : 4 7 15
TCP/IP Protocol Stack : TCP and UDP , Routing Protocols, ICMP -

Advanced Features of IP Routers : Filtering, IP QoS, NAT,
Routers - Wide Area Networks : Virtual Circuit Techniques, X.25,
Frame Relay Networks , ATM Technology – IP WANs : Pure IP
WANs, IP over ATM, Multiprotocol Label Switching, Network
Management
MODULE : 5 7 20
Congestion and Traffic Management : Congestion Control in

Data Networks and Internets, Link Level Flow and Error
Control, TCP Traffic Control, Traffic and Congestion Control in
ATM Network. Secure Transport Services : IPSec Protected
Channel Service, VPN Service, MPLS VPN.
MODULE : 6 7 20
Multimedia Networking : Audio and Video Compression

Techniques (Entropy encoding, JPEG Image Compression, MPEG
Video Compression), Streaming Stored Audio and Video,
Protocol for Real time Interactive Application, Integrated
Services, RSVP, Differentiated Services.
COURSE NO: 02CS6442.4 COURSE TITLE: INFORMATION RETRIEVAL
Pre-requisites: Nil
Course Objectives:
 To understand the principles and techniques of information retrieval
Syllabus
Goals and history of IR; Impact of web on IR; Role of Artificial Intelligence in IR;
Basic IR models; Basic tokenizing indexing; Implementation of vector space retrieval;
Experimental evaluation of IR; Query operations and languages; Metadata and markup
languages; Web search engines; Text categorization and clustering; Clustering algorithms;
Applications to information filtering, organization, and relevance feedback; Recommender
systems; Information extraction and integration.
Course Outcome:
 Students gain in-depth theoretical and practical knowledge of information retrieval

techniques and ability to apply them in practical scenarios.
References:
1. Manning, Raghavan, and Schutze, Introduction to Information Retrieval, Cambridge

University Press, 2008.
2. R. Baeza-Yates, B. Ribeiro-Neto, “Modern Information Retrieval: The Concepts and
Technology behind Search”, Pearson Education India, 1/e, 2009.
COURSE PLAN
COURSE NO: 02CS6142.4 COURSE TITLE: Information Retrieval
hours Marks;%
MODULE : 1 7 15
Introduction: Goals and history of IR. The impact of the web on

IR. The role of artificial intelligence (AI) in IR. Basic IR Models:
Boolean and vector-space retrieval models; ranked retrieval;
text-similarity metrics; TF-IDF (term frequency/inverse
document frequency) weighting; cosine similarity.
MODULE : 2 7 15
Basic Tokenizing Indexing, and Implementation of Vector-Space

Retrieval: Simple tokenizing, stop-word removal, and stemming;
inverted indices; efficient processing with sparse vectors;
python implementation.
FIRST INTERNAL TEST
MODULE : 3 6 15
Experimental Evaluation of IR: Performance metrics: recall,

precision, and F-measure; Evaluations on benchmark text
collections. Query Operations and Languages: Relevance
feedback; Query expansion; Query languages.
MODULE : 4 7 15
Text Representation: Word statistics; Zipf's law; Porter

stemmer; morphology; index term selection; using thesauri.
Metadata and markup languages (SGML, HTML, XML). Web
Search, Search engines; spidering; metacrawlers; directed
spidering; link analysis (e.g. hubs and authorities, Google
PageRank); shopping agents.

MODULE : 5 6 20
Text Categorization and Clustering: Categorization algorithms:

naive Bayes; decision trees; and nearest neighbor. Clustering
algorithms: agglomerative clustering; k-means; expectation
maximization (EM).
MODULE : 6 7 20
Applications to information filtering; organization; and

relevance feedback. Recommender Systems: Collaborative
filtering and content-based recommendation of documents and
products. Information Extraction and Integration: Extracting
data from text; XML; semantic web; collecting and integrating
specialized information on the web.
COURSE NO: 02CS6442.5 COURSE TITLE: ADVANCED OPERATING SYSTEMS
Pre-requisites: Nil
Course Objectives:
 To understand the configuration and functions of a typical OS Kernel
Syllabus
Introduction to Linux kernel; Linux versus Unix kernels; Process management;

Process scheduling – Linux’s process scheduler, Scheduling algorithms; System call
handling and implementation; Interrupts and interrupt handlers; Kernel synchronization;
Kernel synchronization methods; Timers and time management; Memory management;
Virtual file system; Block IO layer; Process address space; Devices and modules.
Course Outcome:
 In-depth knowledge in Design and implementation of Kernel modules.
References:
1. Robert Love, “Linux Kernel Development”, 3/e, Addison-Wesley, 2010.

2. Daniel Bovet, Marco Cesati, “Understanding the Linux Kernel”, 3/e, OReilly Media Inc.,
2005.
3. Reilly Christian Benvenuti, “Understanding Linux Network Internals”, 1/e, OReilly Media
Inc.,2005.
4. Jonathan Corbet, Alessandro Rubini, Greg Kroah-Hartman, “Linux Device Drivers”, 3/e,
OReilly Media Inc., 2005.
COURSE PLAN
COURSE NO: 02CS6442.5 COURSE TITLE: Advanced Operating System
Design

hours
Marks;%
MODULE : 1 6 15
Overview of basic concepts. Introduction to the Linux Kernel -

History of Unix, Introduction to Linux, Overview of Operating
Systems and Kernels, Linux Versus Classic Unix Kernels, Linux
Kernel Versions.
MODULE : 2 7 15
Process Management - Process Descriptor and the Task

Structure, Process Creation, The Linux Implementation of
Threads, Process Termination. Process Scheduling - Linux’s
Process Scheduler, Policy, Linux Scheduling Algorithm,
Preemption and Context Switching, Real-Time Scheduling
Policies.System Calls - Communicating with the Kernel, Syscalls,
System Call Handler, System Call Implementation.
FIRST INTERNAL TEST
MODULE : 3 7 15
Interrupts and Interrupt Handlers - Registering an Interrupt

Handler, Writing an Interrupt Handler, Interrupt Context,
Interrupt Control, Bottom Halves – Task Queues, Softirqs,
Tasklets, Work Queues.
MODULE : 4 7 15
Kernel Synchronization – Introduction, Critical Regions and

Race Conditions, Locking, Deadlocks, Contention and Scalability.
Kernel Synchronization Methods – Atomic Operations, Spin
Locks, Semaphores, Mutexes, Completion Variables, BKL: The
Big Kernel Lock, Sequential Locks, Preemption Disabling.
Timers and Time Management - Kernel Notion of Time, Jiffies,
Hardware Clocks and Timers, Using Timers, Delaying Execution.
MODULE : 5 6 20
Memory Management - Pages and Zones, Slab Layer, Static

Allocation on the Stack, High Memory Mappings, Per-CPU
Allocations. The Virtual Filesystem - Filesystem Abstraction
Layer, Unix Filesystems, VFS Objects and Data Structures,
Superblock Object, Inode Object, Dentry Object, File Object.
MODULE : 6 7 20
The Block I/O Layer - Buffers and Buffer Heads, Request

Queues, I/O Schedulers. Process Address Space - Address
Spaces, Memory Descriptor, Virtual Memory Areas, Page Tables.
Devices and Modules - Device Types, Modules, Device Model.
Course No: 02CS6452.1 Course Title: WAVELET TRANSFORMS:
THEORY AND APPLICATIONS
Credits: 3-0-0: 3 Year :2015
Pre-requisites: Know about Digital Image Processing and basic transformations.
Course Objectives
 To study the basics of signal representation and Fourier theory

 To understand Multi Resolution Analysis and Wavelet concepts
 To study the wavelet transform in both continuous and discrete domain
 To understand the design of wavelets using Lifting scheme
 To understand the applications of Wavelet transform
Syllabus
Limitations of Fourier transform in representing non-stationary signals are presented.

Continuous Wavelet Transform (CWT) is presented as a solution to this problem. As the
CWT is redundant in nature, Discrete Wavelet Transform (DWT) is introduced with the
benefit of its Multi- Resolution Analysis (MRA) feature. Alternative wavelet
representations such as Biorthogonal wavelets and Two dimensional Wavelets are
presented. The design of wavelets using Lifting scheme is introduced. Various
applications of Wavelet Transforms such as Image and Audio compression, De-noising
etc. are presented.
Course Outcome:
 Using the concepts, theory, and algorithms behind wavelets, students can apply this
interdisciplinary perspective in thesis works that unifies harmonic analysis
(mathematics), filter banks (signal processing), and multiresolution analysis
(computer vision).
 Able to master and solve the modern signal processing tools using signal spaces,
bases, operators and series expansions.
References
1.Insight into wavelets: From theory to Practice- K P Soman and K I Ramachandran,
Prentice Hall of India
2.Wavelet Transforms: Introduction to theory and applications- R M Rao and A S
Bopardikar, Pearson
COURSE PLAN
COURSE NO: 02CS6452.1 COURSE TITLE: WAVELET TRANSFORMS:

THEORY AND APPLICATIONS (L-T-P : 3-0-0)
CREDITS:3
hours Marks;%
MODULE : 1 15
Continuous Wavelet Transform[1],[2]: Continuous time

frequency representation of signals, The Windowed Fourier
Transform, Uncertainty Principle and time frequency tiling, 8
Wavelets, specifications, admissibility conditions, Continuous
wavelet transform, CWT as a correlation, CWT as an operator,
Inverse CWT.
MODULE : 2 15
Discrete wavelet Transform[1],[2]: Approximations of 6

vectors in nested linear vector spaces, Example of an MRA,
Formal definition of MRA, Construction of general orthonormal
MRA, a Wavelet basis for MRA.
FIRST INTERNAL TEST
MODULE : 3 15
Digital filtering interpretations[1],[2]- Decomposition and 7

Reconstruction filters, examples of orthogonal basis generating
wavelets, interpreting orthonormal MRA for Discrete time
signals, Mallat algorithm Filter bank implementation of DWT.
MODULE : 4 15
Alternative wavelet representations[1],[2]- Biorthogonal

Wavelets: biorthogonality in vector space, biorthogonal wavelet
8
bases, signal representation using biorthogonal wavelet system,
advantages of biorthogonal wavelets, biorthogonal analysis and
synthesis, Filter bank implementation
Two dimensional Wavelets, filter bank implementation of two

dimensional wavelet transform.
MODULE : 5 20
Lifting scheme[1],[2]: Wavelet Transform using polyphase 5

matrix factorization, Geometrical foundations of the lifting
scheme, Dealing with Signal Boundary
MODULE : 6 20
Applications[1],[2]: Image Compression: Wavelet Difference

Reduction Compression Algorithm, Denoising, speckle removal,
edge detection and object isolation, audio compression. 6
Course No: 02CS6452.2 Course Title: DATA COMPRESSION
Credits: 3-0-0: 3 Year :2015
Pre-requisites: Know about Digital Image Processing and basic transformations.
Course Objectives
 To provide students with contemporary knowledge in Data Compression and

Coding.
 To equip students with skills to analyze and evaluate different Data Compression
and Coding methods.
Syllabus
Introduction to Compression Techniques, Mathematical modeling for compression,

Different Methods of Compression Basic Techniques , Dictionary methods, Image, Video,
Audio Compression Techniques.
Course Outcome:
Upon the successful completion of this module a student should be able to:
 Explain the evolution and fundamental concepts of Data Compression and Coding
techniques.
 Analyze the operation of a range of commonly used Coding and Compression
techniques
 Identify the basic software and hardware tools used for data compression.
 Identify what new trends and what new possibilities of data compression are
available.
References:
1. “Data compression - The complete Reference”, David Salomon, Springer Publications

(4th Edition), 2006.
2. “The Data compression Book”, Mark Nelson and Jean-Loup Gailly, Mark Nelson and Jean-
Loup Gailly,
BPB publications (2nd Edition), 1995
3. “Introduction to Data Compression”, Khalid Sayood, Harcout India (P) Ltd, 2/e , New
Delhi, 2002.
COURSE PLAN
COURSE NO: 02CS6452.2 COURSE TITLE: DATA COMPRESSION
hours Marks;%
MODULE : 1 15
Introduction Compression Techniques - Lossy compression &

Lossless compression, Measure of performance modeling and
7
compression. Mathematical modeling for Lossless compression-
Mathematical preliminaries- Introduction to information theory,
Derivation of average information, Models- Physical models,
probability models, Markov Models and composite source
models, coding-Uniquely decodable codes, prefix codes, The
Kraft-McMillan Inequality, Algorithmic information theory,
Minimum Description Length principle.
MODULE : 2 15
Mathematical modeling for Lossy compression – Mathematical

preliminaries- Distortion Criteria, Information Theory, Rate 7
distortion Theory, Models- physical models, Probability models
and linear systems models.
Different Methods of Compression Basic Techniques: Run length

encoding, RLE Text compression, RLE image Compression and
scalar quantization. Statistical Methods: Information theory
concepts, Huffman coding, Adaptive Huffman coding, facsimile
compression Arithmetic coding and Adaptive, Arithmetic coding
and Text compression.
FIRST INTERNAL TEST
MODULE : 3 15
Dictionary methods: String compression, LZ 77, LZSS, LZ78,

LZW, Unix compression, GIF image, and Zip and Gzip, Data
compression patterns. Wavelet methods: Fourier Transform,
7
The Frequency Domain, The Uncertainty Principle, Fourier
Image compression, The CWT and its inverse, The Haar
Transform and its properties, Filter Banks, The DWT, Multi
Resolution decomposition and JPEG 2000.
MODULE : 4 15
Image Compression Intuitive Methods, Image Transforms,

Orthogonal Transforms, JPEG, Progressive Image compression,
Vector quantization, Adaptive Vector Quantization, Block
7
Matching, Block Truncation coding. Context Tree weighting,
Block Decomposition, Binary Tree predictive coding, Quad Trees
and Finite Automata Methods.
MODULE : 5 20
Video Compression, Analog Video, Composite and Components 6

Video, Digital Video, Video compression, MPEG and H.261
MODULE : 6 20
Audio Compression Sound, Digital Audio, The Human Auditory

System, μ -Law and A-Law companding, ADPCM Audio 6
compression and MPEPG-1 Audio Layers: Frequency Domain
Coding, Format of Compressed Data, Encoding layers I, II and III
.
COURSE NO: 02CS6452.3 COURSE TITLE: FUZZY SET THEORY AND
APPLICATIONS
Pre-requisites: Nil
Course Objectives:
 To understand Fuzzy Set Theory and the basis of fuzzy logic and fuzzy logic
applications such as fuzzy control and fuzzy decision making.
Syllabus
Crisp sets overview; Basic concepts of fuzzy sets; Fuzzy logic; Operations on fuzzy
sets; Crisp and fuzzy relations; Compatibility or tolerance relations; Membership functions;
Defuzzification methods; Fuzzy rule based systems; Fuzzy pattern recognition; Fuzzy
control systems.
Course Outcome:
The students who succeeded in this course should be:

 able to examine the Set Theory problems.
 able to interpret the systems which include fuzzines within the scope of fuzzy set
theory.
 able to combine the information of decision theory and the information of fuzzy set
theory.
 able to improve the proof techniques of Fuzzy Set Theory.
 able to solve problems that include uncertainty with using Fuzzy Set Theory
References:
1. George J Klir and Tina A Folger, “Fuzzy Sets, Uncertainty and Information”, Prentice Hall
of India, 1998.
2. H.J. Zimmerman, “Fuzzy Set Theory and its Applications”, 4/e, Kluwer Academic
Publishers, 2001.
3. George Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic: Theory and Applications”,
Prentice Hall of India, 1997.
4. Timothy J Ross, “Fuzzy Logic with Engineering Applications”, McGraw Hill International
Editions, 1997.
5. Hung Nguyen and Elbert Walker, “A First Course in Fuzzy Logic, 2/e,, Chapman and
Hall/CRC, 1999.
6. Jerry M Mendel, “Uncertain Rule-based Fuzzy Logic Systems: Introduction and New
Directions, PH PTR, 2000.
7. John Yen and Reza Lengari, “Fuzzy Logic: Intelligence, Control and Information”, Pearson
Education, 1999.
COURSE PLAN
COURSE NO: 02CS6452.3 COURSE TITLE: Fuzzy Set Theory and

Applications (L-T-P : 3-0-0) CREDITS:3
hours Marks;%
MODULE : 1 7 15
Introduction – crisp sets an overview – the notion of fuzzy sets –

Basic concepts of fuzzy sets – classical logic an overview – Fuzzy
logic. Operations on fuzzy sets - fuzzy complement – fuzzy union
– fuzzy intersection
MODULE : 2 6 15
Combinations of operations – general aggregation operations

Crisp and fuzzy relations – binary relations – binary relations on
a single set– equivalence and similarity relations.
FIRST INTERNAL TEST
MODULE : 3 6 15
Compatibility or tolerance relations– orderings – Membership

functions – methods of generation – defuzzification methods.
MODULE : 4 7 15
General discussion – belief and plausibility measures –

probability measures– possibility and necessity measures –
relationship among classes of fuzzy measures.
MODULE : 5 7 20
Classical logic: An overview – fuzzy logic – fuzzy rule based

systems – fuzzy decision making
MODULE : 6 7 20
Fuzzy logic in database and information systems – fuzzy pattern
recognition – fuzzy control systems.
COURSE NO: 02CS6452.4 COURSE TITLE: NETWORK SECURITY
Pre-requisites: Nil
Pre-requisites: Information Security
Course Objectives:
 To impart understanding of various hardware and software aspects of security in

networks.
Syllabus
Security trends, security attacks and security mechanisms; Network security model;
Review of intrusion detection systems; Review of cryptographic algorithms and protocols;
Kerberos v4; Kerberos v5; PKI; Real time communication security; IPSec; Email security;
PEM & S/ MIME; PGP; Web security; SSL/ TLS; Secure electronic transaction; Network
management security; Wireless security; Firewalls.
Course Outcome:
 The student gains knowledge in problems and approaches related to secure

network management.
References:
1. C. Kaufman, R. Perlman and M. Speciner, “Network Security: Private communication in a

public World”, 2/e, PHI, 2002.
2. W. Stallings, “Cryptography and Network Security Principles and practice”, 3/e, Pearson
Education Asia, 2003.
3. William Stallings, “Network Security Essentials”, 2e, Prentice Hall, 2003.
4. Schiller J., “Mobile Communications”, Pearson Education Asia,2/e, 2009.
5. Roberta Bragg et. al., “Network Security: The Complete Reference”, TMH, 2008.
COURSE PLAN
COURSE NO: 02CS6452.4 COURSE TITLE: Network Security
hours Marks;%
MODULE : 1 6 15
Introduction: Security trends, security attacks, security

mechanisms, Network Security model, Review of intrusion
detection systems. Review of cryptographic algorithms and
protocols: cryptanalysis, Message authentication, secure hash
functions, Digital signatures.
MODULE : 2 7 15
Standards: Kerberos v4 – configuration, authentication,

encryption, message formats. Kerberos v5 – cryptographic
algorithms, message formats. PKI – trust models, revocation.
Real-time communication security, IPSec overview, AH, ESP, IKE
– phases.
FIRST INTERNAL TEST
MODULE : 3 7 15
Email security, Security services for Email, establishing keys,

privacy, authentication, message integrity. PEM & S/MIME –
structure of messages, encryption, source authentication and
integrity protection, message formats. PGP encoding, anomalies,
object formats.
MODULE : 4 6 15
Web security: Web security considerations, SSL/TLS – attacks,

exportability, encoding. Secure electronic transaction.
MODULE : 5 7 20
Network management security: SNMP, Basic concepts of

SNMPv1, SNMPv3. Wireless security: Wireless LAN
Specifications, Wireless network security stack, WEP.
MODULE : 6 7 20
Firewalls: Firewall design principles, trusted systems, packet

filters, application level gateways, encrypted tunnels.
COURSE NO: 02CS6452.5 COURSE TITLE: ADVANCED Database Technology
Pre-requisites: Nil
Course Objectives:
 To understand the implementation and management aspects of databases.

 To understand the principles of distributed databases.
 To understand object based data models and their implementation.
 To understand the recent advances in database technology.
Syllabus
Query processing algorithms; Transaction management; Concurrency control;

Deadlocks; Database security and access control; Database system architectures; Parallel
systems; IO parallelism; Distributed database; Distributed transactions; Distributed query
processing; Concepts of object databases; Semi-structured data and XML databases;
Temporal databases; Multimedia databases; Mobile data management.
Course Outcome:
 Conceptual understanding of various implementation issues in databases.

 Conceptual understanding of distributed databases.
 Conceptual understanding and ability to work with object based database systems.
 Conceptual understanding of recent technological trends in databases.
References:
1. R. Elmasri, S.B. Navathe, “Fundamentals of Database Systems”, 5/e, Pearson

Education/Addison Wesley, 2011
2. Patrick O'Neil , Elizabeth O'Neil , “Database: Principles, Programming and
Performance”, 2/e, Morgan Kaufmann, 2011
3. Thomas Cannolly and Carolyn Begg, “Database Systems, A Practical Approach to Design,
Implementation and Management”, 3/e, Pearson Education, 2010.
4. Henry F Korth, Abraham Silberschatz, S. Sudharshan, “Database System Concepts”, 5/e,
Tata McGraw Hill, 2006.
5. C.J. Date, A.Kannan and S. Swamynathan,”An Introduction to Database Systems”, 8/e,
Pearson Education India, 2006.
6. Joe Fawcett, Danny Ayers , Liam R. E. Quin, Beginning XML, 5/e, John Wiley & Sons,
2012
7. Grigoris Antoniou. Frank van Harmelen, “A Semantic Web Primer”, The MIT Press,
Cambridge, Massachusetts, 2003
8. Jules J. Berman, “Principles of Big Data: Preparing, Sharing and Analyzing Complex
Information”, Morgan Kufmann, 2013.
9. Pete Warden, “Big Data Glossary”, O’Reilly Media Inc, 2011
COURSE PLAN
COURSE NO: 02CS6452.5 COURSE TITLE: Advanced Database

Technology (L-T-P : 3-0-0) CREDITS:3
hours Marks;%
MODULE : 1 15
Query Processing Algorithms – Query Optimization Techniques

– Transaction Management: Transaction Processing Concepts -
Concurrency Control – Deadlocks – Recovery Techniques.
MODULE : 2 15
Database Security: threats to databases, control measures,

database security and DBA, Discretionary access control,
Mandatory access control (role-based only), SQL injection.
Database System Architectures: Centralized and Client-Server

Architectures – Server System Architectures.
FIRST INTERNAL TEST
MODULE : 3 15
Parallel Systems- Distributed Systems – Parallel Databases: I/O

Parallelism – Inter and Intra Query Parallelism – Inter and Intra
operation Parallelism – Distributed Database – Functions –
Distributed RDB design- Transparency– Distributed
Transactions - Commit Protocols – Concurrency Control –
Deadlocks – Recovery - Distributed Query Processing.
MODULE : 4 15
Concepts for Object Databases: Object Identity – Object

structure – Type Constructors – Encapsulation of Operations –
Methods – Persistence – Type and Class Hierarchies –
Inheritance – Complex Objects, ODMG, ODL, OQL, basic OQL
queries. Object Relational Systems – Case studies: Oracle and
Informix.
MODULE : 5 20
Semi-structured Data and XML Databases: XML Data Model –

DTD – XPath and XQuery – Example Queries. Storing, RDF
(Fundamental Concepts only). Temporal Databases – Time in
Databases, Spatial and geographical data management:
geographical data, representation, spatial queries, indexing
spatial data, k-d trees, quad trees and R-trees
MODULE : 6 20
Multimedia Databases: data formats, continuous media data,

similarity-based retrieval, Mobile data management: Mobile
computing architecture – data management issues - location-
based services – peer-to-peer systems and applications –
application platforms.
SEMESTER III
COURSE NO: 02CS7411.1 COURSE TITLE: BIOINFORMATICS
Pre-requisites: Nil
Objective:
To give the students an introduction to bio-informatics and various concepts related to bio-
informatics such as search engines, data visualization, pattern matching etc.. To build
efficient solutions to problems like sequence alignment and to introduce the process of
drug discovery.
Syllabus:
Introduction to Molecular biology, Gene structure and information content, Molecular
biology tools, Algorithms for sequence alignment, Sequence databases and tools. Molecular
Phylogenetics, Phylogenetic trees, Algorithms for Phylogenetic tree construction,
Introduction to Perl programming for Bioinformatics.Introduction to Protein structure,
Algorithms for Protein structure prediction, Gene expression analysis, Micro Arrays,
Pathway analysis. Pattern Matching algorithms, Bio-data analysis, Data Mining in
Bioinformatics, Algorithms and data structures for efficient analysis of biological data, Drug
Discovery.
Course Outcomes:
This course empowers students with problem analysis skills, imbibes an interest in
investigation of bioinformatics problems, and students also gain expertise in programming
to solve bioinformatics problems.
References
1.Bryan Bergeron, Bio Informatics Computing, Second Edition, Pearson Education, 2003.
2.D. E. Krane and M. L. Raymer, Fundamental Concepts of Bioinformatics, Pearson Education,
2003.
3.T. K. Attwood and D. J. Parry-Smith, Introduction to Bioinformatics, Pearson Education,
2003.
4.J. H. Zar, Biostatistical Analysis, 4/e, Pearson Education, 1999.
COURSE PLAN
COURSE NO: 02CS 7411.1 COURSE TITLE: BIOINFORMATICS

hours Marks;%
7 15
MODULE : 1
Introduction to molecular biology , Gene structure and
information content, Molecular biology tools , Algorithms for
sequence alignment, Sequence databases and tools.
7 15
MODULE : 2
Phylogenetic trees (6 hours), Molecular Phylogenetics,
Phylogenetic trees, Algorithms for Phylogenetic tree construction.
FIRST INTERNAL TEST

MODULE : 3 7 15
Randomized algorithms (6 hours), Introduction to Perl
programming for Bioinformatics, Introduction to Protein
structure, Algorithms for Protein structure prediction
MODULE : 4 6 15
Micro Arrays Gene expression analysis, Micro Arrays, Pathway
analysis.
,Pattern Matching algorithms

6 20
MODULE : 5
Bio-data analysis, Data Mining in Bioinformatics, Algorithms and
data structures for efficient analysis of biological data.
7 20
MODULE : 6
Drug Discovery – components, Perspectives, Numeric
considerations, Algorithms, Heuristic methods, Systems Biology
Tools
COURSE NO: 02CS7411.2 COURSE TITLE: AD-hoc SESOR NETWORKS
Pre-requisites: Nil
Course Objectives:
 The primary objective of this course is to introduce to the area of wireless sensor
networks and learn the concepts and principles behind WSN.
 To learn WSN network design, sensor node embedded system design and
implementation.
 On WSN network management, the focus is mainly on wireless network security
which is a very important issue in WSN.
Syllabus
Fundamentals of wireless communication technology; Introduction to ad hoc/

sensor networks; Advantages of ad hoc/ sensor networks; Issues in ad hoc wireless
networks; Issues in the design of sensor networks; Sensor network architecture; MAC
protocols; Routing Protocols; QoS and energy management
Course Outcome:
 After passing the course, a student comprehends the Wireless Sensor Networks
(WSN) as a new technology area in research and industry.
 A student is familiar with the main standards and specifications of WSNs and
identifies the key building blocks for them.
 A student can define and explain the essential challenges of resource constrained
WSN design and implementation, including applications, interfaces, energy-efficient
protocols and platform functionalities.
 A student can apply both theoretical and practical tools for WSN design and
utilization and design potential application scenarios for WSNs.
References:
1. C. Siva Ram Murthy, B. S. Manoj, "AdHoc Wireless Networks ", Pearson Education, 2008.
2. Feng Zhao, Leonides Guibas, "Wireless Sensor Networks ", Elsevier, 2004.
3. Jochen Schiller, "Mobile Communications ", 2/e, Pearson Education, 2003.
4. William Stallings, "Wireless Communications and Networks ", Pearson Education, 2004.
COURSE PLAN
COURSE NO: 02CS7411.2 COURSE TITLE: Ad Hoc and Sensor Networks

hours Marks;%
MODULE : 1 7 15
Introduction : Fundamentals of wireless communication

technology, the electro magnetic spectrum radio propagation,
characteristics of wireless channels, modulation
techniques,multiple access techniques, wireless LANs, PANs,
WANs, and MANs, Wireless Internet.
MODULE : 2 7 15
Introduction to adhoc/sensor networks: Key definitions of

adhoc/ sensor networks, unique constraints and challenges,
advantages of ad-hoc/sensor network, driving applications,
issues in adhoc wirelesss networks, issues in design of sensor
network, sensor network archeitecture, data dissemination and
gathering.
FIRST INTERNAL TEST
MODULE : 3 7 15
MAC Protocols : Issues in desiging MAC protocols for adhoc

wireless networks, design goals, classification of MAC protocols,
MAC protocols for sensor network, location discovery, quality,
other issues, S-MAC, IEEE 802.15.4.
MODULE : 4 7 15
Routing Protocols : Issues in designing a routing protocol,

classification of routing protocols, table-driven, on-demand,
hybrid, flooding, hierarchical, and power aware routing
protocols.
MODULE : 5 6 20
QoS and Energy Management : Issues and Challenges in

providing QoS,
classifications, MAC, network layer solutions
MODULE : 6 6 20
QoS frameworks, need for energy management, classification,

battery, transmission power, and system power management
schemes.
Course No: 02CS7411.3 Course Title: DIGITAL VIDEO PROCESSING
Credits: 3-0-0: 3 Year :2015
Pre-requisites: Know about Digital Image Processing and computer vision.
Course Objectives
 Study the fundamental algorithms for pattern recognition

 To instigate the various classification techniques
 To originate the various structural pattern recognition and feature extraction
techniques.
Syllabus:
Introduction to video processing, Motion estimation, Basic of video coding, Content

dependant video coding, Scalable video coding
Course Outcome:
This course provides an introduction to principles of digital video processing. After passing
this course, participants should be able to use video filters, and basic algorithms for video
compression. Homework exercises will help students to gain hands-on experience which
leads to a research work in this area.
References:
1. Yao Wang, Jorn Ostermann, Ya-Qin Zhang, ‘Video Processing and Communications’,
Prentice Hall, 2002
2. Alan C. Bovik, ‘The Essential Guide to Video Processing’, Elsevier Science, edition 2,
2009
3. A. Murat Tekalp, ‘Digital Video Processing’, Prentice Hall, edition 1, 1996
4. Jens R. Ohm, ‘Multimedia Communication Technology: Representation,
Transmission and Identification of Multimedia Signals , Springer, 2004
5. M. E. Al-Mualla, C. N. Canagarajah and D. R. Bull, “Video Coding for Mobile
Communications: Efficiency, Complexity and Resilience”, Elsevier Science,
Academic Press, 2002.
COURSE PLAN
COURSE NO: 02CS7411.3 COURSE TITLE: DIGITAL VIDEO PROCESSING
hours Marks;%
MODULE : 1 15
Introduction to video processing: Principles of colour video 6

processing, Video display, Composite versus component video,
Progressive and interlaced scan, Sampling of video signals.
MODULE : 2 15
Motion estimation: Two dimensional, Optical flow , General

methodologies, Pixel based motion estimation , Block matching 7
algorithm, Deformable block matching algorithm, Mesh based
motion estimation, Global motion estimation, Region based
motion estimation, Multiresolution motion estimation, Three
dimensional, Feature based Motion Estimation, Direct motion
Estimation
FIRST INTERNAL TEST
MODULE : 3 15
Basic of video coding- Categorization of video coding schemes,

Information Theory for source coding, Binary encoding, Scalar
quantization, Vector quantization, Wave form based coding,
7
Block-based transform coding, Predictive coding, Temporal
prediction and transform coding
MODULE : 4 15
Content dependent video coding- Two dimensional shape

coding, Texture coding for arbitrarily shaped region, Joint shape
and texture coding, Region based video coding, Object based 7
video coding, Knowledge based video coding, Semantic video
coding, Layered coding system
MODULE : 5 20
Scalable video coding-Basic modes of scalability, Object based

scalability, Wavelet transform based coding, Application of 6
motion estimator in video coding.
MODULE : 6 20
Stereo and multi view sequence processing- Depth perception,

Stereo imaging principle, Disparity estimation, Intermediate 6
view synthesis, Stereo sequence coding
COURSE NO: 02CS7411.4 COURSE TITLE: CLOUD COMPUTING
Pre-requisites: Nil
Course Objectives:
 Understanding cloud computing, and compare with existing technologies.

 Understand how to develop a cloud service
Syllabus
Cloud computing; Cloud architecture; Cloud storage; Advantages and disadvantages

of cloud computing; Cloud service development; Centralizing email communications; Cloud
computing for the corporation; Schedules and task management; Collaborating on event
management, project management, and contact management; Collaborating on databases;
Collaborating on web-based communication tools; Evaluation of web conference tools;
Collaborating via blogs and wikis.
Course Outcome:
 Design and develop cloud services for everyone.

 Use Cloud Service and collaborate it with various applications and taking it online.
References:
1. Dan C. Marinescu , Cloud computing: Theory and Practice, Morgan Kaufmann, 2013
2. Kai Hwang, Geoffrey C. Fox, Jack J. Dongarra, Distributed and Cloud Computing,: From
Parallel Processing to the Internet of Things, 1/e, Morgan Kaufmann , 2011
3. Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You
Work and Collaborate Online, Que Publishing, 2008.
4. Haley Beard, Cloud Computing Best Practices for Managing and Measuring Processes for
Ondemand Computing, Applications and Data Centers in the Cloud with SLAs, Emereo Pty
Limited, 2008.
COURSE PLAN
COURSE NO: 02CS7411.4 COURSE TITLE: Cloud Computing

hours Marks;%
MODULE : 1 6 15
Cloud Computing – History of Cloud Computing – Cloud

Architecture – Cloud Storage – Why Cloud Computing Matters –
Advantages of Cloud Computing – Disadvantages of Cloud
Computing – Companies in the Cloud Today
MODULE : 2 7 15
Cloud Services Web-Based Application – Pros and Cons of Cloud

Service Development – Types of Cloud Service Development –
Software as a Service – Platform as a Service – Web Services –
On-Demand Computing – Discovering Cloud Services
Development Services and Tools – Amazon Ec2 – Google App
Engine – IBM Clouds.
FIRST INTERNAL TEST
MODULE : 3 7 15
Centralizing Email Communications – Collaborating on

Schedules – Collaborating on To-Do Lists – Collaborating
Contact Lists – Cloud Computing for the Community –
Collaborating on Group Projects and Events – Cloud Computing
for the Corporation.
MODULE : 4 6 15
Collaborating on Calendars, Schedules and Task Management –

Exploring Online Scheduling Applications – Exploring Online
Planning and Task Management

MODULE : 5 7 20
Collaborating on Event Management – Collaborating on Contact

Management – Collaborating on Project Management –
Collaborating on Word Processing - Collaborating on Databases
– Storing and Sharing Files.
MODULE : 6 7 20
Collaborating via Web-Based Communication Tools – Evaluating

Web Mail Services – Evaluating Web Conference Tools –
Collaborating via Social Networks and Groupware –
Collaborating via Blogs and Wikis.
COURSE NO: 02CS7411.5 COURSE TITLE: ADVANCED COMPUTER
ARCHETECTURE
Pre-requisites: Nil
Course Objectives:
 To understand issues and techniques in improving performance of processors

 To understand the concepts of pipelining.
 Familiarize with the properties of superscalar processors.
 To understand the multiprocessor systems and cache coherence.
Syllabus
Classes of parallelism and parallel architecture; Computer architecture; Data
dependencies and hazards; Instruction level parallelism; Dynamic scheduling; Data level
parallelism; Vector architecture; Graphics Processing Unit; Multiprocessor system
interconnects; Cache coherence.
Course Outcome:
In-depth knowledge in:
 Measuring performance of processors
 Instruction level parallelism
 Vector Architecture
 Multiprocessor systems and cache coherence.
 Interconnection networks
References:
1. Hennessy J. L., D. Patterson, “Computer Architecture – A quantitative Approach”, 5/e,
Morgan Kauffman 2012.
2. Dezso Sima, Terence Fountain, Peter Kacsuk, “Advanced Computer Architectures – A
Design Space Approach”, Pearson Education India, 2009.
3. Kai Hwang, “Advanced Computer Architecture Parallelism, Scalability, Programmability”,
Tata McGraw Hill, 2003.
4. John Paul Shen, Mikko Lipasti, “Modern Processor Design – Fundamentals of Superscalar
Processors”, McGraw Hill International Edition, 2005.
5. The World Wide Web (WWW) Computer Architecture page.
http://www.cs.wisc.edu/arch.
COURSE PLAN
COURSE NO: 02CS7411.5 COURSE TITLE: Advanced Computer
Architecture (L-T-P : 3-0-0) CREDITS:3
Hours Marks;%
MODULE : 1 7 15
Classes of parallelism and parallel architecture, computer

architecture- design issues, Performance measurements,
quantitative principles of computer design
MODULE : 2 6 15
Instruction level parallelism –concepts and challenges, Data

dependencies and hazards, Basic compiler techniques for
exposing ILP.
FIRST INTERNAL TEST
MODULE : 3 7 15
Dynamic Scheduling- Tomasulo's approach, Hardware based

speculation, ILP using multiple issue and static scheduling, ILP
using dynamic scheduling, multiple issue and speculation, case
study- Intel Core i7.
MODULE : 4 6 15
Data level parallelism-Vector architecture-Vector instruction

types, Vector-Access memory schemes , Graphic processing
units
MODULE : 5 7 20
Multiprocessor system interconnects-hierarchical bus system,

Cross bar switch and multiport memory, multistage networks,
Centralized shared memory architecture
MODULE : 6 7 20
Multiprocessor cache coherence, Schemes for enforcing

coherence - Snooping protocol, Limitations, Distributed shared
memory and Directory based coherence.
Course No: 02CS7421.1 Course Title: Document Image Processing
Credits: 3-0-0: 3 Year: 2015
Pre-requisites: Students should have basic knowledge in Image Processing, Pattern

Classification, Data-mining and soft Computing Techniques.
Course Objectives:
• A foundation in the fundamentals of document Image Processing

• Clear demonstration on different steps in Character recognition systems
• Overview of different application areas of Document Processing
Syllabus
Introduction: Character Recognition, Evolution and Development, Tools for Pre-processing,

Feature Extraction, Selection and Creation, Pattern classification methods, Word and String
Recognition, Applications of Document Processing
Course Outcome:
in different aspects and application areas of Document Image Processing; can
effectively and efficiently utilize the knowledge gained in one of the application
areas in document processing for the final thesis work.
Text Books:
1. Character Recognition Systems: A Guide for Students and Practitioners

Cheriet,Kharma,Chen-Lin Liu,Ching Y.Suen.Wiley-InterScience
References:
1. Feature Extraction Approaches for Optical Character

Recognition:Yampolskiy,Briviba Scientific Press
2. Knowlegede based Intelligent techniques in Character Recognition

Jain,Lazerrini,CRC Press
3. Hand written character Recognition :A Mile Stone to achieve:Bahatil,Lambert

Academic Publication
COURSE PLAN
COURSE NO: 02CS7421.1 COURSE TITLE: DOCUMENT IMAGE PROCESSING
hours Marks;%
MODULE : 1 6 15
Introduction: Character Recognition, Evolution and

Development
Generation and Recognition of Characters, History Of OCR,

Development of New Techniques, Recent trends and
Movements.
MODULE : 2 6 15
Tools for Pre-processing
Generic form Processing system, A stroke model for complex

background elimination, A scale-space Approach for Visual Data
Extraction, Data Pre-processing.
FIRST INTERNAL TEST
MODULE : 3 8 15
Feature Extraction, Selection and Creation
Feature extraction: Moments, histogram, direction features,

Image registration, Hough Transform, line based
Representation, Fourier Descriptors, Shape approximation,
topological features, linear transforms , kernels Feature
selection for pattern classification, feature creation for pattern
classification
MODULE : 4 6 15
Pattern classification methods:

Overview of classification methods, Statistical methods,
Artificial neural networks, Support Vector machines, Structural
Pattern Recognition, Combining multiple Classifiers
MODULE : 5 8 20
Word and String Recognition:
Introduction, Character Segmentation, Classification based

String Recognition, HMM-based Recognition, HMM Based
recognition, Holistic methods for Handwritten word
Recognition.
MODULE : 6 6 20
Applications of Document Processing:
An Overview in Text mining , Degraded Document Analysis:

Hyper spectral and multi spectral Image analysis, Hand written
character Recognition, Signature verification ,writer
Identification, Form, check, postal address processing, Logo and
stamp identification, Map drawing and diagram analysis,
Chemical mathematical formula and table identification
COURSE NO: 02CS7421.2 COURSE TITLE: Image Forensics and Security
Pre-requisites: Nil
Course Objectives: To impart sufficient knowledge about the fundamental principles of

IPR, various types of cyber-crimes and indian and international cyber laws.
Syllabus
Intellectual property rights; Computer software copyrights; Copyrights in electronic

publishing and databases; Laws of confidence; trademarks; product designs; patent laws;
Computer contracts; Computer crimes; Cyber laws in India; International cyber laws and
crimes; Ethical issues in computer security; Case studies.
Course Outcome: Discuss about ethical issues, cyber-crimes and cyber laws.
References:
1. D. Bainbridge, Introduction to Computer Law, 5/e, Pearson Education, 2004.
2. Harish Chander, Cyber Laws and IT Protection, PHI Learning Private Limited, 2012.
3. P. Duggal, Cyber law: the Indian Perspective, Saakshar Law Publications, Delhi, 2005.
4. C. P. Fleeger and S. L. Fleeger, Security in Computing, 3/e, Pearson Education, 2003.

COURSE PLAN
COURSE NO: 02CS7421.2 COURSE TITLE: Image Forensics and Security


hours Marks;%
MODULE : 1 7 15
Intellectual property rights, computer software copyrights, copyright in

databases and electronic publishing, law of confidence, patent laws,
trademarks, product designs, international law .
MODULE : 2 7 15
Computer contracts, liability for defective hardware and software,

software contracts, web and hardware contracts, electronic contracts
and torts, liabilities.
FIRST INTERNAL TEST

MODULE : 3 6 15
Computer crime, computer fraud, hacking
MODULE : 4 6 15
Unauthorized modification of information, piracy, computer pornography

and harassment.

MODULE : 5 7 20
Cyber laws in India, IT Act 2000, Offences under IT act. Protection pf IPR
in Cyber space in India.
MODULE : 6 7 20
International cyber laws and crimes, COE convention of cyber crimes.

data subjects’ rights, ethical issues in computer security, case studies.
Course No: 02CS7421.3 Course Title: Geographical Information Systems and its
applications Credits: 3-0-0: 3 Year: 2015

Classification, Data-mining and soft Computing Techniques.
Course Objectives:
• A foundation in the fundamentals of Remote sensing and geographical information

systems
• Clear demonstration on different modules in satellite image processing
• Overview of current areas in remote sensing image analysis
Syllabus
Sources and Characteristics of remote sensing Image Data, Correcting and registering
Images, Interpreting Images, Radiometric enhancement of Images, Spectral and Image
Domain Transforms, Classification and clustering.
Course Outcome:
in different aspects and application areas of Geographic Information Systems and
Satellite Image Processing; can effectively and efficiently utilize the knowledge
gained in one of the current research areas in Geographical information processing
for the final thesis work.
Text Books:
Remote sensing digital Image analysis, John A Richards , Springer ,Fifth edition
References:
1. Remote sensing and Image interpretation, Lilie Sand ,Kierfer, ChipMan Wiley
publication, Sixth Edition.
2. Geographic information Analysis, Sullivan and Unwin,Wiley & sons Publication,

second edition.
3. Remote Sensing Of Vegetation, Principles, Techniques and applications, Jones &

Vaugham, Oxford University Press
COURSE PLAN
COURSE NO: 02CS7421.3 COURSE TITLE: GEOGRAPHICAL INFORMATION

SYSTEM AND ITS APPLICATIONS (L-T-P : 3-0-0) CREDITS:3
hours Marks;%
MODULE : 1 15
Sources and Characteristics of remote sensing Image Data:
Energy sources and wavelength ranges, remote sensing 6

platform, primary data characteristics, data sources in general
and geographic information systems, scale in digital image data,
measured earth surface properties
MODULE : 2 15
Correcting and registering Images:
Sources of Radiometric distortion, Instrumentation errors, 6
Effect of solar radiation curve and atmosphere on radiometry,

compensating on solar radiation curve, correcting atmospheric
effect in broad band and narrow band images, empirical and
data driven approaches in atmospheric correction, Sources of
geometrical distortion geometrical distortion due to
instrumental characteristics, Correction of distortion and its
mathematical representation, Image to Image registration
FIRST INTERNAL TEST
MODULE : 3 15
Interpreting Images:
Introduction, Photointepretation, Quantitative analysis: 6
Fundamentals, Sub classes and Spectral classes, Comparison of

Quantitative analysis and Photointepretation
MODULE : 4 8 15
Radiometric enhancement of Images:
Introduction, image histogram, contrast modification, histogram

equalization, matching, density slicing, Neighbour-hood
operations in image filtering, Image smoothening, sharpening
and edge detection, line and spot detection, morphological
analysis, Thinning and linking, morphological analysis, shape
Recognition
MODULE : 5 20
Spectral and Image Domain Transforms:
Image Arithmetic and vegetation indices, Principal Components 8
transform, Principal component transform in change detection,

noise adjusted Principal component transform, Kernel Principal
components transform, Kauth-Thomas tasseled cap transform,
Pan sharpening, Fourier transform, wavelet transform
MODULE : 6 20
Classification and clustering:
Maximum likelihood, Gaussian mixture models, minimum 6
distance classification, parallelepiped classification,

Mahalanobis classification, on parametric classification, table
look-up classification, ANN, SVM, Context classification
COURSE NO: 02CS7421.4 Course Title: Content Based Image and Video
Retrieval Credits: 3-0-0: 3 Year :2015
Pre-requisites: Image Processing
Course Objectives:
To facilitate easy understanding of basic concept in image and video retrieval system.
Syllabus:
Fundamentals of Image and video retrieval, Designing Content based Image Retrieval Systems,
A survey of Content Based Image Retrieval Systems, Advanced Content Based Image Retrieval
Systems, RF MODE, Image Content Analysis and Description.
Course Outcome:
Amelioration of advanced algorithms and concepts related to Image and Video Retrieval Systems
Text Books:
1. Content Based Image and Video Retrieval systems, Oge Marques, Borko Furht, Springer
2002
2. State Of art in content Based Image and video retrieval, Remco C VelCamp,
Hanshardt,Hans Peter Kriegel,Springer 2001 Edition
References:
1. Content Based Image retrieval fundamentals and Algorithms: Channamullu Srinivasa Rao,
Samayamatulla Srininivasa Rao, July 19,2012
2. Compact Composite Descriptors for Content Based Image Retrieval Systems : Savvas A.
Chatzichristofis and Yiannis S. Boutalis, VDM Verlag, August 2011
COURSE PLAN
COURSE NO: 02CS7421.4 COURSE TITLE: Content Based Image and Video
Retrieval (L-T-P : 3-0-0) CREDITS:3
hours Marks;%
MODULE : 1 6 15
Introduction, Basic concepts, CBIVR system Architecture, Users

Perspective
MODULE : 2 6 15
Video Parsing, Video Abstraction and summarization, Video content

representation, indexing and retrieval, video browsing schemes, Examples
of video retrieval systems
FIRST INTERNAL TEST
MODULE : 3 6 15
ADL, AMORE, ASSERT, BDLP, Blobword, CANDID, Cbird, CBVQ,

Chabot, CHROMA, FIDS, FIR,JACOB, ImageRover, ImageScape, LCPD,
MARS.
MODULE : 4 6 15
MIR, NETRA, Photobook, Picasso, PicHunter, PicSOM, PicToSeek,

QBIC,QuickLook2, Shoebox, SIMBA, SMURF, TODAI, VisualSEEK,
Webseek, WebSeer, WISE
MODULE : 5 8 20
RF Mode:-Features and Probabilistic model, RFC Mode:-Features,

clustering, learning, Testing RFC Mode.
MODULE : 6 8 20
Features in content based retrieval system: A survey, Local features for

Image retrieval, Fast invariant feature extraction,fast invariant features.
Course No:02CS7421.5 Course Title: MEDICAL IMAGE ANALYSIS TECHNIQUES
Credits: 3-0-0: 3 Year: 2015

Classification, Data-mining
Course Objectives:
The course will provide the participants with an up-to-date background in current state-of the-art
in medical imaging and medical image analysis. The aim of the course is to show how to extract,
model, and analyze information from medical data and applications in order to help diagnosis,
treatment and monitoring of diseases through computer science.
Syllabus
course on medical imaging and medical image analysis. The course includes topics in medical image
formation, medical imaging techniques, such as X-Ray, Computed Tomography, Magnetic
Resonance Imaging, and Nuclear Imaging, image segmentation, registration, statistical modeling,
visualization, and applications of computational tools for medicine.
Course Outcome:
in different aspects and application areas of Medical Image Processing; can
effectively and efficiently utilize the knowledge gained in one of the current
research areas in medical image information processing for the final thesis work.
Reference
1. Bankman I.N. “Hand book of Medical Imaging-Processing and Analysis”, Academic
Press
2. Jiri Jan, “Medical Image Processing, Reconstruction and Restoration- Concepts and
Methods”, CRC Tayler & Francis, 2006.
3. L. Landini, V. Positano, M.L. Santarelli, “Advanced Image Processing in Magnetic
Resonance Imaging”, CRC Tayler & Francis, 2005.
4. Bovik A.I. “Handbook of Image and video processing”, Academic Press.
COURSE PLAN
COURSE NO: 02CS7421.5 COURSE TITLE: MEDICAL IMAGE ANALYSIS

TECHNIQUES (L-T-P : 3-0-0) CREDITS:3
hours Marks;%
MODULE : 1 15
Introduction to medical imaging technology, systems and modalities. 8

Brief history; importance; applications; trends; challenges.
Medical Image Storage, Archiving and Communication Systems and

Formats, Picture archiving and communication system, (PACS);
Formats: DICOM, Radiology Information Systems (RIS) and Hospital
Information Systems (HIS)
MODULE : 2 15
Basic image processing algorithms, Thresholding; contrast 8

enhancement; SNR characteristics; filtering; histogram modelling,
Medical Image Visualization, Fundamentals of visualization; surface
and volume rendering/visualization; animation; interaction
FIRST INTERNAL TEST
MODULE : 3 15
Medical Image Segmentation : 8
Histogram-based methods; Region growing and watersheds; Markov

Random Field models; active contours; model-based segmentation,
Multi-scale segmentation; semi-automated methods; clustering-based
methods; classification-based methods; atlas-guided approaches;
multi-model segmentation
MODULE : 4 15
Medical Image Registration: Introduction, Intensity-based 5

methods, Joint histograms, Information theory measures, cost
functions, clinical applications of Image registration

MODULE : 5 20
Medical Image Search and Retrieval - Current technology in medical 5

image search, content-based image retrieval, new trends: Applications
MODULE : 6 20
Applications of Medical Imaging - Validation, Image Guided Surgery, 6

Image Guided Therapy, Computer Aided Diagnosis/Diagnostic
Support Systems

IMAGEPROCESSING-FULL SchemeandSyllabus

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

IMAGEPROCESSING-FULL SchemeandSyllabus

Uploaded by

Copyright:

Available Formats

APJ ABDUL KALAM

(KOLAM CLUSTER - 02)

SCHEME AND SYLLABI

COMPUTER SCIENCE AND

1 Dr. S. Mohan, Professor, IIT Madras, Chennai

2 Principal, TKM College of Engineering, Kollam

3 Principal, Baselios Mathews II College of Engineering, Sasthamcotta, Kollam

4 Principal, College of Engineering, Karunagapally, Kollam

5 Principal, College of Engineering, Perumon, Kollam

6 Principal, Pinnacle School of Engineering and Technology, Anchal, Kollam

7 Principal, Shahul Hameed Memorial Engineering College, Kadakkal, Kollam

8 Principal, TKM Institute of Technology, Ezhukone, Kollam

9 Principal, Travancore Engineering College, Parippally, Kollam

10 Principal, Younus College of Engineering and Technology, Pallimukku, Kollam

This is to certify that

2. The suggestions/modifications suggested while presenting the scheme and syllabi

4. The document has been verified by all the constituent colleges

Coordinator in charge of syllabus revision of the programme

As so c iat e Professor and Head

Department of Computer Science and Engg.

Dr. Hari V S College of Engineering, Karunagappally

College of Engineering, Karunagappally

Principals of the colleges in which the programme is offered

No Name of the college Principal’s Name Signature

Place: Professor, IIT, Madras

To inculcate spirit of ethical values and social

PEO1: To facilitate easy understanding of mathematical basis for image

PEO3: To motivate graduates in research field of image processing

PEO4: To understand how to prepare and execute a feasible research project

PEO5: To apply image processing modalities in storage, transmission, biomedical

and security areas of image processing

1. Enhance knowledge in understanding and analyzing

2. Develop solutions to live problems

3. Understanding professional responsibilities

M. Tech Computer Science with specialization in

Internal Ext. Total

Mathematical foundation for Image

02CS6421 Advanced Data Structures and Algorithms 40 60 100 4

02CS6431 Digital Image Processing 40 60 100 4

02CS6441 Random Process 40 60 100 3

02CS6451 Elective 1 40 60 100 3

02CA6001 Research methodology 100 0 100 2

02CS6461 Seminar 100 0 100 2

02CS6471 Image Processing Lab -I 100 0 100 1

Second Semester (Total Credits: 19)

Internal Ext. Total

02CS6412 Advanced Data Mining 40 60 100 4

Advance Image Processing & Computer

02CS6432 Pattern Recognition 40 60 100 3

02CS6442 Elective 2 40 60 100 3

02CS6462 Image Processing Lab II 100 0 100 1

02CS6472 Mini Project 100 0 100 2

Third Semester (Total Credits : 14)

Internal Ext. Total

02CS7411 Elective 4 40 60 100 3

02CS7421 Elective 5 40 60 100 3

02CS7431 Seminar 100 100 2

02CS7441 Project (phase 1) 50 50 6

Fourth Semester (Total Credits: 12)

Internal Ext. Total

02CS7412 Project Dissertation Evaluation 70 30 100 12

Internal Ext. Total

02CS6451.1 Advanced Computer Graphics 40 60 100 3