Initial-value ordinary differential equation solution via variable order Adams method (SIVA/DIVA) package is collection of subroutines for solution of nonstiff ordinary differential equations. There are versions for single-precision and double-precision arithmetic. Requires fewer evaluations of derivatives than other variable-order Adams predictor/ corrector methods. Option for direct integration of second-order equations makes integration of trajectory problems significantly more efficient. Written in FORTRAN 77.

Solving Ordinary Differential Equations

High Efficiency Video Coding (HEVC) is the latest joint standardization effort of ITU-T WP 3/16 and ISO/IEC JTC 1/SC 29/WG 11. The resultant standard will be published as twin text by ITU-T and ISO/IEC; in the latter case, it will also be known as MPEG-H Part 2. This paper describes the block partitioning structure of the draft HEVC standard and presents the results of an analysis of coding efficiency and complexity. Of the many new technical aspects of HEVC, the block partitioning structure has been identified as representing one of the most significant changes relative to previous video coding standards. In contrast to the fixed size 16 × 16 macroblock structure of H.264/AVC, HEVC defines three different units according to their functionalities. The coding unit defines a region sharing the same prediction mode, e.g., intra and inter, and it is represented by the leaf node of a quadtree structure. The prediction unit defines a region sharing the same prediction information. The transform unit, specified by another quadtree, defines a region sharing the same transformation. This paper introduces technical details of the block partitioning structure of HEVC with an emphasis on the method of designing a consistent framework by combining the three different units together. Experimental results are provided to justify the role of each component of the block partitioning structure and a comparison with the H.264/AVC design is performed.

Block Partitioning Structure in the HEVC Standard

The emerging high efficiency video coding standard (HEVC) adopts the quadtree-structured coding unit (CU). Each CU allows recursive splitting into four equal sub-CUs. At each depth level (CU size), the test model of HEVC (HM) performs motion estimation (ME) with different sizes including 2N × 2N, 2N × N, N × 2N and N × N. ME process in HM is performed using all the possible depth levels and prediction modes to find the one with the least rate distortion (RD) cost using Lagrange multiplier. This achieves the highest coding efficiency but requires a very high computational complexity. In this paper, we propose a fast CU size decision algorithm for HM. Since the optimal depth level is highly content-dependent, it is not efficient to use all levels. We can determine CU depth range (including the minimum depth level and the maximum depth level) and skip some specific depth levels rarely used in the previous frame and neighboring CUs. Besides, the proposed algorithm also introduces early termination methods based on motion homogeneity checking, RD cost checking and SKIP mode checking to skip ME on unnecessary CU sizes. Experimental results demonstrate that the proposed algorithm can significantly reduce computational complexity while maintaining almost the same RD performance as the original HEVC encoder.

An Effective CU Size Decision Method for HEVC Encoders

This paper provides a technical overview of a newly added in-loop filtering technique, sample adaptive offset (SAO), in High Efficiency Video Coding (HEVC) The key idea of SAO is to reduce sample distortion by first classifying reconstructed samples into different categories, obtaining an offset for each category, and then adding the offset to each sample of the category The offset of each category is properly calculated at the encoder and explicitly signaled to the decoder for reducing sample distortion effectively, while the classification of each sample is performed at both the encoder and the decoder for saving side information significantly To achieve low latency of only one coding tree unit (CTU), a CTU-based syntax design is specified to adapt SAO parameters for each CTU A CTU-based optimization algorithm can be used to derive SAO parameters of each CTU, and the SAO parameters of the CTU are inter leaved into the slice data It is reported that SAO achieves on average 35% BD-rate reduction and up to 235% BD-rate reduction with less than 1% encoding time increase and about 25% decoding time increase under common test conditions of HEVC reference software version 80

Sample Adaptive Offset in the HEVC Standard

There is disclosed a method, an apparatus, a server, a client and a non-transitory computer readable medium comprising a computer program stored therein for video coding and decoding. Depth pictures from a plurality of viewing angles are projected into a single viewing angle, making it possible to have pixel-wise joint filtering to be applied to all projected depth values. This approach enables to suppress the noise in the depth map data and provides improved performance for a view synthesis.

Apparatus, a method and a computer program for video coding and decoding

The invention provides an apparatus of encoding a video Provided are a method and apparatus of encoding a video by compensating for a pixel value and a method and apparatus of decoding a video by compensating for a pixel value The method of encoding the video includes: encoding image data; decoding the encoded image data and generating a restored image by performing loop filtering on the decoded image data; determining a compensation value corresponding to errors between a predetermined group restored pixels in the restored image and corresponding original pixels, and a pixel group including a restored pixel to be compensated for by using the compensation value; and encoding the compensation value and transmitting the encoded compensation value and a bitstream of the encoded image data

Apparatus for encoding video

Provided are a video encoding method and apparatus and a non-transitory computer readable storage medium. The video encoding method includes determining offset parameters of each LCU, wherein the offset parameters include an offset type, an offset category and an offset value, the offset type indicates a pixel value classification method of the current LCU is an edge type or a band type, the offset category indicates an edge direction or band range, and the offset value indicates a difference value between a reconstructed pixel and an original pixel; and outputting offset merging information which indicates whether to use offset parameters of a left side LCU or LCU at the upper side of the current LCU as offset parameters of the current LCU.

Video encoding method and apparatus and non-transitory computer readable storage medium

A video encoding method and apparatus and video decoding method and apparatus to generate a restored image having a minimum error with respect to an original image. The video decoding method includes: parsing offset merge information indicating whether offset parameters of a current block and at least one neighboring block from among blocks of video are identical to each other from a received bitstream; restoring an offset type and offset values among the offset parameter of the current block based on the offset merge information; determining an edge class or a pixel value band of a restored pixel based on an edge type or a pixel value band type of the current block indicating the offset type; and determining an offset value corresponding to the edge class or the pixel value band of the restored pixel from the offset values and adjusting a pixel value of the restored pixel according to the offset value.

Elena Alshina

Papers

Apparatus for encoding video

Video encoding method and apparatus and non-transitory computer readable storage medium

Video encoding method using merge information to code offset parameters and apparatus therefor, video decoding method and apparatus therefor