CN104702958B - A kind of HEVC inner frame coding methods and system based on spatial coherence - Google Patents
A kind of HEVC inner frame coding methods and system based on spatial coherence Download PDFInfo
- Publication number
- CN104702958B CN104702958B CN201310655153.5A CN201310655153A CN104702958B CN 104702958 B CN104702958 B CN 104702958B CN 201310655153 A CN201310655153 A CN 201310655153A CN 104702958 B CN104702958 B CN 104702958B
- Authority
- CN
- China
- Prior art keywords
- unit
- current coded
- depth
- coded unit
- coding
- 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
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The present invention is applied to the communications field there is provided a kind of HEVC inner frame coding methods based on spatial coherence, including：According to the depth and size of current coded unit, select the space in current coded unit adjacent and with an equal amount of adjacent encoder unit, and ask for the depth bounds [a0, a1] of adjacent encoder unit；According to the relation between the complexity of current coded unit and the complexity of adjacent encoder unit and the position of current coded unit, the depth bounds of current coded unit is determined；Current coded unit is encoded according to the depth bounds of current coded unit, and the depth for selecting Least-cost according to prediction cost, as the depth of current coded unit, the coding for terminating current coded unit is simultaneously transferred to next coding unit.Present invention also offers a kind of HEVC intraframe coding systems based on spatial coherence.HEVC inner frame coding methods and system provided by the present invention based on spatial coherence can improve code efficiency.
Description
Technical field
The present invention relates to the communications field, more particularly to a kind of HEVC inner frame coding methods based on spatial coherence and it is
System.
Background technology
With the improvement of living standards, requirement of the people to quality of the life also more and more higher.Watch video main as one kind
The entertainment way wanted, people increasingly pay attention to the visual enjoyment that it brings.For the size of video, its resolution ratio from 176 ×
144 are gradually increased to 4k × 2k, even 8k × 4k.Compared with low-resolution video, high-resolution video can be carried to the mankind
For bigger visual enjoyment.
Efficient video coding（High Efficiency Video Coding, HEVC）Standard is in Video coding mark of new generation
It is accurate H.264/AVC on the basis of, employ the compression efficiency that more new technologies improve videos, such as advanced motion vector is pre-
Survey, the segmentation of more intra prediction modes, asymmetrical movement, the adaptive skew of sampling etc., although these technologies bring many
Coding gain, but higher encoder complexity is also inevitably brought, so as to have influence on efficient video coding standard
HEVC moves towards actual application from theoretical.
In order to reduce the complexity of efficient video coding standard HEVC cataloged procedures, researcher proposes many effective
Method.For example it has been proposed that one kind is adaptive to should determine that coding unit（Coding Unit, CU）The algorithm of depth bounds, You Renli
Current coded unit CU depth bounds is quickly determined with the depth of previous encoded frame and adjacent encoded coding unit CU,
Someone proposes that a quick algorithm for determining coding unit CU depth accelerates cataloged procedure respectively in CU layers of frame-layer and coding unit,
Someone combines some related feature quick decision coding unit CU depth etc. method using bayesian criterion.
Although the above method can remove redundancy present in cataloged procedure to a certain extent, these methods are only
The simple depth bounds that coding unit CU is quickly determined using spatial coherence or temporal correlation, a frame figure is not accounted for but
The coding unit CU situations not strong with space-time adjacent encoder unit CU correlations is also frequently present as in, it is single that this will result in coding
First CU depth bounds forecasting inaccuracy really, causes different degrees of code efficiency to reduce.
Therefore, design a kind of brand-new HEVC inner frame coding methods and system based on spatial coherence are needed badly, so as to
To improve code efficiency.
The content of the invention
In view of this, it is an object of the invention to provide a kind of HEVC inner frame coding methods based on spatial coherence and it is
System, it is intended to solve the problem of code efficiency is relatively low in the prior art.
The present invention is achieved in that a kind of HEVC inner frame coding methods based on spatial coherence, including：
According to the depth and size of current coded unit, select the space in the current coded unit adjacent and have
An equal amount of adjacent encoder unit, and ask for the depth bounds [a of the adjacent encoder unit0, a1]；
According to the relation between the complexity of the current coded unit and the complexity of the adjacent encoder unit and
The position of the current coded unit, determines the depth bounds of the current coded unit；
Current coded unit is encoded according to the depth bounds of current coded unit, and according to prediction cost selection generation
The minimum depth of valency terminates the coding of current coded unit and is transferred to next coding list as the depth of current coded unit
Member.
It is preferred that, the depth bounds according to current coded unit is encoded to current coded unit, and according to pre-
The depth of cost selection Least-cost is surveyed as the depth of current coded unit, terminates the coding of current coded unit and is transferred to down
The step of one coding unit, includes：
Judge the current coded unit depth whether the current coded unit having determined depth bounds
Within；
If the depth of the current coded unit is not within the depth bounds for the current coded unit having determined,
Then judge whether the depth of the current coded unit is more than or equal to the depth for the current coded unit having determined
The upper limit of scope；
If the depth of the current coded unit is more than or equal to the depth for the current coded unit having determined
The upper limit of scope, then terminate the cutting procedure of the current coded unit；
Whether judge the current coded unit is last coding unit to be searched in code tree unit after trimming；
If the current coded unit is last coding unit to be searched in code tree unit after trimming, terminate
The recursive subdivision process of present encoding tree unit, completes the coding of the corresponding coding unit of present encoding tree unit.
It is preferred that, in the depth for judging the current coded unit whether in the present encoding list having determined
After the step of within the depth bounds of member, methods described also includes：
If the depth of the current coded unit is within the depth bounds for the current coded unit having determined,
Intra-prediction process is performed, and calculates optimum prediction mode correspondence cost, the pattern of selection Least-cost is optimal mode.
It is preferred that, it is described according between the complexity of the current coded unit and the complexity of the adjacent encoder unit
Relation and the current coded unit position, the step of determining the depth bounds of the current coded unit be specific
Including：
If the current coded unit belongs to the coding unit at the top or leftmost edge, it is determined that the current volume
The original depth bounds of code unit is [0,3]；
Or, if the complexity of the current coded unit is more than the maximum of the complexity of the adjacent encoder unit,
The depth bounds for then determining the current coded unit is [a0, min (a1+ N, 3)], N ∈ [0,3]；
Or, if the complexity of the current coded unit is less than the minimum value of the complexity of the adjacent encoder unit,
The depth bounds for then determining the current coded unit is [max (0, a0- N), a1], N ∈ [0,3]；
Or, if the complexity of the current coded unit is between the complexity of the adjacent encoder unit, really
The depth bounds of the fixed current coded unit is [a0, a1]。
It is preferred that, the depth and size according to current coded unit is selected in the space of the current coded unit
It is adjacent and with an equal amount of adjacent encoder unit, and ask for the depth bounds [a of the adjacent encoder unit0, a1] step
Suddenly include：
According to the depth and size of current coded unit, select adjacent with top simultaneously in the left of the current coded unit
And with an equal amount of adjacent encoder unit, and by calculating left and the union of the depth bounds of top adjacent encoder unit
To obtain the depth bounds [a of the adjacent encoder unit0, a1]。
On the other hand, the present invention also provides a kind of HEVC intraframe coding systems based on spatial coherence, the system bag
Include：
Selecting module, for the depth and size according to current coded unit, selects the sky in the current coded unit
Between it is adjacent and with an equal amount of adjacent encoder unit, and ask for the depth bounds [a of the adjacent encoder unit0, a1]；
Range determination module, for the complexity according to the current coded unit and the complexity of the adjacent encoder unit
The position of relation and the current coded unit between degree, determines the depth bounds of the current coded unit；
Prediction module is encoded, current coded unit is encoded for the depth bounds according to current coded unit, and
According to the depth of prediction cost selection Least-cost as the depth of current coded unit, terminate the coding of current coded unit simultaneously
It is transferred to next coding unit.
It is preferred that, the coding prediction module includes：
First judging submodule, for judging whether the depth of the current coded unit is described current what is had determined
Within the depth bounds of coding unit；
Second judging submodule, if the depth for the current coded unit is not in the present encoding having determined
Within the depth bounds of unit, then judge whether the depth of the current coded unit is described more than or equal to what is had determined
The upper limit of the depth bounds of current coded unit；
Terminate segmentation submodule, if for the current coded unit depth be more than or equal to have determined described in
The upper limit of the depth bounds of current coded unit, then terminate the cutting procedure of the current coded unit；
3rd judging submodule, for judge the current coded unit whether be after trimming in code tree unit it is to be searched
Last coding unit；
Wherein, it is described to terminate segmentation submodule, if it is after trimming in code tree unit to be additionally operable to the current coded unit
Last coding unit to be searched, then terminate the recursive subdivision process of present encoding tree unit, completes present encoding tree single
The coding of the corresponding coding unit of member.
It is preferred that, the coding prediction module also includes：
Implementation sub-module, if the depth for the current coded unit is in the current coded unit having determined
Within depth bounds, then intra-prediction process is performed, and calculate optimum prediction mode correspondence cost, select the pattern of Least-cost
For optimal mode.
It is preferred that, the range determination module, specifically for：
If the current coded unit belongs to the coding unit at the top or leftmost edge, it is determined that the current volume
The original depth bounds of code unit is [0,3]；
Or, if the complexity of the current coded unit is more than the maximum of the complexity of the adjacent encoder unit,
The depth bounds for then determining the current coded unit is [a0, min (a1+ N, 3)], N ∈ [0,3]；
Or, if the complexity of the current coded unit is less than the minimum value of the complexity of the adjacent encoder unit,
The depth bounds for then determining the current coded unit is [max (0, a0- N), a1], N ∈ [0,3]；
Or, if the complexity of the current coded unit is between the complexity of the adjacent encoder unit, really
The depth bounds of the fixed current coded unit is [a0, a1]。
It is preferred that, the selecting module specifically for：According to the depth and size of current coded unit, selection is worked as described
The left of preceding coding unit is adjacent with top and with an equal amount of adjacent encoder unit, and by calculating left and top
The union of the depth bounds of adjacent encoder unit obtains the depth bounds [a0, a1] of the adjacent encoder unit.
In embodiments of the present invention, the intraframe coding in the technical scheme that the present invention is provided, video sequence per two field picture
Journey is by code tree unit（Coding Tree Unit, CTU）Processing, and the recurrence side that code tree unit passes through depth-first
Formula travels through coding units all in the code tree unit（Coding Unit, CU）, the present invention is according to video sequence space correlation
Property, the depth bounds of coding unit is accurately determined using recursive fashion, before encoded video Quality Down is not caused substantially
The scope for reducing traversal code tree unit searches is put, the complexity of intraframe coding process is significantly reduced.Use the present invention
The depth that the technical scheme of offer is encoded by the predicting coding information current coded unit of space adjacent encoder unit, to compile
The code more effective depth bounds of cell formation, reduces and performs rate-distortion optimization（Rate-distortion Optimization,
RDO）Coding unit number so that ensure coding efficiency on the premise of, more effectively reduce intraframe coding process complexity
Degree, improves coding rate.
Brief description of the drawings
Fig. 1 is the HEVC inner frame coding method flow charts based on spatial coherence in an embodiment of the present invention；
Fig. 2 is the method detailed flow chart of the step S13 shown in Fig. 1 in an embodiment of the present invention；
The recursive subdivision schematic diagram that Fig. 3 is code tree unit CTU in an embodiment of the present invention；
Fig. 4 is some Quadtree Partition structure of code tree unit CTU final choices in an embodiment of the present invention；
Fig. 5 is the HEVC intraframe coding system structure diagrams based on spatial coherence in an embodiment of the present invention；
Fig. 6 is the internal structure schematic diagram of the coding prediction module 103 shown in Fig. 5 in an embodiment of the present invention；
Fig. 7 a and Fig. 7 b are the contrast test figure of three kinds of coding methods.
Embodiment
In order to make the purpose , technical scheme and advantage of the present invention be clearer, it is right below in conjunction with drawings and Examples
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.
The specific embodiment of the invention provides a kind of HEVC inner frame coding methods based on spatial coherence, mainly includes
Following steps：
S11, depth and size according to current coded unit, select the current coded unit space it is adjacent and
With an equal amount of adjacent encoder unit, and ask for the depth bounds [a of the adjacent encoder unit0, a1]；
Relation between S12, the complexity according to the current coded unit and the adjacent encoder unit complexity
And the position of the current coded unit, determine the depth bounds of the current coded unit；
S13, according to the depth bounds of current coded unit current coded unit is encoded, and according to prediction cost choosing
The depth of Least-cost is selected as the depth of current coded unit, terminates the coding of current coded unit and is transferred to next coding
Unit.
Per two field picture in a kind of HEVC inner frame coding methods based on spatial coherence provided by the present invention, video sequence
Intraframe coding process be by code tree unit（Coding Tree Unit, CTU）Processing, and code tree unit passes through depth
Preferential recursive fashion travels through coding units all in the code tree unit（Coding Unit, CU）, the present invention is according to video
Sequence space correlation, the depth bounds of coding unit is accurately determined using recursive fashion, and encoded video is not being caused substantially
The scope of traversal code tree unit searches is reduced on the premise of Quality Down, the complexity of intraframe coding process is significantly reduced
Degree.The technical scheme provided using the present invention is encoded by the predicting coding information current coded unit of space adjacent encoder unit
Depth, building more effective depth bounds for coding unit, reducing and perform rate-distortion optimization（Rate-distortion
Optimization, RDO）Coding unit number so that ensure coding efficiency on the premise of, more effectively reduce frame in compile
The complexity of code process, improves coding rate.
A kind of HEVC inner frame coding methods based on spatial coherence provided by the present invention will be carried out specifically below
It is bright.
Referring to Fig. 1, being the HEVC inner frame coding method flow charts based on spatial coherence in an embodiment of the present invention.
In step s 11, according to the depth and size of current coded unit, select in the space of the current coded unit
It is adjacent and with an equal amount of adjacent encoder unit, and ask for the depth bounds [a of the adjacent encoder unit0, a1]。
In the present embodiment, a is remembered0Represent that the space of the current coded unit is adjacent and with an equal amount of phase
The lower limit of adjacent coding unit CU depth bounds unions, a1Representation space is adjacent and with an equal amount of adjacent encoder unit CU
The upper limit of depth bounds union.
In the present embodiment, coding unit（Coding Unit, CU）It is the elementary cell of coding, similar to a new generation
The concept of video encoding standard H.264/AVC middle macro block, it is the code tree unit using quad-tree structure recursive subdivision
（Coding Tree Unit, CTU) leaf node.In sequence parameter set（Sequence Parameter Set, SPS）In can
To provide code tree unit CTU maximum coding unit（Largest Coding Unit, LCU）Size and maximum segmentation are deep
Degree.
In the present embodiment, code tree unit CTU determines whether coding unit CU needs to continue to divide using segmentation mark
Cut, when needing segmentation, coding unit CU is segmented into four size identical next stage CU.Predicting unit PU (Prediction
Unit) be prediction elementary cell, it determines that coding unit CU is predicted using which kind of segmentation type, and its root node is in coding
CU layers of unit.The segmentation type of intra prediction mode have do not split with quartering two types, only when coding unit CU recurrence
The Fractionation regimen of the quartering is just performed when segmentation reaches minimum dimension.Converter unit TU (Transform Unit) is real transform
Elementary cell, root node is also in CU layers of coding unit.Converter unit TU processing also uses quad-tree structure, and its quaternary tree claims
For residual error quaternary tree (Residual Quadtree, RQT).It can specify that residual error quaternary tree RQT's in sequence parameter set SPS
Maximum transform block (Transform Block, TB) size and maximum segmentation depth.Transform block TB is substantially all using discrete remaining
String converts (Discrete Cosine Transform, DCT), but if transform block TB sizes are 4 × 4 and are infra-frame predictions
When selection discrete sine transform (Discrete Sine Transform, DST).
In step s 12, according to the complexity of the complexity of the current coded unit and the adjacent encoder unit it
Between relation and the current coded unit position, determine the depth bounds of the current coded unit.
In the present embodiment, the complexity according to the current coded unit and the adjacent encoder unit are answered
The position of relation and the current coded unit between miscellaneous degree, determines the depth bounds of the current coded unit
Step is specifically included：
If the current coded unit belongs to the coding unit at the top or leftmost edge, it is determined that the current volume
The original depth bounds of code unit is [0,3]；
Or, if the complexity of the current coded unit is more than the maximum of the complexity of the adjacent encoder unit,
The depth bounds for then determining the current coded unit is [a0, min (a1+ N, 3)], N ∈ [0,3]；N is set in the present embodiment
1；
Or, if the complexity of the current coded unit is less than the minimum value of the complexity of the adjacent encoder unit,
The depth bounds for then determining the current coded unit is [max (0, a0- N), a1], N ∈ [0,3]；N is set in the present embodiment
1；；
Or, if the complexity of the current coded unit is between the complexity of the adjacent encoder unit, really
The depth bounds of the fixed current coded unit is [a0, a1]。
In step s 13, current coded unit is encoded according to the depth bounds of current coded unit, and according to pre-
The depth of cost selection Least-cost is surveyed as the depth of current coded unit, terminates the coding of current coded unit and is transferred to down
One coding unit.
In the present embodiment, step S13 specifically also includes step S131-S138, as shown in Figure 2.
Referring to Fig. 2, being the method detailed flow chart of the step S13 shown in Fig. 1 in an embodiment of the present invention.
In step S131, judge the depth of the current coded unit whether in the present encoding list having determined
Within the depth bounds of member.
If the depth of the current coded unit is not within the depth bounds for the current coded unit having determined,
Then in step S132, judge whether the depth of the current coded unit is more than or equal to the current volume having determined
The upper limit of the depth bounds of code unit.
In the present embodiment, if the depth of the current coded unit is in the current coded unit having determined
Within depth bounds, then in step S136, intra-prediction process is performed, and calculate optimum prediction mode correspondence cost, selection
The pattern of Least-cost is optimal mode.
In the present embodiment, during infra-frame prediction, code tree unit CTU is according to quaternary tree recursive subdivision, each leaf section
Point constitutes coding unit CU, and coding unit CU includes a luminance coding block (Coding Block, CB), two chroma coder blocks
CB, and corresponding syntax elements.In efficient video coding standard HEVC, code tree unit CTU can be according to sequence parameter set
Maximum coding unit size specified in SPS and maximum depth of recursion recursive subdivision.In order to describe the mistake of recursive subdivision in detail
Journey, it is assumed that maximum coding unit size specified in sequence parameter set SPS is 32 × 32 and maximum depth of recursion is 3, then
Corresponding code tree unit CTU recursive subdivision schematic diagram is as shown in Figure 3.
Referring to Fig. 3, being the recursive subdivision schematic diagram of code tree unit CTU in an embodiment of the present invention.In figure 3,
Digital 1-25 represents the order of processing, is first carried out 1, that is, asks for the corresponding cost of 32 × 32 pieces of optimal predictive modes, and
The corresponding costs of coding unit CU, tool are weighed using two parametric synthesis of bit shared by the data such as image fault and coded residual
The cost function of body is as shown in Equation 1.Because code tree unit CTU uses the way of search of depth-first, so, 1 has performed
After perform 2, that is, seek the corresponding cost of predictive mode that the coding unit CU that numbering is 2 is optimal.So handle in the same way
The coding unit CU that numbering is 3.Because the coding unit CU that numbering is 3 has reached maximum specified in sequence parameter set SPS
Depth, so, the coding unit CU that numbering is 3 needs not continue to segmentation after having handled, but processing same layer numbering is successively
4th, 5,6 coding unit CU.Recited above is code tree unit CTU cutting procedure.In order to judge the coding of final reality
During, the coding unit CU that numbering is 2 is, it is necessary to perform volume using 16 × 16 pieces of codings or using four 8 × 8 pieces of codings
Number operation for being 7, that is, compare numbering 3-6 corresponding cost sums of coding unit CU with numbering the generation for the coding unit CU for being 2
Valency, uses the corresponding mode of minimum cost to encode numbering for 2 coding unit CU, this is the trimming process of coding unit.According to
The secondary segmentation for performing coding unit CU and trimming process, until whole code tree unit CTU processing is completed.Process described above is
Correspondence cost and a kind of minimum combination are used as optimal coded system fgs encoder tree in the CU combinations of selection different coding unit
Unit CTU, this process is referred to as rate-distortion optimization（Rate Distortion Optimization, RDO).It is obvious that rate is lost
The coded system optimal true optimization RDO processes coding unit CU combination selection code tree unit CTU all by traveling through, it is this
Although mode code efficiency is very high, encoder complexity is also highest, and when maximum coding unit CU sizes are certain
When, encoder complexity increases rapidly as sequential parameter concentrates the maximum coding depth set to increase.
RDCost=D+λ·R (1)
Wherein, RDCost represents the cost of image fault and the required bit synthesis of coding after the completion of current block coding, and D is represented
The difference rebuild between pixel and original pixels, the bit needed for the current block message of R presentation codes, λ represents Lagrange multiplier.
From analysis above it is recognised that efficient video coding standard HEVC is according to the ginseng set in sequence parameter set SPS
The leaf node that number scope is traveled through in all code tree unit CTU finds optimal coding unit CU combinations.But final choice
Coding unit CU it is related with video content, content is more complicated, and the coding unit CU of selection is smaller, and content is more flat, selection
Coding unit CU is bigger.Therefore, discounting for the characteristic of video content, all coding unit CU are compiled using identical
Code depth bounds, will produce very big coding redundancy.In order to which this problem is explained in more detail, we illustrate.Fig. 4 is
Some Quadtree Partition structure of code tree unit CTU final choices.
As shown in figure 4, when set in sequence parameter set SPS maximum coding unit (Largest Coding Unit,
LCU) be 64 × 64, maximum fractionation depth be 4 when, possible coding unit CU sizes be 64 × 64,32 × 32,16 × 16,8 ×
8, corresponding coding depth is respectively 0,1,2,3.In an encoding process, code tree unit CTU is by way of recursive subdivision time
All coding unit CU depth are gone through, so as to select optimal coding unit CU depth coding code tree units CTU.If coding
Unit CTU is set by the way of constant depth scope, then code tree unit CTU can from depth 0 progressively recursive subdivision to depth
3.Because the coding unit CU depth of final choice is related with video content, so the coding unit CU depth of final choice is not
Necessarily all comprising depth 0, depth 1, depth 2, depth 3.In figure 3, selected coding unit CU depth and do not include finally
Depth 0, only depth 1, depth 2, depth 3, then present encoding tree unit CTU depth bounds is [1,3].And in reality
In cataloged procedure, efficient video coding standard HEVC can be since depth 0, and progressively recursive subdivision is to depth 3.Therefore the phase of depth 0
All operations closed encode no practical significance to present encoding tree unit CTU, here it is redundancy present in cataloged procedure.
During coding, if Accurate Prediction present encoding tree unit CTU depth bounds can be shifted to an earlier date, it is possible to directly skip not
The depth needed, so as on the premise of coded video quality is not remarkably decreased, substantially reduce encoder complexity.
Please continue to refer to Fig. 2, in the present embodiment, if the depth of the current coded unit is more than or equal to
The upper limit of the depth bounds of the current coded unit determined, then in step S133, terminate the current coded unit
Cutting procedure.
In the present embodiment, if the depth of the current coded unit is less than the current coded unit having determined
Depth bounds the upper limit, then in step S137, the depth of the current coded unit is added 1.In the present embodiment, exist
After adding 1 by the depth of the current coded unit, the step S11 shown in Fig. 1 is continued executing with.
Whether in step S134, it is to be searched last in code tree unit after trimming to judge the current coded unit
One coding unit.
If the current coded unit is last coding unit to be searched in code tree unit after trimming, in step
In rapid S135, terminate the recursive subdivision process of present encoding tree unit, complete the corresponding coding unit of present encoding tree unit
Coding.
In the present embodiment, if the current coded unit is not to be searched last in code tree unit after trimming
Individual coding unit, then be transferred to next coding unit, and next coding unit is defined as into current coded unit, such as step
Shown in S138, then following step is just repeated since the step S11 shown in Fig. 1, and description is just not repeated herein.
Per two field picture in a kind of HEVC inner frame coding methods based on spatial coherence provided by the present invention, video sequence
Intraframe coding process be by code tree unit（Coding Tree Unit, CTU）Processing, and code tree unit passes through depth
Preferential recursive fashion travels through coding units all in the code tree unit（Coding Unit, CU）, the present invention is according to video
Sequence space correlation, the depth bounds of coding unit is accurately determined using recursive fashion, and encoded video is not being caused substantially
The scope of traversal code tree unit searches is reduced on the premise of Quality Down, the complexity of intraframe coding process is significantly reduced
Degree.The technical scheme provided using the present invention is encoded by the predicting coding information current coded unit of space adjacent encoder unit
Depth, building more effective depth bounds for coding unit, reducing and perform rate-distortion optimization（Rate-distortion
Optimization, RDO）Coding unit number so that ensure coding efficiency on the premise of, more effectively reduce frame in compile
The complexity of code process, improves coding rate.
The specific embodiment of the invention also provides a kind of HEVC intraframe codings system 10 based on spatial coherence, main bag
Include：
Selecting module 101, for the depth and size according to current coded unit, is selected in the current coded unit
Space is adjacent and with an equal amount of adjacent encoder unit, and asks for the depth bounds [a of the adjacent encoder unit0,
a1]；
Range determination module 102, for the complexity according to the current coded unit and the adjacent encoder unit
The position of relation and the current coded unit between complexity, determines the depth model of the current coded unit
Enclose；
Prediction module 103 is encoded, current coded unit is encoded for the depth bounds according to current coded unit,
And the depth of current coded unit, the coding of end current coded unit are used as according to the depth of prediction cost selection Least-cost
And it is transferred to next coding unit.
Per frame figure in a kind of HEVC intraframe codings system 10 based on spatial coherence provided by the present invention, video sequence
The intraframe coding process of picture is by code tree unit（Coding Tree Unit, CTU）Processing, and code tree unit passes through depth
The preferential recursive fashion of degree travels through coding units all in the code tree unit（Coding Unit, CU）, the present invention is according to regarding
Frequency sequence spatial coherence, the depth bounds of coding unit is accurately determined using recursive fashion, and coded video is not being caused substantially
The scope of traversal code tree unit searches is reduced on the premise of frequency Quality Down, the complexity of intraframe coding process is significantly reduced
Degree.The technical scheme provided using the present invention is encoded by the predicting coding information current coded unit of space adjacent encoder unit
Depth, building more effective depth bounds for coding unit, reducing and perform rate-distortion optimization（Rate-distortion
Optimization, RDO）Coding unit number so that ensure coding efficiency on the premise of, more effectively reduce frame in compile
The complexity of code process, improves coding rate.
A kind of HEVC intraframe codings system 10 based on spatial coherence provided by the present invention will be carried out in detail below
Explanation.
Referring to Fig. 5, showing in an embodiment of the present invention the HEVC intraframe codings system 10 based on spatial coherence
Structural representation.In the present embodiment, the HEVC intraframe codings system 10 based on spatial coherence includes selecting module
101st, range determination module 102 and coding prediction module 103.
Selecting module 101, for the depth and size according to current coded unit, is selected in the current coded unit
Space is adjacent and with an equal amount of adjacent encoder unit, and asks for the depth bounds [a of the adjacent encoder unit0,
a1]。
In the present embodiment, a is remembered0Represent that the space of the current coded unit is adjacent and with an equal amount of phase
The lower limit of adjacent coding unit CU depth bounds unions, a1Representation space is adjacent and with an equal amount of adjacent encoder unit CU
The upper limit of depth bounds union.
In the present embodiment, coding unit（Coding Unit, CU）It is the elementary cell of coding, similar to a new generation
The concept of video encoding standard H.264/AVC middle macro block, it is the code tree unit using quad-tree structure recursive subdivision
（Coding Tree Unit, CTU) leaf node.In sequence parameter set（Sequence Parameter Set, SPS）In can
To provide code tree unit CTU maximum coding unit（Largest Coding Unit, LCU）Size and maximum segmentation are deep
Degree.
In the present embodiment, code tree unit CTU determines whether coding unit CU needs to continue to divide using segmentation mark
Cut, when needing segmentation, coding unit CU is segmented into four size identical next stage CU.Predicting unit PU (Prediction
Unit) be prediction elementary cell, it determines that coding unit CU is predicted using which kind of segmentation type, and its root node is in coding
CU layers of unit.The segmentation type of intra prediction mode have do not split with quartering two types, only when coding unit CU recurrence
The Fractionation regimen of the quartering is just performed when segmentation reaches minimum dimension.Converter unit TU (Transform Unit) is real transform
Elementary cell, root node is also in CU layers of coding unit.Converter unit TU processing also uses quad-tree structure, and its quaternary tree claims
For residual error quaternary tree (Residual Quadtree, RQT).It can specify that residual error quaternary tree RQT's in sequence parameter set SPS
Maximum transform block (Transform Block, TB) size and maximum segmentation depth.Transform block TB is substantially all using discrete remaining
String converts (Discrete Cosine Transform, DCT), but if transform block TB sizes are 4 × 4 and are infra-frame predictions
When selection discrete sine transform (Discrete Sine Transform, DST).
Range determination module 102, for the complexity according to the current coded unit and the adjacent encoder unit
The position of relation and the current coded unit between complexity, determines the depth model of the current coded unit
Enclose.
In the present embodiment, range determination module 102 specifically for：
If the current coded unit belongs to the coding unit at the top or leftmost edge, it is determined that the current volume
The original depth bounds of code unit is [0,3]；
Or, if the complexity of the current coded unit is more than the maximum of the complexity of the adjacent encoder unit,
The depth bounds for then determining the current coded unit is [a0, min (a1+ N, 3)], N ∈ [0,3]；
Or, if the complexity of the current coded unit is less than the minimum value of the complexity of the adjacent encoder unit,
The depth bounds for then determining the current coded unit is [max (0, a0- N), a1], N ∈ [0,3]；
Or, if the complexity of the current coded unit is between the complexity of the adjacent encoder unit, really
The depth bounds of the fixed current coded unit is [a0, a1]。
Prediction module 103 is encoded, current coded unit is encoded for the depth bounds according to current coded unit,
And the depth of current coded unit, the coding of end current coded unit are used as according to the depth of prediction cost selection Least-cost
And it is transferred to next coding unit.
In the present embodiment, coding prediction module 103 specifically includes the first judging submodule 1031, second judges submodule
Block 1032, end segmentation submodule 1033, the 3rd judging submodule 1034, implementation sub-module 1035 and depth increase submodule
1036, as shown in Figure 6.
Referring to Fig. 6, illustrating for the internal structure of the coding prediction module 103 shown in Fig. 5 in an embodiment of the present invention
Figure.
First judging submodule 1031, for judging the depth of the current coded unit whether described in have determined
Within the depth bounds of current coded unit.
Second judging submodule 1032, if the depth for the current coded unit is described current not what is had determined
Within the depth bounds of coding unit, then judge whether the depth of the current coded unit is more than or equal to what is had determined
The upper limit of the depth bounds of the current coded unit.
Implementation sub-module 1035, if the depth for the current coded unit is in the present encoding list having determined
Within the depth bounds of member, then intra-prediction process is performed, and calculate optimum prediction mode correspondence cost, selection Least-cost
Pattern is optimal mode.In the present embodiment, it is specific to perform intra-prediction process and calculate optimum prediction mode correspondence
Described in the method and step step S136 described above of cost, narration is not repeated herein, refer to foregoing step S136 and
Corresponding Fig. 2 and Fig. 3.
Terminate segmentation submodule 1033, if the depth for the current coded unit is more than or equal to what is had determined
The upper limit of the depth bounds of the current coded unit, then terminate the cutting procedure of the current coded unit.
Depth increases submodule 1036, if the depth for the current coded unit is described current less than what is had determined
The upper limit of the depth bounds of coding unit, then add 1 by the depth of the current coded unit.In the present embodiment, by institute
State current coded unit depth plus 1 after, selecting module 101 is additionally operable to continue according to the depth of current coded unit and big
It is small, select the space in the current coded unit adjacent and with an equal amount of adjacent encoder unit, and ask for described
Depth bounds [a of adjacent encoder unit0, a1]。
3rd judging submodule 1034, for judging whether the current coded unit is to be treated after trimming in code tree unit
Last coding unit of search.
Wherein, it is described to terminate segmentation submodule 1033, if it is code tree list after trimming to be additionally operable to the current coded unit
Last coding unit to be searched in member, then terminate the recursive subdivision process of present encoding tree unit, completes present encoding
Set the coding of the corresponding coding unit of unit.
In the present embodiment, selecting module 101, if it is not code tree list after trimming to be additionally operable to the current coded unit
Last coding unit to be searched in member, then be transferred to next coding unit, and next coding unit is defined as
Current coded unit.
Per frame figure in a kind of HEVC intraframe codings system 10 based on spatial coherence provided by the present invention, video sequence
The intraframe coding process of picture is by code tree unit（Coding Tree Unit, CTU）Processing, and code tree unit passes through depth
The preferential recursive fashion of degree travels through coding units all in the code tree unit（Coding Unit, CU）, the present invention is according to regarding
Frequency sequence spatial coherence, the depth bounds of coding unit is accurately determined using recursive fashion, and coded video is not being caused substantially
The scope of traversal code tree unit searches is reduced on the premise of frequency Quality Down, the complexity of intraframe coding process is significantly reduced
Degree.The technical scheme provided using the present invention is encoded by the predicting coding information current coded unit of space adjacent encoder unit
Depth, building more effective depth bounds for coding unit, reducing and perform rate-distortion optimization（Rate-distortion
Optimization, RDO）Coding unit number so that ensure coding efficiency on the premise of, more effectively reduce frame in compile
The complexity of code process, improves coding rate.
The technical scheme that the present invention is provided has the advantages that to improve coding rate relative to prior art, for example, with reference to text
Offer [4]（X.Li,J.An,X.Guo,S.Lei,“Adaptive CU Depth Range,”JCTVC-E090,JCTVC of
ISO/IEC and ITU-T,Geneva,Switzerland,Apr.2011.）Middle proposition one is adaptive to should determine that coding unit CU
The algorithm reduction encoder complexity of depth bounds.Although the method for above-mentioned bibliography [4] can remove volume to a certain extent
Redundancy present in code process, but this method only simply quickly determines that coding is single using spatial coherence or temporal correlation
First CU depth bounds, does not account for but and coding unit CU and space-time adjacent encoder unit CU is also frequently present in a two field picture
The not strong situation of correlation, this will result in coding unit CU depth bounds forecasting inaccuracy really, causes different degrees of coding
Efficiency is reduced.
The problem of for failing fully to reduce intraframe coding process complexity present in prior art, the present invention utilizes phase
Adjacent encoded coding unit CU depth bounds, and current coded unit CU complexity and adjacent encoded coding list
The relation Accurate Prediction current coded unit CU of first CU complexities depth bounds, in the case where ensureing encoded video quality substantially not
On the premise of drop, unwanted depth is skipped, so as to substantially reduce answering for efficient video coding standard HEVC intraframe coding processes
Miscellaneous degree.It may be noted that coding unit CU complexity is using absolute difference and to weigh in the present invention.
Contrast experiment's scheme include original high efficiency video encoding standard HEVC encoding platform schemes, bibliography [4] it is fast
The method of fast intraframe coding scheme and the present invention.Coding experiments result shows：For in compression efficiency, the inventive method is in phase
With under code check, 0.03dB is averagely dropped to relative to original high efficiency video encoding standard HEVC encoding platform spike signal to noise ratio, can
To ignore, comparing result is as shown in figs. 7 a and 7b.
Fig. 7 a and Fig. 7 b are referred to, is the contrast test figure of three kinds of coding methods.Specific three kinds of coding methods include：This
Inventive method, original high efficiency video encoding standard HEVC encoding platforms and bibliography [4] method in full frame efficient class and
The lower partial sequence distortion performance comparison diagram of two kinds of configurations of main file time in full frame.
Intraframe coding process speed improves 27.99% to 67.08% under efficient class configuration in full frame（Average 40.16%）,
Compared to existing method bibliography [4] complexity reduction by 21.13%；Compared to original high efficiency video encoding standard HEVC volume
Code platform, intraframe coding process speed improves 28.03% to 63.89% under main file time configuration in full frame（Average 39.41%）, phase
Than further reducing by 20.73% in existing method bibliography [4] complexity.In addition, solid present invention mainly solves coding unit CU
The problem of fixed depth bounds has bulk redundancy, frame in fast method that can be traditional with other is combined, and further reduces frame
Interior coding complexity.
In the present embodiment, three kinds of coding method Experimental results shows are in table 1 below, final to use average peak noise
Time-Saving (TS) is saved than incrementss BD-PSNR (dB), the incrementss BD-BitRate (%) of mean bit rate, time
(%) evaluates the performance for proposing algorithm.
Table 1
Wherein, the time saves TS definition as shown by the following formula：
Wherein, THM8.0(QPi) represent to work as QP=QPiWhen encoding platform HM8.0 coding total time；Tpropoed(QPi) represent
As QP=QPiWhen propose method coding total time.
In embodiments of the present invention, the intraframe coding in the technical scheme that the present invention is provided, video sequence per two field picture
Journey is by code tree unit（Coding Tree Unit, CTU）Processing, and the recurrence side that code tree unit passes through depth-first
Formula travels through coding units all in the code tree unit（Coding Unit, CU）, the present invention is according to video sequence space correlation
Property, the depth bounds of coding unit is accurately determined using recursive fashion, before encoded video Quality Down is not caused substantially
The scope for reducing traversal code tree unit searches is put, the complexity of intraframe coding process is significantly reduced.Use the present invention
The depth that the technical scheme of offer is encoded by the predicting coding information current coded unit of space adjacent encoder unit, to compile
The code more effective depth bounds of cell formation, reduces and performs rate-distortion optimization（Rate-distortion Optimization,
RDO）Coding unit number so that ensure coding efficiency on the premise of, more effectively reduce intraframe coding process complexity
Degree, improves coding rate.
It is worth noting that, in above-described embodiment, included unit is simply divided according to function logic,
But above-mentioned division is not limited to, as long as corresponding function can be realized；In addition, the specific name of each functional unit
Only to facilitate mutually distinguishing, the protection domain being not intended to limit the invention.
In addition, one of ordinary skill in the art will appreciate that realizing all or part of step in the various embodiments described above method
It can be by program to instruct the hardware of correlation to complete, corresponding program can be stored in embodied on computer readable storage Jie
In matter, described storage medium, such as ROM/RAM, disk or CD.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention
Any modifications, equivalent substitutions and improvements made within refreshing and principle etc., should be included in the scope of the protection.
Claims (10)
1. a kind of HEVC inner frame coding methods based on spatial coherence, it is characterised in that methods described includes：
According to the depth and size of current coded unit, select the space in the current coded unit adjacent and with same
The adjacent encoder unit of size, and ask for the depth bounds [a of the adjacent encoder unit0, a1]；
According to the relation between the complexity of the current coded unit and the complexity of the adjacent encoder unit and described
The position of current coded unit, determines the depth bounds of the current coded unit；
Current coded unit is encoded according to the depth bounds of current coded unit, and according to prediction cost selection cost most
Small depth terminates the coding of current coded unit and is transferred to next coding unit as the depth of current coded unit.
2. the HEVC inner frame coding methods as claimed in claim 1 based on spatial coherence, it is characterised in that the basis is worked as
The depth bounds of preceding coding unit is encoded to current coded unit, and is made according to the depth of prediction cost selection Least-cost
For the depth of current coded unit, terminate the coding of current coded unit and include the step of being transferred to next coding unit：
Judge the depth of the current coded unit whether within the depth bounds for the current coded unit having determined；
If the depth of the current coded unit within the depth bounds for the current coded unit having determined, is not sentenced
Whether the depth of the disconnected current coded unit is more than or equal to the depth bounds for the current coded unit having determined
The upper limit；
If the depth of the current coded unit is more than or equal to the depth bounds for the current coded unit having determined
The upper limit, then terminate the cutting procedure of the current coded unit；
Whether judge the current coded unit is last coding unit to be searched in code tree unit after trimming；
If the current coded unit is last coding unit to be searched in code tree unit after trimming, terminate current
The recursive subdivision process of code tree unit, completes the coding of the corresponding coding unit of present encoding tree unit.
3. the HEVC inner frame coding methods as claimed in claim 2 based on spatial coherence, it is characterised in that judge described
The step of whether depth of the current coded unit within the depth bounds for the current coded unit having determined it
Afterwards, methods described also includes：
If the depth of the current coded unit is performed within the depth bounds for the current coded unit having determined
Intra-prediction process, and optimum prediction mode correspondence cost is calculated, the pattern of selection Least-cost is optimal mode.
4. the HEVC inner frame coding methods as claimed in claim 3 based on spatial coherence, it is characterised in that described according to institute
State the relation and the present encoding list between the complexity of current coded unit and the complexity of the adjacent encoder unit
The step of position of member, depth bounds for determining the current coded unit, specifically includes：
If the current coded unit belongs to the coding unit at the top or leftmost edge, it is determined that the present encoding list
The original depth bounds of member is [0,3]；
Or, if the complexity of the current coded unit is more than the maximum of the complexity of the adjacent encoder unit, really
The depth bounds of the fixed current coded unit is [a0, min (a1+ N, 3)], N ∈ [0,3]；
Or, if the complexity of the current coded unit is less than the minimum value of the complexity of the adjacent encoder unit, really
The depth bounds of the fixed current coded unit is [max (0, a0- N), a1], N ∈ [0,3]；
Or, if the complexity of the current coded unit is between the complexity of the adjacent encoder unit, it is determined that institute
The depth bounds for stating current coded unit is [a0, a1]。
5. the HEVC inner frame coding methods as claimed in claim 1 based on spatial coherence, it is characterised in that the basis is worked as
The depth and size of preceding coding unit, select the space in the current coded unit adjacent and with an equal amount of adjacent
Coding unit, and ask for the depth bounds [a of the adjacent encoder unit0, a1] the step of include：
According to the depth and size of current coded unit, selection is adjacent with top and have in the left of the current coded unit
Have an an equal amount of adjacent encoder unit, and by calculate the union of left and the depth bounds of top adjacent encoder unit come
To the depth bounds [a of the adjacent encoder unit0, a1]。
6. a kind of HEVC intraframe coding systems based on spatial coherence, it is characterised in that the system includes：
Selecting module, for the depth and size according to current coded unit, selects the space phase in the current coded unit
It is adjacent and with an equal amount of adjacent encoder unit, and ask for the depth bounds [a of the adjacent encoder unit0, a1]；
Range determination module, for the complexity according to the current coded unit and the adjacent encoder unit complexity it
Between relation and the current coded unit position, determine the depth bounds of the current coded unit；
Prediction module is encoded, current coded unit is encoded for the depth bounds according to current coded unit, and according to
Predict that the depth of cost selection Least-cost, as the depth of current coded unit, terminates the coding of current coded unit and is transferred to
Next coding unit.
7. the HEVC intraframe coding systems as claimed in claim 6 based on spatial coherence, it is characterised in that the coding is pre-
Surveying module includes：
First judging submodule, for judging the depth of the current coded unit whether in the present encoding having determined
Within the depth bounds of unit；
Second judging submodule, if the depth for the current coded unit is not in the current coded unit having determined
Depth bounds within, then judge whether the depth of the current coded unit is more than or equal to have determined described current
The upper limit of the depth bounds of coding unit；
Terminate segmentation submodule, if the depth for the current coded unit is described current more than or equal to what is had determined
The upper limit of the depth bounds of coding unit, then terminate the cutting procedure of the current coded unit；
3rd judging submodule, for judge the current coded unit whether be after trimming in code tree unit it is to be searched most
Latter coding unit；
Wherein, it is described to terminate segmentation submodule, if it is to wait to search in code tree unit after trimming to be additionally operable to the current coded unit
Last coding unit of rope, then terminate the recursive subdivision process of present encoding tree unit, completes present encoding tree unit pair
The coding for the coding unit answered.
8. the HEVC intraframe coding systems as claimed in claim 7 based on spatial coherence, it is characterised in that the coding is pre-
Surveying module also includes：
Implementation sub-module, if for the current coded unit depth the current coded unit having determined depth
Within the scope of, then intra-prediction process is performed, and optimum prediction mode correspondence cost is calculated, the pattern of selection Least-cost is most
Good pattern.
9. the HEVC intraframe coding systems as claimed in claim 8 based on spatial coherence, it is characterised in that the scope is true
Cover half block, specifically for：
If the current coded unit belongs to the coding unit at the top or leftmost edge, it is determined that the present encoding list
The original depth bounds of member is [0,3]；
Or, if the complexity of the current coded unit is more than the maximum of the complexity of the adjacent encoder unit, really
The depth bounds of the fixed current coded unit is [a0, min (a1+ N, 3)], N ∈ [0,3]；
Or, if the complexity of the current coded unit is less than the minimum value of the complexity of the adjacent encoder unit, really
The depth bounds of the fixed current coded unit is [max (0, a0- N), a1], N ∈ [0,3]；
Or, if the complexity of the current coded unit is between the complexity of the adjacent encoder unit, it is determined that institute
The depth bounds for stating current coded unit is [a0, a1]。
10. the HEVC intraframe coding systems as claimed in claim 6 based on spatial coherence, it is characterised in that the selection
Module specifically for：According to the depth and size of current coded unit, select in the left and top of the current coded unit
It is adjacent and with an equal amount of adjacent encoder unit, and by calculating the depth bounds of left and top adjacent encoder unit
Union obtain the depth bounds [a0, a1] of the adjacent encoder unit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310655153.5A CN104702958B (en) | 2013-12-05 | 2013-12-05 | A kind of HEVC inner frame coding methods and system based on spatial coherence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310655153.5A CN104702958B (en) | 2013-12-05 | 2013-12-05 | A kind of HEVC inner frame coding methods and system based on spatial coherence |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104702958A CN104702958A (en) | 2015-06-10 |
| CN104702958B true CN104702958B (en) | 2017-09-15 |
Family
ID=53349670
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310655153.5A Active CN104702958B (en) | 2013-12-05 | 2013-12-05 | A kind of HEVC inner frame coding methods and system based on spatial coherence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104702958B (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105915925A (en) * | 2015-07-24 | 2016-08-31 | 乐视云计算有限公司 | Coding unit construction method based on HEVC and coding unit construction device thereof |
| CN105141954B (en) * | 2015-08-19 | 2018-03-13 | 浙江工业大学 | A kind of HEVC interframe encodes fast schema selection method |
| CN105376571A (en) * | 2015-11-06 | 2016-03-02 | 山东交通学院 | HEVC reconstruction video scintillation inhibition method based on R-lambda code rate control model |
| CN107306353B (en) * | 2016-04-19 | 2020-05-01 | 广州市动景计算机科技有限公司 | Image space prediction mode selection method and device, and image compression method and device |
| CN106210721B (en) * | 2016-07-05 | 2017-11-21 | 中南大学 | A kind of quick code check code-transferring methods of HEVC |
| CN107087172B (en) * | 2017-03-22 | 2018-08-07 | 中南大学 | Quick code check code-transferring method based on HEVC-SCC and its system |
| CN107071497B (en) * | 2017-05-21 | 2020-01-17 | 北京工业大学 | Low-complexity video coding method based on space-time correlation |
| CN109151477B (en) * | 2017-06-28 | 2020-08-07 | 华为技术有限公司 | Image data encoding and decoding methods and devices |
| CN109510997B (en) * | 2017-09-15 | 2022-09-23 | 华为技术有限公司 | Image encoding method and apparatus |
| CN109168000B (en) * | 2018-10-09 | 2021-02-12 | 北京佳讯飞鸿电气股份有限公司 | HEVC intra-frame prediction rapid algorithm based on RC prediction |
| CN109618152B (en) * | 2018-12-14 | 2020-09-08 | 北京数码视讯软件技术发展有限公司 | Depth division coding method and device and electronic equipment |
| CN111031303B (en) * | 2019-11-21 | 2021-01-26 | 郑州轻工业大学 | 3D-HEVC (high efficiency video coding) rapid depth coding method based on Bayesian decision theorem |
| CN112383774B (en) * | 2020-10-30 | 2023-10-03 | 网宿科技股份有限公司 | Encoding method, encoder and server |
| CN113242429B (en) * | 2021-05-11 | 2023-12-05 | 杭州网易智企科技有限公司 | Video coding mode decision method, device, equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103281541A (en) * | 2013-05-10 | 2013-09-04 | 北方工业大学 | Wedge-shaped block intra-frame prediction method based on depth images |
| CN103442228A (en) * | 2013-08-19 | 2013-12-11 | 四川大学 | Quick frame inner transcoding method from H.264/AVC standard to HEVC standard and transcoder thereof |
-
2013
- 2013-12-05 CN CN201310655153.5A patent/CN104702958B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103281541A (en) * | 2013-05-10 | 2013-09-04 | 北方工业大学 | Wedge-shaped block intra-frame prediction method based on depth images |
| CN103442228A (en) * | 2013-08-19 | 2013-12-11 | 四川大学 | Quick frame inner transcoding method from H.264/AVC standard to HEVC standard and transcoder thereof |
Non-Patent Citations (1)
| Title |
|---|
| Adaptive CU Depth Range;Xiang Li;《Joint Collaborative Team on Video Coding (JCT-VC)》;20110323;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104702958A (en) | 2015-06-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104702958B (en) | A kind of HEVC inner frame coding methods and system based on spatial coherence | |
| US9749653B2 (en) | Motion vector encoding/decoding method and device and image encoding/decoding method and device using same | |
| RU2693649C1 (en) | Method and device for encoding or decoding an image with prediction of motion information between levels in accordance with a traffic information compression circuit | |
| CN102640492B (en) | The coding unit of image boundary is carried out to the method and apparatus of Code And Decode | |
| CN103098469B (en) | For the method and apparatus that conversion coefficient is carried out entropy code/entropy decoding | |
| CN102857764B (en) | The method and apparatus of intra prediction mode process | |
| CN104754357B (en) | Intraframe coding optimization method and device based on convolutional neural networks | |
| CN104581181B (en) | A kind of inner frame coding method based on alternative mode list optimization | |
| CN104754350A (en) | Method And Apparatus For Encoding Video | |
| CN104780381A (en) | Method and apparatus for decoding video | |
| CN102932642B (en) | Interframe coding quick mode selection method | |
| CN104980739A (en) | Method And Apparatus For Video Encoding Using Deblocking Filtering, And Method And Apparatus For Video Decoding Using The Same | |
| CN105357540A (en) | Method and apparatus for decoding video | |
| CN105681797A (en) | Prediction residual based DVC-HEVC (Distributed Video Coding-High Efficiency Video Coding) video transcoding method | |
| CN103596003B (en) | Interframe predication quick mode selecting method for high-performance video coding | |
| CN106331700A (en) | Coding and decoding methods of reference image, coding device, and decoding device | |
| CN102934445B (en) | Based on the method and apparatus of segmentation to image coding and decoding | |
| CN103702131B (en) | Pattern-preprocessing-based intraframe coding optimization method and system | |
| CN109040756B (en) | HEVC image content complexity-based rapid motion estimation method | |
| CN102984522A (en) | Brightness transformation domain intra-frame prediction coding and decoding method and system | |
| CN109889831A (en) | 360 degree of video intra mode decisions based on CU size | |
| CN111629207B (en) | Template matching intra-frame sub-division method | |
| CN116320417A (en) | Video coding method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |