Tuesday, 29 October 2013

DS7201 ADVANCED DIGITAL IMAGE PROCESSING-ANNA UNIV PG 1ST SEM SYLLABUS

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. APPLIED ELECTRONICS
DS7201 ADVANCED DIGITAL IMAGE PROCESSING


COURSE OBJECTIVES:
 To understand the image fundamentals and mathematical transforms necessary for image
processing and to study the image enhancement techniques.
 To understand the image segmentation and representation techniques.
 To understand how image are analyzed to extract features of interest.
 To introduce the concepts of image registration and image fusion.
 To analyze the constraints in image processing when dealing with 3D data sets.

UNIT I FUNDAMENTALS OF DIGITAL IMAGE PROCESSING
Elements of visual perception, brightness, contrast, hue, saturation, mach band effect, 2D
image transforms-DFT, DCT, KLT, and SVD. Image enhancement in spatial and frequency
domain, Review of morphological image processing

UNIT II SEGMENTATION
Edge detection, Thresholding, Region growing, Fuzzy clustering, Watershed algorithm, Active
contour methods, Texture feature based segmentation, Model based segmentation, Atlas based segmentation, Wavelet based Segmentation methods

UNIT III FEATURE EXTRACTION
First and second order edge detection operators, Phase congruency, Localized feature
extraction-detecting image curvature, shape features Hough transform, shape skeletonization,
Boundary descriptors, Moments, Texture descriptors- Autocorrelation, Co-occurrence features,
Runlength features, Fractal model based features, Gabor filter, wavelet features

UNIT IV REGISTRATION AND IMAGE FUSION
Registration- Preprocessing, Feature selection-points, lines, regions and templates Feature
correspondence-Point pattern matching, Line matching, region matching Template matching
.Transformation functions-Similarity transformationand Affine Transformation. Resampling-
Nearest Neighbour and Cubic Splines Image Fusion-Overview of image fusion, pixel fusion,
Multiresolution based fusiondiscrete wavelet transform, Curvelet transform. Region based
fusion.

UNIT V 3D IMAGE VISUALIZATION
Sources of 3D Data sets, Slicing the Data set, Arbitrary section planes, The use of color,
Volumetric display, Stereo Viewing, Ray tracing, Reflection, Surfaces, Multiply connected
surfaces, Image processing in 3D, Measurements on 3D images.

TOTAL: 45 PERIODS

COURSE OUTCOMES:
Upon Completion of the course, the students will be able to
 To understand image formation and the role human visual system plays in perception of
gray and color image data.
 To apply image processing techniques in both the spatial and frequency (Fourier) domains.
 To design image analysis techniques in the form of image segmentation and to evaluate the
methodologies for segmentation.
 To conduct independent study and analysis of feature extraction techniques.
 To understand the concepts of image registration and image fusion.
 To analyze the constraints in image processing when dealing with 3D data sets and to apply
image processing algorithms in practical applications.

TEXT BOOKS:
1. John C.Russ, “The Image Processing Handbook”, CRC Press,2007.
2. Mark Nixon, Alberto Aguado, “Feature Extraction and Image Processing”, Academic Press,
2008.
3. Ardeshir Goshtasby, “ 2D and 3D Image registration for Medical, Remote Sensing and
Industrial Applications”,John Wiley and Sons,2005.
REFERENCE BOOKS:
1. Rafael C. Gonzalez, Richard E. Woods, , Digital Image Processing', Pearson,Education,
Inc., Second Edition, 2004.
2. Anil K. Jain, , Fundamentals of Digital Image Processing', Pearson Education,Inc., 2002.
3. Rick S.Blum,Zheng Liu,“ Multisensor image fusion and its Applications“,Taylor&
Francis,2006.

Monday, 28 October 2013

CP7204 ADVANCED OPERATING SYSTEMS - ANNA UNIV CSE PG 2ND SEM SYLLABUS

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. COMPUTER SCIENCE AND ENGINEERING
CP7204 ADVANCED OPERATING SYSTEMS

OBJECTIVES:
 To learn the fundamentals of Operating Systems
 To gain knowledge on Distributed operating system concepts that includes architecture, 
Mutual exclusion algorithms, Deadlock detection algorithms and agreement protocols
 To gain insight on to the distributed resource management components viz. the 
algorithms for implementation of distributed shared memory, recovery and commit 
protocols
 To know the components and management aspects of Real time, Mobile operating 
systems

UNIT I FUNDAMENTALS OF OPERATING SYSTEMS    
Overview – Synchronization Mechanisms – Processes and Threads - Process Scheduling –
Deadlocks: Detection, Prevention and Recovery  – Models of Resources  – Memory 
Management Techniques.

UNIT II DISTRIBUTED OPERATING SYSTEMS 
Issues in Distributed Operating System  – Architecture  – Communication Primitives  –
Lamport’s Logical clocks  – Causal Ordering of Messages  – Distributed Mutual Exclusion 
Algorithms  – Centralized and Distributed Deadlock Detection Algorithms  – Agreement 
Protocols. 

UNIT III DISTRIBUTED RESOURCE MANAGEMENT
Distributed File Systems  – Design Issues  - Distributed Shared Memory  – Algorithms for 
Implementing Distributed Shared memory–Issues in Load Distributing  – Scheduling 
Algorithms  – Synchronous and Asynchronous Check Pointing and Recovery  – Fault 
Tolerance  – Two-Phase Commit Protocol  – Nonblocking Commit Protocol  – Security and 
Protection.

UNIT IV REAL TIME AND MOBILE OPERATING SYSTEMS
Basic Model of Real Time Systems  - Characteristics- Applications of Real Time Systems –
Real Time Task Scheduling  - Handling Resource Sharing  - Mobile Operating Systems  –
Micro Kernel Design  - Client Server Resource Access – Processes and Threads  - Memory 
Management - File system.

UNIT V CASE STUDIES
Linux System: Design Principles  - Kernel Modules  - Process Management Scheduling  -
Memory Management  - Input-Output Management  - File System  - Interprocess 
Communication. iOS and Android:  Architecture and SDK Framework  - Media Layer  -
Services Layer - Core OS Layer - File System.

OUTCOMES:
Upon Completion of the course, the students should be able to:
 Discuss the various synchronization, scheduling and memory management issues
 Demonstrate the Mutual exclusion, Deadlock detection and agreement protocols of 
Distributed operating system 
 Discuss the various resource management techniques for distributed systems
 Identify the different features of real time and mobile operating systems
 Install and use available open source kernel
 Modify existing open source kernels in terms of functionality or features used

REFERENCES:
1. Mukesh Singhal and Niranjan G. Shivaratri, “Advanced Concepts in Operating Systems 
– Distributed, Database, and Multiprocessor Operating Systems”, Tata McGraw-Hill, 
2001.
2. Abraham Silberschatz; Peter Baer Galvin; Greg Gagne, “Operating System Concepts”, 
Seventh Edition, John Wiley & Sons, 2004.  
3. Daniel P Bovet and Marco Cesati, “Understanding the Linux kernel”, 3rd edition, 
O’Reilly, 2005. 
4. Rajib Mall, “Real-Time Systems: Theory and Practice”, Pearson Education India, 2006.
5. Neil Smyth, “iPhone iOS 4 Development Essentials – Xcode”, Fourth Edition, Payload 
media, 2011. 

Sunday, 27 October 2013

CP7203 PRINCIPLES OF PROGRAMMING LANGUAGES - ANNA UNIV CSE PG 2ND SEM SYLLABUS

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. COMPUTER SCIENCE AND ENGINEERING
CP7203 PRINCIPLES OF PROGRAMMING LANGUAGES   

OBJECTIVES:
 To understand and describe syntax and semantics of programming languages
 To understand data, data types, and basic statements
 To understand call-return architecture and ways of implementing them
 To understand object-orientation,concurrency, and event handling in programming languages
 To develop programs in non-procedural programming paradigms

UNIT I SYNTAX AND SEMANTICS
Evolution of programming languages – describing syntax – context-free grammars – attribute 
grammars – describing semantics – lexical analysis – parsing – recursive-decent – bottomup parsing

UNIT II DATA, DATA TYPES, AND BASIC STATEMENTS 
Names – variables – binding – type checking – scope – scope rules – lifetime and garbage 
collection – primitive data types – strings – array types – associative arrays – record types –
union types  – pointers and references  – Arithmetic expressions  – overloaded operators  –
type conversions  – relational and boolean expressions  – assignment statements  – mixedmode assignments  – control structures  – selection  – iterations  – branching  – guarded 
statements

UNIT III SUBPROGRAMS AND IMPLEMENTATIONS
Subprograms  – design issues  – local referencing  – parameter passing  – overloaded 
methods  – generic methods – design issues for functions  – semantics of call and return –
implementing simple subprograms  – stack and dynamic local variables  – nested 
subprograms – blocks – dynamic scoping

UNIT IV OBJECT-ORIENTATION, CONCURRENCY, AND EVENT HANDLING
Object-orientation  – design issues for OOP languages  – implementation of object-oriented 
constructs  – concurrency  – semaphores  – monitors  – message passing  – threads  –
statement level concurrency – exception handling – even handling

UNIT V FUNCTIONAL AND LOGIC PROGRAMMING LANGUAGES
Introduction to lambda calculus  – fundamentals of functional programming languages  –
Programming with Scheme  – Programming with ML  – Introduction to logic and logic 
programming – Programming with Prolog – multi-paradigm languages

OUTCOMES:
Upon Completion of the course,the students will be able to
 Describe syntax and semantics of programming languages
 Explain data, data types, and basic statements of programming languages
 Design and implement subprogram constructs14
 Apply object-oriented, concurrency, and event handling programming constructs
 Develop programs in Scheme, ML, and Prolog
 Understand and adopt new programming languages

REFERENCES:
1. Robert W. Sebesta, “Concepts of Programming Languages”, Tenth Edition, Addison 
Wesley, 2012.
2. Michael L. Scott, “Programming Language Pragmatics”, Third Edition, Morgan 
Kaufmann, 2009.
3. R. Kent Dybvig, “The Scheme programming language”, Fourth Edition, MIT Press, 2009.
4. Jeffrey D. Ullman, “Elements of ML programming”, Second Edition, Prentice Hall, 1998.
5. Richard A. O'Keefe, “The craft of Prolog”, MIT Press, 2009.
6. W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO Standard”, Fifth 
Edition, Springer, 2003.

Saturday, 26 October 2013

ANNA UNIVERSITY AFFILIATED COLLEGES RANK HOLDERS 2009-2013 BATCH

Anna University officially published the Anna University affiliated colleges Rank list for the April/may 2013 Examination.That is Rank holders of 2009 to 2013 batch.Now we updated this in our Website just click the link given below to view the Rank holders of 2013.

ANNA UNIVERSITY AFFILIATED COLLEGES RANK HOLDERS 2009-2013 BATCH
Rank Holders of 2009 -2013 Batch
To see Rank Holders List --> Click Here

How to get University Rank :
  • A candidate should get pass in all the subjects in first class or first class with distinction in the first attempt.(Pass in currents semester)
  • And some calculations will be done to select the rank holders at the rate of 1 for every 20 students who are eligible as above.