Video has a high "bandwidth" (i.e. Many bytes of information per second) applications require video compression or video coding technology to reduce the bandwidth before transmission. The H.263 standard supports video compression (coding) for video-conferencing and video-telephony applications.
Video has a high "bandwidth" (i.e. Many bytes of information per second) applications require video compression or video coding technology to reduce the bandwidth before transmission. The H.263 standard supports video compression (coding) for video-conferencing and video-telephony applications.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online from Scribd
Video has a high "bandwidth" (i.e. Many bytes of information per second) applications require video compression or video coding technology to reduce the bandwidth before transmission. The H.263 standard supports video compression (coding) for video-conferencing and video-telephony applications.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online from Scribd
Roll no:03 Why video compression ? • In each case video information (and perhaps audio as well) is transmitted over telecommunications links, including networks, telephone lines, ISDN and radio. • Video has a high "bandwidth" (i.e. many bytes of information per second) and so these applications require video compression or video coding technology to reduce the bandwidth before transmission. • Main reasons for compression of digital video: • a) large storage requirement (a 30 minute video may require 50 GB of storage!!!) • b) limited network bandwidth for real time video transmission Video coding Introduction • The H.263 standard, published by the International Telecommunications Union (ITU). • It supports video compression (coding) for video-conferencing and video-telephony applications. The H.263 system • A number of video coding standards exist, each of which is designed for a particular type of application: • for example, JPEG for still images, MPEG2 for digital television and H.261 for ISDN video conferencing. • H.263 is aimed particularly at video coding for low bit rates (typically 20-30kbps and above). Digitization formats • QCIF:Y=176 x 144, Cb =Cr =88 x 72 • S-QCIF:Y=128 x 96, Cb =Cr =64 x 68 • Frame refresh rate =15 or 7.5 fps Types of frames • I frame (intra-coded) – Coded without reference to other frames • P frame (predictive-coded) – Coded with reference to a previous reference frame (either I or P) – Size is usually about 1/3rd of an I frame • B frame (bi-directional predictive-coded) – Coded with reference to both previous and future reference frames (either I or P) – Size is usually about 1/6th of an I frame GOP (Group of Pictures) • GOP is a set of consecutive frames that can be decoded without any other reference frames • Usually 12 or 15 frames • Transmitted sequence is not the same as displayed sequence • Random access to middle of stream – Start with I frame Blocks • Process the data in blocks of 8x8 samples • • Convert Red-Green-Blue into Luminance (grayscale) and • Chrominance (Blue color difference and Red color difference) • • Use half resolution for Chrominance (because eye is more sensitive to grayscale than to color) H.263 Encoder Motion estimation and compensation • The first step in reducing the bandwidth is to subtract the previous transmitted frame from the current • frame so that only the difference or residue needs to be encoded and transmitted. Motion Compensation • Subtract the reference area from the current macroblock • – difference macroblock • Encode the difference macroblock with an image encoder • • If motion estimation was effective • – little data left in difference macroblock • – more efficient compression. Discrete Cosine Transform (DCT) • The DCT transforms a block of pixel values (or residual values) into a set of "spatial frequency“ coefficients. • This is analogous to transforming a time domain signal into a frequency domain signal using a Fast Fourier Transform. • Transform each block of 8x8 samples into a block of 8x8 spatial frequency coefficients • – energy tends to be concentrated into a few significant coefficients • – other coefficients are close to zero / insignificant Quantization • Divide each DCT coefficient by an integer, discard remainder • Result: loss of precision • Typically, a few non-zero coefficients are left Entropy encoding • An entropy encoder (such as a Huffman encoder) replaces frequently-occurring values with short binary codes and replaces infrequently-occurring values with longer binary codes. Frame store • The current frame must be stored so that it can be used as a reference when the next frame is encoded H.263 Decoder Entropy decode