s p o n s o r e d   l i n k s


Multimedia Processing.pdf

July 6, 2008 · Filed Under Other Programming Ebooks  · Tags: , , , , , ,

One of the IIT Kharagpur series course material, about multimedia processing. As you know we are all living in a world without borders, thanks to the internet. Instead of printed text, multimedia also plays roles in the internet era, what, how, why behind the multimedia (streaming video, image, audio and more…) will be answered in this course material.

This ebook is available FREE at National Programme on Technology Enhanced Learning Indian Institute of Technology Madras, India website, we merely collect the information, we are neither affiliated with the author(s), the website and any brand nor responsible for its content and change of content. (Read our disclaimer here or here before you download the document from the website written above by clicking the below link).

Contents, along with the download links:

  • Module 1 Multimedia Systems
    • Lesson 1 Introduction to Multimedia Systems and Processing, objectives: Define multimedia signal. ~ Name at least five different sources of multimedia signal. ~ State the motivation behind the growth of multimedia technology. ~ State the elements of multimedia communication system. ~ State at least five challenges involved with multimedia signal processing and communication ] contents [ Multimedia Signals ~ Motivation behind the growth of multimedia technology ~ Elements of multimedia communication systems ~ Challenges involved with multimedia communication ~ Bandwidth limitations]
  • Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS
    • Lesson 2 Image Compression Systems, objectives: Identify and classify the redundancies present in an image. ~ Distinguish between lossless and lossy image compression. ~ Measure the quality of reconstructed images. ~ State the elements of an image compression system. ~ State the objectives of each of the elements of image compression system ] contents [ Redundancies and how to exploit those? ~ Classification of Redundancies ~ Statistical Redundancy ~ Psychovisual Redundancy ~ Lossless and lossy image compression ~ Measuring the quality of reconstructed images ~ Elements of Image Compression System ~ Elements of Image De-compression system]
    • Lesson 3 Lossless Compression: Huffman Coding, objectives: Define and measure source entropy. ~ State Shannon’s Coding theorem for noiseless channels. ~ Measure the coding efficiency of an encoding scheme. ~ State the basic principles of Huffman coding. ~ Assign Huffman codes to a set of symbols of known probabilities. ~ Encode a string of symbols into a Huffman coded bit stream. ~ Decode a Huffman coded bit stream ] contents [ Source entropy- a measure of information content ~ Shannon's Coding Theorem for noiseless channels ~ Basic principles of Huffman Coding ~ Assigning Binary Huffman codes to a set of symbols ~ Encoding a string of symbols using Huffman codes ~ Decoding a Huffman coded bit stream ~ Discussions and Further Reading]
    • Lesson 4 Arithmetic and Lempel-Ziv Coding, objectives: Explain why Huffman coding is not optimal. ~ State the basic principles of arithmetic coding. ~ Encode a sequence of symbols into an arithmetic coded bit stream. ~ Decode an arithmetic coded bit stream. ~ State the coding efficiency limitations of arithmetic coding. ~ State the basic principles of Lempel-Ziv coding ~ Encode a sequence of symbols into a Lempel-Ziv coded bit stream. ~ Decode a Lempel-Ziv coded bit stream ] contents [ Basic Principles of Arithmetic Coding ~ Algorithm for Arithmetic Coding ~ Encoding a Sequence of Symbols using Arithmetic Coding ~ Decoding an Arithmetic-Coded Bit Stream ~ Coding Efficiency Limitations of Arithmetic-Coded Bit Stream ~ Basic Principles of Lempel-Ziv Coding ~ Encoding a sequence of symbols using Lempel-Ziv Coding ~ Decoding a Lempel-Ziv encoded sequence]
    • Lesson 5 Other Coding Techniques, objectives: Convert a gray-scale image into bit-plane images. ~ Apply run-length coding on binary images. ~ State the basic principles of lossless predictive coding. ~ Obtain predicted image and error image from a given image and prediction scheme. ~ Reconstruct the original image from the error image and the predicted image. ~ Compare the entropies of the original image and the error image ] contents [ Converting a gray-scale image into bit-plane images ~ Run-length Coding of bit-plane images ~ Lossless Predictive Coding]
  • Module 3 LOSSY IMAGE COMPRESSION SYSTEMS
    • Lesson 6 Theory of Quantization, objectives: Define quantization. ~ Distinguish between scalar and vector quantization. ~ Define quantization error and optimum scalar quantizer design criteria. ~ Design a Lloyd-Max quantizer. ~ Distinguish between uniform and non-uniform quantization. ~ Define rate-distortion function. ~ State source coding theorem. ~ Determine the minimum possible rate for a given SNR to encode a quantized Gaussian signal ] contents [ Quantization ~ Design of Lloyd-Max Quantizers ~ Uniform and non-uniform quantization ~ Rate-Distortion Function and Source Coding Theorem ~ Source Coding Theorem]
    • Lesson 7 Delta Modulation and DPCM, objectives: Describe a lossy predictive coding scheme. ~ Define Delta Modulation. ~ Encode and decode a sequence of pixels through Delta Modulation. ~ Define granular noise and slope overload. ~ State the effects of granular noise and slope overload on the reconstructed image. ~ State the basic principle of Differential Pulse Code Modulation (DPCM). ~ Design an optimal predictor for DPCM. ~ Design a Lloyd-Max quantizer for DPCM. ~ Design an adaptive quantizer for DPCM ] contents [ Delta Modulation ~ Differential Pulse Code Modulation (DPCM) ~ Adaptive Quantization]
    • Lesson 8 Transform Coding & K-L Transforms, objectives: Distinguish between spatial and transform-domain image compression systems. ~ State the objectives of transform coding. ~ Write the general expressions for forward and inverse transforms. ~ Define separable and symmetric transforms. ~ Define basis images. ~ Determine the covariance matrix of image block. ~ Represent a covariance matrix in terms of its eigenvectors and eigenvalues. ~ Define K-L transform. ~ Show that K-L transform is optimal in terms of mean-square truncation error. ~ State why K-L transforms are difficult to implement in practice ] contents [ Transform Coding ~ Generalized forward and inverse transforms ~ Covariance Matrix ~ K-L Transforms ~ Optimality of K-L Transform ~ Practical limitations of K-L Transforms]
    • Lesson 9 Discrete Cosine Transforms, objectives: State the advantages of Discrete Cosine Transform (DCT) over Discrete Fourier Transform (DFT). ~ Transform a block of image into its DCT coefficients. ~ Compose the basis images of DCT. ~ Apply zonal coding over the DCT coefficients. ~ Allocate bits to the zonal coded coefficients. ~ Apply threshold coding over the DCT coefficients. ~ Encode the quantized DCT coefficients in zig-zag scanned order. ~ State the limitations of DCT ] contents [ Discrete Cosine Transform (DCT) ~ Principles of bit allocation ~ Limitations of DCT]
  • Module 4 MULTI-RESOLUTION ANALYSIS
    • Lesson 10 Theory of Wavelets, objectives: Explain the space-frequency localization problem in sinusoidal transforms. ~ Explain the need for multi-resolution image analysis. ~ Define scaling functions. ~ Define functional subspace of scaling functions at a given scale. ~ Compute the scaled and translated versions of scaling functions. ~ Show the relationship between the functional subspaces of scaling functions at different scales. ~ Define wavelet functions. ~ Show the functional subspace relationship between scaling and wavelet functions. ~ Compute the scaled and translated versions of wavelet functions. ~ Express a continuous signal as a series expansion of scaling and wavelet basis functions ] contents [ Need for multi-resolution image analysis ~ Scaling Functions and functional subspace]
    • Lesson 11 Multi-resolution Analysis: Theory of Subband Coding, objectives: Show a two-band filter bank for subband coding and decoding of one-dimensional signals. ~ Define analysis and synthesis filters. ~ Explain the need for downsampling after the analysis and upsampling before the synthesis. ~ Determine the z-transforms of downsampled and upsampled signals. ~ Determine the z-transform of the reconstructed signal. ~ Derive the conditions for error-free reconstruction of the signal. ~ Show that the analysis and synthesis filter banks for error-free reconstruction fulfill the conditions of bi-orthogonality. ~ Extend the idea of subband coding for a two-dimensional four-band filter bank. ~ Repetitively apply four-band split on a given image using FIR analysis filter bank. ~ Synthesize an image from the subbands using FIR synthesis filter bank ] contents [ Two-band Analysis of Signals ~ Two-band Synthesis of Signals ~ Conditions for perfect reconstruction in analysis-synthesis filters ~ Bi-Orthogonality of analysis-synthesis filters ~ Subband decomposition of Images]
    • Lesson 12 Multi-resolution Analysis: Discrete Wavelet Transforms, objectives: Define Discrete Wavelet Transforms (DWT) and its inverse. ~ Compute DWT and inverse DWT through subband coding and decoding. ~ Extend the DWT concepts to two dimensions. ~ Apply DWT and inverse DWT on images. ~ Explain the block diagram of a DWT-based still image compression and coding system ] contents [ Discrete Wavelet Transforms and its inverse ~ Computing DWT and IDWT through subband analysis and synthesis ~ Two-dimensional DWT ~ Applying DWT and IDWT on images ~ DWT based still image compression system]
  • Module 5 EMBEDDED WAVELET CODING
    • Lesson 13 Zerotree Approach, objectives: Explain the principle of embedded coding. ~ Show the parent-child relationships between subbands of same orientation. ~ Define significance and insignificance of DWT coefficients with respect to a threshold. ~ Define zerotree and zerotree root. ~ Perform successive approximation quantization (SAQ) on DWT coefficients. ~ Perform dominant pass and subordinate pass for coding of DWT coefficients. ~ Implement a complete Embedded Zerotree Wavelet (EZW) encoder and study its performance on images ] contents [ Embedded Coding ~ Relationship between subbands ~ Significance of DWT coefficients ~ Encoding the Significance map ~ Successive Approximation Quantization (SAQ) ~ Order of importance in the bit-stream ~ Summary of the EZW algorithm]
    • Lesson 14 SPIHT algorithm, objectives: State the limitations of EZW algorithm. ~ Justify the need for magnitude ordering of coefficients in progressive image transmission. ~ Justify the need for efficient encoding of coefficient sorting in progressive image transmission. ~ State the basic objectives of Set Partitioning in Hierarchical Trees (SPIHT) algorithm. ~ Define spatial orientation trees. ~ Define the set partitioning rules. ~ Outline the steps of SPIHT encoding and decoding algorithm. ~ Implement a wavelet coder and decoder based on SPIHT ] contents [ Coefficient ordering in progressive image transmission ~ Basic Objectives of Set Partitioning ~ Spatial Orientation Tree ~ Set Partitioning Rules ~ SPIHT Encoding and Decoding]
    • Lesson 15 EBCOT Algorithm, objectives: Explain the inadequacies of EZW and SPIHT in wavelet packet encoding. ~ Define resolution scalability of embedded bit-stream. ~ Define SNR scalability of embedded bit-stream. ~ State the basic characteristics of EBCOT algorithm. ~ Explain the rate-distortion optimization problem of code blocks. ~ Explain how the truncation points are selected in EBCOT bit-stream. ~ State the highlighting features of block coding algorithm. ~ Define the significance of sub-blocks. ~ Explain the quad-tree structure representation of sub-block significance. ~ Name the four coding passes in block coding algorithm. ~ State the role of each of the coding passes in block coding algorithm. ~ Define the four coding primitives used in block coding algorithm. ~ Explain the formation of the quality layers from the embedded code block bit stream ] contents [ Resolution Scalability ~ SNR Scalability ~ Basic Characteristics of EBCOT algorithm ~ Rate-Distortion Optimization ~ Block Coding Algorithm]
  • Module 6 STILL IMAGE COMPRESSION STANDARDS
    • Lesson 16 Still Image Compression Standards: JBIG and JPEG, objectives: Explain the need for standardization in image transmission and reception. ~ Name the coding standards for fax and bi-level images and state their characteristics. ~ Present the block diagrams of JPEG encoder and decoder. ~ Describe the baseline JPEG approach. ~ Describe the progressive JPEG approach through spectral selection. ~ Describe the progressive JPEG approach through successive approximation. ~ Describe the hierarchical JPEG approach. ~ Describe the lossless JPEG approach. ~ Convert YUV images from RGB. ~ Illustrate the interleaved and non-interleaved ordering for color images ] contents [ Coding Standards for Fax and Bi-level Images ~ Continuous tone still image coding standards ~ Modes of Operation in JPEG ~ Color image formats and interleaving ~ JPEG Performance]
    • Lesson 17 JPEG-2000 - Architecture and Features, objectives: State the shortcomings of JPEG standard. ~ State the scope and objectives of JPEG-2000. ~ Name the main application areas of JPEG-2000. ~ List the requirements of its major applications. ~ Explain the major building blocks of JPEG-2000. ~ Define tiling and its significance. ~ Distinguish between reversible and irreversible wavelet transforms. ~ Perform periodic extension of signals. ~ Distinguish between convolution based filtering and lifting based filtering. ~ Show the relations for reversible and irreversible component transformations. ~ Define precincts and packets for JPEG-2000 bit stream ] contents [ Scope and objectives of JPEG-2000 ~ Applications of JPEG-2000 and their requirements ~ Architecture of JPEG-2000 ~ Tiling and its significance ~ Wavelet Filters ~ Reversible and Irreversible Component Transformations ~ Precincts and packets for JPEG-2000 bit-stream]
    • Lesson 18 JPEG-2000 - Region of Interests Coding, objectives: State the objective of Region of interests (ROI) coding. ~ Explain the basic principle of scaling based method for ROI encoding. ~ Outline the steps involved in implementing the scaling based method. ~ Generate the ROI masks for each stage of subband decomposition. ~ Explain the limitations of scaling based method in arbitrarily shaped ROI. ~ Outline the MAXSHIFT method for ROI coding. ~ State the advantages of MAXSHIFT method, as compared to general scaling based method ] contents [ Scaling Based Method for ROI encoding ~ Implementation of Scaling Based Method ~ Generation of ROI mask for different subbands ~ Limitations of Scaling Based Methods ~ MAXSHIFT Method ~ Advantages of MAXSHIFT method ~ Encoding and Decoding Aspects of MAXSHIFT]
    • Lesson 19 JPEG-2000- Error Resiliency, objectives: Name two different types of lossy channels. ~ Define error correction, error resilience and error concealment. ~ List three major error conditions. ~ State the impact of these conditions in source coding and their remedies. ~ Justify the introduction of resynchronization for error resilience. ~ Define packet resynchronization approach. ~ Define periodic resynchronization approach. ~ Define data partitioning strategy to resynchronization. ~ Explain hierarchical resynchronization and data partitioning in JPEG-2000. ~ List the error detection tools in JPEG-2000 ] contents [ Lossy Channels ~ Error corrections, error resilience and error concealment ~ Error conditions and their impacts on source coding ~ Use of resynchronization ~ Hierarchical re-synchronization and data partitioning in JPEG-2000 ~ Error-detection tools in JPEG-2000]
  • Module 7 VIDEO CODING AND MOTION ESTIMATION
    • Lesson 20 Basic Building Blocks & Temporal Redundancy, objectives: Name at least five major applications of video compression and coding. ~ Present the block-diagram of a hybrid video codec. ~ Define intra-coded and inter-coded frames. ~ Explain the role of motion estimation in video codecs. ~ Explain the role of motion compensation in video codecs. ~ Define the translational model of motion estimation. ~ Define backward motion estimation. ~ Name two distinct approaches to motion estimation ] contents [ Hybrid Video codec ~ Intra-coded and inter-coded frames ~ Motion estimation and motion compensation ~ Translational model of motion estimation ~ Backward motion estimation ~ Forward motion estimation ~ Basic approaches to motion estimation]
    • Lesson 21 Block based motion estimation algorithms, objectives: Name and define the matching criteria for block motion estimation. ~ Determine the computational complexity of each matching criterion ~ Explain full search block motion (FSBM) estimation. ~ Determine the computational complexity in FSBM. ~ State the fundamental assumption of quick search strategy. ~ Explain 2-D logarithmic search strategy. ~ Determine the computational complexity of 2-D logarithmic search ] contents [ Matching Criteria for block-based motion estimation ~ Full-search block motion (FSBM) estimation ~ Quick and efficient search strategies]
    • Lesson 22 Other fast search motion estimation algorithms, objectives: Provide an overview of the following fast search motion estimation algorithms: Cross search; Three step-search; New three-step search; Diamond search; Gradient -descent search ~ Determine the computation complexity of the above algorithms ~ Compare between FSBM and fast search motion estimation algorithms. ~ ~ Cross search algorithm (CSA) ~ Three step search (TSS) algorithm ~ Diamond- search (DS) algorithms ~ Block based gradient descent search (BBGDS) algorithm]
  • Module 8 VIDEO CODING STANDARDS
    • Lesson 23 MPEG-1 standards, objectives: Enlist the major video coding standards ~ State the basic objectives of MPEG-1 standard. ~ Enlist the set of constrained parameters in MPEG-1 ~ Define the I- P- and B-pictures ~ Present the hierarchical data structure of MPEG-1 ~ Define the macroblock modes supported by MPEG-1 ] contents [ Major Video coding initiatives and standards ~ Basic objectives of MPEG-1 standard ~ Constrained parameters in MPEG-1 ~ Picture types in MPEG-1 ~ Hierarchical data structure in MPEG-1 ~ Macroblock types supported by MPEG-1 standard.]
    • Lesson 24 MPEG-2 Standards, objectives: State the basic objectives of MPEG-2 standard. ~ Enlist the profiles and the levels supported by MPEG-2 ~ Define field picture and frame picture for interlaced video ~ Illustrate how the field and the frame predictions are made ~ Define the chrominance format for MPEG-2. ~ Explain the basic philosophy of scalable coding ~ Define SNR scalability, spatial scalability and temporal scalability. ~ State the objectives of data partitioning ] contents [ Basic Objectives of MPEG-2 standard ~ Profiles and levels of MPEG-2 ~ Interlaced Video: Frame picture and field picture ~ Field and frame prediction ~ Chrominance format for MPEG-2 ~ Scalability support of MPEG-2 ~ Scalable Coding Schemes ~ Data partitioning in MPEG-2 bit-stream]
    • Lesson 25 MPEG-4 Standard, objectives: State the basic objectives of MPEG-4 standard. ~ Explain the concept of content based interactivity. ~ Explain the toolbox approach of MPEG-4. ~ Define video object planes, video objects and video object layers. ~ Define VOP image window and shape-adaptive macro block grid. ~ Explain shape coding, motion estimation and texture coding applicable to MPEG-4. ~ Explain the spatial and temporal scalability aspects of MPEG-4. ~ State the basic philosophy of sprite coding. ~ Explain the facial feature animation capabilities of MPEG-4 ] contents [ Basic objectives of MPEG-4 standard ~ Content-based interactivity ~ Toolbox approach of MPEG-4 ~ Video object representation and encoding layers ~ Encoding of VOPs ~ Spatial and temporal scalability of MPEG-4]
    • Lesson 26 H.261 and H.263 Standards, objectives: State the basic objective of H.261 standard. ~ Name the picture format supported by H.261. ~ Show the H.261 bitstream. ~ Show the Group of Block (GOB) arrangements in an H.261 picture. ~ Show the arrangement of macroblock (MB) in a GOB. ~ Show the structure of macroblock layer in H.261. ~ Define the prediction modes of macroblocks in H.261. ~ Show the structure of block layer in H.261. ~ State the basic objectives of H.263 standard. ~ Name the picture formats supported by H.263. ~ State the improved features of H.263 over H.261. ~ Explain the advanced prediction modes in H.263 ] contents [ Basic objectives of H.261 standard ~ Picture formats and frame-types in H.261 ~ H.261 Bit-stream structure ~ Basic objectives of H.263 standard ~ Picture formats of H.263 ~ Improved features of H.263 over H.261 ~ H.263 + Extension]
    • Lesson 27 H.264 standard, objectives: State the broad objectives of the H.264 standard. ~ List the improved prediction methods adopted in H.264 ~ Implement motion estimation with quarter-pixel accuracy for video sequence ~ Present the concept of multi frame motion compensation ~ Explain the principle of deblocking filter ~ Illustrate the intra-frame prediction modes of H.264 ~ List the improved transform and entropy coding schemes ~ Implement 4 x 4 integer transforms ~ Explain the basic concepts of two entropy coding schems- CAVLC and CABAC ~ List the features of the Video Coding Layer ( VCL) ~ Define ’slice and ’slice group’ ~ Explain the concept of Flexible Macroblock Ordering (FMO) ~ State the role of the network adaptation layer (NAL) ] contents [ Broad objectives of the H.264 standard ~ Improved Prediction modes in H.264 ~ Improved transform coding and entropy coding schemes ~ Features of H.264 Video Coding Layer ( VCL)]
  • Module 9 AUDIO CODING
    • Lesson 28 Basic of Audio Coding, objectives: Name at least three different audio signal classes. ~ Calculate the bit-rate requirements for stereo quality audio. ~ State the basic requirements of low bit-rate audio coders ~ Outline the scope of MPEG audio standards. ~ Define critical bands of auditory response system ~ Define simultaneous masking and masking threshold ~ Define signal to mask ratio (SMR) and noise to mask ratio (NMR) ~ Define temporal masking ~ State the objectives of perceptual coding ~ Present the block diagram of perception based audio coders ] contents [ Audio signal classes ~ Bit-rate requirements for stereo quality audio ~ Basic requirements of low bit-rate audio coders ~ Scope of MPEG audio standards ~ Human auditory perception]
    • Lesson 29 Transform and Filter banks, objectives: Define the three layers of MPEG-1 audio coding. ~ Define the four modes of MPEG-1 audio coding. ~ Present the structure of MPEG-1 audio codec layer -1 and II. ~ State the basic objectives of two psychoacoustics models. ~ Explain the realization of analysis and synthesis filters through filter banks. ~ Explain the realization of analysis and synthesis filters through time domain windowing and transforms. ~ Define critically sampled analysis-synthesis system. ~ Define time domain aliasing. ~ Explain the mechanism of time domain alias cancellation ] contents [ Layers of audio compression: ~ Modes of MPEG-1 audio ~ Structure of MPEG-1 audio codec ~ Psychoacoustics models ~ Design issues of analysis and synthesis filters ~ Mechanism of time-domain aliasing cancellation ~ Implementation and Window Design for TDAC]
    • Lesson 30 Polyphase filter implementation, objectives: Show how a bank of bandpass filters can be realized through windowing and transform. ~ Justify why the filters implemented as above are known as polyphase filters ~ Describe the polyphase implementation of the analysis filter bank-in MPEG-1 audio ~ Describe the polyphase implementation of the synthesis filter bank in MPEG-1 audio ] contents [ Theory of Polyphase filters ~ Polyphase analysis filter for MPEG-1 audio]
    • Lesson 31 Format and encoding, objectives: Show the flow diagram for encoding an audio frame ~ State the role of bit allocation section of the encoder ~ State the role of the scale factor section of the encoder ~ Distinguish between layer-1 and layer-2 encoding. ~ Explain the bit allocation algorithm ] contents [ Bit allocation section ~ Scale factor section ~ Layer-3 encoding scheme ~ Bit -allocation algorithm]
    • Lesson 32 Psychoacoustic Models, objectives: State the basic objectives of both the psychoacoustic models. ~ Identify the tonal components from an auditory spectrum. ~ Identify the non-tonal components from an auditory spectrum. ~ Prune the list of tonal and non-tonal components using a sliding window. ~ Define masking index, masking function and masking threshold for both tonal and non-tonal components. ~ Calculate the global masking thresholds. ~ Explain the partition-domain transformation for psychoacoustic model-II ] contents [ Psychoacoustic model classification]
  • Module 10 MULTIMEDIA SYNCHRONIZATION
    • Lesson 33 Basic definitions and requirements, objectives: Define synchronization between media objects. ~ Distinguish between time independent and time dependent media objects. ~ Define continuous media objects. ~ Define intra-object synchronization and inter-object synchronization ~ Define Logical Data Units (LDU) with examples ] contents [ Synchronization between media objects ~ Time-independent and time-dependent media objects ~ Intra and inter-object synchronization ~ Logical Data Unit (LDU)]
    • Lesson 34 References Model and Specification, objectives: State why a reference model is needed. ~ Give some examples of multi-layer reference model ~ Define the roles of media layer, stream layer, object layer and specification layer. ~ State why synchronization is more complex in distributed environment ~ State the mechanisms for achieving distributed environment synchronization ] contents [ Multi layer reference model ~ Blackowski -Steinmetz four layer reference model ~ Synchronization in distributed environment ~ Mechanism for distributed environment synchronization]
    • Lesson 35 Time stamping and pack architecture, objectives: Specify the requirements of media playback. ~ Define packets and packs for media stream ~ Present the block diagram of Digital Storage Medium (DSM) and System Target Decoder (STD) ~ Specify the requirements of systems clock reference (SCR) ~ Show the pack architecture ~ Define the elements of the pack header ] contents [ Requirements of media playback ~ Packs and packets ~ Requirements of System Clock Reference (SCR) ~ Pack architecture and pack headers]
    • Lesson 36 Packet architectures and audio-video interleaving, objectives: Show the packet architecture ~ Define the elements of the packet header ~ State and significance of presentation time stamp (PTS) and decoding time stamps (DTS) ~ Show how audio and video packets can be interleaved ~ State the design considerations of pack size ] contents [ Packet architecture ~ Presentation Time stamp (PTS) and Decoding Time Stamp (DTS) ~ Audio and Video interleaving ~ Choice of pack size]
    • Lesson 37 Playback continuity, objectives: Explain why re-sequencing is necessary for display buffers. ~ State the essential condition of continuous playback in real decoders. ~ Explain how buffer underflow may result. ~ State how buffer underflow can be prevented. ~ Explain how buffer overflow may result. ~ State how buffer overflow may be prevented. ~ Explain how synchronization can be carried out using a master stream ] contents [ Requirement for re-sequencing ~ Conditions for continuous playback ~ Buffer underflow and its conditions ~ Synchronization at the packet layer]
  • Module 11 VIDEO INDEXING AND RETRIEVAL
    • Lesson 38 Basics of content based image retrieval, objectives: Describe the algorithm for extraction of index keys from JPEG compressed image. ~ Describe the algorithm for computing image similarities based on keys. ~ Extend the concepts of key extraction to video sequences. ~ Outline the methodology for dominant motion estimation for scene structuring. ~ Out line the technique for computing mosaiced images ] contents [ Michael Shneier & Mottalab's approach ~ Simultaneous multiple motion estimation ~ Video Mosaicing with dominant 2 D Motion Estimation]
    • Lesson 39 Video Content Representation, objectives: Define a video segment ~ List the primitive features used for video concept extraction ~ Define evaluation function for video segments. ~ Analyze time - series video contents based on curve distribution ~ Derive connection types from content categories. ~ Outline the bounding box principle for video structuring ] contents [ Video Segments ~ Video content segmentation and indexing ~ Bounding Box Principle ~ Prominent index point ~ Video indexing]
    • Lesson 40 Video Sequence Query Processing, objectives: Define the query types in a typical video sequence ~ Outline the box - to - box matching and point matching ~ Define good match in a query processing system. ~ Define the box -to-box and point - to- point similarity measures. ~ Describe the algorithm for approximate box searching ] contents [ Box to-box matching ~ Point to point matching ~ Query constraints and similarity measure of query types ~ Matching strategies and box-to-box approximately matching ]

Related posts




You might also be interested in reading:
multimedia, kl transform tutorial, Discrete Cosine Transform: Algorithms Advantages Applications ebook, multimedia processing in distributed environment, wavelet, time series, download coding for dwt algorithm, discrete wavelet transform tutorial, ebooks on quadtree and its algorithms
« Prev
Next »

Disclaimer

http://www.onlinefreeebooks.net - provides you collection of links to other websites containing ebooks/manuals/cheatsheets either for computer geeks, technicians, automotive enthusiasts or programmers. We merely take the power of Google Search to find those materials and link to it. NONE OF THOSE MATERIALS ARE HOSTED IN THIS SERVER NOR UPLOADED BY ME IN SOMEONE'S SERVERS.

We are neither affiliated with authors and brands nor responsible for its content and change of content.

Information contained herein is provided "as is" without warranty of any kind, either expressed or implied, including any warranty of merchantability or fitness for a particular purpose. In no event shall ANYONE be held liable for any loss of profit, special, incidental, consequential, or other similar claims.

Comments

One Response to “Multimedia Processing.pdf”

  1. Arvind Kumar on October 21st, 2008 12:57 am

    a very gud effort….in field of higher education..
    thnxx all d members…

Leave a Reply