Department of Computer Science and Engineering

Module 1 (10 (T) + 7(P) Hours)

Introduction to digital image processing: images, image quality, basic operations.

Radiography: Introduction, X-rays, interaction with matter, detectors, dual energy imaging, quality clinical use, biologic effect and safety, Fourier Slice Theorem Basics.

Module 2 (10 (T) + 7(P) Hours)

X-ray Computed tomography: Introduction, X-ray detectors in CT, imaging, cardiac CT, image quality, clinical use, biologic effects and safety.

Magnetic resonance imaging: Introduction, physics of transmitted signal, interaction with tissue, signal detection and detector, imaging. Biologic effects and safety
Module 3 (10 (T) + 7(P) Hours)

Nuclear imaging, Introduction, radionuclides, interaction of Gama-photons and particles with matter, data acquisition, imaging, image quality, equipment, clinical use, biologic effects and safety

Ultrasound imaging: Physics of acoustic waves, generation and detection of ultrasound, grayscale imaging, Doppler imaging, image quality, equipment, clinical use, biologic effects and safety.
Module 4 (12 (T) + 7(P) Hours)

Medical image analysis: Manual and automated analysis, computation strategies for automated medical image analysis, pixel classification.

References:

1. 
   Paul Suetens, Fundamentals of medical imaging, Cambridge University Press, 2009.
   
2. 
   Bushberg, J. A. et al., The Essential Physics of Medical Imaging , 2/e, L. Williams and Wilkins, 2002.
   

CS4046 COMPUTER VISION

Pre-requisite: Nil

L	T	P	C
3	0	2	4

Total Hours: 70 Hrs  

Module 1 (10 (T) + 7(P) Hours)

Introduction and overview, pinhole cameras, radiometry terminology. Sources, shadows and shading: Local shading models- point, line and area sources; photometric stereo. Color: Physics of color; human color perception, Representing color; A model for image color; surface color from image color.
Module 2 (10 (T) + 7(P) Hours)

Linear filters: Linear filters and convolution; shift invariant linear systems- discrete convolution, continuous convolution, edge effects in discrete convolution; Spatial frequency and fourier transforms; Sampling and aliasing; filters as templates; Normalized correlations and finding patterns. Edge detection: Noise; estimating derivatives; detecting edges. Texture: Representing texture; Analysis using oriented pyramid; Applications; Shape from texture. The geometry and views: Two views.

Module 3 (10 (T) + 7(P) Hours)

Stereopsis: Reconstruction; human stereo; Binocular fusion; using color camera.

Module 4 (12 (T) + 7(P) Hours)

Segmentation by clustering: Human vision, applications, segmentation by graph theoretic clustering. Segmentation by fitting a model, Hough transform; fitting lines, fitting curves;

References:

1. 
   David A Forsynth and Jean Ponce, Computer Vision- A modern approach, Pearson education series, 2003.
   
2. 
   Milan Sonka, Vaclav Hlavac and Roger Boyle, Digital image processing and computer vision, Cengage learning, 2008.
   
3. 
   Schalkoff R. J., Digital Image Processing and Computer Vision, John Wiley, 2004.
   

CS4047 COMPUTER GRAPHICS

Pre-requisite: Nil

L	T	P	C
3	0	2	4

Total Hours: 70Hrs  

Module 1 (10 (T) + 7(P) Hours)

Graphics Pipeline -  overview of vertex processing, primitive generation, transformations and projections, clipping, rasterisation, fragment processing - Graphics Hardware - overview of GPU architecture, how GPUs SIMD architecture suits computer graphics.
Module 2 (10 (T) + 7(P) Hours)

Coordinate Systems - representations, homogenous coordinates, object, camera, world, and screen coordinate system, changing coordinate systems. Transformations - affine transformations, translation, rotation, scaling in homogenous coordinates, matrix representations,  cumulation of transformations. Viewing and Projections - orthographic and perspective projection, camera positioning, Hidden Surface Removal - its importance in rendering, z buffer algorithm, clipping, culling, Data Structures for efficient implementation of the transformations and projections.

Module 3 (10 (T) + 7(P) Hours)

Lighting and Shading - light sources, normal computation, reflection models, flat and smooth shading , Introduction to Textures and Mapping - Rendering Techniques - slicing, volume rendering, iso-surface extraction, ray casting, multi resolution representations for large data rendering. Data Structures for efficient implementation.

Module 4 (12 (T) + 7(P) Hours)

Geometric Modelling - Data structures - tree representations, hierarchical models, scene graphs - particle systems and representations - introduction to modeling and solving dynamics based on physics, Introduction to Curves Surfaces (Bezier, splines) and Meshes - structured and unstructured.

References:

1. 
   E. S. Angel, Interactive Computer Graphics, A top-down approach with OpenGL, 5/e, Pearson Education, 2009.
   
2. 
   D. Hearn and M. P. Baker, Computer Graphisc with OpenGL, Prentice Hall, 2003, 3/e, Prentice Hall, 2003.
   

CS4048 TOPICS IN COMPILERS

Prerequisite: CS3005 Compiler Design

L	T	P	C
3	0	2	4

Total Hours: 70 Hrs  
Module 1: Attribute grammars (10(T) + 7(P) hours)

Analysis, use, tests, circularity. Issues in type systems.

Module 2: Analysis and Optimizations (10(T)+7(P) hours)

Advanced topics in Data Flow, Control Flow and Dependency analysis, Loop optimizations – invariant code motion, elimination of partial redundancy, Experimental platforms – SUIF.

Module 3: ILP Compilation (11(T) + 7(P) hours)

Issues in compilation for ILP based processors. Effect of VLIW, Speculative, Predicated instructions, multithreaded processors.

Module 4: Dynamic Compilation (11(T)+7(P) hours)

Introduction, methods, case studies, implementation, software tools.

References:

1.     ACM SIGPLAN.

2.     ACM TOPLAS.

3.     Steven Muchnick, Advanced Compiler Design Implementation, Morgan Kauffmann Publishers, 1997

4.      Aho A.V, Lam M.S, Sethi R and Ullman J. D, Compilers – Principles, Techniques and Tools, Pearson, 2007.

CS4049 ADVANCED COMPUTER NETWORKS

Pre-requisite: CS3006 Computer Networks

L	T	P	C
3	0	2	4

Total Hours: 70 Hrs  

Module 1 (10 (T) + 7(P) Hours): Introduction- Internet design philosophy, layering and end to end design principle. MAC protocols for high-speed LANS, MANs, wireless LANs and mobile networks, VLAN. Fast access technologies.
Module 2 (10 (T) + 7(P) Hours): IPv6: Why IPv6, basic protocol, extensions and options, support for QoS, security, neighbour discovery, auto-configuration, routing. Changes to other protocols. Application Programming Interface for IPv6, 6bone. IP Multicasting, wide area multicasting, reliable multicast. Routing layer issues, ISPs and peering, BGP, IGP, Traffic Engineering, Routing mechanisms: Queue management, packet scheduling. MPLS, VPNs
Module 3 (10 (T) + 7(P) Hours): TCP extensions for high-speed networks, transaction-oriented applications. New options in TCP, TCP performance issues over wireless networks, SCTP, DCCP.
Module 4 (12 (T) + 7(P) Hours): DNS issues, other naming mechanisms, overlay networks, p2p networks, web server systems, web 2.0, Internet traffic modelling, Internet measurements. Security – Firewalls, Unified threat Management System, Network Access Control.
References:

1. 
   Adrian Farrel, The Internet and its protocols a comparative approach, Elsevier, 2005
   
2. 
   M. Gonsalves and K. Niles._IPv6 Networks, McGraw Hill, 1998.
   
3. 
   W. R. Stevens, TCP/IP Illustrated, Volume 1: The protocols, Addison Wesley, 1994.
   
4. 
   G. R. Wright, TCP/IP Illustrated, Volume 2: The Implementation, Addison Wesley, 1995.
   
5. 
   W. R. Stevens, TCP/IP Illustrated, Volume 3: TCP for Transactions, HTTP, NNTP, and the Unix Domain Protocols, Addison Wesley, 1996.
   
6. 
   Articles in various journals and conference proceedings.
   
7. 
   RFCs and Internet Drafts, available from Internet Engineering Task Force.
   

CS4050 DESIGN AND ANALYSIS OF ALGORITHMS
Pre-requisite: CS2005 Data Structures & Algorithms

L	T	P	C
3	0	2	4

Total Hours: 70 Hrs