m.e. k.s.r. college of engineering (autonomous) … · topological sort – strongly connected...

34
M.E. Multimedia Technology KSRCE Curricula and Syllabi (R 2016) 1 K.S.R. COLLEGE OF ENGINEERING (Autonomous) (Approved by AICTE& Affiliated to Anna University) K.S.R. Kalvi Nagar, Tiruchengode 637 215 CURRICULUM PG R - 2016 Department Department of Computer Science and Engineering Programme M.E Multimedia Technology SEMESTER I Sl.No. Course Code Course Name Hours/ Week Credit Maximum Marks L T P C CA ES Total THEORY 1. MA16134 Optimization Techniques 3 1 0 4 30 70 100 2. MT16111 GPU Architecture and Programming 3 0 0 3 30 70 100 3. CS16142 Advanced Data structures and Algorithms (Common to CS and MMT) 3 0 0 3 30 70 100 4. MT16113 Computer Graphics and Animation 3 0 0 3 30 70 100 5. MT16114 Multimedia Systems 3 0 0 3 30 70 100 6. MT16115 Multimedia Databases 3 0 0 3 30 70 100 PRACTICAL 7. MT16121 Computer Graphics and Animation Laboratory 0 0 3 2 50 50 100 8. MT16122 Photography Laboratory 0 0 3 2 50 50 100 9. MT16123 Technical Presentation I 0 0 3 2 50 50 100 Total 18 1 9 25 900 SEMESTER - II Sl.No. Course Code Course Name Hours/ Week Credit Maximum Marks L T P C CA ES Total THEORY 1. MT16211 Digital Image Processing and Pattern Recognition 3 0 0 3 30 70 100 2. MT16212 Multimedia Compression Techniques 3 0 0 3 30 70 100 3. MT16213 Multimedia Networks 3 0 0 3 30 70 100 4. MT16214 3D Modeling and Rendering 3 0 0 3 30 70 100 5. MT16215 Web Design and Programming 3 0 0 3 30 70 100 6. Elective I 3 0 0 3 30 70 100 PRACTICAL 7. MT16221 Web Design and Programming Laboratory 0 0 3 2 50 50 100 8. MT16222 3D Modeling and Rendering Laboratory 0 0 3 2 50 50 100 9. MT16223 Technical Presentation II 0 0 3 2 50 50 100 Total 18 0 9 24 900

Upload: others

Post on 08-Oct-2020

3 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 1

K.S.R. COLLEGE OF ENGINEERING (Autonomous) (Approved by AICTE& Affiliated to Anna University)

K.S.R. Kalvi Nagar, Tiruchengode – 637 215

CURRICULUM PG

R - 2016

Department Department of Computer Science and Engineering

Programme M.E – Multimedia Technology

SEMESTER – I

Sl.No. Course Code Course Name

Hours/ Week Credit Maximum Marks

L T P C CA ES Total

THEORY

1. MA16134 Optimization Techniques 3 1 0 4 30 70 100

2. MT16111 GPU Architecture and Programming 3 0 0 3 30 70 100

3. CS16142 Advanced Data structures and Algorithms (Common to CS and MMT)

3 0 0 3 30 70 100

4. MT16113 Computer Graphics and Animation 3 0 0 3 30 70 100

5. MT16114 Multimedia Systems 3 0 0 3 30 70 100

6. MT16115 Multimedia Databases 3 0 0 3 30 70 100

PRACTICAL

7. MT16121 Computer Graphics and Animation Laboratory 0 0 3 2 50 50 100

8. MT16122 Photography Laboratory 0 0 3 2 50 50 100

9. MT16123 Technical Presentation – I 0 0 3 2 50 50 100

Total 18 1 9 25 900

SEMESTER - II

Sl.No. Course Code Course Name

Hours/ Week Credit Maximum Marks

L T P C CA ES Total

THEORY

1. MT16211 Digital Image Processing and Pattern Recognition

3 0 0 3 30 70 100

2. MT16212 Multimedia Compression Techniques 3 0 0 3 30 70 100

3. MT16213 Multimedia Networks 3 0 0 3 30 70 100

4. MT16214 3D Modeling and Rendering 3 0 0 3 30 70 100

5. MT16215 Web Design and Programming 3 0 0 3 30 70 100

6. Elective I 3 0 0 3 30 70 100

PRACTICAL

7. MT16221 Web Design and Programming Laboratory

0 0 3 2 50 50 100

8. MT16222 3D Modeling and Rendering Laboratory 0 0 3 2 50 50 100

9. MT16223 Technical Presentation – II 0 0 3 2 50 50 100

Total 18 0 9 24 900

Page 2: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 2

K.S.R. COLLEGE OF ENGINEERING (Autonomous) (Approved by AICTE& Affiliated to Anna University)

K.S.R. Kalvi Nagar, Tiruchengode – 637 215

CURRICULUM PG

R - 2016

Department Department of Computer Science and Engineering

Programme M.E – Multimedia Technology

SEMESTER – III

Sl.No. Course Code Course Name

Hours/ Week Credit Maximum Marks

L T P C CA ES Total

THEORY

1. MT16311 Multimedia Information Storage and Retrieval 3 0 0 3 30 70 100

2. Elective II 3 0 0 3 30 70 100

3. Elective III 3 0 0 3 30 70 100

PRACTICAL

4. MT16321 Project Phase – I 0 0 12 6 50 50 100

Total 9 0 18 15 400

SEMESTER - IV

Sl.No. Course Code Course Name

Hours/ Week Credit Maximum Marks

L T P C CA ES Total

PRACTICAL

1. MT16421 Project Phase – II 0 0 24 12 50 50 100

Total 0 0 24 12 100

Page 3: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 3

K.S.R. COLLEGE OF ENGINEERING (Autonomous) (Approved by AICTE& Affiliated to Anna University)

K.S.R. Kalvi Nagar, Tiruchengode – 637 215

CURRICULUM UG

R - 2016

Department Department of Computer Science and Engineering

Programme M.E – Multimedia Technology

List of Electives

ELECTIVES – I (SEMESTER – II)

Sl.No. Course Code Course Name

Hours/ Week Credit Maximum Marks

L T P C CA ES Total

1. MT16261 Biometrics 3 0 0 3 30 70 100

2. MT16262 Game Programming 3 0 0 3 30 70 100

3. MT16263 Multimedia Signal Processors 3 0 0 3 30 70 100

4. MT16264 Multimedia Security 3 0 0 3 30 70 100

5. MT16265 Speech and Audio Processing 3 0 0 3 30 70 100

ELECTIVES – II and III (SEMESTER – III)

Sl.No. Course Code Course Name

Hours/ Week Credit Maximum Marks

L T P C CA ES Total

1. MT16361 Principles of Film Development 3 0 0 3 30 70 100

2. MT16362 Multimedia Server Management 3 0 0 3 30 70 100

3. CS16003 Cloud Computing (Common to CS and MMT ) 3 0 0 3 30 70 100

4. MT16364 Virtual Reality 3 0 0 3 30 70 100

5. MT16365 Digital Video Processing 3 0 0 3 30 70 100

6. MT16366 Interaction Design For 3D User Interfaces 3 0 0 3 30 70 100

7. CS16393 Internet of Things (Common to CS and MMT ) 3 0 0 3 30 70 100

8. MT16368 Visualization Techniques 3 0 0 3 30 70 100

9. MT16369 Video Analytics 3 0 0 3 30 70 100

10. MT16371 Sound Engineering 3 0 0 3 30 70 100

Page 4: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 4

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – I

MA16134 OPTIMIZATION TECHNIQUES L T P C

3 1 0 4

Objective:

To learn the concept of operations research techniques in computer science applications.

UNIT – I LINEAR PROGRAMMING [ 12 ]

Formation of LPP - Graphical method - Simplex method - Big - M Method - Two Phase Method - Dual Simplex

Method.

UNIT – II TRANSPORTATION AND ASSIGNMENT PROBLEMS [ 12 ]

Transportation Models (Minimizing and Maximizing Problems) - Balanced and unbalanced Problems - Initial Basic

feasible solution by N-W Corner Rule, Least cost and Vogel’s approximation methods –Optimum solution by

MODI Method . Assignment Models (Minimizing and Maximizing Problems) – Balanced and Unbalanced

Problems - Travelling Salesman problem

UNIT – III INTEGER PROGRAMMING [ 12 ]

Formulation of Integer Programming problems - Gomory’s cutting plane methods - Branch and Bound

Techniques.

UNIT – IV DYNAMIC PROGRAMMING [ 12 ]

Characteristics of Dynamic Programming - Bellman’s principle of optimality - Concepts of dynamic programming -

Calculus method of solution.

UNIT – V PERT/CPM [ 12 ]

Network Construction –Critical Path method - computation of earliest start time, latest start time, Total, free and independent float time – PERT - Computation of optimistic - most likely Pessimistic and expected time - Crashing.

Total (L: 45 T:15) = 60 Periods

Course Outcomes:

Upon Completion of this course, the student will be able to:

Develop the Linear Programming concepts during the uncertain situations in engineering fields.

Find the minimization of Transportation and Assignment cost.

Develop integer solutions by solving Integer Programming Problems.

Understand to develop the concept of Dynamic Programming Problems.

Find the Critical path of networking problems by using PERT and critical path methods.

Reference Books:

1 P.K.Gupta & Man Mohan, Operations Research, Sultan Chand & Sons, 12th Edition, 2013.

2 N. D Vohra, Quantitative Techniques in Management, Tata Mcgraw Hill, 2010.

3 Gupta P.K, Hira D.S, Problem in Operations Research, S.Chand and Co, 2007.

4 Taha, H.A., Operations Research: An Introduction, Pearson Education, New Delhi, 2002.

Page 5: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 5

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – I

MT16111 GPU ARCHITECTURE AND PROGRAMMING L T P C 3 0 0 3

Objectives:

To understand the architecture of GPUs in order to program them effectively.

To program using GPU programming frameworks.

To optimize multimedia applications to run on GPUs.

UNIT – I GPU ARCHITECTURES [ 9 ]

Parallel Processors – Classification – Performance – Multimedia SIMD Architectures. GPU – NVIDIA Case Study – GPU Computational Structures – ISA – Memory Structures.

UNIT – II GPU COMPUTING AND CUDA [ 9 ]

Introduction – Parallel Programming Languages and models – Evolution of Graphic pipelines – GPGPUs - CUDA Program Structure – Device memories – Data Transfer – Kernel Functions.

UNIT – III CUDA DETAILS [ 9 ]

CUDA Threads – Thread Organization – Synchronization & Scalability – CUDA memories – Performance – Imaging Case study.

UNIT – IV OPENCL BASICS [ 9 ]

OpenCL Standard – Kernels – Host Device Interaction – Execution Environment – Memory Model – Basic OpenCL Examples.

UNIT – V OPENCL CONCURRENCY AND EXECUTION MODEL [ 9 ]

OpenCL Synchronization – Kernels – Fences – Barriers – Queuing – Global Synchronization – Memory Consistency – Events – Host side memory model – Device Side memory Model – Case study.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of this course, the student will be able to:

Design multimedia applications using GPUs. Write Programs for GPUs using CUDA / OpenCL.

Optimize programs to run on massively parallel architectures.

Understand the concepts of openCL concurrency.

Describe the case study of GPU.

Reference Books :

1 David B. Kirk and Wen-mei W. Hwu, Programming massively parallel processors, Morgan Kauffman, 2010.

2 B.R. Gaster, L. Howes, D.R. Kaeli, P. Mistry and D. Schaa, Heterogeneous computing with OpenCL, Morgan Kauffman, 2012.

3 John L. Hennessey and David A. Patterson, Computer Architecture – A quantitative approach, Morgan Kaufmann / Elsevier, Fifth Edition, 2012.

4 J. Sanders and E. Kandrot, CUDA by Example: An Introduction to General-Purpose GPU Programming, Addison Wesley, 2010.

5 Wen–mei W. Hwu, GPU Computing Gems, Morgan Kaufmann / Elsevier, 2011.

Page 6: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 6

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – I

CS16142 ADVANCED DATA STRUCTURES AND ALGORITHMS (Common to CS and MMT )

L T P C 3 0 0 3

Objectives:

To understand the usage of algorithms in computing

To learn and use hierarchical data structures and its operations

To learn the usage of graphs and its applications

To select and design data structures and algorithms that is appropriate for problems

UNIT – I ROLE OF ALGORITHMS IN COMPUTING [ 9 ]

Algorithms – Algorithms as a Technology – Insertion Sort – Analyzing Algorithms – Designing Algorithms – Growth of Functions: Asymptotic Notation – Standard Notations and Common Functions – Recurrences: The Substitution Method – The Recursion – Tree Method

UNIT – II HIERARCHICAL DATA STRUCTURES [ 9 ]

Binary Search Trees: Basics – Querying a Binary search tree – Insertion and Deletion – Red-Black trees: Properties of Red-Black Trees – Rotations – Insertion – Deletion – B-Trees: Definition of B-trees – Basic operations on B-Trees – Deleting a key from a B-Tree – Fibonacci Heaps: Structure – Mergeable-heap operations – Decreasing a key and deleting a node – Bounding the maximum degree.

UNIT – III GRAPHS [ 9 ]

Elementary Graph Algorithms: Representations of Graphs – Breadth First Search – Depth First Search – Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and Prim – Single Source Shortest Paths: The Bellman-Ford algorithm – Single Source Shortest paths in Directed Acyclic Graphs – Dijkstra‟s Algorithm – All Pairs Shortest Paths: Shortest Paths and Matrix Multiplication – The Floyd-Warshall Algorithm.

UNIT – IV ALGORITHM DESIGN TECHNIQUES [ 9 ]

Dynamic Programming: Matrix Chain Multiplication – Elements of Dynamic Programming – Longest Common Subsequence – Greedy Algorithms: An Activity Selection Problem – Elements of the Greedy Strategy – Huffman Codes.

UNIT – V NP COMPLETE AND NP HARD [ 9 ]

NP-Completeness: Polynomial Time – Polynomial-Time Verification – NP Completeness and Reducibility – NP Completeness Proofs – NP Complete Problems

Total (L: 45 T: 0) = 45 Periods

Course Outcomes: Upon the completion of the course the student should be able to:

Design data structures and algorithms to solve computing problems.

Know the concept of hierarchical data structures

Design algorithms using graph structure and various string matching algorithms to solve real-life problems.

Apply suitable design strategy for problem solving.

Understand the concepts of NP-Completeness.

Reference Books:

1 Alfred V. Aho and John E. Hopcroft, Jeffrey D. Ullman, Data Structures and Algorithms, Pearson Education, Reprint 2006.

2 Robert Sedgewick and Kevin Wayne, Algorithms, Pearson Education, Fourth Edition.2010

3 S.Sridhar, Design and Analysis of Algorithms, First Edition, Oxford University Press, 2014

4 Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, Prentice-Hall, Third Edition, 2011.

Page 7: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 7

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – I

MT16113 COMPUTER GRAPHICS AND ANIMATION L T P C 3 0 0 3

Objective:

To understand the basics of geometry processing.

To understand the fundamentals of pipelined rasterization rendering of meshed objects and curved surfaces.

To understand and work with advanced rendering methods such as radiosity.

To design programs for advanced animation methods and

To become proficient at graphics programming using OpenGL

UNIT – I BASICS OF COMPUTER GRAPHICS [ 9 ]

Basics – Scope and Applications – Graphics Standards – Display systems – Image formation – Graphics Systems – Coordinate systems – Line Drawing Algorithms – Parallel Line Algorithms – Circle drawing algorithms – Area Filling – Clipping Algorithms: Line and Polygon – Anti-aliasing.

UNIT – II TRANSFORMATIONS [ 9 ]

Affine Transformations (2D & 3D): Translation – Rotation – Scaling – Reflection and Shearing: Hierarchical Modeling & viewing: The Camera Transformation – Perspective, Orthographic and Stereographic views.

UNIT – III FRACTALS [ 9 ]

Fractals and Self similarity – Peano curves – Creating image by iterated functions – Mandelbrot sets – Julia Sets – Random Fractals – Overview of Ray Tracing – Intersecting rays with other primitives – Reflections and Transparency – Boolean operations on Objects – Applications

UNIT – IV ADVANCED RENDERING TECHNIQUE [ 9 ]

Curves and Surfaces: Bezier – B-Splines and NURBS – Color models – Photorealistic rendering – Global Illumination – Ray tracing – Monte Carlo algorithm – Adding Surface texture – Texture Synthesis – Bump Mapping – Environmental mapping – Advanced Lighting and Shading.

UNIT – V ANIMATION [ 9 ]

Overview of Animation Techniques – Keyframing – Computer Animation – Motion capture and editing – forward/Inverse Kinematics – Deformation models – Facial animation. Raster methods – Design of animation sequences – animation techniques – Key-frame systems – motion specification – direct ,dynamics – Rigid body animation – Radiosity – Collision detection – Graphics file format – Opengl animation procedures

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to : Analyze the fundamentals of 2D and 3D computer graphics. Discuss the basic algorithms commonly used in 3D computer graphics. Describe advanced computer graphics techniques and applications. Analyze computer graphics and solid modeling techniques for various applications.

Reference Books :

1 Donald D. Hearn, M. Pauline Baker and Warren Carithers, Computer Graphics with Open GL, Fourth Edition, Prentice Hall, 2011.

2 Alan Watt and Mark Watt, Advanced Animation and Rendering Techniques: Theory and Practice, Addison-Wesley, 1992.

3 Foley, van Dam and Feiner, Hughes, Computer Graphics Principles and Practice, Third Edition in C. Addison Wesley, 2014.

4 Edward Angel and Dave Shreiner, Interactive Computer Graphics: A top-down approach with OpenGL, Sixth Edition Addison Wesley, 2012.

5 Rick Parent, Computer Animation - Algorithms and Techniques, Third Edition Morgan Kaufman, 2012.

Page 8: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 8

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – I

MT16114 MULTIMEDIA SYSTEMS L T P C 3 0 0 3

Objectives:

To understand basic concepts of multimedia including algorithm, compression technique and software.

To understand different realization of multimedia tools

To experience development of multimedia software by utilizing existing libraries & description of algorithms

UNIT – I OVERVIEW OF MULTIMEDIA SYSTEMS [ 9 ]

Multimedia Properties of Multimedia Systems: Independency – Computer Support – Communication System – Network Architecture Evolving Technologies – Application of Multimedia – Discrete Cosine transform – Coefficient Coding.

UNIT – II MULTIMEDIA COMPONENTS [ 9 ]

Hypermedia – Authoring – Authoring Tools – File Format – Color Models – Digital Audio Representation – Transmission – Audio Signal Processing – Digital Music Making – MIDI – Digital Video – Video Compression Technique – Evaluating a Compression System – Redundancy and Visibility – Video Compression Techniques –- ITU.

UNIT – III MULTIMEDIA COMMUNICATION [ 9 ]

Stream Characteristics for Continuous Media – Temporal Relationship – Object Stream Interaction – Media Synchronization – Model for Temporal Specification – Streaming of Audio and Video – Recovering From Packet Loss – RTSP – Multimedia Communication Standards – RTP/RTCP – SIP and H.263 – Real Time Streaming and Demand Streaming.

UNIT – IV MULTIMEDIA AUTHORING TOOLS [ 9 ]

Multimedia Hardware: Macintosh and Windows Production Platforms – Hardware Peripherals: Memory and Storage Devices – Input Devices – Output Devices – Communication Devices – Basic Software Tools.

UNIT – V MULTIMEDIA AND INTERNET [ 9 ]

Internetworking – Connections – Internet Services – Tools for WWW – Designing WWW.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Describe different realizations of multimedia tools and the way in which they are used.

Analyze the structure of the tools in the light of low-level constraints imposed by the adoption of various QoS.

Analyze the effects of scale and use on both presentation and lower-level requirements.

Compare and contrast different network protocols and to describe mechanisms for providing QoS guarantees in the network

Identify both theoretical and practical aspects in designing multimedia systems.

Reference Books :

1 Ranjan Parekh, Principles of Multimedia, TMH, 2006.

2 Ralf Steinmetz and Klara Nahrstedt, Multimedia Application, Springer, 2007

3 Ralf Steinmetz and Klara Nahrstedt, Multimedia: Computing, Communication and applications Pearson Edition, 2001.

4 www.nptel.ac.in/courses/117105083/

5 nptel.ac.in/.../Multimedia%20Processing

Page 9: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 9

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – I

MT16115 MULTIMEDIA DATABASES L T P C 3 0 0 3

Objectives: To understand basic of database and different types of data structures

To know design and architecture of a multimedia database and design

To understand audio and video storage

UNIT – I BASICS OF MULTIMEDIA DATABASE [ 9 ]

Introduction to Object Oriented Databases – Multidimensional Data Structures: kd Trees – Point Quadtrees – MX Quadtree – R Trees – Comparison of Different Data Structures.

UNIT – II IMAGE DATABASE [ 9 ]

Raw Images – Compressed Image Representations – Image Processing: Segmentation – Similarity – Based Retrieval – Alternative Image DB Paradigms – Representing Image DBs with Relations – Representing Image DBs with R Trees – Retrieving Images By Spatial Layout – Implementations.

UNIT – III TEXT / DOCUMENT DATABASE [ 9 ]

Text/Document Databases: Precision and Recall – Stop Lists – Word Stem and Frequency Tables – Latent Semantic Indexing – TV Trees – Other Retrieval Techniques.

UNIT – IV AUDIO & VIDEO DATABASE [ 9 ]

Audio Databases: A General Model of Audio Data – Capturing Audio Content through Discrete Transformation – Indexing Audio Data. Video Databases: Organizing Content of a Single Video – Querying Content of Video Libraries – Video Segmentation – Video Standards.

UNIT – V MULTIMEDIA DATABASE [ 9 ]

Multimedia Databases: Design and Architecture of a Multimedia Database – Organizing Multimedia Data Based on The Principle of Uniformity – Media Abstractions – Query Languages for Retrieving Multimedia Data – Indexing SMDSs with Enhanced Inverted Indices – Query Relaxation/Expansion.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Understand the basics of multimedia database technologies

Demonstrate the knowledge of different types of multimedia database technologies

Apply the concepts learnt in this course to optimize performance of multimedia database technologies

Design to support a specified set of applications

Be familiar with query languages for retrieving multimedia data

Reference Books :

1 V.S. Subrahmanian, Principles of Multimedia Database Systems, Elsevier, Second Edition, 2013.

2 Lynne Dunckley, Multimedia Databases: An Object Relational Approach, Pearson Education, 2012.

3 Prabhakaram, Multimedia Database Systems, , Springer 2012

4 Subramanian S, Principles of Multimedia Database Systems, Elsevier, 1998.

5 Khoshafian S. and Bakor A. B., Multimedia and Imaging Databases, Elsevier, 1996.

Page 10: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 10

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – I

MT16121 COMPUTER GRAPHICS AND ANIMATION LABORATORY L T P C 0 0 3 2

Objective :

To explore the various multimedia editing tools like Photoshop, Audacity, Flash and Premier

List of Experiments:

1. Implementation of Bresenhams Algorithm – Line, Circle, Ellipse.

2. Two Dimensional transformations - Translation, Rotation, Scaling.

3. Image color/contrast balancing and Enhancement using Photoshop

4. Applying special effects using Photoshop

5. Audio editing using Audacity

6. Creation of 2D Animation using Flash

7 .Video editing using adobe premier

8. Creating photo sliding animation using action script

9. Creating web header using flash action script

10. Mini Project.

Total = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Implement small projects using Photoshop, Flash, premier and Audacity

Manipulate the images and audio files using Photoshop and Audacity

Page 11: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 11

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – I

MT16122 PHOTOGRAPHY LABORATORY L T P C 0 0 3 2

Objective :

To explore in-depth the marketing and self-promotion issues practiced by photographers such as portfolio strategies, networking, web portfolios, photographic reps, award shows and client research.

List of Experiments:

1. Shooting Techniques

2. Art of Photography

3. Composition

4. Framing the Subject

5. Subject Placement

6. View Point and Camera Angles

7. Light Setup and Design

8. Diffuser and Honeycomb

9. Soft boxes and Umbrellas

11. Image Editing

Total = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Expose and print black and white negatives

Mount enlarged photographs and present them for display.

Carefully interpret and think critically about the images we make and see, and in order to better understand them

Find their place within the historical traditions of photographic imagery

Complete the following assignments: a depth of field/ shutter speed shoot, an overlapping panoramic, dream pictures, self-portraits, portraits, an advertising still-life, night photography shoot, landscapes, photo stories and an oral presentation in order to pass the class.

Page 12: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 12

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – II

MT16211 DIGITAL IMAGE PROCESSING AND PATTERN

RECOGNITION

L T P C

3 0 0 3

Objectives:

To understand the basic concepts and algorithms of digital processing To familiarize the student with the image processing environments like Matlab and its equivalent

open source Image processing environments. To expose the students to a broad range of image processing techniques and issues and their

applications, and to provide the student with practical experiences using them. To appreciate the use of image processing in current technologies and to expose the students to real-

world applications of the image processing

UNIT – I FUNDAMENTALS OF IMAGE PROCESSING [ 9 ]

Introduction – Elements of visual perception, Steps in Image Processing Systems – Digital Imaging System – Image Acquisition – Sampling and Quantization – Pixel Relationships – File Formats – Colour images and models – Image Operations – Arithmetic, logical, statistical and spatial operations.

UNIT – II IMAGE ENHANCEMENT AND RESTORATION [ 9 ]

Image Transforms – Discrete and Fast Fourier Transform and Discrete Cosine Transform – Spatial Domain – Gray level Transformations – Histogram Processing – Spatial Filtering: Smoothing and Sharpening – Frequency Domain: Filtering in Frequency Domain – Smoothing and Sharpening filters – Homomorphic Filtering – Noise models – Constrained and Unconstrained restoration models.

UNIT – III IMAGE SEGMENTATION AND MORPHOLOGY [ 9 ]

Detection of Discontinuities – Edge Operators – Edge Linking and Boundary Detection – Thresholding – Region Based Segmentation – Motion Segmentation – Image Morphology: Binary and Gray level morphology operations – Erosion, Dilation, Opening and Closing Operations – Distance Transforms – Basic morphological Algorithms – gray scale Morphology.

UNIT – IV PATTERN RECOGNITION [ 9 ]

Component Labeling – Image Features – Textures – Boundary representations and descriptions – Regional descriptors – Feature selection and Feature dimensionality reduction – Image Classification and Recognition –Statistical Classifiers – Clustering Algorithms – Hierarchical and Partitional clustering.

UNIT – V IMAGE PATTERN RECOGNITION CASE STUDIES [ 9 ]

Image Understanding – Case Studies in Biometrics – Video Processing – Image Fusion – Image Security – Steganography and Watermarking – Stereo vision – Visual Effects – Image compositing.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

On Completion of this course, the student will be able to: Implement basic image processing algorithms using MATLAB tools Design an application that incorporates different concepts of Image processing Apply and explore new techniques in the areas of image enhancement, restoration, segmentation,

compression, wavelet processing and image morphology Critically analyze different approaches to implement mini projects

Explore the possibility of Applying image processing concepts in various domains

Reference Books :

1 S.Sridhar, Digital Image Processing, Oxford University Press, New Delhi, 2011.

2 Rafael C.Gonzalez and Richard E.Woods, Digital Image Processing, Third Edition, Pearson Education, New Delhi, 2008.

3 Alasdair McAndrew, Introduction to Digital Image Processing with Matlab, Cengage Learning, India, 2011.

4 Anil J Jain, Fundamentals of Digital Image Processing, PHI, 2011.

5 Wilhelm Burger and Mark J Berge, Digital Image Processing: An algorithmic Introduction using Java, Springer International Edition, 2008.

Page 13: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 13

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – II

MT16212 MULTIMEDIA COMPRESSION TECHNIQUES L T P C 3 0 0 3

Objectives: To understand the basic ideas of compression algorithms related to multimedia components – text,

speech, audio, image and video. To understand the principles and standards and their applications with an emphasis on underlying

technologies, algorithms and performance.

To appreciate the use of compression in multimedia processing applications To understand and implement compression standards in detail

UNIT – I FUNDAMENTALS OF COMPRESSION [ 9 ]

Introduction to Multimedia – Graphics, Image and Video representations – Fundamental concepts of video, digital audio – Storage requirements of multimedia applications – Need for compression – Taxonomy of compression Algorithms – Elements of Information Theory – Error Free Compression – Lossy Compression

UNIT – II TEXT COMPRESSION [ 9 ]

Huffman codes – Adaptive Huffman coding – Arithmetic coding – Shannon - Fano coding – Dictionary techniques – LZW family algorithms.

UNIT – III IMAGE COMPRESSION [ 9 ]

Image Compression: Fundamentals – Compression Standards – JPEG Standard – Sub-band coding – Wavelet Based compression – Implementation using Filters – EZW, SPIHT coders – JPEG 2000 standards – JBIG and JBIG2 standards.

UNIT – IV AUDIO COMPRESSION [ 9 ]

Audio compression Techniques – law, A-Law Companding – Frequency domain and filtering – Basic sub-band coding – Application to speech coding – G.722 – MPEG audio – Progressive encoding – Silence compression – Speech compression – Formant and CELP Vocoders.

UNIT – V VIDEO COMPRESSION [ 9 ]

Video compression techniques and Standards – MPEG video coding: MPEG-1, MPEG-2, MPEG-3 and MPEG-4 – Motion estimation and Compensation techniques – H.261 Standard – DVI technology – DVI real time compression – Current Trends in Compression standards.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

On Completion of this course, the student will be able to:

Implement basic compression algorithms

Be familiar with the use of MATLAB and its equivalent open source environments Design and implement some basic compression standards

Analyze different approaches of compression algorithms in multimedia related mini projects.

Know the use of compression in multimedia processing applications

Reference Books :

1 Khalid Sayood, Introduction to Data Compression, Morgan Kauffman Harcourt India, Third Edition, 2010.

2 David Solomon, Data Compression – The Complete Reference, Fourth Edition, Springer Verlog, New York, 2006.

3 Yun Q.Shi and Huifang Sun, Image and Video Compression for Multimedia Engineering, Algorithms and Fundamentals, CRC Press, 2003.

4 Mark S. Drew and Ze-Nian Li, Fundamentals of Multimedia, PHI, 2009.

Page 14: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 14

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – II

MT16213 MULTIMEDIA NETWORKS L T P C 3 0 0 3

Objectives:

To learn about audio, video compression techniques

To get the knowledge of streaming protocol and caching techniques.

To learn about Home networks and High-end IPTVs

UNIT – I AUDIO, VIDEO COMPRESSION AND TRANSMISSION [ 9 ]

Types of Networks – Standard Organizations – Requirements : Telephony – Streaming – IPTV – High End Video conferences – Webcast – Audio: Companding – Differential Quantization – Vocoders – Basics of Video Coding – JPEG – MPEG Data Streams – H.261 – Three Dimensional Video – Transcoder.

UNIT – II UNDERLYING NETWORK FUNCTIONS [ 9 ]

Real Time Protocol – Session Description Protocol – Real Time Streaming Protocol – Multicast – Quality of Service – NTP – Caching.

UNIT – III SYNCHRONIZATION, ADAPTATION AND SESSION INITIATION PROTOCOL [ 9 ]

End to End Model – Jitter – Packet Loss – Play Out Time – Congestion Control – Delay – Queuing – Storage and Retrieval – SIP Basics – PSTN interconnection – Security and Safety.

UNIT – IV VOIP PROTOCOLS AND STREAMING [ 9 ]

H.323 VoIP Family – Comparing SIP and H.323 – Gateway Control – Mobile VoIP – HTTP Live Streaming – HTTP Smooth Streaming – HTTP Dynamic Streaming – Content Delivery Networks – Providers – Common Issues for all Providers .

UNIT – V HOME NETWORKS AND HIGH-END IPTV [ 9 ]

IETF Home Standards – UPnP – Residential Gateway – High End IPTV – Live Media Broadcast – Datacast Protocols – Management Functions – Content Download Service – Deployment – Set Top Box Functions – Integration into Other Systems.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Enhance the knowledge of audio compression and video compression techniques like JPEG, MPEG and H.261.

Understand about RTP, RTSP and NTP.

Be familiar with Congestion control and PSTN connection.

Get the knowledge of Mobile VoIP various HTTP streaming.

Be familiar with Home networks and IPTV.

Reference Books :

1 Hans, W.Barz ,Gregory and A.Bassett, Multimedia Networks protocols, Designs and applications, Wiley publishers, First Edition, 2016.

2 Juliet Bates, Chris Gallon, Matthew Bocci and Tom Taylor, Converges Multimedia Networks, John Wiley & sons Ltd, 2006.

3 Syed Mahbubur Rahman, Multimedia Networking: Technology, Management and Applications, Idea group Publishing, 2001.

4 Jenq-Neng Hwang, Multimedia Networking: From theory to Practice, Cambridge University Press, First Edition, 2009.

Page 15: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 15

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – II

MT16214 3D MODELING AND RENDERING L T P C 3 0 0 3

Objectives:

To understand the fundamentals of 3D concepts and techniques.

To gain knowledge on space curve, surface generation and visual surface detection techniques.

To understand modeling and animation techniques.

UNIT – I 3D CONCEPTS AND TECHNIQUES [ 9 ]

Introduction – 3D Transformation – Rotation and Reflection about an Axis – 3D Modeling Schemes – Types of Projections: Orthographic Projection – Isometric Projection – Oblique Projection – Perspective Projection – One, Two and Three Point Perspective – Viewing Parameters – 3D Clipping – View Volume.

UNIT – II SPACE CURVE [ 9 ]

Introduction – Parametric cubic polynomial curves – Bezier curves – Spline representation – Spline as blending function – Spline as curve design tool – Closed curves based spline – Changing knot function – B spline basis unction – B spline with multiple knots – Open B spline curves – General characteristics of B spline curves – rational B spline curves – Special cases of Nurbus curve design.

UNIT – III SURFACE GENERATION AND DETECTION [ 9 ]

Parametric Representation – Quadric Surfaces – Bezier Surface – Bezier Surfaces Patch – B-Spline Surfaces – Rational B-Spline Surfaces – Visible Surface Detection: Hidden Surface Removal Algorithms – Back Face Detection Method – Depth Buffer Method – Painter’s Algorithm – Binary Space Partitioning Tree Method – Hidden Line Removal Method

UNIT – IV ILLUMINATION MODELS AND SURFACE RENDERING [ 9 ]

Illumination Model and Light Sources – Specular Reflection – Intensity Attenuation – Shadow – Reflectivity and Refractivity – Radiosity Lighting Model – Texturing: Surface Texture – Bump Mapping – Environment Mapping – Shading Methods: Flat Shading Models – Z- Flat Shading – Lambert Flat – Smooth Shading Models – Gouraud Shading – Phong Shading.

UNIT – V MODELING TECHNIQUES AND ANIMATION [ 9 ]

Structures and Hierarchical Modeling – Hierarchical Modeling With Structures – Advanced Modeling Techniques – Procedural Models – Fractals – Grammar Based Models – Physical Based Modeling – Animation : Devices For Producing Animation – Computer-Assisted Animation – Video Formats – Frame By Frame and Real Time Animation Techniques.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

On Completion of this course, the student will be able to:

Understand the fundamentals of 3D concepts and techniques.

Gain knowledge on space curve in 3D.

Understand surface generation and detection techniques.

Understand about illumination models and surface rendering.

Gain knowledge on modeling techniques and animation.

Reference Books :

1 Amarendra N. Sinha and Arun D Udai, Computer Graphics, Tata McGraw Hill, 2010.

2 Nicholas Bernhardt Zeman, Essential Skills for 3D Modeling, Rendering, and Animation, A K Peters/CRC Press, 2014.

3 Donald Hearn and M. Pauline Baker, Computer Graphics - C Version, Pearson Education/PHI Learning, 2014.

4 Ellery Connell, 3D for Graphic Designers, Wiley India Pvt Ltd, 2011

5 James D. Foley, Andries van Dam, K. Feiner and John F. Hughes, Computer Graphics-principles and practice in C, Pearson Education, Second Edition, 2011.

6 Jeffrey J. McConnell, Computer Graphics Theory into Practice, CBS Publishers, 2007.

Page 16: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 16

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – II

MT16215 WEB DESIGN AND PROGRAMMING L T P C 3 0 0 3

Objectives:

To provide an opportunity to practice various scripts like HTML, XML and JavaScript.

To design the web application using CSS and built in functions.

To learn how to design and develop JSP Pages

To understand the concepts of ASP.NET

UNIT – I STYLE SHEETS AND SCRIPTING LANGUAGE [ 9 ]

Basics of Internet – Web browser – Web Server – HTML forms – Cascading Style Sheets Cascading Style Sheets – Introduction – Defining Your Own Styles – Properties and Values in Styles – Style Sheets – A Worked Example – Formatting Blocks of Information – Layers – Positioning Elements – Box Model – Text flow – Scripting Language Java Script – Basics – Control Statements – Function – Array – Objects.

UNIT – II JAVA SERVER PAGES [ 9 ]

Java Web Technologies – Servlets – Java Server Pages – Java Server Faces – Web Technologies in Netbeans – Creating and Running a Simple Application in Netbeans – Examining a JSP File – Examining a Page Bean File – Event – Processing Life Cycle – Relationship Between the JSP and Page Bean Files JSF Components – Text and Graphics Components – Validation Using Validator Components and Custom Validators

UNIT – III XML [ 9 ]

XML: Creating Markup with XML – Namespace – Defining Data for Web Applications – Basic XML – Document Type Definition – XML Schema – Document Object Model – Presenting XML – Handling XML With Perl – Using XML Parser – Handling the DOM with Perl – Xpath .

UNIT – IV RICH INTERNET APPLICATIONS CLIENT TECHNOLOGIES [ 9 ]

Adobe Flash CS3 – Flash Movie Development – Hands on examples – Publishing Flash Movie – Special Effects –Website Splash Screen – Building an Interactive Game – Adobe Flex TM2 and Applications – Flex Platform – Overview – Simple user Interface – Access XML data – Interactive Server Side Applications – Creating Chats and Graphics – Adobe Integrated Runtime (AIR)

UNIT – V RICH INTERNET APPLICATIONS SERVER TECHNOLOGIES [ 9 ]

Web Servers (IIS and Apache) – Database – MySQL – Installation – Setting Up User Account – Creating Database – Basic Queries – ADO.NET Object Model – ASP.NET – Simple Web Forms Examples – Web Controls – Session Tracking.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Learn the use of HTML in web development

Develop simple web application using scripting languages

Understand the use of XML technologies in web development

Learn the process of developing Web applications with client side technology.

Explore use of ASP.NET in Web Development

Reference Books :

1 Harvey M. Deitel, Paul J. Deitel and Abbey Deitel, Internet and World Wide Web How to Program, Pearson Education, Fifth Edition, 2014.

2 Chris Bates, Web Programming – Building Internet Applications, Wiley, 2014.

3 Jon Duckett, Beginning Web Programming with HTML, XHTML, and CSS, Wiley Publishing Inc, 2011.

4 Heather Williamson, The Complete Reference XML, Tata Mc–Graw Hill, 2009

5 Paul S. Wang, Dynamic Web Programming and HTML5, CRC Press, 2013.

Page 17: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 17

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – II

MT16221 WEB DESIGN AND PROGRAMMING LABORATORY L T P C 0 0 3 2

Objective:

To develop Programming skills using various scripting languages and technologies.

List of Experiments:

1. Develop the XHTML document using Text styling, Linking, Images, Lists, Table.

2. Create an XHTML document that has a form with Text box, Radio Button, Selection box, Checkbox,Submit and

Reset buttons

3. Implement Cascading Style Sheets using XHTML document.

4. Write JavaScript using control statements.

5. Develop JavaScript using arrays and functions.

6. Create and save an XML document at the server, which contains 10 users information. Write a program which

takes User Id as input and returns the user details by taking the user information from the XML document.

7. Build an interactive game using Adobe Flex TM2

8. Develop a Library Management System using JSP.

9. Develop a website for Airline Ticket reservation using ASP.NET.

10. Develop a website to display the student result using ASP.NET.

Total = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Learn how to develop Web page using HTL

Develop simple web application using scripting languages

Understand the use of XML technologies in web development

Learn the process of developing Web applications with client side programming.

Develop Web page using ASP.NET.

Page 18: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 18

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – II

MT16222 3D MODELING AND RENDERING LABORATORY L T P C 0 0 3 2

Objective:

To identify personal interests and abilities related to 3D Graphics careers.

To identify 3D graphics and animation job titles, such as: Animator, Technical Director, Rigger, 3D Modeler, Lighter, Texture Artist, Special Effects.

To achieve high standards of personal performance with a positive work ethic and attitude.

List of Experiments:

Implement the following using AUTODESK MAYA:

1. Maya Interface : Introduction to the User Interface

2. Working in 3D

3. To create an object using a tool from the Shelf

4. Creating, Manipulating and Viewing objects

5. Surface-Nurbs primitives

6. Polygon primitives

7. Sub Division Primitives

8. Creating Curves

9. Extruding polygon faces and edges

10. Modeling : Using NURBS Curves to Create a Model

11. Texturing and Lighting : Understanding Maya Textures

12. Rendering : Converting 3D Scenes to 2D Images

Total = 45 Periods

Course Outcomes:

On Completion of this course, the student will be able to:

Work with and navigate the unique features of the digital 3D modeling workspace to create 3D objects.

Identify characteristics of rendering 3D objects for optimal system processing and analysis.

Create a 3D environment featuring lighting and textures.

Create basic 3D models and animations.

Evaluate digital 3D projects, identify items for improvement and implement changes

Page 19: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 19

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – III

MT16311 MULTIMEDIA INFORMATION STORAGE AND RETRIEVAL L T P C 3 0 0 3

Objectives:

To introduce the basics of multimedia information storage technology, techniques for analysis, representation and retrieval that is commonly used in industry.

To compare and contrast information retrieval models and internal mechanisms such as Boolean, Probability, and Vector Space Models.

To outline the structure of queries and media elements.

To critically evaluate multimedia retrieval system effectiveness and improvement techniques

UNIT – I FUNDAMENTALS OF MEDIA [ 9 ]

Introduction – Media Types – Media Understanding – Description of Audio, Visual spectral and Video - Storage networks – Storage medium.

UNIT – II TEXT RETRIEVAL AND MUSIC [ 9 ]

Text Information retrieval: Information retrieval system – Catalog and indexing – Automatic indexing – Term clustering – User search Techniques – Information Visualization – Fundamentals – Instantaneous Features – Intensity – Tonal Analysis – Musical Genre – Similarity and Mood.

UNIT – III IMAGE RETRIEVAL [ 9 ]

Content-based image retrieval – Techniques – Feature extraction – Integration – Similarity – Feature Indexing – Interactive retrieval – MPEG-7 standard.

UNIT – IV VIDEO RETRIEVAL [ 9 ]

Content Based Video Retrieval – Video Parsing – Video abstraction and Summarization – Video Content Representation – Indexing and retrieval – Video Browsing Schemes – Example of Video Retrieval Systems.

UNIT – V RETRIEVAL METRICS AND MODERN IR [ 9 ]

Average recall and average precision – Harmonic mean – Evaluation of a search engine – Relevance Issue – Kappa Measure – Quality versus Quantity – Possible factors which influence outcome of a search – Grandfield Experimental Study– Parallel IR – Distributed IR – Trends and research Issue.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Learn the basics of multimedia information storage technology

Learn the techniques for analysis, representation and retrieval that is commonly used in industry.

Compare and contrast information retrieval models and internal mechanisms such as Boolean, Probability, and Vector Space Models.

Outline the structure of queries and media elements.

Evaluate Multimedia retrieval system effectiveness and improvement techniques.

Reference Books :

1 Christopher D. Manning, Prabhakar Raghavan and Hinrich Schütze, Introduction to Information Retrieval, Cambridge University Press, 2008

2 Ricci, F Rokach, L. Shapira, B., Kantor, P.B. (Eds.), Recommender Systems Handbook. First Edition., 2011,

3 Brusilovsky, Peter et.al. The Adaptive Web: Methods and Strategies of Web Personalization. Berlin: Springer, 2007.

Page 20: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 20

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – II (ELECTIVE)

MT16261 BIOMETRICS L T P C 3 0 0 3

Objectives:

To understand the basic ideas and principles in biometrics

To understand the basic concepts of statistical data analysis for validating the biometrics projects

To familiarize the student with the image processing facilities in Matlab and its equivalent open source tools like OpenCV

To appreciate the use of biometrics Industrial applications and to understand the role of biometrics in modern security environment

To understand and implement more advanced topics in current research literature.

UNIT – I FUNDAMENTALS OF BIOMETRICS [ 9 ]

Introduction – Benefits of biometric security – Verification and identification – Basic working of biometric matching – Accuracy – False match rate – False non-match rate – Failure to enroll rate – Derived metrics – Layered biometric solutions.

UNIT– II FINGER AND FACIAL SCAN [ 9 ]

Finger scan – Features – Components – Operation Steps – Competing finger Scan technologies – Strength and weakness – Types of algorithms used for interpretation – Facial Scan – Features – Components – Operation Steps – Competing facial Scan technologies – Strength – weakness.

UNIT– III IRIS AND VOICE [ 9 ]

Iris Scan - Features – Components – Operation Steps – Competing iris Scan technologies – Strength and weakness. Voice Scan - Features – Components – Operation (Steps) – Competing voice Scan (facial) technologies – Strength and weakness.

UNIT– IV PHYSIOLOGICAL BIOMETRICS [ 9 ]

Other physiological biometrics – Hand scan – Retina scan – AFIS (Automatic Finger Print Identification Systems) – Behavioral Biometrics – Signature scan – Keystroke scan – Multimodalities and combining biometrics for improving performance.

UNIT– V BIOMETRICS APPLICATION DEVELOPMENT [ 9 ]

Biometrics Application – Biometric Solution Matrix – Bio privacy – Comparison of privacy factor in different biometrics technologies – Designing privacy sympathetic biometric systems – Biometric standards – BioAPI – BAPI – Biometric middleware – Biometrics for Network Security – Statistical measures of Biometrics.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Implement basic biometrics related algorithms

Familiar with the use of MATLAB and its equivalent open source environments.

Study the strength and weakness of iris and voice.

Design and implement industrial applications that incorporates different concepts of biometrics

Critically analyze different approaches to implement mini projects in industrial environment and in security related projects.

Reference Books :

1 Samir Nanavati, Michael Thieme, Raj Nanavati, Biometrics – Identity Verification in a Networked World John WILEY and Sons, 2002.

2 Anil K. Jain, Arun A. Ross and Karthik Nandakumar, Introduction to Biometrics, Springer, 2011

3 James L. Wayman, Anil K. Jain, Davide Maltoni, and Dario Maio, Biometric Systems: Technology, Design and Performance Evaluation, Springer, 2004

4 Stan Z. Li and Anil K. Jain, Handbook of Face Recognition, 2005.

Page 21: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 21

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – II (ELECTIVE)

MT16262 GAME PROGRAMMING L T P C 3 0 0 3

Objectives:

To understand principles of Game design and Game Engine design.

To get knowledge in implementing games in various platforms.

To make use of artificial intelligence in gaming.

To learn different types of animation.

UNIT– I FUNDAMENTAL OF GAME PROGRAMMING [ 9 ]

Fundamental of Game Programming: Input – Applying Game Logic – Game Loops – Game Timings – Core Architecture Using State Controls – ACTOR Management – Collision Detection – Artificial Intelligence – 2D Graphics Programming: Rendering – Render Loop – Handling Window Events.

UNIT– II GAME NETWORK AND GAME DATABASE [ 9 ]

Local Area Networking for Java Games: The Communication Protocol – Socket – Using the Java Networking APIs – The Game Networking Process – Protocol – Game Databases and JDBC: Relational Databases – SQL–The JDBC API – Database Design Essentials – Keys – Indexes and Referential Integrity – Database Design Essentials – JDBC Performance Techniques – Data Caching

UNIT– III 3D GAME [ 9 ]

3D Graphics Foundations: 3D Graphics in Computer Animation and Real Time – 3D Hardware Acceleration – 3D Game History – 3D Graphics Condensed Soup – Creating Game Audio Using: Overview of Audio Components – Basics – OpenAL Basics – Tinkering with Source and Listener Properties – Sound Rendering Contexts.

UNIT –IV GAME AGENTS [ 9 ]

State Driven Agent Design: Finite State Machine – State Transition Tables – Embedded Rules – Base Game Entity Class – Goal Driven Agent: Introduction – Implementation – Goal Arbitration – Desirability Calculation – Fuzzy Logic: Crisp Sets – Set Operators – Fuzzy Sets – Membership Functions – FLV – Fuzzy Rules – Fuzzy Inference – Defuzzification

UNIT –V GAME DEVELOPMENT [ 9 ]

Practical Path Planning: Navigation Graph Construction – The Raven Navigation Graph – A* Algorithm, Developing 2D and 3D interactive games – Tile Based Games – Puzzle games – Single Player games – Multi Player games.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Discuss the concepts of game design and development.

Design the processes and use mechanics for game development.

Explain the core architectures of game programming.

Use game programming platforms, frame works and engines.

Create interactive games.

Reference Books :

1 David H. Eberly, 3D Game Engine Design, Second Edit on: A Practical Ap roach to Real-Time Computer Graphics, Morgan Kaufman, Second Edition, 2006.

2 Roger E. Pedersen, “Game Design Foundations”, Edition 2, Jones & Bartlett Learning, 2009.

3 Mike McShaf rfy, Game Coding Complete, Third Edition, Charles River Media, 2009.

4 Jonathan S. Harbour, Beginning Game Programming, Course Technology PTR, Third Edition, 2009.

5 Ernest Adams and Andrew Rolings, Fundamentals of Game Design, Prentice Hall, First edition, 2006.

Page 22: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 22

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – II (ELECTIVE)

MT16263 MULTIMEDIA SIGNAL PROCESSORS L T P C 3 0 0 3

Objective:

To understand the various programmable DSPs and DCT architectures for high end devices.

UNIT – I PROGRAMMABLE AND MEDIA DSPS [ 9 ]

Architecture overview – Hard real time processing – Low cost – Minimum Code Size – Low Power Dissipation – Specialization – Media MPU – Video DSP and Media Processors

UNIT – II WIRELESS DSP AND MOTION ESTIMATION DESIGN [ 9 ]

Digital Wireless Communications - Wireless Digital Signal Processors - Domain Specific DSP Core: Lode – Block–Matching Motion Estimation – Motion Vector Search Algorithms – Circuit Architectures for Motion Vector Search – Video Encoder LSI Implementations – Motion Estimation

UNIT – III WAVELET VLSI AND DCT ARCHITECTURES [ 9 ]

Introduction to Wavelet Transforms – The One-Dimensional DWT – Architectures for 2D DWT – DCT Algorithms – DCT Architectures

UNIT – IV LOSSLESS CODERS AND VITERBI DECODERS [ 9 ]

Huffman Based Lossless Coding – Implementation of Huffman Based Encoders and Decoders – Arithmetic Coding – Implementation of Arithmetic Coders – Systems Issues – Viterbi Algorithm – Transition Metric Unit – Add – Compare –Select Unit – Synchronization of Coded Streams

UNIT – V PIPELINED RLS [ 9 ]

Introduction – The QRD-RLS Algorithm – Pipelining Problem in QRD-RLS – Pipelining for Low-Power Designs – Star–RLS Systolic Array Algorithm – Pipelined Star-RLS (PSTAR-RLS) Architecture – Numerical Stability Analysis – Finite-Precision Analysis – A 100 MHz Pipelined RLS Adaptive Filter.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

On completion of this course, the student will be able to:

Understand complete Programmable, Media and Wireless DSPs

Know the concepts of wavelet VLSI.

Learn the DCT architecture and DCT algorithms

Understand Huffman Based Lossless Coding and Viterbi Algorithm

Understand various pipelined RLS Algorithms

Reference Books :

1 Srdjan Stanković, Irena Orović and Ervin Sejdić, Multimedia Signals and Systems, Springer Science &

Business Media, 2012.

2 Keshab K. Parhi and Takao Nishitami, Digital Signal Processing for Multimedia Systems, Marcel Dekker Inc,

1999. 3 Keshab K. Parhi, VLSI Digital Signal Processing Systems: Design and Implementation, Wiley Edition, 1999.

Page 23: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 23

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – II (ELECTIVE)

MT16264 MULTIMEDIA SECURITY L T P C 3 0 0 3

Objectives:

To understand the multimedia security needs

To evaluate the multimedia security weakness through forensics

To enable the students to develop secured multimedia application

UNIT – I MULTIMEDIA SYSTEM OVERVIEW [ 9 ]

Multimedia compression technologies and standards – VCD – DVD – MPEG – 1/2/4/21.

UNIT – II SECURED MULTIMEDIA [ 9 ]

Secured Multimedia – Digital Rights Management Systems and Technical Trends – Multimedia encryption – Digital Watermarking – Security Attacks.

UNIT – III MULTIMEDIA AUTHENTICATION [ 9 ]

Pattern, Speaker and Behavior Recognition – Speaker Recognition – Face Recognition.

UNIT – IV MULTIMEDIA FORENSICS [ 9 ]

Digital Forensics taxonomy – Goals/requirements – Forensic Data Acquisition – Digital Forensics Tools – Forensics Analysis and Validation – File and Network Forensics – Techniques – Application forensics – Email – Graphics and Multimedia Forensics.

UNIT – V MULTIMEDIA SECURITY APPLICATIONS [ 9 ]

Media Sensor Network – Voice over IP (VoIP) Security – DTH – Video Conference.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Distinguish about the compression technologies for multimedia data.

Discern about the encryption and decryption techniques used in Multimedia data.

Deal about how to recognize the data provided by the multimedia system.

Deal about the forensics of multimedia data in all aspect.

Understand the applications of multimedia security systems

Reference Books :

1 Wenjun Zeng, Heather Yu and Ching – Yung Lin, Multimedia Security technologies for Digital rights Management, Elsevier Inc 2006.

2 Chun-Shien Lu, Multimedia Security: Steganography and Digital Watermarking techniques for Protection of

Intellectual Property, Springer Inc 2007.

3 Borko Furht, Darko Kirovski, Multimedia Security Handbook, CRC Press, 2004.

Page 24: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 24

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – II (ELECTIVE)

MT16265 SPEECH AND AUDIO PROCESSING L T P C 3 0 0 3

Objectives: To provide an introduction to the fundamental principles and techniques in audio processing. To provide an overview of audio enhancement

To provide details about audio compression techniques

To review latest trends and future technologies in speech processing.

UNIT – I DIGITAL AUDIO [ 9 ]

Basics of Digital Audio – Digitization of Sound – Quantization and Transmission – Auditory Perception – Electro acoustics – Mixers - Basic audio processing – Sampling – Normalization – Noise Reduction – Audio processing – Analysis window sizing – Visualisation: Digital Audio Principles – Digital and Analog Recording – A/D and D/A Converter – Direct Stream Digital (DSD) – Resolution of an Audio Signal – Pitch Shifting and Time Stretching – Audio Data Reduction.

UNIT – II SPEECH PROCESSING [ 9 ]

Speech – Speech production – Characteristics of speech– Speech understanding: Speech communications – Quantisation – Parameterisation – Pitch models – Analysis-by-synthesis – Speech Technologies – Speech Coding – Text-to-Speech Synthesis – Early Knowledge-Based Text-to-Speech (TTS) Synthesis – Unit-Selection Synthesis – Statistical Parametric Synthesis – Speech Recognition.

UNIT – III MUSICAL SOUND SYNTHESIS AND MIDI [ 9 ]

Acoustic Instruments – Sound Synthesis in Music – MIDI Principles – Hardware aspects – Structure of MIDI Messages – General MIDI – MIDI-to-Wav Conversion – Scalable Polyphonic MIDI (SPMIDI) – RMID and XMF Files, SAOL and SASL in MPEG 4 Structured Audio – MIDI over USB – MIDI over IEEE 1394.

UNIT – IV STEREO AND SURROUND SOUND [ 9 ]

Two-Channel Stereo – Principles of Loudspeaker Stereo and Binaural or Headphone Stereo – Loudspeaker Stereo Over Headphones and Vice Versa – Two-Channel Signal Formats and Microphone techniques – Binaural Recording and Dummy Head Techniques – Spot microphones and Two-Channel Panning Laws--Surround Sound – Three Channel Stereo – Four Channel Surround – 5.1 Channel Surround and other Multichannel Configurations- Surround Sound Systems – Matrixed Surround Sound Systems-Digital Surround Sound Formats – Dolby Digital – DTS –Ambisonics – Surround Sound Monitoring – Surround Sound Recording Techniques – Multichannel Panning Techniques.

UNIT – V MPEG AUDIO COMPRESSION AND FORMATS [ 9 ]

Basic Audio Compression Techniques – ADPCM in Speech Coding – G.726ADPCM – Vocoders – MPEG Audio Compression – Psychoacoustics – MPEG Audio – Digital Audio Formats and Interchange – Audio File Formats for Digital and Disk formats – Interconnecting Digital Audio Devices

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Implement basic algorithms related to Audio Compression.

Analyze audio compression formats.

Understand the musical sound synthesis and MIDI.

Critically analyze the role of surround sound in modern technologies.

Understand the MPEG audio compression and formats.

Reference Books :

1 Francis Rumsey & Tim McCormick , Sound and Recording, Focal Press, Elsevier Ltd, Sixth Edition, 2009

2 Ian Mcloughlin, Applied Speech and Audio Processing With MAT LAB Examples, Cambridge University

Press, Cambridge, New York, Melbour, 2009.

3 Ville Pulkki and Matti Karjalainen, Communication Acoustics an Introduction to Speech, Audio and

Psychoacoustics, John Wiley & Sons Ltd, 2015.

4 Ze-NianLi and MarkS.Drew, Fundamentals of Multimedia, PHI Learning Pvt. Ltd, 2010.

Page 25: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 25

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – III (ELECTIVE)

MT16361 PRINCIPLES OF FILM DEVELOPMENT L T P C 3 0 0 3

Objectives: To know step by step procedure in making a Documentary of their topic.

To produce a documentary as part of their assessment.

UNIT – I GRAMMAR OF DOCUMENTARIES [ 9 ]

Origins and History of Documentary Films – Introduction to Narrative and Non-narrative Filmmaking – Elements of documentaries – Aesthetics and Authorship – Documentary theory and Issue of representation – Types of documentaries – Approaches in Science – Nature filmmaking – Ethnographic Documentary filmmaking – Creative approaches – Case Studies.

UNIT – II DEVELOPING THE STORY – PREPRODUCTION [ 9 ]

Understanding story, story basics, finding the story – Developing story ideas, story structure, time on screen, researching for documentaries, kinds of information, finding people as sources, information management, choosing a subject – Visual scope and visual evidence, permissions, funding, pitching your ideas – Proposals, Elements of proposals, Resources for writing proposals, attracting funding – Ethics in documentary filmmaking.

UNIT – III SHOOTING THE STORY – PRODUCTION [ 9 ]

Treatment, unscripted and scripted documentaries, planning, and collecting the material – adapting the script, ways to tell a story – Interviews, recce, use of talents, re-enactments, reconstruction and docudrama – Choosing the team, bringing together right people, working together, getting the right camera and equipment’s, camerawork, producing, directing, and directing the crew – Shooting, lighting, location sound, problems and issues

UNIT – IV BUILDING THE STORY – POST PRODUCTION [ 9 ]

Building the story in the editing table, working with an editor – Crafting the story, Finding your style – The paper edit, reviewing the footage, assembling of rushes, editing the footages, applying effects, transition – Adding sound effects and music, special effects dubbing, rerecording – Narration – Voiceover, using Music, titles and graphics – Colour exposure and colour correction – Credits and acknowledgements.

UNIT – V PROJECT – PRACTICE AND SCREENING [ 9 ]

Project involving the production and direction of an individually or group authored documentary film – Accompanied by a research dossier – A proposal and a treatment. The students will also ensure the exhibition of their films for reviews

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Gain adequate skills to produce a documentary for broadcast.

Apply principles of factual program production in their future productions.

Gain knowledge about basics of how to develop story.

Understand the concepts of unscripted and scripted documentaries.

Ensure the exhibition of their films for reviews.

Reference Books :

1 Genevieve Jolliffe and Andrew Zinnes. The Documentary Film Makers Handbook: A Guerilla Guide,

Continuum International Publishing Group, New York, 2006

2 Louise Spence and Vinicius Navarro, Crafting Truth: Documentary Form and Meaning, Rutgers University

Press, New Brunswick, N.J., 2011.

3 Andy Glynne, Documentaries and How to Make Them, Kamera Books, Harpenden, Herts, 2012.

4 Alan Rosenthal, Writing, Directing, and Producing Documentary Film, SIU Press, 2007.

5 Clifford Thurlow, Making Short Films: The Complete Guide from Script to Screen, Oxford International

Publishers, Second Edition, 2008

6 Michael Rabiger, Directing the Documentary, Focal Press, 2004.

7

James R. Martin, Create Documentary Films, Videos, and Multimedia: A Comprehensive Guide to Using

Documentary Storytelling Techniques for Film, Video, the Internet and Digital Media Nonfiction Projects (Films

Cinema), Real Deal Press, 2010.

Page 26: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 26

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – III (ELECTIVE)

MT16362 MULTIMEDIA SERVER MANAGEMENT L T P C 3 0 0 3

Objective: To know about the area of application and environments client scheduling, storage sub-system and cache

management.

UNIT – I MULTIMEDIA SERVER APPLICATIONS AND ENVIRONMETNS [ 9 ]

Introduction – Multimedia Applications – Multimedia Server Environment – Requirements – Client Environment – Network Environment – ATM Model – Multimedia Server Architecture and Components – Hardware – Software –

Server Topology.

UNIT – II CLIENT SCHEDULING [ 9 ]

Client Session Scheduling – QoS Specification – Capacity Estimation – Logical Channel Setup – Client Request Scheduling – Client Scheduling Issues – VCR Control Operations – Batching Policies – Time-Varying Workloads – Scheduling in System Components.

UNIT – III THE STORAGE SUB SYSTEM [ 9 ]

Storage Management Overview – Storage System Architecture – Placement of Multimedia Data in Storage Devices – Retrieval – Issues in I/O Scheduling – Single Disk Issue – Multiple Disk Organization – NAS Architecture – Management – SAN Architecture – Management – Issues – Storage Hierarchy.

UNIT – IV CACHE MANAGEMENT [ 9 ]

Caching Overview – Objectives – Data Prefetching – Relationships to Buffering and Caching – Cache Management Policies – Memory Cache – Caching Policies – Caching Among Disks – Distributed Disk Caching – Storage Networks – Management of Storage Networks.

UNIT – V RELATED ISSUES [ 9 ]

Performances Evaluation of the GIS Policy – Affinity Routing – Load Balancing – Network Backup Services – Backup Clients – Performance Gains as Result of Network Backups – Deadline Driven Scheduling and Unconstrained Data Placement – Fault Tolerance Issues in Media Servers.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Analyze the right multimedia server and its architecture models.

Apply QoS to multimedia network applications with client scheduling techniques.

Organize the storage system with the multimedia content.

Identify efficient routing techniques to multimedia network applications

Obtain the cache management policies.

Reference Books :

1 Dinker Sitaram and Asit Dan, Multimedia Servers – Applications, Environments and Design, Morgan Kaufmann Publishers, 2000.

2 Ali Dashti, Seon Ho Kim, Cyrus Shahabi and Roger Zimmermann, Streaming Media Server Design, IMSC Press Multimedia Series, 2003.

3 Ulf Troppens, Rainer Erkens, Wolfgang Muller and Rachael Waddington, Storage Networks Explained Basics and applications of Fiber Channel SAN, NAS iSCSI and Infiniband, John Wiley and Sons, 2004.

4 W.Curtis Preston, Using SANs and NAS, O’Reilly Media, Inc., 2002

Page 27: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 27

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – III (ELECTIVE)

CS16003 CLOUD COMPUTING (Common to CS and MMT )

L T P C 3 0 0 3

Objectives:

To understand the concepts of cloud and utility computing

To understand the various issues in cloud computing

To familiarize themselves with the lead players in cloud

To appreciate the emergence of cloud as the next generation computing paradigm

To be able to set up a private cloud.

UNIT – I BASICS OF CLOUD COMPUTING [ 9 ]

Evolution of Cloud Computing – System Models for Distributed and Cloud Computing – NIST Cloud Computing Reference Architecture – IaaS – On - demand Provisioning – Elasticity in Cloud – Examples of IaaS Providers – PaaS – Examples of PaaS Providers – SaaS – Examples of SaaS Providers – Public , Private and Hybrid Clouds – Google App Engine, Amazon AWS – Cloud Software Environments – Eucalyptus, Open Nebula, Open Stack, Nimbus.

UNIT – II VIRTUALIZATION [ 9 ]

Basics of Virtual Machines – Process Virtual Machines – System Virtual Machines – Emulation – Interpretation – Binary Translation – Taxonomy of Virtual Machines -- Virtualization – Management Virtualization – Hardware Maximization – Architectures – Virtualization Management – Storage Virtualization – Network Virtualization

UNIT – III VIRTUALIZATION INFRASTRUCTURE [ 9 ]

Comprehensive Analysis – Resource Pool – Testing Environment –Server Virtualization – Virtual Workloads – Provision Virtual Machines – Desktop Virtualization – Application Virtualization – Work with App – Mobile OS for smart phones – Mobile Platform Virtualization – Collaborative Applications for Mobile platforms

UNIT – IV PROGRAMMING MODEL [ 9 ]

Map Reduce Hadoop Distributed File Systems – Hadoop I/O – Developing Map Reduce Applications – Working of Map Reduce – Types and Formats – Setting up Hadoop Cluster

UNIT – V CLOUD INFRASTRUCTURE AND SECURITY [ 9 ]

Architectural Design of Compute and Storage Clouds – Inter Cloud Resource Management – Resource Provisioning and Platform Deployment – Global Exchange of Cloud Resources – Security Overview – Cloud Security Challenges – Software as a Service Security – Security Governance – Risk Management – Security Monitoring – Security Architecture Design – Data Security – Application Security – Virtual Machine Security.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Articulate the main concepts, key technologies, strengths and limitations of cloud computing

Identify the architecture, infrastructure and delivery models of cloud computing

Explain the core issues of cloud computing such as security, privacy and interoperability

Choose the appropriate technologies, algorithms and approaches for the related issues

Understand the concepts of security techniques.

Reference Books :

1 Rajkumar Buyya, Christian Vecchiola, and Thamarai Selvi, “Mastering Cloud Computing”, Tata McGraw Hill, 2013

2 Tom White, "Hadoop: The Definitive Guide", Yahoo Press, 2012.

3 John W.Rittinghouse and James F.Ransome, "Cloud Computing: Implementation, Management, and Security", CRC Press, 2010.

4 Toby Velte, Anthony Velte, Robert Elsenpeter, "Cloud Computing, A Practical Approach", McGraw-Hill Osborne Media, 2009.

Page 28: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 28

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – III (ELECTIVE)

MT16364 VIRTUAL REALITY L T P C 3 0 0 3

Objectives:

To learn about Geometric modeling and Virtual environment.

To understand the Virtual Hardware and Software.

To know the Virtual Reality applications.

UNIT – I INTRODUCTION TO VIRTUAL REALITY [ 9 ]

Virtual Reality and Virtual Environment : Introduction – Computer graphics – Real time computer graphics – Flight Simulation – Virtual environments – Requirement for virtuality – Benefits of virtual reality – Historical development of VR : Introduction – Scientific Landmark – 3D Computer Graphics : Introduction – The Virtual world space – positioning the virtual of server – The perspective projection – Human vision – Stereo perspective projection – 3D clipping – Colour theory – Simple 3D modeling – Illumination models – Reflection models – Shading algorithms – Radiosity – Hidden-Surface removal – Realism – Stereographic usages.

UNIT – II GEOMETRIC MODELING [ 9 ]

Geometric Modeling : Introduction – From 2D to 3D – 3D space curves – 3D boundary representation – Other modeling strategies – Geometrical Transformations: Introduction – Frames of reference – Modeling transformations – Instances – Picking – Flying – Scaling the VE – Collision detection – A Generic VR system : Introduction – The virtual environment – The Computer environment – VR Technology – Model of interaction – VR System.

UNIT – III VIRTUAL ENVIRONMENT [ 9 ]

Animating the Virtual Environment: Introduction – The dynamics of numbers – The animation of objects – Shape and object in between – Free-form deformation – Particle system – Physical Simulation : Introduction – Objects falling in a graphical field – Rotating wheels – Elastic collisions – Projectiles – Simple pendulum – Springs – Flight dynamics of an aircraft.

UNIT – IV VR HARDWARES AND SOFTWARES [ 9 ]

Human factors : Introduction – The age – The ear – The semantic senses – Equilibrium – Conclusions - VR Hardware : Introduction – Sensor Hardware – Head-coupled displays – Aquatic hardware – Integrated VR systems-VR Software: Introduction – Modeling virtual world – Physical simulation – VR Polkits

UNIT – V VR APPLICATION [ 9 ]

Introduction – Engineering – Entertainment – Science – Training– The Future: Introduction – Virtual Equipment’s – Modes of interaction – Conclusion.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Be aware of the main learning theories, with emphasis on those that justify using VR applications in the teaching process and know how to install and manage an online virtual world server.

Be familiar with Geometric modeling.

Know how to use virtual agents and non-playable characters.

Be familiar with Human factors, VR Hardware devices.

Be aware of various VR applications.

Reference Books :

1 John Vince, Virtual Reality Systems , Pearson Education Asia, 2007

2 Adams, Visualizations of Virtual Reality, Tata McGraw Hill, 2000.

3 Grigore C. Burdea, Philippe Coiffet , Virtual Reality Technology , Wiley-Interscience, First Edition,1994 4 WilWilliam R. Sherman and Alan B. Craig, Understanding Virtual Reality: Interface, Application, and Design,

Morgan Kaufmann, First Edition,2002.

Page 29: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 29

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – III (ELECTIVE)

MT16365 DIGITAL VIDEO PROCESSING L T P C 3 0 0 3

Objectives:

To provide an introduction to the fundamental principles and techniques in video processing. To provide an overview of video enhancement and restoration algorithms. To deliver details about video tracking.

To review latest trends and future technologies in video computing.

UNIT – I FUNDAMENTALS OF VIDEO PROCESSING [ 9 ]

Video Formation, Perception and Representation – Video Capture and Display – Principles of Color Video – Video Cameras – Video Display and Composite versus Component Models and Gamma Correction – Analog Video Raster – Progressive Vs Interlaced scans – Digital Video – Notation – ITU – R.BT.601 Digital Video Format and Other Digital Video Formats – Applications

UNIT – II DIGITAL VIDEO ENHANCEMENT AND SEGMENTATION [ 9 ]

Video Sampling – Basics of the Lattice Theory – Sampling of Video Signals over Lattices –Filtering Operations in Cameras and Display Devices – Video Segmentation Algorithms – Median Cut, Graph Cut and EM Algorithms – Active Contour models.

UNIT – III VIDEO ANALYSIS AND TRACKING [ 9 ]

Typical Tracker – Localization – Optical Flow – Object Tracking and analysis – Kalman Filtering – Video Tracking – Bayesian Approach – Particle Filter – Trackers – Evaluation – Video in painting – Restoration – Video Mining – Video Search Engines and Retrieval – Visual Event Detection – Video Surveillance and Security.

UNIT – IV MOTION ESTIMATION [ 9 ]

Two-Dimensional Motion Estimation – Optical Flow – General Methodologies – Motion Representation – Motion Estimation Criteria – Optimization Methods -- Pixel-Based Motion Estimation – Block-Matching Algorithm – Exhaustive Block-Matching Algorithm – Phase Correlation Method and Multi Resolution Motion Estimation. UNIT – V

VIDEO CLASSIFICATION AND RECOGITION

[ 9 ]

Video Classification – Classification and Clustering Models – Video Annotation – Video Summarization – Action Recognition – Visual Event Detection.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Implement basic algorithms related to digital video. Familiarize with the MATLAB and its equivalent open source tools for processing video. Design and implement some basic video related applications in domains like biometrics, object traction

and in industrial environment.

Critically analyze the role of video in modern technologies.

Reference Books :

1 A. Murat Tekalp, Digital Video Processing, Pearson, 2010.

2 Maggio E. and Cavallaro A., Video Tracking, Wiley , 2011

3 Alan Bovik C, The Essential Guide to Video Processing, Academic Press Inc, 2009.

4 Oge Marques, Practical Image and Video processing using Matlab, IEEE Press, 2011.

5 Niels NielsHaering and Niels Da Vitoria Lobo, Visual Event Detection, The International Series in Video

Computing, Springer US, 2001.

6 Michael A. Smith and Takeo Kanade, Multimodal Video Characterization and Summarization, The Kluwer

International Series in Video Computing, 2005.

Page 30: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 30

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – III (ELECTIVE)

MT16366 INTERACTION DESIGN FOR 3D USER INTERFACES L T P C 3 0 0 3

Objectives:

To learn about human computer interaction and interfaces

To learn the fundamentals of 3D interaction, manipulation and navigation

To understand the concepts of multi-touch, 3D Math and MEMS

UNIT – I INTERFACES [ 9 ]

Introduction: The vision -- Human-Computer Interaction – Definitions – Input: Interfaces and Devices – Introduction – Input Technologies – User Interfaces: Input – Input Devices – Input Recognition – Virtual Devices – Input Taxonomies – Output: interfaces and Display – 3D output: Interfaces – Displays.

UNIT – II 3D INTERACTION AND NAVIGATION [ 9 ]

Computer Graphics – 3D Interaction – Introduction – 3D Manipulation – 3D Navigation – 3D Travel – Way finding – 3D Navigation: User Studies - Descriptive and Predictive Models: Introduction – Predictive Models – Descriptive Models.

UNIT – III 3D TOUCH [ 9 ]

Multi-Touch : Introduction – Hardware – Multi-Touch and its Applications – Figures of Large Tabletop Displays – Understanding 3D Touch – Touching Parallaxes - Multi-Touch above the Tabletop – Interaction with Virtual Shadows – Perceptual Illusions for 3D Touch Interaction.

UNIT – IV PEN AND MULTI TOUCH [ 9 ]

Pen and Multi-Touch Modeling and Recognition – Introduction – The Dollar Family – Proton++ and More – FETOUCH – Using Multi-Touch with Petri Nets – Background - PeNTa: Petri Nets – Eye Gaze Tracking as Input in Human – Computer Interaction – Principle of Operation – Post-Processing of POG Data: Fixation Identification – Emerging Uses of EGT in HCI: Affective Sensing.

UNIT – V MATHEMATICAL APPROACHES [ 9 ]

Brain – Computer Interfaces: Considerations for the Next Frontier in Interactive Graphics and Games – Neuroscience Research – Implications of EEG and fMRI-Based Research for the Brain-Computer – Interface – Neuro headsets – Using EEG Data to Recognize Active Brain Regions – Introduction to 3D Math for Input Devices – Introduction – Axis Conventions – Vectors – Matrices – Axis Angle Rotations – Two Vector Orientation – Calibration of Three-Axis Sensors – Smoothing – MEMS Inertial Sensors and Magnetic Sensors – Introduction – Inertial Sensors – MEMS Inertial Sensor Errors – Magnetometers – MEMS Magnetometer Errors.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Understand human computer interaction and interfaces.

Know 3D interaction and models.

Obtain the concept 3Dtouch interaction.

Understand Pen and Multi-Touch.

Understand Brain Computer Interfaces and 3D Math.

Reference Books :

1 Francisco R. Ortega, Fatemeh Abyarjoo, Armando Barreto, Naphtali Rishe and Malek Adjouadi, Interaction Design for 3D User Interfaces: The World of Modern Input Devices for Research, Applications and Game Development, CRC Press, 2016.

2 Doug Bowman, Ernst Kruijff, Joseph J. LaViola Jr. and Ivan Poupyrevan, 3D User Interfaces: Theory and Practice, Addison Wesley, 2016.

3 Yvonne Rogers, Helen Sharp and Jenny Preece, Interaction Design: Beyond Human - Computer Interaction, Wiley, Third Edition, 2011.

4 https://www.youtube.com/watch?v=SAFYSUzLYKk

5 http://nptel.ac.in/courses/106103115/

Page 31: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 31

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – III (ELECTIVE)

CS16393 INTERNET OF THINGS (Common to CS and MMT)

L T P C 3 0 0 3

Objectives:

To gain knowledge of Internet of things architecture, web of things and its applications.

UNIT – I BASICS OF INTERNET OF THINGS [ 9 ]

Definitions and Functional Requirements – Motivation – Architecture – Web 3.0 View of IoT– Ubiquitous IoT Applications – Four Pillars of IoT – DNA of IoT – The Toolkit Approach for End-user Participation in the Internet of Things – Middleware for IoT: Overview – Communication middleware for IoT – IoT Information Security.

UNIT – II IOT PROTOCOLS [ 9 ]

Protocol Standardization for IoT – Efforts – M2M and WSN Protocols – SCADA and RFID Protocols – Issues with IoT Standardization – Unified Data Standards – Protocols – IEEE 802.15.4 – BAC Net Protocol– Modbus – KNX – Zigbee Architecture – Network layer – APS layer – Security.

UNIT – III WEB OF THINGS [ 9 ]

Web of Things versus Internet of Things – Two Pillars of the Web – Architecture standardization for WoT– Platform Middleware for WoT – Unified Multitier WoT Architecture – WoT Portals and Business Intelligence – Cloud of Things: Grid/SOA and Cloud Computing – Cloud Middleware – Cloud Standards –Cloud Providers and Systems – Mobile Cloud Computing – The Cloud of Things Architecture.

UNIT – IV IOT MODELS [ 9 ]

Integrated Billing Solutions in the Internet of Things – Business Models for the Internet of Things – Network Dynamics: Population Models – Information Cascades – Network Effects – Network Dynamics: Structural Models – Cascading Behavior in Networks –The Small World Phenomenon.

UNIT – V APPLICATIONS OF IOT [ 9 ]

Role of the Internet of Things for Increased Autonomy and Agility in Collaborative Production Environments – Resource Management in the Internet of Things: Clustering – Synchronization and Software Agents – Applications – Smart Grid – Electrical Vehicle Charging.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Identify and design the new models for market strategic interaction.

Develop business intelligence and information security for Internet of Things.

Compare various protocols for IoT.

Develop a middleware for IoT.

Develop different models for network dynamics.

Reference Books :

1 Honbo Zhou, The Internet of Things in the Cloud: A Middleware Perspective, CRC Press, 2012.

2 Dieter Uckelmann, Mark Harrison and Florian Michahelles, Architecting the Internet of Things, Springer, 2011.

3 David Easley and Jon Kleinberg, Networks, Crowds, and Markets: Reasoning About a Highly Connected World, Cambridge University Press, 2010.

4 Olivier Hersent, Omar Elloumi and David Boswarthick, The Internet of Things: Applications to the Smart Grid and Building Automation‖, Wiley, 2012.

5 Olivier Hersent, David Boswarthick and Omar Elloumi, ―The Internet of Things – Key applications and Protocols, Wiley, 2012.

Page 32: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 32

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – III (ELECTIVE)

MT16368 VISUALIZATION TECHNIQUES L T P C 3 0 0 3

Objectives:

To understand the importance of data visualization.

To know the different types of visualization techniques.

To create various visualizations.

UNIT – I BASICS OF VISUALIZATION TECHNIQUES [ 9 ]

Introduction – Issues – Data Representation – Data Presentation – Common Mistakes in design.

UNIT – II FOUNDATIONS FOR DATA VISUALIZATION [ 9 ]

Visualization stages – Experimental Semiotics based on Perception Gibson’s Affordance theory – A Model of Perceptual Processing – Power of visual perception –Types of Data – Visualization and data objects.

UNIT – III COMPUTER VISUALIZATION [ 9 ]

Non-Computer Visualization – Computer Visualization: Exploring Complex Information Spaces – Fisheye Views – Applications – Comprehensible Fisheye views – Fisheye views for 3D data – Interacting with visualization.

UNIT – IV MULTIDIMENSIONAL VISUALIZATION [ 9 ]

One Dimension – Two Dimensions – Three Dimensions – Multiple Dimensions – Trees – Web Works – Data Mapping: Document Visualization – Workspaces.

UNIT – V CASE STUDIES [ 9 ]

Small interactive calendars – Selecting one from many – Web browsing through a key hole – Communication analysis – Archival analysis.

Total (L: 45 T: 0 ) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Compare various visualization techniques.

Design creative visualizations.

Apply visualization over different types of data.

Understand the computer visualization

Know the case studies of visualization techniques

Reference Books :

1 Colin Ware, Information Visualization Perception for Design, Margon Kaufmann Publishers, Second Edition, 2004.

2 Robert Spence, Information visualization – Design for interaction, Pearson Education, Second Edition, 2007

3 Stephen Few, Information Dashboard Design-The Effective Visual Communication of Data, O'Reilly Media Publisher, First Edition, 2006

4 Stuart.K.Card, Jock.D.Mackinlay and Ben Shneiderman, Readings in Information Visualization Using Vision to think, Morgan Kaufmann Publishers, 1999.

Page 33: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 33

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – III (ELECTIVE)

MT16369 VIDEO ANALYTICS L T P C 3 0 0 3

Objectives:

To learn the image, video acquisition techniques and to extract the features using various methods.

UNIT – I IMAGE AND VIDEO ACQUISITION, REPRESENTATION AND STORAGE [ 9 ]

Introduction – Human Eye Physiology – Structure of the Human Eye – Image Acquisition Devices – Digital Camera – Color Representation – Human Color Perception – Color Models – Image Formats – Image File Format Standards – JPEG Standard – Video Principles – MPEG Standard – Further MPEG Standards

UNIT – II FEATURE EXTRACTION METHODS AND MANIFOLD LEARNING METHODS [ 9 ]

Introduction – The Curse of Dimensionality – Data Dimensionality – Local Methods – Global Methods – Principal Component Analysis – Nonlinear Principal Component Analysis – Independent Component Analysis – Statistical Independence – ICA Estimation – ICA by Mutual Information Minimization – Fast ICA Algorithm – Multidimensional Scaling Methods – Sammon‘s Mapping – Manifold Learning – The Manifold Learning Problem – Isomap – Locally Linear Embedding – Laplacian Eigenmaps.

UNIT – III STRUCTURE FROM MOTION [ 9 ]

Triangulation – Two frame structure from motion – Projective reconstruction – Self– calibration – application: View morphing – Factorization – Perspective and projective factorization – Application: Sparse 3D model extraction – Bundle adjustment – Exploiting sparsity – Application: Match move and augmented reality – Uncertainty and ambiguities – Application: Reconstruction from Internet photos – Constrained structure and motion – Line based techniques – Plane based techniques.

UNIT – IV AUTOMATIC FACE RECOGNITION [ 9 ]

Introduction – Face Recognition: General Approach – Face Detection and Localization – Face Segmentation and Normalization with Torch Vision – Lighting Normalization – Center/Surround Retinex – Gross and Brajovic‘s Algorithm – Normalization with Torch Vision – Feature Extraction – Holistic Approaches – Local Approaches – Feature Extraction with Torch Vision – Classification – Performance Assessment – The FERET Database – The FRVT database – Experiments – Data and Experimental Protocol – Euclidean Distance – based Classifier – SVM – based Classification.

UNIT – V VIDEO SEGMENTATION AND KEYFRAME EXTRACTION [ 9 ]

Introduction – Applications of Video Segmentation – Shot Boundary Detection – Pixel based Approaches – Block based Approaches – Histogram based Approaches – Clustering based Approaches – Performance Measures – Shot Boundary Detection with Torch vision – Key frame Extraction – Key frame Extraction with Torch vision and Torch.

Total (L: 45 T: 0 ) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Explain about video acquisition, representation and storage.

List various feature extraction methods.

Assess the process of reconstruction from internet photos.

Explain the face detection and localization process.

List the applications of video segmentation.

Reference Books :

1 Francesco Camastra Alessandro Vinciarelli, Machine Learning for Audio, Image and Video Analysis, Springer, First Edition, 2010.

2 Richard Szelis Ki, Computer Vision: Algorithms and Applications, Springer, First Edition, 2010.

3 David A. Forsyth and Jean Ponce, Computer Vision, A Modern Approach, PHI, 2009.

4 Alan Hanjalic, Content Based Analysis of Digital Video, Springer, 2004.

Page 34: M.E. K.S.R. COLLEGE OF ENGINEERING (Autonomous) … · Topological Sort – Strongly Connected Components – Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and

M.E. – Multimedia Technology

KSRCE – Curricula and Syllabi (R 2016) 34

K.S.R. COLLEGE OF ENGINEERING (Autonomous) R 2016

SEMESTER – III (ELECTIVE)

MT16371 SOUND ENGINEERING L T P C 3 0 0 3

Objectives:

To implement the standards in the real world service creations.

To know about new generation set-top boxes, hand-held devices, and PC add-in cards.

To understand MPEG-2 System Standards

UNIT – I BASICS OF BROADCASTING [ 9 ]

Frequency bands – Propagation and Modulation – Radio and Television Transmission System – Transmitting Antennas and Systems – RF System Maintenance – Test Equipment’s – Audio Test and Measurements – Video Signal Measurement and Analysis

UNIT – II DATA BROADCASTING [ 9 ]

Introduction to data Broadcasting – Data Broadcasting system overview and Architecture – MPEG 2 Transport Basics – Data Categorization – Service Description Frame work – Synchronized Streaming Encapsulation – Data Piping Protocol.

UNIT – III DESIGN AND INSTALLATION OF VIDEO AND AUDIO SYSTEMS [ 9 ]

Basics of Television – Analog Video Fundamentals – Digital Video Fundamentals – Analog Audio Fundamentals - Digital Audio Fundamentals – Data Multiplexing – Transition to DTD.

UNIT – IV AUDIO VIDEO STREAMING [ 9 ]

Introduction to streaming media – Video Encoding – Audio Encoding – Preprocessing –Stream Serving – Web Casting – Media Players – Applications for Streaming Media – Content Distribution.

UNIT – V ALGORITHMS AND INTERFACES [ 9 ]

Color Introduction to Luma and Chroma – Component SDTV – HDTV – Digital Video Interfaces – Filtering and Sampling – Image Digitization and Reconstructions – Perceptions and Visual Activity – DeInterlacing – DV Compressions–Digital television Standards.

Total (L: 45 T: 0) = 45 Periods

Course Outcomes:

Upon Completion of the course, the students should be able to :

Work with big data platform and its analysis techniques.

Design efficient algorithms for mining the data from large volumes.

Work with surveillance videos for analytics.

Design optimization algorithms for better analysis and recognition of objects in a scene.

Model a framework for Human Activity Recognition.

Reference Books :

1 David Austerberry, The technology of video and audio streaming, Elsevier Focal Press, Second Edition, 2005.

2 Richards.S Chernock, Regis J.cainon, Micheal A. Dolan and John R.Mick JR, Data Broadcasting – Understanding the ATCS Data Broadcasting Standards, Tata McGraw Hill, 2001

3 Charles Poynton, Digital Video And HDTV Algorithm and Interfaces, Morgan Kaufman Publishers, 2007.

4 Jerry C. Whitaker, Standard Handbook of Broadcast Engineering, Mcgraw Hill Publications, 2005

5 Michael Robin And Michel Poulin, Digital Television Fundamentals - Design and Installation of Video and Audio Systems, Mcgraw Hill Publications, Second Edition, 2000.