WO2013068733A1 - Codage de données adaptatif au contexte - Google Patents

Codage de données adaptatif au contexte Download PDF

Info

Publication number
WO2013068733A1
WO2013068733A1 PCT/GB2012/052760 GB2012052760W WO2013068733A1 WO 2013068733 A1 WO2013068733 A1 WO 2013068733A1 GB 2012052760 W GB2012052760 W GB 2012052760W WO 2013068733 A1 WO2013068733 A1 WO 2013068733A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
values
size
code values
value
Prior art date
Application number
PCT/GB2012/052760
Other languages
English (en)
Inventor
James Alexander GAMEI
Karl James Sharman
Paul James SILCOCK
Original Assignee
Sony Corporation
Sony Europe Limited
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sony Corporation, Sony Europe Limited filed Critical Sony Corporation
Publication of WO2013068733A1 publication Critical patent/WO2013068733A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H03M7/4006—Conversion to or from arithmetic code
    • H03M7/4012—Binary arithmetic codes
    • H03M7/4018—Context adapative binary arithmetic codes [CABAC]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/46—Embedding additional information in the video signal during the compression process
    • H04N19/463—Embedding additional information in the video signal during the compression process by compressing encoding parameters before transmission
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • H04N19/14—Coding unit complexity, e.g. amount of activity or edge presence estimation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/184—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being bits, e.g. of the compressed video stream
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/189—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding

Definitions

  • This invention relates to context adaptive data encoding.
  • Video data compression and decompression systems which involve transforming video data into a frequency domain representation, quantising the frequency domain coefficients and then applying some form of entropy encoding to the quantised coefficients.
  • Entropy in the present context, can be considered as representing the information content of a data symbol or series of symbols.
  • the aim of entropy encoding is to encode a series of data symbols in a lossless manner using (ideally) the smallest number of encoded data bits which are necessary to represent the information content of that series of data symbols.
  • entropy encoding is used to encode the quantised coefficients such that the encoded data is smaller (in terms of its number of bits) than the data size of the original quantised coefficients.
  • a more efficient entropy encoding process gives a smaller output data size for the same input data size.
  • CABAC context adaptive binary arithmetic coding
  • a data bit is encoded with respect to a probability model, or context, representing an expectation or prediction of how likely it is that the data bit will be a one or a zero.
  • an input data bit is assigned a code value within one of two complementary sub-ranges of a range of code values, with the respective sizes of the subranges being defined by the context.
  • a next step is to modify the overall range (for use in respect of a next input data bit) in response to the assigned code value and the current size of the selected sub-range. If the modified range is then smaller than a threshold (for example, one half of an original range size) then it is increased in size, for example by doubling (shifting left) the modified range.
  • a threshold for example, one half of an original range size
  • an output encoded data bit is generated to indicate that a doubling operation took place.
  • a further step is to modify the context for use with the next input data bit. In currently proposed systems this is carried out by using the current context and the identity of the current "most probable symbol" (either one or zero, whichever is indicated by the context to currently have a greater than 0.5 probability) as an index into a look-up table of new context values.
  • this process is repeated several times, once for each of the plural "maps” indicating the positions, in an array of data, of data values exceeding certain thresholds. So, the process may be executed once for input data from a base "significance map" showing where there are (zero or) non-zero data values in the frequency-separated image data, then another time for a map showing where data having a first value (such as a value of 1 ) is located, then for a map showing where data having a second value (such as a value of 2) is located, and so on.
  • This invention provides a data encoding method for encoding successive input data values, the method comprising the steps of:
  • n complementary portions of a set of code values in respect of the input data value according to the range data corresponding to that input data value, the sizes of the n portions relative to the set of code values being defined by at least n-1 context variables associated with that input data value;
  • the invention provides a technique of encoding multiple variables in a single context adaptive arithmetic coder encoding stage, and a corresponding decoding technique. Rather than simply conducting the multiple encodings and decodings in parallel, instead, a CABAC process is run which divides a code value range into more than two sub-ranges and applies these sub-ranges to different values of the data to be encoded.
  • the technique can improve the data throughput of the encoding / decoding system, something which is particularly important in the field of video data encoding and decoding.
  • the invention also provides a data encoding method for encoding successive input data values, the method comprising the steps of:
  • the invention also provides a data encoding method for encoding successive input data values, the method comprising the steps of:
  • modifying the context variables by selecting a set of context variables from a set of available combinations of context variables, the set being smaller than all combinations of context variables values.
  • the invention also provides a data encoding method for encoding successive input data values, the input data values comprising a significance map indicating the presence, in an array of frequency separated image data, of non-zero data values, the method comprising the steps of: comparing an input data value with an ordered set of n-1 different threshold values, where n is three or more, to generate range data defining that one of the n complementary ranges bounded by the threshold values in which the current data value lies;
  • FIG 1 schematically illustrates an audio/video (A/V) data transmission and reception system using video data compression and decompression
  • Figure 2 schematically illustrates a video display system using video data decompression
  • FIG. 3 schematically illustrates an audio/video storage system using video data compression and decompression
  • Figure 4 schematically illustrates a video camera using video data compression
  • Figure 5 provides a schematic overview of a video data compression and decompression apparatus
  • Figure 6 schematically illustrates the generation of predicted images
  • FIG. 7 schematically illustrates a largest coding unit (LCU).
  • Figure 8 schematically illustrates a set of four coding units (CU);
  • Figures 9 and 10 schematically illustrate the coding units of Figure 8 sub-divided into smaller coding units
  • Figure 1 schematically illustrates an array of prediction units (PU);
  • FIG 12 schematically illustrates an array of transform units (TU);
  • Figure 13 schematically illustrates a partially-encoded image
  • Figure 14 schematically illustrates a set of possible prediction directions
  • Figure 15 schematically illustrates a set of prediction modes
  • Figure 16 schematically illustrates a zigzag scan
  • Figure 17 schematically illustrates a CABAC entropy encoder
  • Figure 18 schematically illustrates a CAVLC entropy encoding process
  • FIGS. 19A to 19D schematically illustrate aspects of a CABAC encoding and decoding operation
  • Figure 20 schematically illustrates a CABAC encoder
  • Figure 21 schematically illustrates a CABAC decoder
  • Figure 22 schematically illustrates the partitioning of a code value space
  • FIGS 23-25 schematically illustrate the relative age of other coefficients used in updating context values.
  • Figure 26 schematically illustrates an implementation of a CABAC decoder.
  • Figures 1 -4 are provided to give schematic illustrations of apparatus or systems making use of the compression and/or decompression apparatus to be described below in connection with embodiments of the invention.
  • All of the data compression and/or decompression apparatus is to be described below may be implemented in hardware, in software running on a general-purpose data processing apparatus such as a general-purpose computer, as programmable hardware such as an application specific integrated circuit (ASIC) or field programmable gate array (FPGA) or as combinations of these.
  • ASIC application specific integrated circuit
  • FPGA field programmable gate array
  • the embodiments are implemented by software and/or firmware, it will be appreciated that such software and/or firmware, and non-transitory machine- readable data storage media by which such software and/or firmware are stored or otherwise provided, are considered as embodiments of the present invention.
  • Figure 1 schematically illustrates an audio/video data transmission and reception system using video data compression and decompression.
  • An input audio/video signal 10 is supplied to a video data compression apparatus 20 which compresses at least the video component of the audio/video signal 10 for transmission along a transmission route 30 such as a cable, an optical fibre, a wireless link or the like.
  • the compressed signal is processed by a decompression apparatus 40 to provide an output audio/video signal 50.
  • a compression apparatus 60 compresses an audio/video signal for transmission along the transmission route 30 to a decompression apparatus 70.
  • the compression apparatus 20 and decompression apparatus 70 can therefore form one node of a transmission link.
  • the decompression apparatus 40 and decompression apparatus 60 can form another node of the transmission link.
  • the transmission link is uni-directional, only one of the nodes would require a compression apparatus and the other node would only require a decompression apparatus.
  • FIG. 2 schematically illustrates a video display system using video data decompression.
  • a compressed audio/video signal 1 00 is processed by a decompression apparatus 1 10 to provide a decompressed signal which can be displayed on a display 120.
  • the decompression apparatus 110 could be implemented as an integral part of the display 120, for example being provided within the same casing as the display device.
  • the decompression apparatus 1 10 might be provided as (for example) a so-called set top box (STB), noting that the expression "set-top” does not imply a requirement for the box to be sited in any particular orientation or position with respect to the display 120; it is simply a term used in the art to indicate a device which is connectable to a display as a peripheral device.
  • STB set top box
  • Figure 3 schematically illustrates an audio/video storage system using video data compression and decompression.
  • An input audio/video signal 130 is supplied to a compression apparatus 140 which generates a compressed signal for storing by a store device 150 such as a magnetic disk device, an optical disk device, a magnetic tape device, a solid state storage device such as a semiconductor memory or other storage device.
  • a store device 150 such as a magnetic disk device, an optical disk device, a magnetic tape device, a solid state storage device such as a semiconductor memory or other storage device.
  • compressed data is read from the store device 150 and passed to a decompression apparatus 160 for decompression to provide an output audio/video signal 170.
  • Figure 4 schematically illustrates a video camera using video data compression.
  • image capture device 180 such as a charge coupled device (CCD) image sensor and associated control and read-out electronics, generates a video signal which is passed to a compression apparatus 190.
  • a microphone (or plural microphones) 200 generates an audio signal to be passed to the compression apparatus 190.
  • the compression apparatus 190 generates a compressed audio/video signal 210 to be stored and/or transmitted (shown generically as a schematic stage 220).
  • the techniques to be described below relate primarily to video data compression. It will be appreciated that many existing techniques may be used for audio data compression in conjunction with the video data compression techniques which will be described, to generate a compressed audio/video signal. Accordingly, a separate discussion of audio data compression will not be provided. It will also be appreciated that the data rate associated with video data, in particular broadcast quality video data, is generally very much higher than the data rate associated with audio data (whether compressed or uncompressed). It will therefore be appreciated that uncompressed audio data could accompany compressed video data to form a compressed audio/video signal.
  • Figu re 5 provi des a schematic overvi ew of a vi deo d ata compressi on an d decompression apparatus.
  • Successive images of an input video signal 300 are supplied to an adder 310 and to an image predictor 320.
  • the image predictor 320 will be described below in more detail with reference to Figure 6.
  • the adder 310 in fact performs a subtraction (negative addition) operation, in that it receives the input video signal 300 on a "+" input and the output of the image predictor 320 on a "-" input, so that the predicted image is subtracted from the input image. The result is to generate a so-called residual image signal 330 representing the difference between the actual and projected images.
  • a residual image signal is generated.
  • the data coding techniques to be described that is to say the techniques which will be applied to the residual image signal, tends to work more efficiently when there is less "energy” in the image to be encoded.
  • the term “efficiently” refers to the generation of a small amount of encoded data; for a particular image quality level, it is desirable (and considered “efficient") to generate as little data as is practicably possible.
  • the reference to "energy” in the residual image relates to the amount of information contained in the residual image. If the predicted image were to be identical to the real image, the difference between the two (that is to say, the residual image) would contain zero information (zero energy) and would be very easy to encode into a small amount of encoded data. In general, if the prediction process can be made to work reasonably well, the expectation is that the residual image data will contain less information (less energy) than the input image and so will be easier to encode into a small amount of encoded data.
  • the residual image data 330 is supplied to a transform unit 340 which generates a discrete cosine transform (DCT) representation of the residual image data.
  • DCT discrete cosine transform
  • the output of the transform unit 340 which is to say, a set of DCT coefficients for each transformed block of image data, is supplied to a quantiser 350.
  • quantisation techniques are known in the field of video data compression, ranging from a simple multiplication by a quantisation scaling factor through to the application of complicated lookup tables under the control of a quantisation parameter. The general aim is twofold. Firstly, the quantisation process reduces the number of possible values of the transformed data. Secondly, the quantisation process can increase the likelihood that values of the transformed data are zero. Both of these can make the entropy encoding process, to be described below, work more efficiently in generating small amounts of compressed video data.
  • a data scanning process is applied by a scan unit 360.
  • the purpose of the scanning process is to reorder the quantised transformed data into an encoding order so as to gather as many as possible of the non-zero quantised transformed coefficients together, and of course therefore to gather as many as possible of the zero-valued coefficients together.
  • These features can allow so-called run-length coding or similar techniques to be applied efficiently.
  • the scanning process involves selecting coefficients from the quantised transformed data, and in particular from a block of coefficients corresponding to a block of image data which has been transformed and quantised, according to a "scanning order" so that (a) all of the coefficients are selected once as part of the scan, and (b) the scan tends to provide the desired reordering.
  • a scanning order which can tend to give useful results is a so-called zigzag scanning order.
  • Entropy encoding is carried out according to the encoding order of data.
  • CABAC Context Adaptive Binary Arithmetic Coding
  • CAVLC Context Adaptive Variable-Length Coding
  • the output of the entropy encoder 370 along with additional data (mentioned above and/or discussed below), for example defining the manner in which the predictor 320 generated the predicted image, provides a compressed output video signal 380.
  • a return path is also provided because the operation of the predictor 320 itself depends upon a decompressed version of the compressed output data.
  • the reason for this feature is as follows. At the appropriate stage in the decompression process (to be described below) a decompressed version of the residual data is generated. This decompressed residual data has to be added to a predicted image to generate an output image (because the original residual data was the difference between the input image and a predicted image). In order that this process is comparable, as between the compression side and the decompression side, the predicted images generated by the predictor 320 should be the same during the compression process and during the decompression process. Of course, at decompression, the apparatus does not have access to the original input images, but only to the decompressed images. Therefore, at compression, the predictor 320 bases its prediction (at least, for inter-image encoding) on decompressed versions of the compressed images.
  • the entropy encoding process carried out by the entropy encoder 370 is considered to be "lossless", which is to say that it can be reversed to arrive at exactly the same data which was first supplied to the entropy encoder 370. So, the return path can be implemented before the entropy encoding stage. Indeed, the scanning process carried out by the scan unit 360 is also considered lossless, but in the present embodiment the return path 390 is from the output of the quantiser 350 to the input of a complimentary inverse quantiser 420.
  • an entropy decoder 410 the reverse scan unit 400, an inverse quantiser 420 and an inverse transform unit 430 provide the respective inverse functions of the entropy encoder 370, the scan unit 360, the quantiser 350 and the transform unit 340.
  • the discussion will continue through the compression process; the process to decompress an input compressed video signal will be discussed separately below.
  • the scanned coefficients are passed by the return path 390 from the quantiser 350 to the inverse quantiser 420 which carries out the inverse operation of the scan unit 360.
  • An inverse quantisation and inverse transformation process are carried out by the units 420, 430 to generate a compressed-decompressed residual image signal 440.
  • the image signal 440 is added, at an adder 450, to the output of the predictor 320 to generate a reconstructed output image 460. This forms one input to the image predictor 320, as will be described below.
  • the signal is supplied to the entropy decoder 410 and from there to the chain of the reverse scan unit 400, the inverse quantiser 420 and the inverse transform unit 430 before being added to the output of the image predictor 320 by the adder 450.
  • the output 460 of the adder 450 forms the output decompressed video signal 480.
  • further filtering may be applied before the signal is output.
  • Figure 6 schematically illustrates the generation of predicted images, and in particular the operation of the image predictor 320.
  • Intra-image prediction bases a prediction of the content of a block of the image on data from within the same image. This corresponds to so-called l-frame encoding in other video compression techniques.
  • l-frame encoding where the whole image is intra- encoded
  • the choice between intra- and inter- encoding can be made on a block-by-block basis, though in other embodiments of the invention the choice is still made on an image-by-image basis.
  • Motion-compensated prediction makes use of motion information which attempts to define the source, in another adjacent or nearby image, of image detail to be encoded in the current image. Accordingly, in an ideal example, the contents of a block of image data in the predicted image can be encoded very simply as a reference (a motion vector) pointing to a corresponding block at the same or a slightly different position in an adjacent image.
  • a reference a motion vector
  • two image prediction arrangements (corresponding to intra- and inter-image prediction) are shown, the results of which are selected by a multiplexer 500 under the control of a mode signal 510 so as to provide blocks of the predicted image for supply to the adders 310 and 450.
  • the choice is made in dependence upon which selection gives the lowest "energy” (which, as discussed above, may be considered as information content requiring encoding), and the choice is signalled to the encoder within the encoded output datastream.
  • Image energy in this context, can be detected, for example, by carrying out a trial subtraction of an area of the two versions of the predicted image from the input image, squaring each pixel value of the difference image, summing the squared values, and identifying which of the two versions gives rise to the lower mean squared value of the difference image relating to that image area.
  • the actual prediction, in the intra-encoding system, is made on the basis of image blocks received as part of the signal 460, which is to say, the prediction is based upon encoded- decoded image blocks in order that exactly the same prediction can be made at a decompression apparatus.
  • data can be derived from the input video signal 300 by an intra-mode selector 520 to control the operation of the intra-image predictor 530.
  • a motion compensated (MC) predictor 540 uses motion information such as motion vectors derived by a motion estimator 550 from the input video signal 300. Those motion vectors are applied to a processed version of the reconstructed image 460 by the motion compensated predictor 540 to generate blocks of the inter-image prediction.
  • the signal is filtered by a filter unit 560.
  • an adaptive loop filter is applied using coefficients derived by processing the reconstructed signal 460 and the input video signal 300.
  • the adaptive loop filter is a type of filter which, using known techniques, applies adaptive filter coefficients to the data to be filtered. That is to say, the filter coefficients can vary in dependence upon various factors. Data defining which filter coefficients to use is included as part of the encoded output datastream.
  • the filtered output from the filter unit 560 in fact forms the output video signal 480. It is also buffered in one or more image stores 570; the storage of successive images is a requirement of motion compensated prediction processing, and in particular the generation of motion vectors. To save on storage requirements, the stored images in the image stores 570 may be held in a compressed form and then decompressed for use in generating motion vectors. For this particular purpose, any known compression / decompression system may be used.
  • the stored images are passed to an interpolation filter 580 which generates a higher resolution version of the stored images; in this example, intermediate samples (sub-samples) are generated such that the resolution of the interpolated image is output by the interpolation filter 580 is 8 times (in each dimension) that of the images stored in the image stores 570.
  • the interpolated images are passed as an input to the motion estimator 550 and also to the motion compensated predictor 540.
  • a further optional stage is provided, which is to multiply the data values of the input video signal by a factor of four using a multiplier 600 (effectively just shifting the data values left by two bits), and to apply a corresponding divide operation (shift right by two bits) at the output of the apparatus using a divider or right-shifter 610. So, the shifting left and shifting right changes the data purely for the internal operation of the apparatus. This measure can provide for higher calculation accuracy within the apparatus, as the effect of any data rounding errors is reduced.
  • LCU 700 largest coding unit 700 ( Figure 7), which represents a square array of 64 x 64 samples.
  • LCU 700 largest coding unit 700
  • the discussion relates to luminance samples.
  • chrominance mode such as 4:4:4, 4:2:2, 4:2:0 or 4:4:4:4 (GBR plus key data)
  • coding units Three basic types of blocks will be described: coding units, prediction units and transform units.
  • the recursive subdividing of the LCUs allows an input picture to be partitioned in such a way that both the block sizes and the block coding parameters (such as prediction or residual coding modes) can be set according to the specific characteristics of the image to be encoded.
  • the LCU may be subdivided into so-called coding units (CU). Coding units are always square and have a size between 8x8 samples and the full size of the LCU 700.
  • the coding units can be arranged as a kind of tree structure, so that a first subdivision may take place as shown in Figure 8, giving coding units 710 of 32x32 samples; subsequent subdivisions may then take place on a selective basis so as to give some coding units 720 of 16x16 samples ( Figure 9) and potentially some coding units 730 of 8x8 samples ( Figure 10). Overall, this process can provide a content-adapting coding tree structure of CU blocks, each of which may be as large as the LCU or as small as 8x8 samples. Encoding of the output video data takes place on the basis of the coding unit structure.
  • Figure 1 1 schematically illustrates an array of prediction units (PU).
  • a prediction unit is a basic unit for carrying information relating to the image prediction processes, or in other words the additional data added to the entropy encoded residual image data to form the output video signal from the apparatus of Figure 5.
  • prediction units are not restricted to being square in shape. They can take other shapes, in particular rectangular shapes forming half of one of the square coding units, as long as the coding unit is greater than the minimum (8x8) size.
  • the aim is to allow the boundary of adjacent prediction units to match (as closely as possible) the boundary of real objects in the picture, so that different prediction parameters can be applied to different real objects.
  • Each coding unit may contain one or more prediction units.
  • FIG. 12 schematically illustrates an array of transform units (TU).
  • a transform unit is a basic unit of the transform and quantisation process. Transform units are always square and can take a size from 4x4 up to 32x32 samples. Each coding unit can contain one or more transform units.
  • the acronym SDIP-P in Figure 12 signifies a so-called short distance intra- prediction partition. In this arrangement only one dimensional transforms are used, so a 4xN block is passed through N transforms with input data to the transforms being based upon the previously decoded neighbouring blocks and the previously decoded neighbouring lines within the current SDIP-P.
  • intra-prediction involves generating a prediction of a current block (a prediction unit) of samples from previously-encoded and decoded samples in the same image.
  • Figure 13 schematically illustrates a partially encoded image 800. Here, the image is being encoded from top-left to bottom-right on an LCU basis.
  • An example LCU encoded partway through the handling of the whole image is shown as a block 810.
  • a shaded region 820 above and to the left of the block 810 has already been encoded.
  • the intra-image prediction of the contents of the block 810 can make use of any of the shaded area 820 but cannot make use of the unshaded area below that.
  • the block 810 represents an LCU; as discussed above, for the purposes of intra-image prediction processing, this may be subdivided into a set of smaller prediction units.
  • An example of a prediction unit 830 is shown within the LCU 810.
  • the intra-image prediction takes into account samples above and/or to the left of the current LCU 810.
  • Source samples from which the required samples are predicted, may be located at different positions or directions relative to a current prediction unit within the LCU 810.
  • To decide which direction is appropriate for a current prediction unit the results of a trial prediction based upon each candidate direction are compared in order to see which candidate direction gives an outcome which is closest to the corresponding block of the input image.
  • the candidate direction giving the closest outcome is selected as the prediction direction for that prediction unit.
  • the picture may also be encoded on a "slice" basis.
  • a slice is a horizontally adjacent group of LCUs. But in more general terms, the entire residual image could form a slice, or a slice could be a single LCU, or a slice could be a row of LCUs, and so on. Slices can give some resilience to errors as they are encoded as independent units.
  • the encoder and decoder states are completely reset at a slice boundary. For example, intra- prediction is not carried out across slice boundaries; slice boundaries are treated as image boundaries for this purpose.
  • Figure 14 schematically illustrates a set of possible (candidate) prediction directions.
  • the full set of 34 candidate directions is available to a prediction unit of 8x8, 16x16 or 32x32 samples.
  • the special cases of prediction unit sizes of 4x4 and 64x64 samples have a reduced set of candidate directions available to them (17 candidate directions and 5 candidate directions respectively).
  • the directions are determined by horizontal and vertical displacement relative to a current block position, but are encoded as prediction "modes", a set of which is shown in Figure 15. Note that the so-called DC mode represents a simple arithmetic mean of the surrounding upper and left-hand samples.
  • Figure 16 schematically illustrates a zigzag scan, being a scan pattern which may be applied by the scan unit 360.
  • the pattern is shown for an example block of 8x8 DCT coefficients, with the DC coefficient being positioned at the top left position 840 of the block, and increasing horizontal and vertical spatial frequencies being represented by coefficients at increasing distances downwards and to the right of the top-left position 840.
  • the coefficients may be scanned in a reverse order
  • the scan may pass from left to right across a few (for example between one and three) uppermost horizontal rows, before carrying out a zig-zag of the remaining coefficients.
  • Figure 17 schematically illustrates the operation of a CABAC entropy encoder.
  • the CABAC encoder operates in respect of binary data, that is to say, data represented by only the two symbols 0 and 1.
  • the encoder makes use of a so-called context modelling process which selects a "context" or probability model for subsequent data on the basis of previously encoded data.
  • the selection of the context is carried out in a deterministic way so that the same determination, on the basis of previously decoded data, can be performed at the decoder without the need for further data (specifying the context) to be added to the encoded datastream passed to the decoder.
  • input data to be encoded may be passed to a binary converter 900 if it is not already in a binary form; if the data is already in binary form, the converter 900 is bypassed (by a schematic switch 910).
  • conversion to a binary form is actually carried out by expressing the quantised DCT coefficient data as a series of binary "maps", which will be described further below.
  • the binary data may then be handled by one of two processing paths, a "regular” and a “bypass” path (which are shown schematically as separate paths but which, in embodiments of the invention discussed below, could in fact be implemented by the same processing stages, just using slightly different parameters).
  • the bypass path employs a so-called bypass coder 920 which does not necessarily make use of context modelling in the same form as the regular path.
  • this bypass path can be selected if there is a need for particularly rapid processing of a batch of data, but in the present embodiments two features of so-called "bypass" data are noted: firstly, the bypass data is handled by the CABAC encoder (950, 960), just using a fixed context model representing a 50% probability; and secondly, the bypass data relates to certain categories of data, one particular example being coefficient sign data. Otherwise, the regular path is selected by schematic switches 930, 940. This involves the data being processed by a context modeller 950 followed by a coding engine 960.
  • the entropy encoder shown in Figure 17 encodes a block of data (that is, for example, data corresponding to a block of coefficients relating to a block of the residual image) as a single value if the block is formed entirely of zero-valued data.
  • a "significance map" is prepared for each block that does not fall into this category.
  • the significance map indicates whether, for each position in a block of data to be encoded, the corresponding coefficient in the block is non-zero.
  • the significance map data being in binary form, is itself CABAC encoded. The use of the significance map assists with compression because no data needs to be encoded for a coefficient with a magnitude that the significance map indicates to be zero.
  • the significance map can include a special code to indicate the final non-zero coefficient in the block, so that all of the final high frequency / trailing zero coefficients can be omitted from the encoding.
  • the significance map is followed, in the encoded bitstream, by data defining the values of the non-zero coefficients specified by the significance map.
  • the significance map and other maps are generated from the quantised DCT coefficients, for example by the scan unit 360, and is subjected to a zigzag scanning process (or a scanning process selected from zigzag, horizontal raster and vertical raster scanning according to the intra-prediction mode) before being subjected to CABAC encoding.
  • CABAC encoding involves predicting a context, or a probability model, for a next bit to be encoded, based upon other previously encoded data. If the next bit is the same as the bit identified as “most likely” by the probability model, then the encoding of the information that "the next bit agrees with the probability model" can be encoded with great efficiency. It is less efficient to encode that "the next bit does not agree with the probability model", so the derivation of the context data is important to good operation of the encoder.
  • adaptive means that the context or probability models are adapted, or varied during encoding, in an attempt to provide a good match to the (as yet uncoded) next data.
  • CABAC encoding is used, in the present arrangements, for at least the significance map and the maps indicating whether the non-zero values are one or two.
  • Bypass processing which in these embodiments is identical to CABAC encoding but for the fact that the probability model is fixed at an equal (0.5:0.5) probability distribution of 1 s and 0s, is used for at least the sign data and the map indicating whether a value is >2.
  • escape data encoding can be used to encode the actual value of the data. This may include a Golomb-Rice encoding technique.
  • CABAC context modelling and encoding process is described in more detail in WD4: Working Draft 4 of High-Efficiency Video Coding, JCTVC-F803_d5, Draft ISO/IEC 23008- HEVC; 201x(E) 201 1-10-28.
  • Figure 18 schematically illustrates a CAVLC entropy encoding process.
  • the entropy encoding process shown in Figure 18 follows the operation of the scan unit 360. It has been noted that the non-zero coefficients in the transformed and scanned residual data are often sequences of ⁇ 1.
  • the CAVLC coder indicates the number of high-frequency ⁇ 1 coefficients by a variable referred to as "trailing 1 s" (T1 s). For these non-zero coefficients, the coding efficiency is improved by using different (context- adaptive) variable length coding tables.
  • a first step 1000 generates values "coeffjoken" to encode both the total number of non-zero coefficients and the number of trailing ones.
  • each trailing one is encoded in a reverse scanning order.
  • Each remaining non-zero coefficient is encoded as a "level" variable at a step 1020, thus defining the sign and magnitude of those coefficients.
  • a variable total_zeros is used to code the total number of zeros preceding the last nonzero coefficient.
  • a variable run_before is used to code the number of successive zeros preceding each non-zero coefficient in a reverse scanning order.
  • a default scanning order for the scanning operation carried out by the scan un it 360 is a zigzag scan is ill ustrated schematical ly in Figu re 1 6.
  • a choice may be made between zigzag scanning, a horizontal raster scan and a vertical raster scan depending on the image prediction direction ( Figure 15) and the transform unit (TU) size.
  • CABAC at least as far as it is used in the proposed HEVC system, involves deriving a
  • context or probability model in respect of a next bit to be encoded.
  • the context defined by a context variable or CV, then influences how the bit is encoded.
  • CV context variable
  • the encoding process involves mapping a bit to be encoded onto a position within a range of code values.
  • m_range m_high - mjow.
  • m_range is constrained to lie between 256 and 512.
  • mjow can be any value. It can start at (say) zero, but can vary as part of the encoding process to be described.
  • m_range The range of code values, m_range, is divided into two sub-ranges, by a boundary 1 100 defined with respect to the context variable as:
  • the context variable divides the total range into two sub-ranges or sub-portions, one sub-range being associated with a value (of a next data bit) of zero, and the other being associated with a value (of the next data bit) of one.
  • the division of the range represents the probabilities assumed by the generation of the CV of the two bit values for the next bit to be encoded. So, if the sub-range associated with the value zero is less than half of the total range, this signifies that a zero is considered less probable, as the next symbol, than a one.
  • a lower region of the range that is, from mjow to the boundary
  • the encoder and decoder maintain a record of which data bit value is the less probable (often termed the "least probable symbol” or LPS).
  • LPS least probable symbol
  • the CV refers to the LPS, so the CV always represents a value of between 0 and 0.5.
  • a next bit is now mapped to the range m_range, as divided by the boundary. This is carried out deterministically at both the encoder and the decoder using a technique to be described in more detail below. If the next bit is a 0, a particular code value, representing a position within the sub-range from mjow to the boundary, is assigned to that bit. If the next bit is a 1 , a particular code value in the sub-range from the boundary 1 100 to m_high is assigned to that bit.
  • the lower limit mjow and the range m range are then redefined. If the just-encoded bit is a zero, then mjow is unchanged but m range is redefined to equal m range * CV. If the just-encoded bit is a one then mjow is moved to the boundary position (mjow + (CV * m_range)) and m_range is redefined as the difference between the boundary and mjiigh (that is, (1 -CV) * m_range).
  • the data bit was a one and so mjow was moved up to the previous boundary position.
  • This provides a revised set of code values for use in a next bit encoding sequence.
  • the value of CV is changed for the next bit encoding, at least in part on the value of the just-encoded bit. This is why the technique refers to "adaptive" contexts.
  • the revised value of CV is used to generate a new boundary 1100'.
  • the interval m_range is successively modified and renormalized in dependence upon the adaptation of the CV values (which can be reproduced at the decoder) and the encoded bit stream.
  • the resulting interval and the number of renormalizing stage uniquely defines the encoded bitstream.
  • a decoder which knows such a final interval would in principle be able to reconstruct the encoded data.
  • the underlying mathematics demonstrate that it is not actually necessary to define the interval to the decoder, but just to define one position within that interval. This is the purpose of the assigned code value, which is maintained at the encoder and passed to the decoder (as a final part of the data stream) at the termination of encoding the data.
  • CV is changed from one bit to the next according to various known factors, which may be different depending on the block size of data to be encoded. In some instances, the state of neighbouring and previous image blocks may be taken into account.
  • the assigned code value is generated from a table which defines, for each possible value of CV and each possible value of bits 6 and 7 of m range (noting that bit 8 of m range is always 1 because of the constraint on the size of m range), a position or group of positions at which a newly encoded bit should be allocated a code value in the relevant sub-range.
  • Figure 20 schematically illustrates a CABAC encoder using the techniques described above.
  • the CV is initiated (in the case of the first CV) or modified (in the case of subsequent CVs) by a CV derivation unit 1 120.
  • a code generator 1130 divides the current m_range according to CV and generates an assigned data code within the appropriate sub_range, using the table mentioned above.
  • a range reset unit 1 140 resets m_range to that of the selected subrange. If necessary, a normaliser 1150 renormalises the m_range, outputting an output bit for each such renormalisation operation. As mentioned, at the end of the process, the assigned code value is also output.
  • the CV is initiated (in the case of the first CV) or modified (in the case of subsequent CVs) by a CV derivation unit 1220 which operates in the same way as the unit 1 120 in the encoder.
  • a code application unit 1230 divides the current m_range according to CV and detects in which sub-range the data code lies.
  • a range reset unit 1240 resets m_range to that of the selected sub-range. If necessary, a normaliser 1250 renormalises the m_range in response to a received data bit.
  • Embodiments of the invention can provide an arithmetic coder (such as a CABAC entropy coder) that can potentially decode multiple coefficients per clock and is therefore capable of decoding even the sustained worst case (from the point of view of data amounts to be handled) of 4:4:4 data.
  • an arithmetic coder such as a CABAC entropy coder
  • the technique encodes or decodes all of the required CABAC context variables (CV) for each coefficient in a single cycle using a quaternary arithmetic coding function, potentially in a single pass of the data.
  • CV CABAC context variables
  • a typical video data encoding technique involves the following steps:
  • the CABAC encoding process can be involved in stages 2, 3 and 4, to encode a binary value in combination with a context variable (CV), where the CV is selected from a set using various criteria.
  • CV context variable
  • the previous CABAC process requires multiple passes of the data, and may require 3 context variables (for the three maps) to be encoded per coefficient, as well as bypass data (sign and escape codes). Designing an encoder and decoder that can cope with the sustained worst case for 4:2:0, let alone 4:4:4 data is a challenge, making the CABAC engine a potential bottleneck in a video coder.
  • the present embodiments aim to encode/decode one coefficient in one step, and therefore to encode a block in one pass of the Transform Unit (TU) data.
  • TU Transform Unit
  • each quantised DCT coefficient is encoded into the CABAC stream with up to 3 CVs. These 3 CVs can be thought of as probabilities of the magnitude, m, of the coefficient:
  • the probability space is split into 4 symbols, which is then represented in an 8-bit integer 'fractional' space corresponding to the set of code values described earlier.
  • This is shown schematically in Figure 22, where the probability space is split (corresponding to a split amongst the set of code values) into four regions, each defined by a respective fraction, corresponding to different values of the current DCT coefficient as defined by the significance maps.
  • the proportion of the CABAC code value range that a symbol is allocated is proportional to the probability of a symbol; the CABAC 'low' part of the range is incremented by the cumulative of the allocation of ranges of the 'preceding' symbols.
  • Arithmetic context variables may be derived from previous ACVs and/or from the decoded data by an arithmetic process. However, context variables which are derived from previous context variables and/or decoded data by a look-up table or similar method, or by examining the probability distribution of previous data, are also envisaged as alternatives. Arithmetic context variables are described in United Kingdom Patent Application No.1 119176.4. As will be described below, the ACVs define respective ones of the fractional spaces, or in other words respective fractions of the set of code values.
  • the encoding/decoding process is as follows. Note that >> m indicates a right bit shift by m places; « m indicates a left bit shift by m places. So, an ACV is represented by an n-bit number (for example, an 8 bit number) and is converted to a fraction by a right shift of n places, which is equivalent to dividing by 2 n .
  • the final fractional space can in fact be defined as "all that is left", or in other words, 1 minus the total of the other fractional spaces, so that n-1 ACVs are needed to define n-1 of the fractions, and a remaining portion defined as that part of the set of code values not occupied by those n-1 ACVs is defined as the other fraction.
  • the "all that is left" range can be the largest of the ranges, representing the largest proportion (amongst the different fractions) of the set of code values.
  • each CV defines a respective range of code values.
  • the modification can be arranged so as to have the effect of increasing the size of the portion corresponding to the range in which the current data value lies.
  • Changing CABACrange to CRn is equivalent to multiplying CABACrange, the current size of the set of code values, by the corresponding fraction in which the current data value lies). Then, renormalize.
  • CABACrange is updated as for encoding, and renormalization occurs.
  • the encoding into the different fractional spaces can therefore be thought of as an example of comparing an input data value with an ordered set of n-1 different threshold values, where n is three or more, to generate range data defining that one of the n complementary ranges bounded by the threshold values in which the current data value lies; and selecting one or more of n complementary portions of a set of code values in respect of the input data value according to the range data corresponding to that input data value, the sizes of the n portions relative to the set of code values being defined by at least n-1 context variables associated with that input data value.
  • the context variable CV0 could be expressed as the probability of ⁇ ' rather than ⁇ ', thereby potentially reducing the delay of the critical path. Depending on implementation, this may produce/require a different bit-stream, and so corresponding changes at the decoder may be applied. To implement this, one possibility is to employ internal registers which are set to "256 minus the standard value", or the standard itself could be changed.
  • the cumulative ranges can be defined in an order which places a remaining portion (the
  • the initial fractions, F1 , F2 or F3 may be 0, and therefore this should be prevented as all possible symbols must have a space in the fractional space. Therefore the cumulative fraction of CF0 is clipped to a maximum of "256-3"; the cumulative fraction of CF1 is clipped to "256-2”; the cumulative fraction of CF2 is clipped to "256-1 ".
  • the fractions are constrained so as to have a value of at least 1 in the 2" bit fraction space.
  • an adder-based system which uses as supporting data an identification of a symbol that has at least 25% of the symbol range, i.e., the first of the fractions F0, F1 , F2 and F3 that is at least 64 (in a 256-bit fraction space) is declared as the 'First Most Probable Symbol' (FMPS).
  • FMPS 'First Most Probable Symbol'
  • VCR1 (CF1.[9,11 ,13,15])»3
  • VCR2 (CF2.[9,11 ,13,15])»3
  • VCR3 (CF3.[9,11 ,13,15])»3
  • vector multiplies used for the VCRs can be done with 4 adders each.
  • bits 7,6 to select (bit 8 is always 1 ).
  • CABACrange is updated as for encoding, and renormalization occurs.
  • the context variables can then be modified for use in encoding a next input data value or word, for example to increase the size of the portion corresponding to the range in which the current data value lies.
  • the modifying step can modify a context variable subject to predetermined maximum and minimum allowable values of the context variable, for example in dependence upon the current size of the set of code values and the current size of the selected portion.
  • Combining the ACVs while keeping a 9-bit CABACrange system (8-bit fractional space) can potentially reduce the accuracy of the system. For this reason, other embodiments of the invention can use an 1 1 -bit CABACrange system (10-bit fractional space, but still with 8-bit ACVs).
  • decoding coefficient N may impact decoding coefficient N+1 (because of the way in which CVs are modified in dependence upon previously decoded data and/or CVs), and if a system based upon these techniques was required to decode 4 coefficients in parallel, when decoding coefficient N, coefficient N+7 is being prepared: interactions between the coefficients mean that speculation on the result of coefficient N, N+1 , N+2, N+3, N+4, N+5, and N+6 must be taken into account when preparing coefficient N+7 for decode. With each value having 4 different outcomes, this could be impractical to implement, as it has 47 possibilities.
  • One method to reduce speculation is to defer the updating of the ACVs until a later point, and therefore the update that an ACV undergoes does not affect any of the coefficients being decoded/prepared up until the update point.
  • the modification takes place only after a group of m data values has been encoded, where m > 1.
  • the ACV selection is based around a 16-coefficient group (though in general this could refer to an m-coefficient group, where m is greater than one), and therefore waiting until the group of 16 (or m) is fully encoded/decoded is a practical opportunity to update the context variables; deferring the update may also have the benefit of 'smoothing' out the updates caused by high-frequency noise in the data.
  • the ACVO context variable is a function based solely upon its position in the block, and therefore not dependent on the data.
  • 8x8 blocks 4 pixels in the block can update the same ACVO, but with the deferred update system, the shared use of the ACVO does not impede the decoding of any coefficients within the same group of 16.
  • ACV1 is selected based upon the length of the end run of ⁇ 's in the current group of 16; the choice of ACV2 is changed each time another value whose magnitude is greater than 1 is encountered. For each group of 16 coefficients, there are only 8 valid combinations of ACV1 and ACV2 which can be used.
  • the following technique uses neighbourhood data values to derive a modification of the ACVs for the significance map.
  • the variable 'cY counts the number of trailing magnitude 1 's in the current group of 16 coefficients (noting that c1 is initialised to and is clipped to a maximum of 4); the variable 'c2' counts the number of values in the group whose magnitude is >1 (where c2 is initialised to ⁇ ' and clipped to a maximum of 4).
  • ACV2 ACV_set2[c2]
  • the new ACVs are selected from a set of available combinations of values, the set being smaller than all possible combinations of values.
  • the neighbourhood is defined as the two coefficients to the right, the two coefficients below, and the coefficients below and to the right; if the coefficient is outside the TU, it is assumed to be 0.
  • the mechanism of using the same neighbourhood as the significance map therefore removes speculation of ACV1 and ACV2 for larger blocks, since the neighbouring values are sufficiently 'old' - which is to say that they were decoded sufficiently far in advance of the decoding of the coefficient on which the CV depends, so as to avoid speculation being required.
  • the top-left (low frequency) areas of the "Youngest age” indicate position-based context variables; no such rule has been applied for ACV1 and ACV2, and the three top left values use the same rule of context variable selection as the other coefficients. This increases the number of clock cycles to process the data to 166, 128 and 95 for the 3 described systems, potentially increasing the system clock rate to at least 1 11 % of pixel rate for the 4:4:4 scenario.
  • a new superset of ACVs is used, from which a subset is picked, based upon the same slice type and channel type scheme, and the selection of ACV1 and ACV2 is modified as follows.
  • ACV1 ACV_set1 [4]
  • ACV2 ACV_set2[4]
  • the new superset of ACVs are currently unoptimized, and are initialised to the same values as those corresponding to the first subset (uiCtxSetO) of the larger blocks for each slice type and channel combination; in addition, the ACV supersets for the larger blocks also have not been optimized from those in HM4.0, even though they are now being used with a different selection method.
  • the Combined Context Variable system describes the quaternary process being used on combined context variables for coefficient data. However, the system could be extended to code CABAC header data.
  • the worst case bit-stream is potentially decodable by any decoder, and techniques such as wave-front processing could actually be applied within the slice, thereby increasing the parallelism for the subsequent processes.
  • functions described in respect of the entropy encoding and decoding processes are, unless otherwise indicated, implemented by the entropy encoder or the entropy decoder respectively, according to whether those functions are being carried out at the encoding or decoding side.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

La présente invention se rapporte à un procédé de codage de données adapté pour coder des valeurs de données d'entrée successives. Le procédé selon l'invention comprend les étapes consistant : à comparer une valeur de données d'entrée à un ensemble ordonné de n-1 valeurs de seuil différentes, n étant une valeur égale à trois ou plus, dans le but de générer des données de plage qui définissent celle des n plages complémentaires liées par la valeur de seuil dans laquelle se trouve la valeur de données actuelle ; à sélectionner une ou plusieurs de n parties complémentaires d'un ensemble de valeurs de codage en référence à la valeur de données d'entrée, sur la base des données de plage correspondant à ladite valeur de données d'entrée, les tailles des n parties par rapport à l'ensemble de valeurs de codage étant définies par au moins n-1 variables de contexte associées à ladite valeur de données d'entrée ; à modifier la taille de l'ensemble de valeurs de codage, en vue de son usage en référence à un mot de données d'entrée suivant, en fonction de la taille actuelle de l'ensemble de valeurs de codage et de la taille actuelle de la partie sélectionnée ; à détecter si l'ensemble de valeurs de codage est inférieur, ou non, à une taille minimale prédéterminée ; et, dans l'affirmative : à augmenter successivement la taille de l'ensemble de valeurs de codage jusqu'à ce que ce dernier ait au moins la taille minimale prédéterminée ; et à délivrer en sortie un bit de données encodé, en réponse à chacune desdites opérations d'augmentation de la taille.
PCT/GB2012/052760 2011-11-07 2012-11-06 Codage de données adaptatif au contexte WO2013068733A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
GB1119175.6 2011-11-07
GB201119175A GB201119175D0 (en) 2011-11-07 2011-11-07 Context adaptive data encoding
GB1119710.0A GB2496210A (en) 2011-11-07 2011-11-15 Context adaptive (CABAC) data encoding and decoding
GB1119710.0 2011-11-15

Publications (1)

Publication Number Publication Date
WO2013068733A1 true WO2013068733A1 (fr) 2013-05-16

Family

ID=45421368

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/GB2012/052760 WO2013068733A1 (fr) 2011-11-07 2012-11-06 Codage de données adaptatif au contexte

Country Status (2)

Country Link
GB (2) GB201119175D0 (fr)
WO (1) WO2013068733A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015004441A1 (fr) * 2013-07-09 2015-01-15 Sony Corporation Codage et décodage de données
CN113994680A (zh) * 2019-06-25 2022-01-28 索尼集团公司 用于图片的子部分的独立cabac

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2513110A (en) 2013-04-08 2014-10-22 Sony Corp Data encoding and decoding
WO2020092788A2 (fr) * 2018-11-01 2020-05-07 Fungible, Inc. Unité de traitement de données comprenant des fonctions de codage et de décodage de gamme matérielles
US10922026B2 (en) 2018-11-01 2021-02-16 Fungible, Inc. Data processing unit having hardware-based range encoding and decoding

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB1119176A (en) 1964-11-30 1968-07-10 Europ Plastic Machinery Mfg As Methods of making balls and other hollow articles

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8902972B2 (en) * 2008-04-11 2014-12-02 Qualcomm Incorporated Rate-distortion quantization for context-adaptive variable length coding (CAVLC)

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB1119176A (en) 1964-11-30 1968-07-10 Europ Plastic Machinery Mfg As Methods of making balls and other hollow articles

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
"WD4: Working Draft 4 of High-Efficiency Video Coding", JCTVC-F803-D5, DRAFT ISO/IEC 23008-HEVC, vol. 201, no. E, pages 2011 - 10,28
BODDEN, E. ET AL: "Arithmetic Coding revealed", SABLE TECHNICAL REPORT, no. 2007-5, 25 May 2007 (2007-05-25), Montreal (CA), XP002691554, Retrieved from the Internet <URL:http://www.sable.mcgill.ca/publications/techreports/2007-5/bodden-07-arithmetic-TR.pdf> [retrieved on 20130205] *
BROSS B ET AL: "WD4: Working Draft 4 of High-Efficiency Video Coding", 6. JCT-VC MEETING; 97. MPEG MEETING; 14-7-2011 - 22-7-2011; TORINO; (JOINT COLLABORATIVE TEAM ON VIDEO CODING OF ISO/IEC JTC1/SC29/WG11 AND ITU-T SG.16 ), no. JCTVC-F803, 8 September 2011 (2011-09-08), XP030009800 *
SHARMAN K ET AL: "CABAC with Arithmetic Context Variables", 7. JCT-VC MEETING; 98. MPEG MEETING; 21-11-2011 - 30-11-2011; GENEVA; (JOINT COLLABORATIVE TEAM ON VIDEO CODING OF ISO/IEC JTC1/SC29/WG11 AND ITU-T SG.16 ), no. JCTVC-G501, 8 November 2011 (2011-11-08), XP030110485 *
SHARMAN K ET AL: "CABAC with Combined Context Variables", 7. JCT-VC MEETING; 98. MPEG MEETING; 21-11-2011 - 30-11-2011; GENEVA; (JOINT COLLABORATIVE TEAM ON VIDEO CODING OF ISO/IEC JTC1/SC29/WG11 AND ITU-T SG.16 ), no. JCTVC-G504, 8 November 2011 (2011-11-08), XP030110488 *
TEXAS INSTRUMENTS: "Parallel CABAC", ITU-T SG16 MEETING; 22-4-2008 - 2-5-2008; GENEVA,, no. T05-SG16-C-0334, 11 April 2008 (2008-04-11), XP030003826, ISSN: 0000-0052 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015004441A1 (fr) * 2013-07-09 2015-01-15 Sony Corporation Codage et décodage de données
US11290751B2 (en) 2013-07-09 2022-03-29 Sony Corporation Data encoding and decoding
CN113994680A (zh) * 2019-06-25 2022-01-28 索尼集团公司 用于图片的子部分的独立cabac

Also Published As

Publication number Publication date
GB201119175D0 (en) 2011-12-21
GB201119710D0 (en) 2011-12-28
GB2496210A (en) 2013-05-08

Similar Documents

Publication Publication Date Title
US11671599B2 (en) Data encoding and decoding
US10893273B2 (en) Data encoding and decoding
JP6400092B2 (ja) データ符号化及び復号化
JP6134055B2 (ja) データ符号化及び復号化
US9544599B2 (en) Context adaptive data encoding
US20130128958A1 (en) Video data encoding and decoding
US20130121423A1 (en) Video data encoding and decoding
WO2013068731A1 (fr) Codage et décodage de données
WO2019150075A1 (fr) Codage et décodage de données
WO2013068733A1 (fr) Codage de données adaptatif au contexte
WO2013068732A1 (fr) Codage de données adaptatif au contexte

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12784662

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12784662

Country of ref document: EP

Kind code of ref document: A1