Abstract: The present technology relates to an encoding device and an encoding method capable of reducing the amount of information relating to information that specifies a reference image. An encoding unit generates a predicted image using a reference image. A transmission unit transmits inter_ref_pic_set_prediction_flag representing whether reference image specifying information specifying the reference image of a prior image that is an image prior to a current coding image in coding order is used as the reference image specifying information of the current coding image in a case where the current coding image is an image other than a first image of a GOP (Group of Picture). The present technology, for example, can be applied to an encoding device of an HEVC (High Efficiency Video Coding) system.

Abstract: A length indicator associated with an encoded representation of a slice is parsed. The length indicator is indicative of a length of an extension field present in a slice header of the encoded representation. A decoder can then determine to ignore, during decoding of the encoded representation, any value of the extension field in the slice header where these values are identified based on the length indicator. As a consequence, an extension field can be added to slice headers and still enable legacy decoders to correctly decode the encoded representations.

Abstract: A decoding method and apparatus are provided. A first candidate having a first motion vector that has been used to decode a first block, a first prediction direction that corresponds to the first motion vector, and a first reference picture index that identifies a first reference picture is derived. A second candidate having a second motion vector that has been used to decode a second block, a second prediction direction that corresponds to the second motion vector, and a second reference picture index that identifies a second reference picture is derived. When a total number of candidates is less than a maximum number, a third candidate is derived by combining the first motion vector and the first reference picture index for the first prediction direction of the first candidate and the second motion vector and the second reference picture index for the second prediction direction of the second candidate.

Abstract: Methods and devices for modified coding of blocks of residuals in the case of transform skipping. To better align the data with assumptions upon which the entropy coding scheme is based, the block of residual data is permuted at the encoder prior to entropy coding. The block of reconstructed data is then inverse permuted at the decoder to recover the reconstructed block of residuals. The permutation may include 180 rotation of the block, which may be of particular benefit in the case of intra-coded residuals.

Abstract: Technique for initialization of encoders and decoders. In some cases, the decoder receives a slice and identifies if the slice is either a forward predicted B-slice or a backward predicted B-slice, and not both a forward and backward predicted B-slice, and based upon this identification initializes, using a P-slice technique, a context associated with the slice.

Abstract: A system for decoding a video bitstream includes receiving a reference picture set associated with a frame including a set of reference picture identifiers. The reference picture set identifies one or more reference pictures to be used for inter-prediction of the frame based upon its associated least significant bits of a picture order count based upon the reference picture identifiers. The one or more reference pictures is a second or greater previous frame to the frame having the matching reference picture identifier.

Abstract: The present invention relates to an image processing device and method, which realize improvement in encoding efficiency for color difference signals and reduction in address calculations for memory access. In a case where a block size of orthogonal transform is 4×4, and a macroblock of luminance signals is configured of four 4×4 pixel blocks appended with 0 through 1, the four luminance signal blocks are corresponded with one color difference signal 4×4 block appended with C. At this time, there exist four motion vector information of mv0, mv1, mv2, and mv3, as to the four luminance signal blocks. The motion vector information mvc of the one color difference signal 4×4 block is calculated by averaging processing using these four motion vector information. The present invention can be applied to an image encoding device which performed encoding based on the H.264/AVC format, for example.

Abstract: Methods of encoding and decoding for video data are described in which multi-level significance maps are used in the encoding and decoding processes. The significant-coefficient flags that form the significance map are grouped into contiguous groups, and a significant-coefficient-group flag signifies for each group whether that group contains no non-zero significant-coefficient flags. If there are no non-zero significant-coefficient flags in the group, then the significant-coefficient-group flag is set to zero. The set of significant-coefficient-group flags is encoded in the bitstream. Any significant-coefficient flags that fall within a group that has a significant-coefficient-group flag that is non-zero are encoded in the bitstream, whereas significant-coefficient flags that fall within a group that has a significant-coefficient-group flag that is zero are not encoded in the bitstream.

Abstract: Image coding and decoding technologies are described. For example, a sample adaptive offset (SAO) type parameter is decoded from a bitstream, and an SAO type for an SAO value to be added to a pixel value of a reconstructed image is determined from the SAO type parameter. A plurality of bins with variable length coding is decoded from the bitstream using bypass arithmetic coding with a fixed probability. The plurality of bins represents an integer indicating a magnitude of the SAO value. The integer indicating the magnitude of the SAO value is determined based on the plurality of bins decoded using bypass arithmetic coding with a fixed probability. The SAO value is determined using the determined integer.

Abstract: Techniques are described related to output and removal of decoded pictures from a decoded picture buffer (DPB). The example techniques may remove a decoded picture from the DPB prior to coding a current picture. For instance, the example techniques may remove the decoded picture if that decoded picture is not identified in the reference picture set of the current picture.

Abstract: There is provided a terminal device capable of efficiently performing communication in a communication system in which a base station device and the terminal device communicate with each other. The terminal device that communicates with the base station device by using a plurality of aggregated cells recognizes that a serving cell is stopped in a first state, recognizes that the serving cell is started in a second state, and switches from the first state to the second state based on a received PDCCH.

Abstract: Methods of encoding and decoding for video data are describe in which significance maps are encoded and decoded using non-spatially-uniform partitioning of the map into parts, wherein the bit positions within each part are associated with a given context. Example partition sets and processes for selecting from amongst predetermined partition sets and communicating the selection to the decoder are described.

Abstract: A method of reducing blocking artifacts associated with pixels of a block boundary of an image. Pixel values of pixels from a first block and a neighboring block, being located on opposite sides of a block boundary, are evaluated. A first offset for the two pixels of each block located next to the block boundary is calculated, after which the first offset is compared to a first threshold value. If abs[first offset]<first threshold, the pixel values of consecutive pixels from the first block and the pixel values of consecutive pixels from the second block are modified by applying normal filtering on the respective pixels, while if instead abs[first offset]>=first threshold, the pixel values of consecutive pixels from the first block and the pixel values of consecutive pixels from the second block are modified by applying weak filtering or no filtering at all on the respective pixels.

Abstract: A method for decoding video includes receiving a frame of the video that includes at least one slice and at least one time. Each of the at least one slice and the at least one tile are not all aligned with one another. Each of the at least one slice is characterized that it is decoded independently of the other the at least one slice. Each of the at least one tile is characterized that it is a rectangular region of the frame and having coding units for the decoding arranged in a raster scan order. The at least one tile of the frame are collectively arranged in a raster scan order of the frame.

Abstract: A co-located block of a video block to be decoded is determined. The co-located block is either (i) a forward reference block or (ii) a backward reference block. A reference motion vector is selected for the video block. When the co-located block is backward reference block and has a forward reference motion vector and a backward reference motion vector, the forward reference motion vector of the co-located block is selected. When the co-located block is forward reference block and has a forward reference motion vector and a backward reference motion vector, the backward reference motion vector of the co-located block is selected. When the co-located block has only one reference motion vector, the one reference motion vector of the co-located block is selected. When the co-located block has no reference motion vector, a zero-reference motion vector for the video block is selected.

Abstract: A method for decoding video includes creating a first list of motion vectors from at least one neighboring block in a current frame of the video and creating a second list of motion vectors from at least one previous block in a temporally earlier frame of the video. A third list of motion vectors is created based upon the first list and the second list. Based upon receiving a motion vector competition control parameter selecting one of the motion vectors from the third list, wherein the second list of motion vectors is further based upon a flooring function.

Abstract: A moving picture coding apparatus includes an intra-inter prediction unit which calculates a second motion vector by performing a scaling process on a first motion vector of a temporally neighboring corresponding block, when selectively adding, to a list, a motion vector of each of one or more corresponding blocks each of which is either a block included in a current picture to be coded and spatially neighboring a current block to be coded or a block included in a picture other than the current picture and temporally neighboring the current block, determines whether the second motion vector has a magnitude that is within a predetermined magnitude or not within the predetermined magnitude, and adds the second motion vector to the list when the intra-inter prediction unit determines that the second motion vector has a magnitude that is within the predetermined magnitude range.

Abstract: The quantization parameters (QP) for Chroma are extended up to and more preferably to the same range as Luma QP (e.g., 0 to 51). Previous, values of Chroma QP only extended up to 39. Techniques are provided for determining extended Chroma QP values (e.g., for Cr and Cb) based on the Luma QP and picture level chroma offsets. In one preferred embodiment, slice level offsets are added making the method particularly well-suited for slice level parallel processing. The extension of Chroma QP enhances functionality, flexibility and friendliness of the High Efficiency Video Coding (HEVC) standard for various applications.

Abstract: A bitstream, including a coded signal resulting from coding slices of an image, is decoded. Each slice includes plural largest coding units (LCUs). A slice is either a normal slice having a slice header with information useable for another slice or a dependent slice having an associated normal slice which is decoded using information included in a slice header of the associated normal slice. The image includes plural LCU rows, and each LCU row includes two or more LCUs. When decoding a first normal slice in a first LCU row that starts at a position other than a beginning of the first LCU row: (i) the first normal slice and any dependent slices associated with the first normal slice are decoded, and (ii) a second normal slice that starts at the beginning of a second LCU row, immediately following the first LCU row, is decoded.

Abstract: Methods of encoding and decoding for video data are described for encoding or decoding coefficients for a transform unit. In particular, the sign bits for the non-zero coefficients are encoded using sign bit hiding. Two or more sets of coefficients are defined for the transform unit and a sign bit may be hidden for each set, subject to satisfaction of a threshold test. The sets may correspond to coefficient groups that are otherwise used in multi-level significance map encoding and decoding.