CN105007486B - Code and decode method, the coding and decoding equipment of image - Google Patents
Code and decode method, the coding and decoding equipment of image Download PDFInfo
- Publication number
- CN105007486B CN105007486B CN201510340428.5A CN201510340428A CN105007486B CN 105007486 B CN105007486 B CN 105007486B CN 201510340428 A CN201510340428 A CN 201510340428A CN 105007486 B CN105007486 B CN 105007486B
- Authority
- CN
- China
- Prior art keywords
- group
- block
- piece
- probability data
- probability
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
Links
Abstract
Disclose the method, coding and decoding equipment, computer program of coding and decoding image.The present invention relates to a kind of methods at least one image coding, comprise the following steps：Divide an image into multiple pieces；Block is grouped into the subset of the block of predetermined quantity；To each parallel encoding in the subset of block, the block in the subset of consideration is encoded according to the predetermined order of traversal.Coding step is included for the current block in the subset considered, and the block at least one coding and decoding before is to the sub-step of current block predictive coding and based at least one symbol probability of occurrence to the sub-step of current block entropy coding.In the case of current block is to consider in subset be encoded first piece, symbol appearing probability is calculated for the predictive encoding at least one other subset and decoded piece.Current block is to consider block in addition to first piece in subset in the case of, symbol appearing probability is calculated for the block at least one coding and decoding for belonging to same subsets.
Description
The application is Application No. 201280021355.8, and the applying date is on 2 23rd, 2012, entitled " coding and decoding
The divisional application of the Chinese invention patent application of the method for image, coding and decoding equipment, computer program ".
Technical field
The present invention typically belongs to the field of image procossing, more accurately belongs to digital picture and the volume of digital image sequence
Code and decoding.
Thus the present invention may be particularly used to compile in current video encoder (MPEG, H.264 etc.) or following video
The Video coding realized in code device (ITU-T/VCEG (H.265) or ISO/MPEG (HVC)).
Background technology
Current video encoder (MPEG, H264 etc.) is represented using video sequence by block (block-wise).Image
Be split as macro block, each macro block itself is split as block, and each block or macro block by image or inter picture prediction come
Coding.Then, specific image is encoded by spatial prediction (intra prediction), and other images are in those skilled in the art
Under the auxiliary of known motion compensation on one or more coding-decoded reference pictures by time prediction (inter-prediction) come
Coding.In addition, for each piece, residual block can be encoded, it is corresponding which with original block subtracts prediction.Can
After the conversion of choosing, the coefficient of the block can be quantized, and then be coded by entropy device coding.
Encoded and decoded specific piece can use before intra prediction and inter-prediction need, so as in decoder or coding
It is used to predict current block in device.The schematic example of predictive coding as Figure 1A expressions, wherein, image INIt is divided into block,
The current block MB of the imageiIt is subjected to three blocks of the predetermined quantity of coding and decoding before with for example being represented by hatched arrows
MBr1、MBr2、MBr3Relevant predictive coding.Above three block particularly including it is disposed immediately in current block MBiThe left side block
MBr1And it is disposed immediately in current block MB respectivelyiTop and upper right side two block MBr2And MBr3。
Here more particular interest is that entropy coder.Entropy coder encodes information according to the order of arrival.Typical case
The traversal line by line of the block of " raster scanning " type is realized on ground, if Figure 1A is as shown in reference (label) PRS, from the upper left corner of image
BOB(beginning of block).For each piece, represent that each item of information (block type, prediction mode, residual coefficients etc.) needed for the block is suitable
Sequence is distributed to entropy coder.
A kind of significance arithmetic encoder of known enough complexity, being referred to as " CABAC ", (" context adapts to binary arithmetic
Encoder "), it is introduced in AVC compression standards (being also referred to as the 10th parts of ISO-MPEG4 and ITU-T H.264).
Entropy coder realizes various designs：
- arithmetic coding：Such as initially in document J.Rissanen and G.G.Langdon Jr, " Universal
Modeling and coding, " in IEEE Trans.Inform.Theory, vol.IT-27, pp.12-23, Jan. 1981
The encoder of description encodes symbol using the probability of occurrence of the symbol；
- context adapts to：This includes the probability of occurrence for adapting to the symbol to be encoded.On the one hand, realize and quickly learn.It is another
Aspect, according to the state of the information encoded before, specific context be used to encode.There are corresponding solid for each context
Some symbol appearing probabilities.For example, context corresponds to type (remaining coefficient, the volume of coded identification according to given configuration
The expression of the signaling of pattern etc.) or state (such as the quantity of " in frame " pattern from neighbor choice corresponding to neighbours
Deng)；
- binarization：The symbol to be encoded is converted into the form of Bit String.Then, which is distributed in succession
Give binary system entropy coder.
Then, which realizes a kind of system for each context used, for quickly learn with before
The relevant probability of symbol encoded for the context of consideration.This learns the coded sequence based on these symbols.Typically, such as
The order of upper basis " raster scanning " type is come traversing graph picture.
When that pair can be encoded equal to 0 or 1 given symbol b, in the following manner for current block MBiTo update this
The probability of occurrence P of symboliLearn：
Wherein, α is predetermined value, such as 0.95, and Pi-1It is that the symbol calculated when the symbol finally occurs occurs generally
Rate.
The schematic example of entropy coding as Figure 1A expressions, wherein, image INCurrent block MBiIt is coded by entropy.Current
Block MBiEntropy coding when starting, used symbol appearing probability is obtained after the coding of the block coded and decoded before
Symbol appearing probability, should be tight in the block coded and decoded before according to the traversal line by line of the block of above-mentioned " raster scanning " type
Neighbour is in current block MBiBefore.It is clear only for illustrating, in Figure 1A by thin-line arrow come represent for specific block based on
Block-by-block dependence is learned.
The defects of entropy coding of the type, resides in the fact that, when the symbol to being located at row beginning encodes, uses
Probability correspond mainly to positioned at the probability observed by the symbol at the end of previous row, travel through phase with " raster scanning " of block
It closes.Now, due to symbol probability possible space variation (for example, for the relevant symbol of movable information item, it is right positioned at image
The movement of side part from left part observe can be different, and hence for being class for resulting local probability
As), it is observed that the missing of the local adaptation of probability, this is in coding with the risk that validity is caused to be lost.
In internet addresshttp://wftp3.itu.int/av-arch/jctvc-site/2010_04_A_ Dresden/JCTVC-A114-Annex A.doc(on 2 8th, 2011) document " the Annex A provided:CDCM Video
A kind of coding method is described in Codec Decoder Specification ", alleviates drawbacks described above.As shown in Figure 1B,
Coding method described in documents above includes：
- by image INThe step of cutting is multiple pieces,
- combine for example by three block MBr of the predetermined quantity of coding and decoding before hatched arrows expression1、MBr2、
MBr3To the current block MB of the imageiThe step of carrying out predictive coding.Above three block particularly including it is disposed immediately in current block
MBiThe left side block MBr1And it is disposed immediately in current block MB respectivelyiTop and upper right side two block MBr2And MBr3,
- to image INBlock the step of carrying out entropy coding, accordingly, when these blocks are available, every piece of use is respectively for tight
It is located at the encoded and decoding in encoded and decoded piece above current block and the left side for being disposed immediately in current block adjacently
Block come the symbol appearing probability that calculates.In order to make the latter apparent, this is represented come part by thin-line arrow in fig. ib
The use of symbol appearing probability.
The entropy coding is advantageous in that it make use of by the probability of the immediate environment generation of current block, thereby making it possible to
Obtain higher coding efficiency.In addition, the coding techniques used allows to the subset to the paired adjacent block of predetermined quantity
Parallel encoding.In the example of Figure 1B displayings, three subsets SE1, SE2 and SE3 are by parallel encoding, in this example embodiment per height
Collect a line block being represented by the dotted line to form.Certainly, which needs the block respectively positioned at the top of current block and upper right side can use.
The defects of parallel encoding technology is, is counted to allow access needle to being disposed immediately in the block above current block
The symbol appearing probability of calculation is, it is necessary to store and some associated probability of a line block.If such as the second row SE2 is considered in fig. ib
Block, the symbol appearing probability calculated by using first piece for the first row SE1 before, first piece of the row by entropy
Coding.When completing first piece of coding of the second row, the state of the value V1 of probability of occurrence is stored in buffer storage MT.
Then, by using general come the symbol appearance calculated for second piece of the first row SE1 and first piece of the second row SE2 simultaneously
Rate, second piece of the second row SE2 are coded by entropy.When completing second piece of coding of the second row, the shape of the value V2 of probability of occurrence
State is stored in buffer storage MT.The process continues, until last block of the second row SE.Due to probability quantity very
(there is the probability of combination as many with the quantity of the quantity of syntactic element and associated context) greatly, these probability of whole a line
Be stored in it is very expensive in terms of memory resource.
The content of the invention
An object of the invention is the defects of making up the above-mentioned prior art.
For this purpose, subject of the present invention is related to a kind of method encoded at least one image, comprise the following steps：
- multiple pieces are divided an image into,
The subset of-the block for being grouped into predetermined quantity by described piece,
- to each parallel encoding in described piece of subset, the block in the subset considered is according to the predetermined suitable of traversal
Sequence is come what is encoded, and for the current block in the subset considered, the coding step includes substep：
Block at least one coding and decoding before carries out predictive coding to the current block,
By learn it is at least one before symbol appearing probability to current block carry out entropy coding,
The method according to the invention is in place of meriting attention：
In the case of-to be encoded in the subset that current block is considered first piece, symbol appearing probability is for extremely
The symbol appearing probability for lacking the predetermined block of the coding and decoding in other subsets to calculate,
- in the subset that current block is considered in the case of block in addition to first piece, symbol appearing probability is to be directed to
The symbol appearing probability for belonging at least one encoded and decoded piece of same subsets to calculate.
This is arranged such that may store small number of symbol appearing probability in the buffer storage of encoder, because removing
The entropy coding of current block outside first piece of the subset of block must no longer need use on encoded before and decoded
The symbol appearing probability that block is calculated is located in another subset and above current block for encoded and decoded piece before being somebody's turn to do.
The arrangement also allows to keep existing compression performance, because the entropy coding of current block is used for current block institute
The block coded and decoded before another in the subset of category has finally passed through update the symbol appearing probability that calculates
Probability is learned to realize, so as to which the latter meets the statistics of vision signal.
First for other subsets is used during the first current block entropy coding in the subset of the block considered
Block is come the key benefit of the symbol appearing probability calculated, by only storing the symbol in the buffer storage of encoder
The buffer storage is saved in more newly arriving for probability of occurrence, and the symbol learned without considering other continuous blocks of other subsets
Number probability of occurrence.
Used during the entropy coding of the first current block of the subset of the block considered in other described subsets except the
Block (such as second piece) beyond one piece is come the key benefit of the symbol appearing probability calculated, obtains to symbol appearing probability
It is more accurate and therefore preferably learn, thus bring better video compression performance.
In certain embodiments, same subsets are belonged to the current block to be encoded in the subset in addition to first piece
The coding and decoding block be the current block to be encoded nearest neighbor block.
The arrangement thereby making it possible to during first piece of entropy coding in the subset considered only storage learned
Symbol appearing probability because under the special case, only considers to be directed to be located above the first current block and belong to another subset
Block is come the symbol appearing probability that calculates.This results in the optimizations that the size of the memory resource of encoder reduces.
In another specific embodiments, the predictive coding of the block in the subset considered is by the subset on the consideration
The block of coding and decoding is performed under situation before predetermined quantity in addition, the parallel volume of the block in the subset of the consideration
Code is to deviate the block of predetermined quantity with the subset compared with the block for being adjacent to front in the case where performing the order of parallel encoding to hold
Capable.
The arrangement allow for the subset for the current block to be encoded realize perform parallel encoding order under work as
The synchronization of the processing procedure of block in the subset of block before preceding subset, thereby making it possible to ensureing the coding for being used for current block
One or more of previous subset block availability.By this way, the block in the subset of verification front is available
Property the step of the step of (be, for example, being realized in the parallel encoder of the prior art) can advantageously be ignored, thus allow in root
To block handle the acceleration of required processing time in encoder according to the present invention.
Relatively, the invention further relates to a kind of equipment encoded at least one image, including：
- for dividing an image into multiple pieces of component,
- for block to be grouped into the component of the subset of the block of predetermined quantity,
- to the component of each parallel encoding in the subset of block, the block in the subset considered is according to the predetermined of traversal
Order is come what is encoded, and for the current block in the subset considered, the addressable part includes：
Block at least one coding and decoding before carries out current block the subassembly of predictive coding,
The subassembly of entropy coding is carried out to current block based at least one symbol probability of occurrence,
The encoding device is in place of meriting attention：
In the case of-to be encoded in the subset that current block is considered first piece, compiled for the entropy of the first current block
Code, the subassembly of entropy coding consider that the symbol for the predetermined block of the coding and decoding at least one other subset to calculate goes out
Existing probability,
- in the subset that current block is considered in the case of block in addition to first piece, for the entropy coding of current block,
The symbol appearing probability that the subassembly consideration of entropy coding is calculated at least one coding and decoding block for belonging to same subsets.
By corresponding mode, the invention further relates to a kind of streams to representing at least one coded image to carry out decoded side
Method comprises the following steps：
- in the picture identification want decoded predetermined quantity block subset,
- pair decoded with the part parallel of each associated stream in the subset of block, the block in the subset considered is basis
The predetermined order of traversal is next decoded, and for the current block in the subset considered, the decoding step includes substep：
Entropy decoding is carried out to current block based at least one symbol probability of occurrence,
Prediction decoding is carried out to current block on decoded piece before at least one,
The coding/decoding method is in place of meriting attention：
- in the case of want decoded first piece in the subset that current block is considered, symbol appearing probability is for extremely
Few other subsets have decoded predetermined block to calculate,
- in the subset that current block is considered in the case of block in addition in the subset first piece, symbol occurs general
Rate is calculated for belong to same subsets at least one decoded piece.
In certain embodiments, with beyond in the subset first piece decoded current block being wanted to belong to identical son
The decoding block of collection is to want the nearest neighbor block of decoded current block.
In another specific embodiment, the prediction decoding of the block in the subset considered is wanted to be directed to except being considered
The block of coding and decoding is performed under situation before predetermined quantity beyond subset, the block in the subset considered it is parallel
Decoding is to deviate the block of predetermined quantity compared with the subset for the block for being adjacent to front in the case where performing the order of parallel decoding to hold
Capable.
Relatively, the invention further relates to a kind of streams to representing at least one coded image to carry out decoded equipment, including：
- in the picture identification want decoded predetermined quantity block subset component,
- decoded the component of part parallel pair with each associated stream in the subset of block, the block in the subset considered
It is come decoded according to the predetermined order of traversal, for the current block of the subset considered, the decoding device includes：
The subassembly of entropy decoding is carried out to current block based at least one symbol probability of occurrence,
The subassembly of prediction decoding is carried out to current block on decoded piece before at least one,
The decoding device is in place of meriting attention：
- in the case of want decoded first piece in the subset that current block is considered, for the entropy solution of the first current block
Code, the subassembly for carrying out entropy decoding consider occur generally for the symbol for having decoded predetermined block to calculate of at least one other subset
Rate,
In-the subset for being the consideration in current block in the case of block in addition to first piece, for the entropy solution of current block
Code, the subassembly for carrying out entropy decoding consider that the symbol calculated at least one decoding block for belonging to same subsets occurs generally
Rate.
The target of the present invention also resides in a kind of computer program for including instruction, when the program performs on computers,
Described instruction be used for perform more than coding or coding/decoding method the step of.
The program can use arbitrary programming language, and can be source code, object code or source code and object code
Between intermediate code form, such as the form of partial compilation or other arbitrary desired forms.
The another target of the present invention also resides in a kind of recording medium being readable by a computer, and it includes for example above-mentioned
Computer program instructions.
Recording medium can store the arbitrary entity or equipment of program.For example, the medium can include：Storage dress
It puts, such as ROM (such as CD ROM) or microelectronic circuit ROM；Or magnetic recording system, such as disk (floppy disk) or hard disk.
In addition, the recording medium can be transmission medium such as electrically or optically signal, it can be by electrically or optically cable with wireless
Electricity or other modes are transmitted.It can particularly be downloaded according to the procedure of the present invention on the network of Internet type.
Alternatively, which can be integrated circuit, and program is incorporated in the integrated circuit, which is suitable for holding
The discussed method of row or the execution available for the latter.
Above-mentioned encoding device, coding/decoding method, decoding device and computer program at least have and coding according to the present invention
The identical advantage of advantage that method is showed.
Description of the drawings
Two preferred embodiments described by reference to attached drawing, other feature and advantage will be apparent, in the accompanying drawings：
- Figure 1A represents the image code pattern of the prior art according to first example,
- Figure 1B represents the image code pattern of the prior art according to second example,
- Fig. 2A represents the key step of coding method according to the present invention,
The parallel encoding realized in coding method in fig. 2 has been shown in detail in-Fig. 2 B,
- Fig. 3 A represent the embodiment of encoding device according to the present invention,
- Fig. 3 B represent the coding unit of the encoding device in Fig. 3 A,
- Fig. 4 A represent the encoding/decoding image figure according to first preferred embodiment,
- Fig. 4 B represent the encoding/decoding image figure according to the second preferred embodiment,
- Fig. 5 A represent the key step of coding/decoding method according to the present invention,
The parallel encoding realized in the coding/decoding method that-Fig. 5 B have been shown in detail in Fig. 5 A,
- Fig. 6 A represent the embodiment of decoding device according to the present invention,
- Fig. 6 B represent the decoding unit of the decoding device in Fig. 6 A.
Specific embodiment
The embodiment of the present invention will now be described, wherein, coding method according to the present invention is used for according to binary stream
A series of images is encoded, which encodes what is obtained close to according to H.264/MPEG-4 AVC standards
Binary stream.In this embodiment, by initially meet the adjustment of the H.264/MPEG-4AVC encoder of standard for example with
The mode of software or hardware realizes coding method according to the present invention.With the algorithm comprising step C1 to C5 shown in Fig. 2A
Form shows coding method according to the present invention.
According to an embodiment of the invention, coding method according to the present invention is realized in the encoding device CO shown in Fig. 3 A.
With reference to figure 2A, the first coding step C1 be image IE cuttings in a series of images that will be encoded for multiple pieces or
Macro block MB, as shown in Fig. 4 A or 4B.In the example shown, described piece of MB for square and has identical size.As figure
As the function of size, the multiple of block size is needed not be, the last block in left side and the last block of bottom can not be pros
Shape.In alternate embodiments, block for example can be rectangle size and/or be misaligned mutually.
Each block or macro block itself can also be divided into sub-block, which itself can also segment.
The cutting is realized by the division module PCO shown in Fig. 3 A, and use example divides calculation as everyone knows
Method.
With reference to figure 2A, the second coding step C2 be the continuous block for being grouped into predetermined quantity P by above-mentioned piece subset SE1,
SE2 ... SEk ..., SEP, which will be by parallel encoding.In the example shown in Fig. 4 A and 4B, predetermined quantity P be equal to 4, and
And four subsets SE1, SE2, SE3, SE4 being represented by dashed line are made of respectively four row blocks before image IE.
The division operation is to be realized by the computing module GRCO shown in Fig. 3 A using well-known algorithm.
With reference to figure 2A, the 3rd coding step C3 include in described piece subset SE1, SE2, SE3 and SE4 it is each simultaneously
Row encodes, and the block in the subset considered is encoded according to the predetermined order PS of traversal.In the example shown in Fig. 4 A and 4B
In, the block in current subnet SEk (1≤k≤4) is from left to right encoded successively as shown in arrow PS.
The parallel encoding is realized by the coding unit UCk (1≤k≤R) that the quantity shown in Fig. 3 A is R (R=4)
, and allow the significantly acceleration of coding method.Known mode in this way, encoder CO include buffer storage MT, fit
In including the gradual newer symbol appearing probability for example with the coding cooperative of current block.
If Fig. 3 B are shown in more detail, each coding unit UCk includes：
Block at least one coding and decoding before carries out current block on the subelement of predictive coding, uses SUCPk
To represent；
At least one symbol probability of occurrence calculated by using the block for the coding and decoding before is to institute
The subelement that current block carries out entropy coding is stated, is represented with SUCEk.
Predictive coding subelement SUCPk can be according to traditional Predicting Technique for example in frame and/or inter-frame mode is held
The predictive coding of row current block.
Entropy coding subelement SUCEk is CABAC types in itself, but is adjusted according to the present invention, in the description will be into one
Step description.
As variant, entropy coding subelement SUCEk can be known huffman encoder.
In the example shown in Fig. 4 A and 4B, first module UC1 encodes the block of the first row SE1 from left to right.
When reaching last block of the first row SE1, first piece that (N+1) row is the 5th row etc. here can be transferred to.Second unit UC2
The block of second row SE2 is encoded from left to right.When reaching last block of the second row SE2, (N+2) row can be transferred to
Here it is first piece of the 6th row etc..The traversal is repeated until unit UC4, and the block of fourth line SE4 is compiled from left to right
Code.Reach the first row last block when, first piece that (N+4) row is eighth row here can be transferred to, and so on until
Last block of image IE is encoded.
What the other kinds of traversal different from what is described just now above was certainly possible to.Thus it is possible to by image IE
Cutting is several subgraphs, and the cutting of the type is applied independently for each subgraph.Each coding unit can also
Do not handle the row of nesting as explained above but the row of nesting.Can also row or column be traveled through with any direction.
With reference to figure 2A, the 4th coding step C4 is generated in N number of sub- bit stream Fk (1≤k≤N) and each subset SEk
Processed piece of decoded version, which represents by the processed block of above-mentioned each coding unit compression.According to
The synchronization mechanism that be described in further detail in the description, with SED1, SED2 ... SEDk ..., being considered of representing of SEDP
Decoded processed piece in subset can by shown in Fig. 3 A some coding unit UC1, UC2 ..., UCk ..., UCP weights
It is new to use.
With reference to figure 2A, the 5th coding step C5 includes constructing global stream F based on above-mentioned subflow Fk.According to an implementation
Example, subflow Fk is by simply side by side, additional item of information is used to represent positions of each subflow Fk in global flow F to decoder
It puts.The global flow F is transferred to remote terminal by communication network (not shown).The latter includes the decoder DO shown in Fig. 6 A.
Then, as will be described in further detail in specification, decoder according to the present invention can isolate the son in global flow F
Fk is flowed, and assigns these to each composition decoding unit of decoder.It is noted that by subflow be decomposed into global flow independently of
The decoding unit that selection is concurrently operated using several, and can be used only by this method and include parallel operated units
Encoder or decoder.
The construction of global flow F is realized in stream constructing module CF as shown in Figure 3A.
It describes for example to realize in coding unit UCk during above-mentioned parallel encoding step C3 referring now to Fig. 2 B
The present invention each specific sub-step.
During step C31, coding unit UCk selects to be encoded in the current line SEk shown in Fig. 4 A or 4B
One piece is used as current block.
During step C32, unit UCk test current block whether be in image IE first piece (be located at top and
Left side), the image has been split as block in above-mentioned steps C1.
If this is the case, during step C33, coding possibilities be initialized to before Fig. 3 A coding
Value Pinit defined in device CO.
If not this situation, in the step C40 that will be described in subsequent instruction, necessary coding before is determined
With decoded piece of availability.
During step C34, the first current block MB1 in the first row SE1 described in Fig. 4 A or 4B is encoded.
Step C34 includes multiple sub-step C341 to the C348 that will be described below.
In the process of the first sub-step C341, by frame and/or the known technology of inter-prediction come to current block MB1 into
Row predictive coding, during it, the block at least one coding and decoding before carrys out prediction block MB1.
Needless to say, the intra prediction of other patterns such as in the h .264 standard proposed is also possible.
Current block MB1 may also pass through the predictive coding of inter-frame mode, during it, be coded and decoded on from before
The block that generates of image predict current block.It is of course possible to imagine other kinds of prediction.For the possible pre- of current block
In survey, optimal prediction is selected according to well-known rate distortion criterion to those skilled in the art.
Above-mentioned predictive coding step allows to structure forecast block MBp1, this is to current block MB1Approximation.With the prediction
It encodes relevant information and would be subsequently written into and flow F, stream F is sent to decoder DO.The information especially includes the class of prediction
Type (in interframe or frame), and if appropriate, pattern, block or macro block comprising intra prediction classified types (if macro block by
Subdivision), reference picture index and the offset vector used in inter-frame forecast mode.The information is compressed by encoder CO.
During sub-step C342 below, from current block MB1In subtract prediction block MBp1, generate residual block MBr1。
During sub-step C343 below, according to traditional direct map function, (such as DCT types is discrete
Cosine transform) convert residual block MBr1, generate the block MBt of conversion1。
During sub-step C344 below, according to traditional quantization operation (such as scalar quantization) come to conversion
Block MBt1Quantified.Then the block MBq that coefficient is quantized is obtained1。
During sub-step C345 below, the block MBq that is quantized to coefficient1Carry out entropy coding.Preferred real
It applies in example, this needs CABAC entropy codings.
During sub-step C346 below, according to traditional inverse quantization operation come to block MBq1Carry out inverse quantization,
This is the inverse operation of the quantization performed in step C344.Then coefficient is obtained by the block MBDq of inverse quantization1。
During sub-step C347 below, to coefficient by the block MBDq of inverse quantization1Inverse transformation is carried out, more than this is
The inverse operation directly converted performed in step C343.Then decoded residual block MBDr is obtained1。
During sub-step C348 below, by by decoded residual block MBDr1It is added to prediction block MBp1To construct
Decoded piece of MBD1.It is noted that the latter and the method being decoded to image IE further described in the description are completed
When the decoding block that obtains it is identical.Decoding block MBD1Then unit UC1 can be encoded or form appointing for the coding unit of predetermined quantity R
Anticipate other coding units use.
When completing above-mentioned coding step C34, for example, entropy coding subelement SUCEk as shown in Figure 3B include for example with
First piece of coding cooperative and gradually newer all probability.These probability correspond to various possible syntactic elements and correspond to
Various relevant coding contexts.
It after above-mentioned coding step C34, is tested during step C35, to determine whether current block is this
The mutually jth block of colleague, wherein, j is the known predetermined value of encoder CO and at least equal to 1.
If such situation, during step C36, the one group of probability calculated for jth block is stored in
Such as in the buffer storage MT of the encoder CO as shown in Fig. 3 A and Fig. 4 A and 4B, the memory is sized for depositing
The probability of the calculated quantity of storage.
During step C37, whether the current block in the row SEk that unit UCk tests were encoded just now is image IE
Last block.
If this is the case, then during step C38, coding method terminates.
If not this situation, the traversal represented by arrow PS during the step C39 in Fig. 4 A or 4B
Order selects next block MB to be encodedi。
If during step C35, current block is not the jth block in considered row SEk, then without above step
Rapid C37.
During step C40, determine for current block MBiCoding for it is necessary before coding and decoding block
Availability.The fact that need in view of this through different coding unit UCk come to the block parallel encoding of image IE, is used for
The coding unit encoded to these blocks may not code and decode these blocks, and therefore they are also unavailable.Institute
Stating definite step includes the block for the predetermined quantity N' that verification is located in previous row SEk-1 for example respectively positioned at the top of current block
Whether can be used for the coding of current block with two blocks in upper right side, i.e., they whether the coding unit encoded to it
UCk-1 is encoded and is then decoded.The definite step further includes verification and is located at the current block MB to be encodediLeft side extremely
Availability one piece few.But, it is contemplated that the traversal order PS selected in the embodiment shown in Fig. 4 A or 4B, to the row considered
Block in SEk is encoded successively.Therefore, encoded and decoded piece of left side it is always available (except first in a line
Block).In the example shown in Fig. 4 A or 4B, this needs block to be disposed immediately in the left side of the current block to be encoded.For this purpose, only test point
Not Wei Yu current block top and upper right side two blocks availability.
The testing procedure is easy to make coding method slack-off, by alternative according to the present invention, the clock shown in Fig. 3 A
CLK is suitable for synchronizing the process of block coding, so that it is guaranteed that respectively positioned at two blocks in the top of current block and upper right side
Availability, the availability without verifying the two blocks.Then, as shown in Fig. 4 A or 4B, coding unit UCk always for
Predetermined quantity N'(in the previous row SEk-1 of the coding of current block N'=2 here) coding and decoding block opened as offset
Begin to first piece of coding.From the perspective of software, clock as realization allows to substantially speed up in encoder CO
For handling the processing time needed for the block in image IE.
During step C41, tested to determine whether current block is first piece in considered row SEk.
If such situation, during step C42, only read in previous row SEk- in buffer storage MT
The symbol appearing probability calculated during the coding of 1 jth block.
The first variant according to Fig. 4 A, jth block are first piece (j=1) in previous row SEk-1.The reading includes
Present in buffer storage MT probability replaces the probability of CABAC encoders.To the second row SE2, the third line SE32 and
Each first piece in four row SE4 is handled, and describes the read step by the arrow of filament expression in Figure 4 A.
The second variant of above-mentioned steps C42 according to Fig. 4 B, jth block are second piece (j=2) of previous row SEk-1.
The reading includes the probability present in buffer storage MT to replace the probability of CABAC encoders.To the second row SE2, the 3rd
Each first piece in row SE32 and fourth line SE4 handled, and the arrow represented by a dotted line in figure 4b describes the reading
Take step.
After step C42, by the iteration of above-mentioned steps C34 to C38, current block is encoded and is then decoded.
If after above-mentioned steps C41, current block is not first piece of considered row SEk, advantageously without reading
(it is disposed immediately in the coding in the left side of current block in example shown in i.e. from the block coded and decoded before same a line SEk
And decoding block) generate probability.Indeed, it is contemplated that the order traversal to the block in same row reads PS, as shown in Fig. 4 A or 4B,
When the coding of current block starts, the symbol appearing probability present in CABAC encoders is exactly previous in this is mutually gone together
Existing symbol appearing probability after the coding/decoding of block.
Therefore, during step C43, the symbol appearing probability of the entropy coding of the current block is learned, it is only corresponding
In the double solid line arrow in Fig. 4 A or 4B represent for same a line in as described in previous piece come the symbol appearing probability that calculates.
After step C43, by the iteration of above-mentioned steps C34 to C38, current block is encoded and is then decoded.
The detailed description of the embodiment of decoded portion
The embodiment of coding/decoding method according to the present invention will now be described, wherein, by right in a manner of software or hardware
Initially meet the adjustment of the H.264/MPEG-4AVC decoder of standard to realize the coding/decoding method.
Coding/decoding method according to the present invention is shown in the form of the algorithm comprising step D1 to D4 shown in Fig. 5 A.
According to an embodiment of the invention, decoding side according to the present invention is realized in decoding device DO as shown in Figure 6A
Method.
With reference to figure 5A, the first decoding step D1 be it is described stream F in identify N number of subflow F1, F2 ..., Fk ..., FP, should
Subflow respectively comprising the block encoded before as shown in Fig. 4 A or 4B or N number of subset SE1, SE2 of macro block MB ..., SEk ...,
SEP.For this purpose, each subflow Fk in stream F is associated with indicator, decoder DO to be allowed to determine position of each subflow in F is flowed
It puts.In the example shown, described piece of MB has square and has identical size.As the function of image size, no
Must be the multiple of block size, the last block in left side and the last block of bottom can not be square.In alternative embodiment
In, block for example can be rectangle size and/or be misaligned mutually.
Each block or macro block itself can also be divided into sub-block, which itself can also segment.
Such stream extraction module EXDO being identified by as represented in fig. 6 is performed.
In the example shown in Fig. 4 A or 4B, predetermined quantity is equal to 4, and four subsets SE1, SE2, SE3, SE4 are empty
Line represents.
With reference to figure 5A, the second decoding step D2 is each parallel in subset SE1, SE2, SE3 and SE4 to described piece
It decodes, the root tuber in the subset considered is encoded according to the order PS of traversal.In the example shown in Fig. 4 A or 4B, current subnet
Block in SEk (1≤k≤4) is from left to right decoded successively as shown in arrow PS.When step D2 is completed, decoded piece is obtained
Subset SED1, SED2, SED3 ..., SEDk ..., SEDP.
The parallel decoding is realized by the decoding unit UDk (1≤k≤R) that quantity as shown in Figure 6A is R (R=4)
, and allow the significantly acceleration of coding/decoding method.According to so known mode, decoder DO includes buffer storage MT,
Suitable for comprising for example with the decoding of current block collaboratively gradually newer symbol appearing probability.
If Fig. 6 B are shown in more detail, each decoding unit UDk includes：
At least one symbol probability of occurrence that is calculated by learning for decoded piece before at least one, to described
Current block carries out the subelement of entropy decoding, is represented with SUDEk,
On the decoded piece of subelement for carry out current block prediction decoding before, represented with SUDPk.
Prediction decoding subelement SUDPk can be held according to traditional Predicting Technique for example in frame and/or under inter-frame mode
The prediction decoding of row current block.
Entropy decoding subelement SUDEk is CABAC types in itself, but is adjusted according to the present invention, in the description will be into one
Step description.
As variant, entropy decoding subelement SUDEk can be known huffman decoder.
In the example shown in Fig. 4 A or 4B, first module UD1 is decoded the block in the first row SE1 from left to right.
When reaching last block of the first row SE1, first piece of (N+1) row (being the 5th row here) etc. can be transferred to.Second unit
UC2 is from left to right decoded the block in the second row SE2.When reaching last block of the second row SE2, (N can be passed to
+ 2) first piece of row (being the 6th row here) etc..The traversal is repeated until unit UD4, to the block in fourth line SE4 from left-hand
The right side is decoded.When reaching last block of the first row, first piece of (N+4) row (being eighth row here) can be passed to, with
This last block analogized in the subflow to the last identified is decoded.
What the other kinds of traversal different from what is described just now above was certainly possible to.For example, each decoding unit
The row of nesting as explained above can not also be handled but the row of nesting.Can also row or column be traveled through with any direction.
With reference to figure 5A, the 3rd decoding step D3 be based on each decoded subset SED1 obtained in decoding step D2,
SED2 ..., SEDk ..., SEDP reconstruct decoded image.More precisely, each decoded subset SED1, SED2 ...,
SEDk ..., the decoding block in SEDP be sent to image reconstruction unit URI for example as shown in Figure 6A.In the process of step D3
In, when these blocks are made available by, unit URI writes decoding block in decoded image.
During the 4th decoding step D4 shown in Fig. 5 A, the unit URI shown in Fig. 6 A provides complete decoded figure
As ID.
It describes for example to realize in decoding unit UDk during above-mentioned parallel decoding step D2 referring now to Fig. 5 B
The present invention each specific sub-step.
During step D21, decoding unit UDk selections are decoded in the current block SEk shown in Fig. 4 A or 4B
First piece is used as current block.
During step D22, whether unit UDk tests current block is first piece in decoded image, at this
It is first piece of subflow F1 in example.
If this is the case, during step D23, decoding probability be initialized to before Fig. 6 A decoding
Value Pinit defined in device DO.
If not this situation, necessary solution before will be determined during the step D30 described in subsequent instruction
The availability of the block of code.
During step D24, the first current block MB1 in the first row SE1 shown in Fig. 4 A or 4B is decoded.
Step D24 includes will be described below multiple sub-step D241 to D246.
During the first sub-step D241, pair syntactic element progress entropy decoding relevant with current block.More accurately
It says, is decoded for example, by SUDE1 pairs of CABAC entropy decodings subelement shown in Fig. 6 B with the relevant syntactic element of current block.
CABAC entropy decoding subelement SUDE1 are decoded to generate syntactic element to the sub- bit stream F1 of compressed file, and simultaneously with this
Mode updates its probability, so as to which the subelement is decoded symbol at the time of, the probability of occurrence of the symbol is equal to upper
State the symbol appearing probability obtained when being encoded in entropy code step C345 to the same-sign.
During sub-step D242 below, by frame and/or the known technology of inter-prediction is come to current block
MB1 carries out prediction decoding, and during it, described piece of MB1 is predicted on decoded piece before at least one.
Needless to say, the intra prediction of other patterns such as in the h .264 standard proposed is also possible.
During the step, prediction decoding, the language are carried out by means of decoded syntactic element in before the step of
Method element especially includes the type (in interframe or frame) of prediction, and if appropriate, pattern, block or macro block comprising intra prediction
Classified types (if the latter has been subdivided), reference picture index and the offset vector used in inter-frame forecast mode.
Above-mentioned prediction decoding step allows to structure forecast block MBp1。
During sub-step D243 below, quantization residual block is constructed by means of decoded syntactic element before
MBq1。
During sub-step D244 below, according to traditional inverse quantization operation come the residual block MBq to quantization1Into
Row inverse quantization, this is the inverse operation of the quantization performed in above-mentioned steps C344, to generate decoded inverse quantisation block MBDt1。
During sub-step D245 below, to inverse quantisation block MBDt1Inverse transformation is carried out, this is above step C343
The inverse operation directly converted of middle execution.Then decoded residual block MBDr is obtained1。
During sub-step D246 below, by by prediction block MBp1It is added to decoded residual block MBDr1To construct
Decoding block MBD1.The decoding block MBD1Then unit UD1 can be decoded or form a part for the decoding unit of predetermined quantity N
Other arbitrary decoding units use.
When completing above-mentioned decoding step D246, for example, entropy decoding subelement SUDE1 as shown in Figure 6B include for example with
First piece of decoding cooperates and gradual newer all probability.These probability correspond to various possible syntactic elements and various
Associated decoding context.
It after above-mentioned decoding step D24, is tested during step D25, to determine whether current block is this
The mutually jth block of colleague, wherein j are the known predetermined values of decoder DO and at least equal to 1.
If this is the case, during step D26, the one group of probability calculated for jth block is stored in example
In the buffer storage MT of the decoder DO as shown in Fig. 6 A and Fig. 4 A or 4B, shown memory is sized for storing
The quantity of the probability calculated.
During step D27, unit UDk test just now decoded current block whether be in last subflow most
Latter piece.
If this is the case, during step D28, coding/decoding method terminates.
If not this situation, step D29, the arrow PS during step D29 in Fig. 4 A or 4B are performed
Shown traversal order selects to want decoded next piece of MBi。
If during above-mentioned steps D25, current block is not the jth block in considered row SEDk, more than progress
Step D27.
During the step D30 after above-mentioned steps D29, determine for current block MBiDecoding for it is necessary
Before decoded piece of availability.The fact that need in view of this through different decoding unit UDk come to block parallel encoding,
Decoding unit for being decoded to these blocks may not be decoded these blocks, and therefore they are also unavailable.It is described
Determine step include verification be located at previous row SEk-1 in predetermined quantity N' block (such as respectively positioned at current block top and
Two blocks in upper right side) whether can be used for current block decoding, i.e., they whether the decoding unit being decoded to it
UDk-1 is decoded.The definite step further include verification be located at want decoded current block MBiLeft side at least one piece available
Property.But, it is contemplated that the traversal order PS selected in the embodiment shown in Fig. 4 A or 4B, to the block in the row SEk that is considered according to
It is secondary to be decoded.Therefore, decoded piece of left side always available (except first piece in a line).Shown in Fig. 4 A or 4B
In example, this needs block to be disposed immediately in the left side for wanting decoded current block.For this purpose, only test the top for being located at current block respectively
With the availability of two blocks in upper right side.
The testing procedure is easy to make coding/decoding method slack-off, by alternative according to the present invention, the clock shown in Fig. 6 A
CLK is suitable for synchronizing the decoded process of block, so that it is guaranteed that respectively positioned at two blocks in the top of current block and upper right side
Availability, the availability without verifying the two blocks.Then, as shown in Fig. 4 A or 4B, decoding unit UDk always for
Decode the predetermined quantity N'(N'=2 here in the previous row SEk-1 of current block) decoding block start as offset to first
Block is decoded.From the perspective of software, clock as realization allows to substantially speed up processing in decoder DO often
The processing time needed for block in a subset SEk.
During step D31, tested to determine whether current block is first piece in considered row SEk.
If such situation, during step D32, only read in previous row SEk- in buffer storage MT
The symbol appearing probability calculated during the decoding of 1 jth block.
The first variant according to Fig. 4 A, jth block are first piece (j=1) in previous row SEk-1.The reading includes
Present in buffer storage MT probability replaces the probability of CABAC decoders.To the second row SE2, the third line SE3 and the 4th
Each first piece in row SE4 is equally handled, and describes the read step by the arrow of filament expression in Figure 4 A.
The second variant of above-mentioned steps D32 according to Fig. 4 B, jth block are second piece (j=2) of previous row SEk-1.
The reading includes the probability present in buffer storage MT to replace the probability of CABAC decoders.To the second row SE2, the 3rd
Each first piece in row SE3 and fourth line SE4 handled, and the arrow represented by a dotted line in figure 4b describes the reading
Step.
After step D32, by the iteration of above-mentioned steps D24 to D28, current block is decoded.
If after above-mentioned steps D31, current block is not first piece of considered row SEk, advantageously without reading
From (decoding block for being disposed immediately in the left side of current block in example shown in the i.e.) generation decoded piece before same a line SEk
Probability.Indeed, it is contemplated that the order traversal to the block in same row reads PS, as shown in Fig. 4 A or 4B, in the solution of current block
The symbol appearing probability present in CABAC decoders is exactly deposited in this is mutually gone together after previous piece of decoding when code starts
Symbol appearing probability.
Therefore, during step D33, the symbol appearing probability of the entropy decoding for the current block is learned, only
Corresponding to the symbol appearance calculated for previous piece as described in same a line represented such as the double solid line arrow in Fig. 4 A or 4B
Probability.
After step D33, by the iteration of above-mentioned steps D24 to D28, current block is decoded.
Claims (12)
1. a method of computer implementation, including：
Receive the stream for representing at least one coded image；
Group multiple pieces predetermined is identified from stream；
Each piece of group is supplied to the first decoding unit；And
First piece in the group of given block is handled by the first decoding unit, wherein the processing to first piece includes：
Determine first piece of first in the group of the given block in the order in block；
In response to determining first piece of first in the group of the given block in the order in block, fetched from buffer
First group of probability data, wherein first group of probability data includes the first group code probability of occurrence associated with following block, the block
The another of the group different from the given block in the group multiple pieces predetermined is closely positioned and belongs to first piece
The group of block；
Based on first group of probability data come to first piece of progress entropy decoding；And
Second piece in the group of the given block is handled by the first decoding unit, wherein the processing to second piece includes：
Determine second piece of first be not in the group of the given block in the order of block；
In response to determining second piece of first be not in the group of the given block in the order of block, from memory list
Second group of probability data is fetched in member, wherein second group of probability data is including associated at least one other decoded piece
The second group code probability of occurrence, it is described in this at least one other decoded piece group for belonging to described predetermined multiple pieces
The group of given block,
The block of wherein the second group code probability of occurrence not group with being not belonging to the given block is associated；And
Based on second group of probability data come to second piece of progress entropy decoding.
2. the method as described in claim 1 further includes：
The 3rd group of probability data is generated based on second group of probability data and on second piece of data；And
Second group of probability data in memory cell is replaced with the 3rd group of probability data.
3. the method as described in claim 1, wherein：
Included based on first group of probability data to carry out entropy decoding to first piece：Binary arithmetic is adapted to by using context to compile
Code CABAC algorithms, based on first group of probability data come to first piece of progress entropy decoding；And
Included based on second group of probability data to carry out entropy decoding to second piece：It is general based on second group by using CABAC algorithms
Rate data are come to second piece of progress entropy decoding.
4. the method as described in claim 1 further includes：
The 3rd group of probability data is generated based on first group of probability data and on first piece of data；
By the 3rd group of probability data storage to memory cell；And
Second group of probability data is generated using at least the 3rd group of probability data.
5. the method as described in claim 1 further includes：
Compared with the block of at least one early decoding, prediction decoding is carried out to each block in the group of the given block.
6. the method as described in claim 1 further includes：
The 3rd piece in the group of the given block is handled by the first decoding unit, wherein the processing to the 3rd piece includes：
The 3rd group of probability data is fetched from memory cell, wherein the 3rd group of probability data include with it is described at least one other
Decoded piece of associated 3rd group code probability of occurrence, and wherein the 3rd group of probability data is at least general based on second group
Rate data；And
Based on the 3rd group of probability data come to the 3rd piece of progress entropy decoding.
7. a kind of computer implemented system, including：
The storage device of one or more computers and one or more store instructions, described instruction are operable as in quilt
One or more computer causes one or more computer execution to include the operation of following item when performing：
Receive the stream for representing at least one coded image；
Group multiple pieces predetermined is identified from stream；
Each piece of group is supplied to the first decoding unit；And
First piece in the group of given block is handled by the first decoding unit, wherein the processing to first piece includes：
Determine first piece of first in the group of the given block in the order in block；
In response to determining first piece of first in the group of the given block in the order in block, fetched from buffer
First group of probability data, wherein first group of probability data includes the first group code probability of occurrence associated with following block, the block
The another of the group different from the given block in the group multiple pieces predetermined is closely positioned and belongs to first piece
The group of block；
Based on first group of probability data come to first piece of progress entropy decoding；And
Second piece in the group of the given block is handled by the first decoding unit, wherein the processing to second piece includes：
Determine second piece of first be not in the group of the given block in the order of block；
In response to determining second piece of first be not in the group of the given block in the order of block, from memory list
Second group of probability data is fetched in member, wherein second group of probability data is including associated at least one other decoded piece
The second group code probability of occurrence, it is described in this at least one other decoded piece group for belonging to described predetermined multiple pieces
The group of given block,
The block of wherein the second group code probability of occurrence not group with being not belonging to the given block is associated；And
Based on second group of probability data come to second piece of progress entropy decoding.
8. system as claimed in claim 7, wherein, the operation further comprises：
The 3rd group of probability data is generated based on second group of probability data and on second piece of data；And
Second group of probability data in memory cell is replaced with the 3rd group of probability data.
9. system as claimed in claim 7, wherein：
Included based on first group of probability data to carry out entropy decoding to first piece：Binary arithmetic is adapted to by using context to compile
Code CABAC algorithms, based on first group of probability data come to first piece of progress entropy decoding；And
Included based on second group of probability data to carry out entropy decoding to second piece：It is general based on second group by using CABAC algorithms
Rate data are come to second piece of progress entropy decoding.
10. system as claimed in claim 7, wherein, the operation further comprises：
The 3rd group of probability data is generated based on first group of probability data and on first piece of data；
By the 3rd group of probability data storage to memory cell；And
Second group of probability data is generated using at least the 3rd group of probability data.
11. system as claimed in claim 7, wherein, the operation further comprises：
Compared with the block of at least one early decoding, prediction decoding is carried out to each block in the group of the given block.
12. system as claimed in claim 7, wherein, the operation further comprises：
The 3rd piece in the group of the given block is handled by the first decoding unit, wherein the processing to the 3rd piece includes：
The 3rd group of probability data is fetched from memory cell, wherein the 3rd group of probability data include with it is described at least one other
Decoded piece of associated 3rd group code probability of occurrence, and wherein the 3rd group of probability data is at least general based on second group
Rate data；And
Based on the 3rd group of probability data come to the 3rd piece of progress entropy decoding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510340428.5A CN105007486B (en) | 2011-03-07 | 2012-02-23 | Code and decode method, the coding and decoding equipment of image |
Applications Claiming Priority (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| FR1151849A FR2972588A1 (en) | 2011-03-07 | 2011-03-07 | METHOD FOR ENCODING AND DECODING IMAGES, CORRESPONDING ENCODING AND DECODING DEVICE AND COMPUTER PROGRAMS |
| FR11/51,849 | 2011-03-07 | ||
| CN201510340428.5A CN105007486B (en) | 2011-03-07 | 2012-02-23 | Code and decode method, the coding and decoding equipment of image |
| CN201280021355.8A CN103535032B (en) | 2011-03-07 | 2012-02-23 | Coding and the decoding method of image, coding and decoding device |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201280021355.8A Division CN103535032B (en) | 2011-03-07 | 2012-02-23 | Coding and the decoding method of image, coding and decoding device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105007486A CN105007486A (en) | 2015-10-28 |
| CN105007486B true CN105007486B (en) | 2018-06-05 |
Family
ID=54447112
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510340428.5A Active CN105007486B (en) | 2011-03-07 | 2012-02-23 | Code and decode method, the coding and decoding equipment of image |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105007486B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11265561B2 (en) * | 2017-01-06 | 2022-03-01 | Mediatek Inc. | Method and apparatus for range derivation in context adaptive binary arithmetic coding |
| CA3069635C (en) | 2017-07-14 | 2022-06-14 | Mediatek, Inc. | Method and apparatus for range derivation in context adaptive binary arithmetic coding |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008036237A2 (en) * | 2006-09-21 | 2008-03-27 | Analog Devices, Inc. | Multiprocessor decoder system and method |
| CN101490968A (en) * | 2006-07-17 | 2009-07-22 | 索尼株式会社 | Parallel processing apparatus for video compression |
| CN101836454A (en) * | 2008-12-03 | 2010-09-15 | 联发科技股份有限公司 | Method for performing parallel cabac processing with ordered entropy slices, and associated apparatus |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8542727B2 (en) * | 2007-12-31 | 2013-09-24 | Intel Corporation | Systems and apparatuses for performing CABAC parallel encoding and decoding |
-
2012
- 2012-02-23 CN CN201510340428.5A patent/CN105007486B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101490968A (en) * | 2006-07-17 | 2009-07-22 | 索尼株式会社 | Parallel processing apparatus for video compression |
| WO2008036237A2 (en) * | 2006-09-21 | 2008-03-27 | Analog Devices, Inc. | Multiprocessor decoder system and method |
| CN101836454A (en) * | 2008-12-03 | 2010-09-15 | 联发科技股份有限公司 | Method for performing parallel cabac processing with ordered entropy slices, and associated apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105007486A (en) | 2015-10-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106454346B (en) | Code and decode method, the coding and decoding equipment of image | |
| CN103959787B (en) | For the method to image coding and decoding, coding and decoding equipment | |
| CN105007486B (en) | Code and decode method, the coding and decoding equipment of image | |
| KR102658291B1 (en) | Method of coding and decoding images, coding and decoding device and computer programs corresponding thereto | |
| KR20240055115A (en) | Method of coding and decoding images, coding and decoding device and computer programs corresponding thereto |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1214050 Country of ref document: HK |
|
| CB02 | Change of applicant information |
Address after: Amsterdam Applicant after: Dolby International AB Address before: Stockholm Applicant before: Dolby International AB |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |