DOCSLIB.ORG

Comparative Study of Motion Estimation & Motion Compensation

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Comparative Study of Motion Estimation & Motion Compensation International Journal of Emerging Trends & Technology in Computer Science (IJETTCS) Web Site: www.ijettcs.org Email: [email protected], [email protected] Volume 1, Issue 1, May-June 2012 ISSN 2278-6856 Comparative Study of Motion Estimation & Motion Compensation for Video Compression Jigar Ratnottar1, Rutika Joshi2, Manish Shrivastav3 1RGPV University, Electronics & Communication Engg. Department, Technocrates Institute of Technology, India [email protected] 2 RGPV University, Electronics & Communication Engg. Department, NIIST College, India [email protected] 3 RGPV University, Electronics & Communication Engg. Department, Technocrates Institute of Technology, India [email protected] Abstract: The newest predictive video coding schemes increasingly include the content based techniques which 2. Motion Estimation open new possibilities for advanced compression technology. Respected paper gives the better comparison A video sequence can be considered to be a discredited for Motion Estimation & Motion Compensation, which three-dimensional projection of the real four-dimensional are the major parameter for getting the highest continuous space-time. The real world objects can move, compression. The ME process analyzes previous or rotate, or deform. The movements cannot be observed future frames to identify blocks those are not changed directly, but instead the light reflected from the object and the motion vectors are stored in the place of blocks. surfaces and projected onto an image. The discretization Whereas Motion Compensation technique gives the causes noise into the video sequence, from which the residue of original image & estimated image. video encoder makes its motion estimations. There may Keywords: Motion Estimation, Motion Compensation, Group also be noises in the image capture device (such as a of Pictures (GOP), MPEG. video camera) or in the lines used for electrical transmission. A perfect motion model would take all the factors into account and find the motion that has the 1. INTRODUCTION maximum likelihood from the observed video sequence. The Digital video coding format has gradually increased The movement of objects can change between the frames. since the 90s when the MPEG-1 first emerged. In a model of the object motion between the frames, “the Digitization of video scenes was an inevitable step since it motion that occurred between the reference frame and the has many advantages over analog video. Digital video is current frame” can be estimated by the encoder. This virtually immune to noise, easier to transmit and is able method is known as the motion estimation (ME) [1]. to provide a more interactive interface to users. In the For the better current frame prediction, the encoder used video scene, the data redundancy arises due to changes in the information that move between the reference frame spatial, temporal and statistical correlation between the contents and motion model. This process is called the frames. Due to the difference in their characteristics, the motion compensation (MC), and the prediction so correlation is processed separately. Hybrid video coding produced is called the motion-compensated prediction architectures have been employed since the first (MCP) or the displaced-frame (DF) [2]. The coded generation of the video coding standards, i.e. MPEG. The prediction error signal is known as called the displaced- MPEG format consists three main parts to reduce the data frame difference (DFD). A block diagram of a motion- redundancy from the all three sources described above. compensated coding system is explained in the Figure The Motion estimation and compensation both are used to Generally, The interframe coding is most commonly used reduce the temporal redundancy between the successive method. frames in the time domain. The Transform coding, also The ME use reference frame can occur temporally after or commonly used in the image compression, is employed to before the current frame, it is called forward and reduce the spatial dependency within a frame in the backward prediction, respectively. But in the bidirectional spatial domain. The entropy coding is used to reduce the prediction, two reference frames (one each for forward statistical redundancy over the residue and the and backward prediction) are worked and the two compression data. This technique is also called lossless predictions are interpolated (the resulting predicted frame compression technique; it is commonly used in the file is called B-frame). The block-matching motion estimation compression. (BMME) algorithm is most commonly used ME method. - 33 - International Journal of Emerging Trends & Technology in Computer Science (IJETTCS) Web Site: www.ijettcs.org Email: [email protected], [email protected] Volume 1, Issue 1, May-June 2012 ISSN 2278-6856 preferred because its simple and good compromise between the prediction quality and the motion overhead. There are many other approaches to motion estimation, some using the frequency or wavelet domains, and designers have considered scope to invent new methods since this process does not need to be specified in coding standards. The standards need only specify how the motion vectors should be interpreted by the decoder. Block Matching (BM) is the most common method of motion estimation. Typically each macro block (16×16 pels) in a new frame is compared with the shifted regions of the same size from previous decoded frame and the shift its results in minimum error is selected as the best motion vector for that macro block. After it, motion compensated prediction frame is formed from all the Figure 1. Motion Compensated Video Coding shifted regions of the previous decoded frame [2]. 2.1 Block Matching Algorithm 2.1.1 Backward Motion Estimation Figure 2 illustrates a process of block-matching The motion estimation generally considered as backward algorithm. In the typical Block Matching Algorithm, motion estimation, since the current frame is considered each frame is divided into blocks and each of which as the candidate frame and the reference frame on which consists of the luminance and the chrominance blocks. the motion vectors are searched is a past frame, that is, Usually, for the coding efficiency, the motion estimation the search is backward. Backward motion estimation will performed only on a luminance block. The each leads to forward motion prediction. luminance block in the present frame will matched against candidate blocks in the search area on the reference frame. The candidate blocks are just the displaced versions of the original block. The best candidate block is found and its motion vector is recorded. In the typical interframe coder, the input frame is subtracted from prediction of reference frame. Accordingly, motion vector and resulting error can be transmitted instead of original luminance block; therefore interframe redundancy is removed and data compression is achieved. At receiver side, decoder builds frame difference signal from received data and adds it to reconstructed reference frames. Figure 3. Backward Motion estimation with current frame as k and frame (k-1) as the reference frame 2.1.2 Forward Motion Estimation It is just the opposite of backward motion estimation. Here, the search for motion vectors is carried out on a frame that appears later than the candidates frame in temporal ordering. In other words, the search is “forward”. Forward motion estimation leads to backward motion prediction. It may appear that forward motion estimation is unusual, since one requires future frames to predict the candidate frame. However, this is not unusual, since the candidate frame, for which the motion vector is Figure 2. Motion Estimation being sought is not necessarily the current, that is the most recent frame. It is possible to store more than one This algorithm is use the concept of a translational model frame and use one of the past frames as a candidate frame for the objects motion between frames. Here it is assumes that uses another frame, appearing later in the temporal that, all the pels within a block undergo same order as a reference. translational movement. Apart from it, there are many other the ME methods, but the BMME is normally - 34 - International Journal of Emerging Trends & Technology in Computer Science (IJETTCS) Web Site: www.ijettcs.org Email: [email protected], [email protected] Volume 1, Issue 1, May-June 2012 ISSN 2278-6856 This is also referred to as the optical flow method, which works on the fundamental assumption of brightness constancy that is the intensity of a pixel remains constant, when it is displaced. However, no unique match for a pixel in the reference frame is found in the direction normal to the intensity gradient. It is for this reason that an additional constraint is also introduced in terms of the smoothness of displacement vectors in the neighborhood. The smoothness constraint makes the algorithm interactive and requires excessively large computation time, making it unsuitable for practical and real time implementation. An alternative and faster approach is the block based Figure 4. Forward Motion estimation with current frame motion estimation. In this method, the candidates frame as k and frame (k+1) as the reference frame is divided into non-overlapping blocks ( of size 16 × 16, or 8 × 8 or even 4 × 4 pixels in the recent standards) and Forward motion estimation (or backward motion in the each of such candidate block, best motion vector is compensation) is supported
Load more

Recommended publications
  • On Computational Complexity of Motion Estimation Algorithms in MPEG-4 Encoder
    On Computational Complexity of Motion Estimation Algorithms in MPEG-4 Encoder Muhammad Shahid This thesis report is presented as a part of degree of Master of Science in Electrical Engineering Blekinge Institute of Technology, 2010 Supervisor: Tech Lic. Andreas Rossholm, ST-Ericsson Examiner: Dr. Benny Lovstrom, Blekinge Institute of Technology Abstract Video Encoding in mobile equipments is a computationally demanding fea- ture that requires a well designed and well developed algorithm. The op- timal solution requires a trade off in the encoding process, e.g. motion estimation with tradeoff between low complexity versus high perceptual quality and efficiency. The present thesis works on reducing the complexity of motion estimation algorithms used for MPEG-4 video encoding taking SLIMPEG motion estimation algorithm as reference. The inherent prop- erties of video like spatial and temporal correlation have been exploited to test new techniques of motion estimation. Four motion estimation algo- rithms have been proposed. The computational complexity and encoding quality have been evaluated. The resulting encoded video quality has been compared against the standard Full Search algorithm. At the same time, reduction in computational complexity of the improved algorithm is com- pared against SLIMPEG which is already about 99 % more efficient than Full Search in terms of computational complexity. The fourth proposed algorithm, Adaptive SAD Control, offers a mechanism of choosing trade off between computational complexity and encoding quality in a dynamic way. Acknowledgements It is a matter of great pleasure to express my deepest gratitude to my ad- visors Dr. Benny L¨ovstr¨om and Andreas Rossholm for all their guidance, support and encouragement throughout my thesis work.
    [Show full text]
  • 1. in the New Document Dialog Box, on the General Tab, for Type, Choose Flash Document, Then Click______
    1. In the New Document dialog box, on the General tab, for type, choose Flash Document, then click____________. 1. Tab 2. Ok 3. Delete 4. Save 2. Specify the export ________ for classes in the movie. 1. Frame 2. Class 3. Loading 4. Main 3. To help manage the files in a large application, flash MX professional 2004 supports the concept of _________. 1. Files 2. Projects 3. Flash 4. Player 4. In the AppName directory, create a subdirectory named_______. 1. Source 2. Flash documents 3. Source code 4. Classes 5. In Flash, most applications are _________ and include __________ user interfaces. 1. Visual, Graphical 2. Visual, Flash 3. Graphical, Flash 4. Visual, AppName 6. Test locally by opening ________ in your web browser. 1. AppName.fla 2. AppName.html 3. AppName.swf 4. AppName 7. The AppName directory will contain everything in our project, including _________ and _____________ . 1. Source code, Final input 2. Input, Output 3. Source code, Final output 4. Source code, everything 8. In the AppName directory, create a subdirectory named_______. 1. Compiled application 2. Deploy 3. Final output 4. Source code 9. Every Flash application must include at least one ______________. 1. Flash document 2. AppName 3. Deploy 4. Source 10. In the AppName/Source directory, create a subdirectory named __________. 1. Source 2. Com 3. Some domain 4. AppName 11. In the AppName/Source/Com directory, create a sub directory named ______ 1. Some domain 2. Com 3. AppName 4. Source 12. A project is group of related _________ that can be managed via the project panel in the flash.
    [Show full text]
  • An Overview of Block Matching Algorithms for Motion Vector Estimation
    Proceedings of the Second International Conference on Research in DOI: 10.15439/2017R85 Intelligent and Computing in Engineering pp. 217–222 ACSIS, Vol. 10 ISSN 2300-5963 An Overview of Block Matching Algorithms for Motion Vector Estimation Sonam T. Khawase1, Shailesh D. Kamble2, Nileshsingh V. Thakur3, Akshay S. Patharkar4 1PG Scholar, Computer Science & Engineering, Yeshwantrao Chavan College of Engineering, India 2Computer Science & Engineering, Yeshwantrao Chavan College of Engineering, India 3Computer Science & Engineering, Prof Ram Meghe College of Engineering & Management, India 4Computer Technology, K.D.K. College of Engineering, India [email protected], [email protected],[email protected], [email protected] Abstract–In video compression technique, motion estimation is one of the key components because of its high computation complexity involves in finding the motion vectors (MV) between the frames. The purpose of motion estimation is to reduce the storage space, bandwidth and transmission cost for transmission of video in many multimedia service applications by reducing the temporal redundancies while maintaining a good quality of the video. There are many motion estimation algorithms, but there is a trade-off between algorithms accuracy and speed. Among all of these, block-based motion estimation algorithms are most robust and versatile. In motion estimation, a variety of fast block based matching algorithms has been proposed to address the issues such as reducing the number of search/checkpoints, computational cost, and complexities etc. Due to its simplicity, the Fig. 1. Classification of Frames block-based technique is most popular. Motion estimation is only known for video coding process but for solving real life redundancies.
    [Show full text]
  • Motion Estimation at the Decoder Sven Klomp and Jorn¨ Ostermann Leibniz Universit¨At Hannover Germany
    5 Motion Estimation at the Decoder Sven Klomp and Jorn¨ Ostermann Leibniz Universit¨at Hannover Germany 1. Introduction All existing video coding standards, such as MPEG-1,2,4 or ITU-T H.26x, perform motion estimation at the encoder in order to exploit temporal dependencies within the video sequence. The estimated motion vectors are transmitted and used by the decoder to assemble a prediction of the current frame. Since only the prediction error and the motion information are transmitted, instead of intra coding the pixel values, compression is achieved. Due to block-based motion estimation, accurate compensation at object borders can only be achieved with small block sizes. Large blocks may contain several objects which move in different directions. Thus, accurate motion estimation and compensation is not possible, as shown by Klomp et al. (2010a) using prediction error variance, and small block sizes are favourable. However, the smaller the block, the more motion vectors have to be transmitted, resulting in a contradiction to bit rate reduction. 4.0 3.5 3.0 2.5 MV Backward MV Forward MV Bidirectional 2.0 RS Backward Rate (bit/pixel) RS Forward 1.5 RS Bidirectional 1.0 0.5 0.0 2 4 8 16 32 Block Size Fig. 1. Data rates of residual (RS) and motion vectors (MV) for different motion compensation techniques (Kimono sequence). 782 Effective Video Coding for MultimediaVideo Applications Coding These characteristics can be observed in Figure 1, where the rates for the residual and the motion vectors are plotted for different block sizes and three prediction techniques.
    [Show full text]
  • Motion Vector Forecast and Mapping (MV-Fmap) Method for Entropy Coding Based Video Coders Julien Le Tanou, Jean-Marc Thiesse, Joël Jung, Marc Antonini
    Motion Vector Forecast and Mapping (MV-FMap) Method for Entropy Coding based Video Coders Julien Le Tanou, Jean-Marc Thiesse, Joël Jung, Marc Antonini To cite this version: Julien Le Tanou, Jean-Marc Thiesse, Joël Jung, Marc Antonini. Motion Vector Forecast and Mapping (MV-FMap) Method for Entropy Coding based Video Coders. MMSP’10 2010 IEEE International Workshop on Multimedia Signal Processing, Oct 2010, Saint Malo, France. pp.206. hal-00531819 HAL Id: hal-00531819 https://hal.archives-ouvertes.fr/hal-00531819 Submitted on 3 Nov 2010 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Motion Vector Forecast and Mapping (MV-FMap) Method for Entropy Coding based Video Coders Julien Le Tanou #1, Jean-Marc Thiesse #2, Joël Jung #3, Marc Antonini ∗4 # Orange Labs 38 rue du G. Leclerc, 92794 Issy les Moulineaux, France 1 [email protected] {2 jeanmarc.thiesse,3 joelb.jung}@orange-ftgroup.com ∗ I3S Lab. University of Nice-Sophia Antipolis/CNRS 2000 route des Lucioles, 06903 Sophia Antipolis, France 4 [email protected] Abstract—Since the finalization of the H.264/AVC standard between motion vectors of neighboring frames and blocks, we and in order to meet the target set by both ITU-T and MPEG propose in this paper a method for motion vector coding based to define a new standard that reaches 50% bit rate reduction on a motion vector residuals forecast followed by an adaptive compared to H.264/AVC, many tools have efficiently improved the texture coding and the motion compensation accuracy.
    [Show full text]
  • LOW COMPLEXITY H.264 to VC-1 TRANSCODER by VIDHYA
    LOW COMPLEXITY H.264 TO VC-1 TRANSCODER by VIDHYA VIJAYAKUMAR Presented to the Faculty of the Graduate School of The University of Texas at Arlington in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE IN ELECTRICAL ENGINEERING THE UNIVERSITY OF TEXAS AT ARLINGTON AUGUST 2010 Copyright © by Vidhya Vijayakumar 2010 All Rights Reserved ACKNOWLEDGEMENTS As true as it would be with any research effort, this endeavor would not have been possible without the guidance and support of a number of people whom I stand to thank at this juncture. First and foremost, I express my sincere gratitude to my advisor and mentor, Dr. K.R. Rao, who has been the backbone of this whole exercise. I am greatly indebted for all the things that I have learnt from him, academically and otherwise. I thank Dr. Ishfaq Ahmad for being my co-advisor and mentor and for his invaluable guidance and support. I was fortunate to work with Dr. Ahmad as his research assistant on the latest trends in video compression and it has been an invaluable experience. I thank my mentor, Mr. Vishy Swaminathan, and my team members at Adobe Systems for giving me an opportunity to work in the industry and guide me during my internship. I would like to thank the other members of my advisory committee Dr. W. Alan Davis and Dr. William E Dillon for reviewing the thesis document and offering insightful comments. I express my gratitude Dr. Jonathan Bredow and the Electrical Engineering department for purchasing the software required for this thesis and giving me the chance to work on cutting edge technologies.
    [Show full text]
  • Video Coding Standards
    Module 8 Video Coding Standards Version 2 ECE IIT, Kharagpur Lesson 23 MPEG-1 standards Version 2 ECE IIT, Kharagpur Lesson objectives At the end of this lesson, the students should be able to : 1. Enlist the major video coding standards 2. State the basic objectives of MPEG-1 standard. 3. Enlist the set of constrained parameters in MPEG-1 4. Define the I- P- and B-pictures 5. Present the hierarchical data structure of MPEG-1 6. Define the macroblock modes supported by MPEG-1 23.0 Introduction In lesson 21 and lesson 22, we studied how to perform motion estimation and thereby temporally predict the video frames to exploit significant temporal redundancies present in the video sequence. The error in temporal prediction is encoded by standard transform domain techniques like the DCT, followed by quantization and entropy coding to exploit the spatial and statistical redundancies and achieve significant video compression. The video codecs therefore follow a hybrid coding structure in which DPCM is adopted in temporal domain and DCT or other transform domain techniques in spatial domain. Efforts to standardize video data exchange via storage media or via communication networks are actively in progress since early 1980s. A number of international video and audio standardization activities started within the International Telephone Consultative Committee (CCITT), followed by the International Radio Consultative Committee (CCIR), and the International Standards Organization / International Electrotechnical Commission (ISO/IEC). An experts group, known as the Motion Pictures Expects Group (MPEG) was established in 1988 in the framework of the Joint ISO/IEC Technical Committee with an objective to develop standards for coded representation of moving pictures, associated audio, and their combination for storage and retrieval of digital media.
    [Show full text]
  • 11.2 Motion Estimation and Motion Compensation 421
    11.2 Motion Estimation and Motion Compensation 421 vertical component to the enhancement filter, making the overall filter separable with 3 3 support. × 11.2 MOTION ESTIMATION AND MOTION COMPENSATION Motion compensation (MC) is very useful in video filtering to remove noise and enhance signal. It is useful since it allows the filter or coder to process through the video on a path of near-maximum correlation based on following motion trajectories across the frames making up the image sequence or video. Motion compensation is also employed in all distribution-quality video coding formats, since it is able to achieve the smallest prediction error, which is then easier to code. Motion can be characterized in terms of either a velocity vector v or displacement vector d and is used to warp a reference frame onto a target frame. Motion estimation is used to obtain these displacements, one for each pixel in the target frame. Several methods of motion estimation are commonly used: • Block matching • Hierarchical block matching • Pel-recursive motion estimation • Direct optical flow methods • Mesh-matching methods Optical flow is the apparent displacement vector field d .d1,d2/ we get from setting (i.e., forcing) equality in the so-called constraint equationD x.n1,n2,n/ x.n1 d1,n2 d2,n 1/. (11.2–1) D − − − All five approaches start from this basic equation, which is really just an ide- alization. Departures from the ideal are caused by the covering and uncovering of objects in the viewed scene, lighting variation both in time and across the objects in the scene, movement toward or away from the camera, as well as rotation about an axis (i.e., 3-D motion).
    [Show full text]
  • Diapositivo 1
    VC 14/15 – TP16 Video Compression Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos Miguel Tavares Coimbra Outline • The need for compression • Types of redundancy • Image compression • Video compression VC 14/15 - TP16 - Video Compression Topic: The need for compression • The need for compression • Types of redundancy • Image compression • Video compression VC 14/15 - TP16 - Video Compression Images are great! VC 14/15 - TP16 - Video Compression But... Images need storage space... A lot of space! Size: 1024 x 768 pixels RGB colour space 8 bits per color = 2,6 MBytes VC 14/15 - TP16 - Video Compression What about video? • VGA: 640x480, 3 bytes per pixel -> 920KB per image. • Each second of video: 23 MB • Each hour of vídeo: 83 GB The death of Digital Video VC 14/15 - TP16 - Video Compression What if... ? • We exploit redundancy to compress image and video information? – Image Compression Standards – Video Compression Standards • “Explosion” of Digital Image & Video – Internet media – DVDs – Digital TV – ... VC 14/15 - TP16 - Video Compression Compression • Data compression – Reduce the quantity of data needed to store the same information. – In computer terms: Use fewer bits. • How is this done? – Exploit data redundancy. • But don’t we lose information? – Only if you want to... VC 14/15 - TP16 - Video Compression Types of Compression • Lossy • Lossless – We do not obtain an – We obtain an exact exact copy of our copy of our compressed data after compressed data after decompression. decompression. – Very high compression – Lower compression rates. rates. – Increased degradation – Freely compress / with sucessive decompress images. compression / It all depends on what we decompression.
    [Show full text]
  • AVC to the Max: How to Configure Encoder
    Contents Company overview …. ………………………………………………………………… 3 Introduction…………………………………………………………………………… 4 What is AVC….………………………………………………………………………… 6 Making sense of profiles, levels, and bitrate………………………………………... 7 Group of pictures and its structure..………………………………………………… 11 Macroblocks: partitioning and prediction modes….………………………………. 14 Eliminating spatial redundancy……………………………………………………… 15 Eliminating temporal redundancy……...……………………………………………. 17 Adaptive quantization……...………………………………………………………… 24 Deblocking filtering….….…………………………………………………………….. 26 Entropy encoding…………………………………….……………………………….. 2 8 Conclusion…………………………………………………………………………….. 29 Contact details..………………………………………………………………………. 30 2 www.elecard.com Company overview Elecard company, founded in 1988, is a leading provider of software products for encoding, decoding, processing, monitoring and analysis of video and audio data in 9700 companies various formats. Elecard is a vendor of professional software products and software development kits (SDKs); products for in - depth high - quality analysis and monitoring of the media content; countries 1 50 solutions for IPTV and OTT projects, digital TV broadcasting and video streaming; transcoding servers. Elecard is based in the United States, Russia, and China with 20M users headquarters located in Tomsk, Russia. Elecard products are highly appreciated and widely used by the leaders of IT industry such as Intel, Cisco, Netflix, Huawei, Blackmagic Design, etc. For more information, please visit www.elecard.com. 3 www.elecard.com Introduction Video compression is the key step in video processing. Compression allows broadcasters and premium TV providers to deliver their content to their audience. Many video compression standards currently exist in TV broadcasting. Each standard has different properties, some of which are better suited to traditional live TV while others are more suited to video on demand (VoD). Two basic standards can be identified in the history of video compression: • MPEG-2, a legacy codec used for SD video and early digital broadcasting.
    [Show full text]
  • Video Coding Standards 1 Videovideo Codingcoding Standardsstandards
    VideoVideo CodingCoding StandardsStandards • H.120 • H.261 • MPEG-1 and MPEG-2/H.262 • H.263 • MPEG-4 Thomas Wiegand: Digital Image Communication Video Coding Standards 1 VideoVideo CodingCoding StandardsStandards MPEG-2 digital TV 2 -6 Mbps ITU-R 601 166 Mbit/s H.261 ISDN 64 kbps Picture phone H.263 PSTN < 28.8 kbps picture phone Thomas Wiegand: Digital Image Communication Video Coding Standards 2 H.120:H.120: TheThe FirstFirst DigitalDigital VideoVideo CodingCoding StandardStandard • ITU-T (ex-CCITT) Rec. H.120: The first digital video coding standard (1984) • v1 (1984) had conditional replenishment, DPCM, scalar quantization, variable-length coding, switch for quincunx sampling • v2 (1988) added motion compensation and background prediction • Operated at 1544 (NTSC) and 2048 (PAL) kbps • Few units made, essentially not in use today Thomas Wiegand: Digital Image Communication Video Coding Standards 3 H.261:H.261: TheThe BasisBasis ofof ModernModern VideoVideo CompressionCompression • ITU-T (ex-CCITT) Rec. H.261: The first widespread practical success • First design (late ’80s) embodying typical structure that dominates today: 16x16 macroblock motion compensation, 8x8 DCT, scalar quantization, and variable-length coding • Other key aspects: loop filter, integer-pel motion compensation accuracy, 2-D VLC for coefficients • Operated at 64-2048 kbps • Still in use, although mostly as a backward- compatibility feature – overtaken by H.263 Thomas Wiegand: Digital Image Communication Video Coding Standards 4 H.261&3H.261&3 MacroblockMacroblock
    [Show full text]
  • Motion Compensation on DCT Domain
    EURASIP Journal on Applied Signal Processing 2001:3, 147–162 © 2001 Hindawi Publishing Corporation Motion Compensation on DCT Domain Ut-Va Koc Lucent Technologies Bell Labs, 600 Mountain Avenue, Murray Hill, NJ 07974, USA Email: [email protected] K. J. Ray Liu Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD 20742, USA Email: [email protected] Received 21 May 2001 and in revised form 21 September 2001 Alternative fully DCT-based video codec architectures have been proposed in the past to address the shortcomings of the conven- tional hybrid motion compensated DCT video codec structures traditionally chosen as the basis of implementation of standard- compliant codecs. However, no prior effort has been made to ensure interoperability of these two drastically different architectures so that fully DCT-based video codecs are fully compatible with the existing video coding standards. In this paper, we establish the criteria for matching conventional codecs with fully DCT-based codecs. We find that the key to this interoperability lies in the heart of the implementation of motion compensation modules performed in the spatial and transform domains at both the encoder and the decoder. Specifically,if the spatial-domain motion compensation is compatible with the transform-domain motion compensation, then the states in both the coder and the decoder will keep track of each other even after a long series of P-frames. Otherwise, the states will diverge in proportion to the number of P-frames between two I-frames. This sets an important criterion for the development of any DCT-based motion compensation schemes.
    [Show full text]