Efficient Method for Half-Pixel Block Motion Estimation Using Block Differentials
|
|
- Sherman Bond
- 5 years ago
- Views:
Transcription
1 Efficient Method for Half-Pixel Block Motion Estimation Using Block Differentials Tuukka Toivonen and Janne Heikkilä Machine Vision Group Infotech Oulu and Department of Electrical and Information Engineering P. O. Box 500, FIN-9001 University of Oulu, Finland Abstract. We present an efficient method for performing half-pixel accuracy block motion estimation, as required by common video coding standards such as H.263 and MPEG-. The estimation quality is superb, in some cases even slightly better than the conventional method, but with % less computation. Alternatively, computation can be decreased by 9% with only small penalty on quality. The method interpolates directly the sum of squared or absolute differences (SSD or SAD) matching criterion at integer pixel positions and subtracts a term based on horizontal, vertical, and diagonal differentials obtained from the search area. 1 Introduction Most video coding standards, such as MPEG- and H.263, use block motion estimation (ME) and compensation (MC) for removing temporal redundancy. Each frame in a video sequence is divided into blocks, typically picture elements (pixels). Each current block B is compared with overlapping candidate blocks C in the search area at the previous frame, and the displacement between the current and the most similar candidate block is used as the motion vector for the current block. Typical criteria, which are used for measuring the similarity, are sum of absolute differences (SAD) and sum of squared differences (SSD): E y,x = H 1 W 1 h=0 w=0 B h,w C h,w (y, x) p (1) where E y,x denotes the criterion value for a candidate motion vector (y, x) corresponding to the candidate block C (y, x). The block size is H W pixels and p = 1 for SAD and 2 for SSD. Block elements are denoted as X h,w for an element or pixel at (h, w). The SSD criterion gives typically slightly better image quality than SAD, but the latter is more widely used due to smaller computational complexity. In practice, the displacement of an object between two subsequent frames in a video is not an integer number of pixels. Therefore, modern coding standards employ also fractional pixel motion estimation, in which motion vectors may Copyright c 2003 Springer-Verlag. Published in the 2003 International Workshop VLBV, scheduled for September 18 19, 2003 in Madrid, Spain. Included in Lecture Notes in Computer Science 289: Visual Content Processing and Representation, available for purchase from http: //
2 6.6 x SSD value Motion vector X coordinate Fig. 1. Behavior of typical fractional pixel motion compensation. point to candidate blocks placed at half-pixel (or sometimes quarter pixel) locations. As defined in most standards, the pixel values in these fractional candidate blocks are obtained by interpolating linearly or bilinearly the nearest pixels at integer locations. If the motion vector (y, x) points to an integer location, then the horizontally half-pixel candidate block C (y, x + 1/2) pixels are obtained by ( C h,w y, x + 1 ) = C h,w (y, x) C h,w (y, x + 1) (2) for h = and w = (from now on, the pixel indices h and w are dropped for conveniency). Vertically half-pixel candidate blocks are obtained similarly, and when both motion vector indices are fractional, ( C y + 1 2, x + 1 ) = 1 2 C (y, x) + 1 C (y, x + 1) + 1 C (y + 1, x) + 1 C (y + 1, x + 1). (3) That is, a motion vector pointing to a fractional candidate block can be thought to point into several candidate blocks at integer locations, whose average is used for motion compensation. The averaging does not only compensate for noninteger displacement, but also filters out fast image variations and noise. Therefore, a candidate block at a fractional location usually gives better match than at an integer location, as shown in Fig. 1.
3 2 Previous Search Methods Conventional encoders perform motion estimation in two steps to save computation: first they find the criterion minimum at an integer location (IL). Then the search area around the best integer candidate block is interpolated into higher resolution and the motion vector is refined into sub-pixel accuracy by computing the criterion between the current block and usually the eight nearest half-pixel candidate blocks to the best integer motion vector. However, this requires much computation and may be difficult to perform in real-time encoders. Thus, faster methods have been investigated. We assume that the criterion values at the eight nearest integer locations surrounding the best integer motion vector have been evaluated and stored into memory, so that they are available during the half-pixel motion estimation without extra computation. This can be easily achieved with many fast full search algorithms [,5], and it is a reasonable assumption even with other fast search methods, because it guarantees that the nearest integer locations do not have a smaller criterion value than the best match which was found. Lee et al. [1] propose that only the four most promising half-pixel locations of the eight are tested. This halves the criterion computations. The surrounding eight criterion values at integer positions are used for deciding which half-pixel locations are selected. However, the total computation, as compared to the conventional method (CM), is decreased only by 38%, because the candidate blocks still need to be interpolated to obtain half-pixel blocks. This increases memory accesses and the amount of memory required for motion estimation. Also the quality will be slightly lower than with the conventional method. A straightforward way is to interpolate directly the criterion values from the integer locations into fractional motion vector locations and select the motion vector corresponding to the smallest value. Some examples presented in literature are linear interpolation method (LIM) and quadratic fit method (QFM) [3]. Both the candidate block interpolation and the direct criterion computation is avoided. Unfortunately, the result will be poor, because low-order polynomials can not approximate well the behavior of the fractional matching criterion, which is obvious from Fig. 1. More interesting interpolation technique called MAE approximation method (MAM) was presented by Senda et al. [2]: the half-pixel criterion is interpolated linearly from two or four nearest integer locations and weighted with a constant factor, E y,x+1/2 = ψ hv (E y,x + E y,x+1 ) /2 and E y+1/2,x+1/2 = ψ d (E y,x + E y,x+1 + E y+1,x + E y+1,x+1 ) /. The factor is ψ hv horizontally and vertically and ψ d diagonally. However, it is not clear how to choose the factors: the best values must be obtained experimentally, and they depend on video content and encoder bitrate. Even when the optimal values for a certain sequence are used, the encoded quality will be clearly worse than with the conventional half-pixel search, as shown in Table 1. In a later paper [3], Senda derives horizontally and vertically half-pixel SSD values from integer locations and block differentials, and applies the results for approximating the factor ψ hv for SAD. However, he does not consider diagonal
4 cases. We will expand the Senda s derivation into diagonally half-pixel locations in the next section and show that it is not necessary to compute the factor at all: an expensive division is avoided and less approximations are required. We also investigate fast algorithms for computing the differentials in Section. 3 Half-Pixel Criterion Let us compute directly the SSD at horizontally half-pixel location by substituting (2) into (1): [ E n = B 1 2 C (y, x) 1 ] 2 2 C (y, x + 1) () where E n is a single sum term in (1). By expanding the square and rearranging the terms, we get E n = 1 2 B2 + 1 C (y, x)2 BC (y, x) + 1 C (y, x) C (y, x + 1) B2 + 1 C (y, x + 1)2 BC (y, x + 1). (5) This can be factored into squares, yielding E n = 1 2 [B C (y, x)] [B C (y, x + 1)]2 1 [C (y, x) C (y, x + 1)]2. (6) By summing over h = 0... H 1 and w = 0... W 1, we get E y,x+ 1 2 = 1 2 E y,x E y,x+1 1 H y,x (7) where H is the horizontal differential of a candidate block H y,x = H 1 W 1 h=0 w=0 C h,w (y, x) C h,w (y, x + 1) p (8) for SSD with p = 2. Similarly the SSD criterion can be also derived for vertically half-pixel criterion, in which case the candidate block vertical differential V y,x = H 1 W 1 h=0 w=0 C h,w (y, x) C h,w (y + 1, x) p (9) is required instead of the horizontal differential. For diagonally half-pixel locations, we substitute (3) into (1): [ E n = B 1 C (y, x) 1 C (y, x + 1) 1 C (y + 1, x) 1 C (y + 1, x + 1) ] 2. (10)
5 We proceed in the same manner than in the horizontal case, expanding the square. By rearranging the terms and factoring into squares, we get E n = 1 [B C (y, x)]2 + 1 [B C (y, x + 1)]2 + 1 [B C (y + 1, x)]2 + 1 [B C (y + 1, x + 1)]2 1 [C (y, x) C (y, x + 1)]2 1 [C (y, x) C (y + 1, x)]2 1 [C (y, x) C (y + 1, x + 1)]2 1 [C (y + 1, x) C (y, x + 1)]2 1 [C (y + 1, x) C (y + 1, x + 1)]2 1 [C (y, x + 1) C (y + 1, x + 1)]2. (11) Finally, by summing the terms, the SSD criterion is E y+ 1 2,x+ 1 2 = 1 E y,x + 1 E y,x E y+1,x + 1 E y+1,x+1 1 H y,x 1 H y+1,x 1 V y,x 1 V y,x+1 1 N y,x 1 S y,x (12) where H and V are horizontal and vertical block differentials, defined above in (8) and (9), and N and S are diagonal differentials in northwest-southeast and southwest-northeast directions, respectively. The value of the half-pixel SSD criterion between four integer locations is the average of the SSD values at the integer locations, minus the weighted differentials. The differentials are shown in Fig. 2 as arrows, where the integer pixel locations are denoted as filled circles and the half-pixel location as an open circle. The SAD criterion can not be derived similarly for the half-pixel locations. However, as pointed out by Senda [3], there is a close relation between SAD and SSD. We can approximate the SAD criterion value by using p = 1 in the differential (8), in which case the approximated horizontally half-pixel SAD is 1 E y,x E y,x E y,x H2 y,x (13) where E is the SAD criterion (1) with p = 1. The square root can be removed by squaring both sides of the equation, and the obtained algorithm can apply integer pixel SAD values. In the computation of the differentials the multiplication is replaced with an absolute value, although the actual biased interpolation in (13) still requires a few multiplications. The vertical and diagonal cases can be handled in the same manner.
6 H V N S Fig. 2. Differentials for half-pixel motion estimation. Subtract Add Fig. 3. Computing the differentials using the sliding window method. The shaded area denotes a single candidate block. Computing the Differentials For computing the SSD values of the nearest eight or sixteen half-pixel locations to the best integer pixel match, we need six vertical and horizontal and eight diagonal or in total twenty differentials. However, the candidate blocks, whose differentials are computed, mostly overlap. We can first compute differentials of columns of the topmost candidate blocks, saving the results. Summing the first W of these yields the differential of the first candidate block, as shown at left in Fig. 3. The differential of the next topmost candidate block is obtained from the previous by subtracting the differential of the first leftmost column of the previous candidate block and adding the differential of the new rightmost column (at middle in the figure). This is repeated for all two or three blocks in the row. After each row, the stored column differentials are updated by subtracting the differentials at the topmost pixel row and adding the new differentials at the bottommost pixel row (at right in the figure). Then the process repeats, obtaining again the differential of the first candidate block at the second row by summing the first W stored differentials. This part is very similar to the computation of the reference block norm, which is described in [5] with a greater detail. Using this sliding window (SW) technique for computing the horizontal, vertical, and the two diagonal differentials in distinct orientations, the twenty differentials are obtained, and the exact
7 Table 1. PSNR in decibels of the predicted images and operation counts for half-pixel motion estimation Method IL CM MAM SW Max Sub IL CM MAM SW Max Sub Criterion SSD SSD SSD SSD SSD SSD SAD SAD SAD SAD SAD SAD Foreman Munchener Stefan Tempete Tourists Average Additions Multiplicat Abs. values Total SSD criterion values can be computed for either the eight or sixteen nearest half-pixel locations essentially with the same number of operations. In practice, one can compute only four differentials, horizontal, vertical, and two diagonal differentials, of a single candidate block located at the best integer pixel motion vector. Since the surrounding candidate blocks almost completely overlap with each one, we can assume that each differential in a particular orientation will be constant over all of the blocks. This avoids the somewhat cumbersome calculation using the SW method and reduces the number of arithmetic operations, but gives very good approximation for the half-pixel SAD or SSD criteria. Another approximation, which will still maintain good quality, is to refrain from computing the diagonal differentials. These can be estimated well using the maximum of the horizontal and vertical diagonals, N S max {H, V}. Finally, the differentials can be computed from every other pixel i.e. computing them from subsampled candidate blocks. This will still supply adequate accuracy for some purposes. 5 Experimental Results The half-pixel motion estimation methods were implemented into Project Mayo s OpenDivX Core MPEG- encoder [6]. Five CIF-sized video sequences, each 200 frames long with 30 frames per second, were encoded at 38 kilobits per second. The coding results are shown in Table 1. The peak signal-to-noise power ratio (PSNR) between the predicted and the original frames is shown. With MAM and the SSD criterion ψ hv = 13/ and ψ d = 12/ and with the SAD criterion ψ hv = 15/ and ψ d = 1/, which produced the best results. For the differential SSD-based methods, sixteen half-pixel positions are tested; for the SAD-based methods, only eight are tested, because this yielded the best outcome. The Max method computes only the vertical and horizontal differentials of a single block; the Sub method is similar, except that the
8 block is also subsampled by two. The obtained SSD criterion is slightly different when computed from interpolated image, as in CM, than if computed directly using the differential SW method, because rounding is not accounted in the latter. However, this is more than recompensed because the SW method examines twice more half-pixel positions. Therefore the SW method with SSD produces the best results, with % less computation. 6 Conclusions We presented a new method for estimating motion vectors at half-pixel accuracy for video encoding. The method is based on computing the SSD or SAD criterion corresponding to half-pixel locations using block differentials and precomputed criterion values at integer locations. The method is very efficient, saving % of computation and image interpolation as compared to the conventional method, and still yielding better image quality, because sixteen half-pixel positions are tested instead of eight. By sacrificing only slightly quality and approximating the differentials, we can diminish computation up to 9% with only 0.2 db loss of predicted image quality. References 1. K.-H. Lee, J.-H. Choi, B.-K. Lee, and D.-G. Kim: Fast Two-Step Half-Pixel Accuracy Motion Vector Prediction. Electronics Letters 36, no. 7 (2000) Y. Senda, H. Harasaki, and M. Yano: A Simplified Motion Estimation Using An Approximation for the MPEG-2 Real-Time Encoder. International Conference on Acoustics, Speech, and Signal Processing (1995) Y. Senda, H. Harasaki, and M. Yano: Theoretical Background and Improvement of a Simplified Half-Pel Motion Estimation. Proceedings of International Conference on Image Processing 3 (1996) T. Toivonen, J. Heikkilä, and O. Silvén: A New Algorithm for Fast Full Search Block Motion Estimation Based on Number Theoretic Transforms. Proceedings of the 9th International Workshop on Systems, Signals, and Image Processing (2002) Y. Naito, T. Miyazaki, and I. Kuroda: A Fast Full-Search Motion Estimation Method for Programmable Processors with a Multiply-Accumulator. IEEE International Conference on Acoustics, Speech, and Signal Processing 6 (1996) Project Mayo: OpenDivX Core.0 alpha 50 ( ) URL: projectmayo.com/dnload/divxcore/encore50src.zip
Reduced Frame Quantization in Video Coding
Reduced Frame Quantization in Video Coding Tuukka Toivonen and Janne Heikkilä Machine Vision Group Infotech Oulu and Department of Electrical and Information Engineering P. O. Box 500, FIN-900 University
More informationRedundancy and Correlation: Temporal
Redundancy and Correlation: Temporal Mother and Daughter CIF 352 x 288 Frame 60 Frame 61 Time Copyright 2007 by Lina J. Karam 1 Motion Estimation and Compensation Video is a sequence of frames (images)
More informationComparative Study of Partial Closed-loop Versus Open-loop Motion Estimation for Coding of HDTV
Comparative Study of Partial Closed-loop Versus Open-loop Motion Estimation for Coding of HDTV Jeffrey S. McVeigh 1 and Siu-Wai Wu 2 1 Carnegie Mellon University Department of Electrical and Computer Engineering
More information2 Computation with Floating-Point Numbers
2 Computation with Floating-Point Numbers 2.1 Floating-Point Representation The notion of real numbers in mathematics is convenient for hand computations and formula manipulations. However, real numbers
More informationMotion estimation for video compression
Motion estimation for video compression Blockmatching Search strategies for block matching Block comparison speedups Hierarchical blockmatching Sub-pixel accuracy Motion estimation no. 1 Block-matching
More informationFAST MOTION ESTIMATION DISCARDING LOW-IMPACT FRACTIONAL BLOCKS. Saverio G. Blasi, Ivan Zupancic and Ebroul Izquierdo
FAST MOTION ESTIMATION DISCARDING LOW-IMPACT FRACTIONAL BLOCKS Saverio G. Blasi, Ivan Zupancic and Ebroul Izquierdo School of Electronic Engineering and Computer Science, Queen Mary University of London
More informationOverview: motion-compensated coding
Overview: motion-compensated coding Motion-compensated prediction Motion-compensated hybrid coding Motion estimation by block-matching Motion estimation with sub-pixel accuracy Power spectral density of
More informationOverview: motion estimation. Differential motion estimation
Overview: motion estimation Differential methods Fast algorithms for Sub-pel accuracy Rate-constrained motion estimation Bernd Girod: EE368b Image Video Compression Motion Estimation no. 1 Differential
More informationMesh Based Interpolative Coding (MBIC)
Mesh Based Interpolative Coding (MBIC) Eckhart Baum, Joachim Speidel Institut für Nachrichtenübertragung, University of Stuttgart An alternative method to H.6 encoding of moving images at bit rates below
More informationIN designing a very large scale integration (VLSI) chip,
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 7, NO. 5, OCTOBER 1997 741 A Comparison of Block-Matching Algorithms Mapped to Systolic-Array Implementation Sheu-Chih Cheng and Hsueh-Ming
More informationLow Bitrate Video Communications
New Half-Pixel Accuracy Motion Estimation Algorithms for Low Bitrate Video Communications H. Mahdavi-Nasab and Shohreh Kasaei Abstract Fractional-pixel accuracy motion estimation (ME) has shown to result
More informationMotion Estimation for Video Coding Standards
Motion Estimation for Video Coding Standards Prof. Ja-Ling Wu Department of Computer Science and Information Engineering National Taiwan University Introduction of Motion Estimation The goal of video compression
More information2 Computation with Floating-Point Numbers
2 Computation with Floating-Point Numbers 2.1 Floating-Point Representation The notion of real numbers in mathematics is convenient for hand computations and formula manipulations. However, real numbers
More informationResearch Article Block-Matching Translational and Rotational Motion Compensated Prediction Using Interpolated Reference Frame
Hindawi Publishing Corporation EURASIP Journal on Advances in Signal Processing Volume 2010, Article ID 385631, 9 pages doi:10.1155/2010/385631 Research Article Block-Matching Translational and Rotational
More informationHigh Performance VLSI Architecture of Fractional Motion Estimation for H.264/AVC
Journal of Computational Information Systems 7: 8 (2011) 2843-2850 Available at http://www.jofcis.com High Performance VLSI Architecture of Fractional Motion Estimation for H.264/AVC Meihua GU 1,2, Ningmei
More informationModule 7 VIDEO CODING AND MOTION ESTIMATION
Module 7 VIDEO CODING AND MOTION ESTIMATION Lesson 20 Basic Building Blocks & Temporal Redundancy Instructional Objectives At the end of this lesson, the students should be able to: 1. Name at least five
More informationChapter 2. Positional number systems. 2.1 Signed number representations Signed magnitude
Chapter 2 Positional number systems A positional number system represents numeric values as sequences of one or more digits. Each digit in the representation is weighted according to its position in the
More informationFloating-point representation
Lecture 3-4: Floating-point representation and arithmetic Floating-point representation The notion of real numbers in mathematics is convenient for hand computations and formula manipulations. However,
More informationFinite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras. Lecture - 36
Finite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras Lecture - 36 In last class, we have derived element equations for two d elasticity problems
More information3. Mr. White does not wear white, so he is wearing the blue shirt. 4. Then Mr. Red wears a white shirt.
5A METHOD 1: Strategy: Use reasoning. 1. Mr. Red and Mr. White are older than the man in gray. Neither Mr. Red nor Mr. White wears gray. Mr. Gray does not wear gray. So Mr. Blue wears the gray shirt. 2.
More informationReduced 4x4 Block Intra Prediction Modes using Directional Similarity in H.264/AVC
Proceedings of the 7th WSEAS International Conference on Multimedia, Internet & Video Technologies, Beijing, China, September 15-17, 2007 198 Reduced 4x4 Block Intra Prediction Modes using Directional
More informationGCSE-AS Mathematics Bridging Course. Chellaston School. Dr P. Leary (KS5 Coordinator) Monday Objectives. The Equation of a Line.
GCSE-AS Mathematics Bridging Course Chellaston School Dr (KS5 Coordinator) Monday Objectives The Equation of a Line Surds Linear Simultaneous Equations Tuesday Objectives Factorising Quadratics & Equations
More informationAn Illustrative Study of the Enumeration of Tilings:
An Illustrative Study of the Enumeration of Tilings: Conjecture Discovery and Proof Techniques by Chris Douglas 1.0 Introduction We have exact formulas for the number of tilings of only a small number
More informationMotion Estimation using Block Overlap Minimization
Motion Estimation using Block Overlap Minimization Michael Santoro, Ghassan AlRegib, Yucel Altunbasak School of Electrical and Computer Engineering, Georgia Institute of Technology Atlanta, GA 30332 USA
More informationExpress Letters. A Simple and Efficient Search Algorithm for Block-Matching Motion Estimation. Jianhua Lu and Ming L. Liou
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 7, NO. 2, APRIL 1997 429 Express Letters A Simple and Efficient Search Algorithm for Block-Matching Motion Estimation Jianhua Lu and
More informationCoding of Coefficients of two-dimensional non-separable Adaptive Wiener Interpolation Filter
Coding of Coefficients of two-dimensional non-separable Adaptive Wiener Interpolation Filter Y. Vatis, B. Edler, I. Wassermann, D. T. Nguyen and J. Ostermann ABSTRACT Standard video compression techniques
More informationVideo compression with 1-D directional transforms in H.264/AVC
Video compression with 1-D directional transforms in H.264/AVC The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation Kamisli, Fatih,
More informationModule 7 VIDEO CODING AND MOTION ESTIMATION
Module 7 VIDEO CODING AND MOTION ESTIMATION Version ECE IIT, Kharagpur Lesson Block based motion estimation algorithms Version ECE IIT, Kharagpur Lesson Objectives At the end of this less, the students
More informationBits, Words, and Integers
Computer Science 52 Bits, Words, and Integers Spring Semester, 2017 In this document, we look at how bits are organized into meaningful data. In particular, we will see the details of how integers are
More informationBI-DIRECTIONAL AFFINE MOTION COMPENSATION USING A CONTENT-BASED, NON-CONNECTED, TRIANGULAR MESH
BI-DIRECTIONAL AFFINE MOTION COMPENSATION USING A CONTENT-BASED, NON-CONNECTED, TRIANGULAR MESH Marc Servais, Theo Vlachos and Thomas Davies University of Surrey, UK; and BBC Research and Development,
More informationAiyar, Mani Laxman. Keywords: MPEG4, H.264, HEVC, HDTV, DVB, FIR.
2015; 2(2): 201-209 IJMRD 2015; 2(2): 201-209 www.allsubjectjournal.com Received: 07-01-2015 Accepted: 10-02-2015 E-ISSN: 2349-4182 P-ISSN: 2349-5979 Impact factor: 3.762 Aiyar, Mani Laxman Dept. Of ECE,
More informationA Study of the Perfect Cuboid Problem
A Study of the Perfect Cuboid Problem Larry Wagner Abstract We develop a procedure to generate face-cuboids. A face-cuboid is a cuboid with only one noninteger face diagonal. We show that it impossible
More informationMultimedia Systems Video II (Video Coding) Mahdi Amiri April 2012 Sharif University of Technology
Course Presentation Multimedia Systems Video II (Video Coding) Mahdi Amiri April 2012 Sharif University of Technology Video Coding Correlation in Video Sequence Spatial correlation Similar pixels seem
More informationImage Compression for Mobile Devices using Prediction and Direct Coding Approach
Image Compression for Mobile Devices using Prediction and Direct Coding Approach Joshua Rajah Devadason M.E. scholar, CIT Coimbatore, India Mr. T. Ramraj Assistant Professor, CIT Coimbatore, India Abstract
More informationFast Mode Decision for H.264/AVC Using Mode Prediction
Fast Mode Decision for H.264/AVC Using Mode Prediction Song-Hak Ri and Joern Ostermann Institut fuer Informationsverarbeitung, Appelstr 9A, D-30167 Hannover, Germany ri@tnt.uni-hannover.de ostermann@tnt.uni-hannover.de
More informationSemi-Hierarchical Based Motion Estimation Algorithm for the Dirac Video Encoder
Semi-Hierarchical Based Motion Estimation Algorithm for the Dirac Video Encoder M. TUN, K. K. LOO, J. COSMAS School of Engineering and Design Brunel University Kingston Lane, Uxbridge, UB8 3PH UNITED KINGDOM
More informationPattern based Residual Coding for H.264 Encoder *
Pattern based Residual Coding for H.264 Encoder * Manoranjan Paul and Manzur Murshed Gippsland School of Information Technology, Monash University, Churchill, Vic-3842, Australia E-mail: {Manoranjan.paul,
More informationEnhanced Hexagon with Early Termination Algorithm for Motion estimation
Volume No - 5, Issue No - 1, January, 2017 Enhanced Hexagon with Early Termination Algorithm for Motion estimation Neethu Susan Idiculay Assistant Professor, Department of Applied Electronics & Instrumentation,
More information2014 Summer School on MPEG/VCEG Video. Video Coding Concept
2014 Summer School on MPEG/VCEG Video 1 Video Coding Concept Outline 2 Introduction Capture and representation of digital video Fundamentals of video coding Summary Outline 3 Introduction Capture and representation
More informationStar Diamond-Diamond Search Block Matching Motion Estimation Algorithm for H.264/AVC Video Codec
Star Diamond-Diamond Search Block Matching Motion Estimation Algorithm for H.264/AVC Video Codec Satish Kumar Sahu 1* and Dolley Shukla 2 Electronics Telecommunication Department, SSTC, SSGI, FET, Junwani,
More informationFRAME-RATE UP-CONVERSION USING TRANSMITTED TRUE MOTION VECTORS
FRAME-RATE UP-CONVERSION USING TRANSMITTED TRUE MOTION VECTORS Yen-Kuang Chen 1, Anthony Vetro 2, Huifang Sun 3, and S. Y. Kung 4 Intel Corp. 1, Mitsubishi Electric ITA 2 3, and Princeton University 1
More informationBy Charvi Dhoot*, Vincent J. Mooney &,
By Charvi Dhoot*, Vincent J. Mooney &, -Shubhajit Roy Chowdhury*, Lap Pui Chau # *International Institute of Information Technology, Hyderabad, India & School of Electrical and Computer Engineering, Georgia
More informationInterframe coding A video scene captured as a sequence of frames can be efficiently coded by estimating and compensating for motion between frames pri
MPEG MPEG video is broken up into a hierarchy of layer From the top level, the first layer is known as the video sequence layer, and is any self contained bitstream, for example a coded movie. The second
More informationArea Efficient SAD Architecture for Block Based Video Compression Standards
IJCAES ISSN: 2231-4946 Volume III, Special Issue, August 2013 International Journal of Computer Applications in Engineering Sciences Special Issue on National Conference on Information and Communication
More informationPolynomial Approximation and Interpolation Chapter 4
4.4 LAGRANGE POLYNOMIALS The direct fit polynomial presented in Section 4.3, while quite straightforward in principle, has several disadvantages. It requires a considerable amount of effort to solve the
More informationA Quantized Transform-Domain Motion Estimation Technique for H.264 Secondary SP-frames
A Quantized Transform-Domain Motion Estimation Technique for H.264 Secondary SP-frames Ki-Kit Lai, Yui-Lam Chan, and Wan-Chi Siu Centre for Signal Processing Department of Electronic and Information Engineering
More informationA Sum Square Error based Successive Elimination Algorithm for Block Motion Estimation
A Sum Square Error based Successive Elimination Algorithm for Block Motion Estimation J.J. Francis and G. de Jager Department of Electrical Engineering, University of Cape Town Rondebosch, 7700, South
More informationMOTION COMPENSATION IN BLOCK DCT CODING BASED ON PERSPECTIVE WARPING
MOTION COMPENSATION IN BLOCK DCT CODING BASED ON PERSPECTIVE WARPING L. Capodiferro*, S. Puledda*, G. Jacovitti** * Fondazione Ugo Bordoni c/o ISPT, Viale Europa 190, 00149 Rome, Italy Tel: +39-6-54802132;
More informationComputer Architecture and Organization
3-1 Chapter 3 - Arithmetic Computer Architecture and Organization Miles Murdocca and Vincent Heuring Chapter 3 Arithmetic 3-2 Chapter 3 - Arithmetic Chapter Contents 3.1 Fixed Point Addition and Subtraction
More informationSummer Review for Students Entering Pre-Calculus with Trigonometry. TI-84 Plus Graphing Calculator is required for this course.
1. Using Function Notation and Identifying Domain and Range 2. Multiplying Polynomials and Solving Quadratics 3. Solving with Trig Ratios and Pythagorean Theorem 4. Multiplying and Dividing Rational Expressions
More informationPrediction-based Directional Search for Fast Block-Matching Motion Estimation
Prediction-based Directional Search for Fast Block-Matching Motion Estimation Binh P. Nguyen School of Information and Communication Technology, Hanoi University of Technology, Vietnam binhnp@it-hut.edu.vn
More informationA VLSI Architecture for H.264/AVC Variable Block Size Motion Estimation
Journal of Automation and Control Engineering Vol. 3, No. 1, February 20 A VLSI Architecture for H.264/AVC Variable Block Size Motion Estimation Dam. Minh Tung and Tran. Le Thang Dong Center of Electrical
More informationIN RECENT years, multimedia application has become more
578 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 17, NO. 5, MAY 2007 A Fast Algorithm and Its VLSI Architecture for Fractional Motion Estimation for H.264/MPEG-4 AVC Video Coding
More informationDeblocking Filter Algorithm with Low Complexity for H.264 Video Coding
Deblocking Filter Algorithm with Low Complexity for H.264 Video Coding Jung-Ah Choi and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 261 Cheomdan-gwagiro, Buk-gu, Gwangju, 500-712, Korea
More information10.2 Video Compression with Motion Compensation 10.4 H H.263
Chapter 10 Basic Video Compression Techniques 10.11 Introduction to Video Compression 10.2 Video Compression with Motion Compensation 10.3 Search for Motion Vectors 10.4 H.261 10.5 H.263 10.6 Further Exploration
More informationToward Optimal Pixel Decimation Patterns for Block Matching in Motion Estimation
th International Conference on Advanced Computing and Communications Toward Optimal Pixel Decimation Patterns for Block Matching in Motion Estimation Avishek Saha Department of Computer Science and Engineering,
More informationNearest Neighbor Value Interpolation
Nearest Neighbor Value Interpolation Rukundo Olivier 1 Department of Electronics and Information Engineering Huazhong University of Science and Technology, HUST Wuhan, China Cao Hanqiang 2 Department of
More informationOCEAN THEME Kid Friendly math Common Core I can... for 3rd Grade
OCEAN THEME Kid Friendly math Common Core I can... for 3rd Grade By Hope Newport teachingwhope.blogspot.com clipart by I can round numbers to the nearest 10. I can round numbers to the nearest 100. I can
More informationIn this lesson, we will use the order of operations to evaluate and simplify expressions that contain numbers and variables.
Show Me: Expressions M8081 Could we sit in a classroom on the other side of the world and still make sense of the mathematics? The answer is yes! Of course, we might not understand exactly what the teacher
More informationFinite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras. Lecture - 24
Finite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras Lecture - 24 So in today s class, we will look at quadrilateral elements; and we will
More informationEngineering Mechanics Prof. Siva Kumar Department of Civil Engineering Indian Institute of Technology, Madras Statics - 4.3
Engineering Mechanics Prof. Siva Kumar Department of Civil Engineering Indian Institute of Technology, Madras Statics - 4.3 In this case let s say delta B and delta C are the kinematically consistent displacements.
More informationY7 Learning Stage 1. Y7 Learning Stage 2. Y7 Learning Stage 3
Y7 Learning Stage 1 Y7 Learning Stage 2 Y7 Learning Stage 3 Understand simple algebraic notation. Collect like terms to simplify algebraic expressions. Use coordinates in the first quadrant. Make a comparative
More informationCMPT 365 Multimedia Systems. Media Compression - Video
CMPT 365 Multimedia Systems Media Compression - Video Spring 2017 Edited from slides by Dr. Jiangchuan Liu CMPT365 Multimedia Systems 1 Introduction What s video? a time-ordered sequence of frames, i.e.,
More informationDIFFERENTIAL IMAGE COMPRESSION BASED ON ADAPTIVE PREDICTION
DIFFERENTIAL IMAGE COMPRESSION BASED ON ADAPTIVE PREDICTION M.V. Gashnikov Samara National Research University, Samara, Russia Abstract. The paper describes the adaptive prediction algorithm for differential
More informationErrors in Computation
Theory of Errors Content Errors in computation Absolute Error Relative Error Roundoff Errors Truncation Errors Floating Point Numbers Normalized Floating Point Numbers Roundoff Error in Floating Point
More informationIntroduction to Video Compression
Insight, Analysis, and Advice on Signal Processing Technology Introduction to Video Compression Jeff Bier Berkeley Design Technology, Inc. info@bdti.com http://www.bdti.com Outline Motivation and scope
More informationYear 7 Key Performance Indicators Maths (Number)
Key Performance Indicators Maths (Number) M7.1 N1: I can use the four operations to answer calculations involving decimals. Use correct notation for recurring decimals, know the denominators of simple
More informationFeature descriptors. Alain Pagani Prof. Didier Stricker. Computer Vision: Object and People Tracking
Feature descriptors Alain Pagani Prof. Didier Stricker Computer Vision: Object and People Tracking 1 Overview Previous lectures: Feature extraction Today: Gradiant/edge Points (Kanade-Tomasi + Harris)
More informationDisplacement estimation
Displacement estimation Displacement estimation by block matching" l Search strategies" l Subpixel estimation" Gradient-based displacement estimation ( optical flow )" l Lukas-Kanade" l Multi-scale coarse-to-fine"
More informationInternational Journal of Emerging Technology and Advanced Engineering Website: (ISSN , Volume 2, Issue 4, April 2012)
A Technical Analysis Towards Digital Video Compression Rutika Joshi 1, Rajesh Rai 2, Rajesh Nema 3 1 Student, Electronics and Communication Department, NIIST College, Bhopal, 2,3 Prof., Electronics and
More informationMOTION COMPENSATION IN TEMPORAL DISCRETE WAVELET TRANSFORMS. Wei Zhao
MOTION COMPENSATION IN TEMPORAL DISCRETE WAVELET TRANSFORMS Wei Zhao August 2004 Boston University Department of Electrical and Computer Engineering Technical Report No. ECE-2004-04 BOSTON UNIVERSITY MOTION
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 2, Issue 1, January 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: An analytical study on stereo
More informationTunnelling-based Search Algorithm for Block-Matching Motion Estimation
Tunnelling-based Search Algorithm for Block-Matching Motion Estimation María Santamaría*, María Trujillo *Universidad del Valle, Colombia, maria.santamaria@correounivalle.edu.co Universidad del Valle,
More informationEquations and Functions, Variables and Expressions
Equations and Functions, Variables and Expressions Equations and functions are ubiquitous components of mathematical language. Success in mathematics beyond basic arithmetic depends on having a solid working
More informationComputational Optical Imaging - Optique Numerique. -- Multiple View Geometry and Stereo --
Computational Optical Imaging - Optique Numerique -- Multiple View Geometry and Stereo -- Winter 2013 Ivo Ihrke with slides by Thorsten Thormaehlen Feature Detection and Matching Wide-Baseline-Matching
More informationSummer Review for Students Entering Pre-Calculus with Trigonometry. TI-84 Plus Graphing Calculator is required for this course.
Summer Review for Students Entering Pre-Calculus with Trigonometry 1. Using Function Notation and Identifying Domain and Range 2. Multiplying Polynomials and Solving Quadratics 3. Solving with Trig Ratios
More informationA COST-EFFICIENT RESIDUAL PREDICTION VLSI ARCHITECTURE FOR H.264/AVC SCALABLE EXTENSION
A COST-EFFICIENT RESIDUAL PREDICTION VLSI ARCHITECTURE FOR H.264/AVC SCALABLE EXTENSION Yi-Hau Chen, Tzu-Der Chuang, Chuan-Yung Tsai, Yu-Jen Chen, and Liang-Gee Chen DSP/IC Design Lab., Graduate Institute
More information0001 Understand the structure of numeration systems and multiple representations of numbers. Example: Factor 30 into prime factors.
NUMBER SENSE AND OPERATIONS 0001 Understand the structure of numeration systems and multiple representations of numbers. Prime numbers are numbers that can only be factored into 1 and the number itself.
More informationTOPIC 2 DECIMALS (and INTRODUCTION TO FRACTIONS) WEEK 3
TOPIC DECIMALS (and INTRODUCTION TO FRACTIONS) WEEK 3 Association between Fractions and Decimals is a fraction. It means divided by. If we divide by the result is not a whole number. It is a half of whole
More informationFast Wavelet-based Macro-block Selection Algorithm for H.264 Video Codec
Proceedings of the International MultiConference of Engineers and Computer Scientists 8 Vol I IMECS 8, 19-1 March, 8, Hong Kong Fast Wavelet-based Macro-block Selection Algorithm for H.64 Video Codec Shi-Huang
More informationADAPTIVE PICTURE SLICING FOR DISTORTION-BASED CLASSIFICATION OF VIDEO PACKETS
ADAPTIVE PICTURE SLICING FOR DISTORTION-BASED CLASSIFICATION OF VIDEO PACKETS E. Masala, D. Quaglia, J.C. De Martin Λ Dipartimento di Automatica e Informatica/ Λ IRITI-CNR Politecnico di Torino, Italy
More informationBulgarian Math Olympiads with a Challenge Twist
Bulgarian Math Olympiads with a Challenge Twist by Zvezdelina Stankova Berkeley Math Circle Beginners Group September 0, 03 Tasks throughout this session. Harder versions of problems from last time appear
More informationHundred-thousands. Millions. Ten-thousands
Place Value, Names for Numbers, and Reading Tables The digits used to write numbers are 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9. Unit 1 Lesson 1a Natural numbers are positive numbers only {1, 2, 3, 4, 5, 6, 7,
More informationYEAR 7 SCHEME OF WORK - EXTENSION
YEAR 7 SCHEME OF WORK - EXTENSION Autumn Term 1 Number Skills Spring Term 1 Angles and Shape Summer Term 1 Multiplicative Reasoning Analysing and displaying data Decimals Perimeter, Area and Volume Half
More informationDynamic Obstacle Detection Based on Background Compensation in Robot s Movement Space
MATEC Web of Conferences 95 83 (7) DOI:.5/ matecconf/79583 ICMME 6 Dynamic Obstacle Detection Based on Background Compensation in Robot s Movement Space Tao Ni Qidong Li Le Sun and Lingtao Huang School
More informationOPTIMIZATION OF LOW DELAY WAVELET VIDEO CODECS
OPTIMIZATION OF LOW DELAY WAVELET VIDEO CODECS Andrzej Popławski, Marek Domański 2 Uniwersity of Zielona Góra, Institute of Computer Engineering and Electronics, Poland 2 Poznań University of Technology,
More informationImplementation and analysis of Directional DCT in H.264
Implementation and analysis of Directional DCT in H.264 EE 5359 Multimedia Processing Guidance: Dr K R Rao Priyadarshini Anjanappa UTA ID: 1000730236 priyadarshini.anjanappa@mavs.uta.edu Introduction A
More informationVIDEO COMPRESSION STANDARDS
VIDEO COMPRESSION STANDARDS Family of standards: the evolution of the coding model state of the art (and implementation technology support): H.261: videoconference x64 (1988) MPEG-1: CD storage (up to
More informationISSN (ONLINE): , VOLUME-3, ISSUE-1,
PERFORMANCE ANALYSIS OF LOSSLESS COMPRESSION TECHNIQUES TO INVESTIGATE THE OPTIMUM IMAGE COMPRESSION TECHNIQUE Dr. S. Swapna Rani Associate Professor, ECE Department M.V.S.R Engineering College, Nadergul,
More informationIN the early 1980 s, video compression made the leap from
70 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 9, NO. 1, FEBRUARY 1999 Long-Term Memory Motion-Compensated Prediction Thomas Wiegand, Xiaozheng Zhang, and Bernd Girod, Fellow,
More information1. NUMBER SYSTEMS USED IN COMPUTING: THE BINARY NUMBER SYSTEM
1. NUMBER SYSTEMS USED IN COMPUTING: THE BINARY NUMBER SYSTEM 1.1 Introduction Given that digital logic and memory devices are based on two electrical states (on and off), it is natural to use a number
More informationMATEMATIKA ANGOL NYELVEN
Matematika angol nyelven középszint 111 ÉRETTSÉGI VIZSGA 014. május 6. MATEMATIKA ANGOL NYELVEN KÖZÉPSZINTŰ ÍRÁSBELI ÉRETTSÉGI VIZSGA JAVÍTÁSI-ÉRTÉKELÉSI ÚTMUTATÓ EMBERI ERŐFORRÁSOK MINISZTÉRIUMA Formal
More informationEdge and corner detection
Edge and corner detection Prof. Stricker Doz. G. Bleser Computer Vision: Object and People Tracking Goals Where is the information in an image? How is an object characterized? How can I find measurements
More informationDigital Image Stabilization and Its Integration with Video Encoder
Digital Image Stabilization and Its Integration with Video Encoder Yu-Chun Peng, Hung-An Chang, Homer H. Chen Graduate Institute of Communication Engineering National Taiwan University Taipei, Taiwan {b889189,
More informationBand Topic Mastery Statements - I can Essential Knowledge - I know Whole order decimals and negative numbers.
Year 7 Maths Assessment Criteria Assessment 1 Band Topic Mastery Statements - I can Essential Knowledge - I know Whole order decimals and negative numbers. know and understand place value in Numbers and
More informationMultiframe Blocking-Artifact Reduction for Transform-Coded Video
276 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 12, NO. 4, APRIL 2002 Multiframe Blocking-Artifact Reduction for Transform-Coded Video Bahadir K. Gunturk, Yucel Altunbasak, and
More information6.001 Notes: Section 4.1
6.001 Notes: Section 4.1 Slide 4.1.1 In this lecture, we are going to take a careful look at the kinds of procedures we can build. We will first go back to look very carefully at the substitution model,
More informationHow to Do Word Problems. Building the Foundation
Building the Foundation The notion that Mathematics is a language, is held by many mathematicians and is being expressed on frequent occasions. Mathematics is the language of science. It is unique among
More informationCO212 Lecture 10: Arithmetic & Logical Unit
CO212 Lecture 10: Arithmetic & Logical Unit Shobhanjana Kalita, Dept. of CSE, Tezpur University Slides courtesy: Computer Architecture and Organization, 9 th Ed, W. Stallings Integer Representation For
More informationFRACTIONS AND DECIMALS
Mathematics Revision Guides Fractions and Decimals Page of MK HOME TUITION Mathematics Revision Guides Level: GCSE Foundation Tier FRACTIONS AND DECIMALS Version: Date: -0-0 Mathematics Revision Guides
More information