CN103533355B - A kind of HEVC fast encoding method - Google Patents
A kind of HEVC fast encoding method Download PDFInfo
- Publication number
- CN103533355B CN103533355B CN201310470508.3A CN201310470508A CN103533355B CN 103533355 B CN103533355 B CN 103533355B CN 201310470508 A CN201310470508 A CN 201310470508A CN 103533355 B CN103533355 B CN 103533355B
- Authority
- CN
- China
- Prior art keywords
- coding unit
- maximum coding
- current
- unit
- value
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 85
- 238000005520 cutting process Methods 0.000 claims abstract description 32
- 101100328883 Arabidopsis thaliana COL1 gene Proteins 0.000 claims description 36
- 101100328886 Caenorhabditis elegans col-2 gene Proteins 0.000 claims description 35
- 238000012360 testing method Methods 0.000 description 28
- 238000010586 diagram Methods 0.000 description 7
- 238000005192 partition Methods 0.000 description 4
- 230000011218 segmentation Effects 0.000 description 4
- 238000013139 quantization Methods 0.000 description 3
- 241000219357 Cactaceae Species 0.000 description 2
- 230000006835 compression Effects 0.000 description 2
- 238000007906 compression Methods 0.000 description 2
- 230000007423 decrease Effects 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 238000002059 diagnostic imaging Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000003384 imaging method Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention discloses a kind of HEVC fast encoding method, it carries out quad-tree structure type analysis by coding unit maximum to prediction, quick obtaining represents the types value that the extreme saturation of current maximum coding unit is interval, obtain during such offset due to current maximum coding unit and adjacent encoded maximum coding unit and forward reference frame and after there is the biggest dependency between coordinate position is identical in reference frame maximum coding unit, the types value in the extreme saturation interval of current maximum coding unit is obtained hence with the types value that the extreme saturation of the maximum coding unit of prediction is interval, thus avoid many unnecessary extreme saturation in current maximum coding unit cutting procedure, on the premise of guarantee video quality and code check are constant, significantly reduce the computation complexity of coding.
Description
Technical field
The present invention relates to a kind of video coding and decoding technology, especially relate to a kind of HEVC fast encoding method.
Background technology
Along with network technology and the development of terminal processing capacity, people are more and more higher to the requirement of video compress, with
Meet the application of the frontiers such as long-range monitoring, mobile flow medium, mobile imaging, medical imaging.Video coding joint specialist group
(Joint Collaborative Team on Video Coding, JCT-VC) is just devoted to study a new generation's efficient video and compiles
Code standard (High Efficiency Video Coding, HEVC), its core objective is at H.264/AVC high
On the basis of profile, compression efficiency is doubled.Owing to HEVC have employed oversize quaternary tree knot on coding structure
The coding unit (Coding Unit, CU) of structure, predicting unit (Prediction Unit, PU) and converter unit (Transform
Unit, TU), therefore considerably improve compression efficiency, but also bring the increase of encoder complexity simultaneously.
HEVC test model (HEVC Test Model, HM) uses the mode of recurrence to maximum coding unit (Largest
CU, LCU) carry out quad-tree structure division.As it is shown in figure 1, LCU finally splits the determination of form in HM, employing is needed to pass
The mode returned carries out the full traversal of 0 to 3 to CU depth value (depth), altogether needs 1+4+4 × 4+4 × 4 × 4=85 CU size
The rate-distortion optimization (Rate-distortion Optimization, RDO) selected calculates, and adds each CU and is also performed to respectively
The rate distortion costs planting PU prediction and model selection calculates, and this makes encoding computational complexity the biggest.Li et al. proposes one
Planting self adaptation CU extreme saturation (Adaptive CU Depth Range, ACUDR) method, it is mainly come by spatial correlation
Predicting the CU depth value of current LCU, and most LCU is also intended to travel through more than 3 CU depth values, therefore the method is saved
Time is fairly limited.Shen et al. uses the mode of time-space domain associated prediction, by the CU depth value weighting side of adjacent LCU
Formula predicts the CU depth value of current LCU, so that it is determined that its corresponding extreme saturation is interval, although this method largely subtracts
Lacked traversal scope, but and do not take into account the diversity of video content and sequence thereof, cause predicting the extreme saturation district obtained
Between yet suffer from sizable improving space.
Summary of the invention
The technical problem to be solved is to provide a kind of on the premise of ensureing video quality, it is possible to effectively drop
The HEVC fast encoding method of low encoder complexity.
The present invention solves the technical scheme that above-mentioned technical problem used: a kind of HEVC fast encoding method, its feature
It is to comprise the following steps:
1. it is present frame by frame definition currently pending in HD video；
2. maximum coding unit the most to be encoded in present frame is defined as current maximum coding unit；
3. according to present frame position in HD video and current maximum coding unit position in the current frame, determine
The maximum coding unit of all predictions of current maximum coding unit, by by all prediction maximum codings of current maximum coding unit
The set that unit is constituted is defined as the prediction sets of current maximum coding unit, and is designated as Ω, and wherein, Ω is institute in empty set or Ω
The maximum coding unit comprised is at least one in L, LT, T, COL1 and COL2, and COL1 represents the forward reference frame of present frame
In the maximum coding unit identical with the coordinate position of current maximum coding unit, COL2 represents in the backward reference frame of present frame
The maximum coding unit identical with the coordinate position of current maximum coding unit, L represents the left side phase of current maximum coding unit
Adjacent maximum coding unit, LT represents the adjacent maximum coding unit in the limit, upper left of the most maximum coding unit, and T represents current maximum volume
The adjacent maximum coding unit in top of code unit；
4. DR is madepredRepresent the types value that the extreme saturation of current maximum coding unit is interval, then establish DRpredWith work as
The one-to-one relationship in the extreme saturation interval of front maximum coding unit, wherein, DRpredFor integer, and 0≤DRpred≤5；
5. judge whether Ω is equal to complete or collected works U={COL1, COL2, L, LT, T}, if it is, perform step 6., otherwise, directly
Connect and determine DRpredValue, then perform step 7.；
6. each maximum coding unit in Ω is carried out quad-tree structure type analysis, determine each maximum volume in Ω
The types value in the extreme saturation interval of code unit, then according to the class that the extreme saturation of each maximum coding unit in Ω is interval
Offset, obtains DRpredValue, then perform step 7.；
7. according to DRpredValue, determine that the extreme saturation of current maximum coding unit is interval, then maximum compile according to current
The extreme saturation of code unit is interval carries out traversal coding to current maximum coding unit, in traversal cataloged procedure, to
Big coding unit carries out coding unit cutting in early days, and detailed process is:
7.-1, currently pending coding unit in the extreme saturation interval of current maximum coding unit is defined as currently
Coding unit, is defined as current layer by the layer at current coded unit place；
7.-2, according to depth value and the current coded unit position in current layer of current coded unit, it is determined that current
Whether next layer of all coding unit of coding unit can carry out cutting in early days, and detailed process is:
If the depth value of current coded unit is 0, then judge next layer to current coded unit all coding unit
Do not carry out in early days cutting, then perform step 7.-4；
If the depth value of current coded unit is 1 or 2, then the 1st or the 2nd in current coded unit is current layer
During individual or the 3rd coding unit, it is determined that next layer of all coding unit of current coded unit are not carried out cutting in early days, then
Perform step 7.-4；And when the 4th coding unit during current coded unit is current layer, it is judged that current coded unit deep
The maximum that angle value is the most interval less than the extreme saturation of current maximum coding unit, if it is, judge current coded unit
Next layer of all coding unit can carry out in early days cutting, then perform step 7.-3, otherwise, do not deal with, then perform
Step 7.-5；
If the depth value of current coded unit is 3, do not deal with, then perform step 7.-5；
7.-3, the rate distortion costs of the last layer coding unit of current coded unit is compared, with four volumes in current layer
The rate distortion costs sum of code unit is plus the value obtained after the decision threshold set, if the former is less than the latter, it is determined that right
Next layer of coding unit of current coded unit carries out cutting in early days, then performs step 7.-5, if the former is more than or equal to
The latter, it is determined that next layer of coding unit of current coded unit does not carry out cutting in early days, then performs step 7.-4；
7.-4, judge that the depth value of current coded unit is the most interval less than the extreme saturation of current maximum coding unit
Maximum, if it is, current coded unit is divided further into 4 next layer of identical coding units of size, then will
Coding unit currently pending in this next layer of coding unit is as current coded unit, and by current coded unit place
Layer, as current layer, returns again to step and 7.-2 continues executing with, otherwise, and directly execution step 7.-5；
-5 7., current coded unit cataloged procedure terminate, then judge that the extreme saturation of current maximum coding unit is interval
Interior all coding units are the most all disposed, if it is, current maximum coding unit cataloged procedure terminates, then perform
8. step, otherwise, then judges that four coding units in current layer are the most all disposed, if four codings in current layer
Unit is all disposed, then using pending coding unit next in the last layer coding unit of current layer as present encoding
Unit, and using the layer at current coded unit place as current layer, be then back to step and 7.-2 continue executing with, if in current layer
Four coding units untreated complete, then using pending coding unit next in current layer as current coded unit,
It is then back to step 7.-2 continue executing with；
8. using maximum coding unit to be encoded next in present frame as current maximum coding unit, it is then back to step
Suddenly 3. continue executing with, until all maximum coding unit in present frame all encodes complete；
9. using frame pending for next frame in HD video as present frame, it is then back to step and 2. continues executing with, until
All frames in HD video are all disposed, and so far complete the fast coding of HD video.
Described step 3. in the determination process of prediction sets Ω of current maximum coding unit be:
If present frame is the 1st frame in the I group of picture in HD video, then it is current when current maximum coding unit
During the 1st maximum coding unit in frame, Ω is empty set；When the 1st row that current maximum coding unit is present frame remove the 1st
During the maximum coding unit of remaining outside maximum coding unit, Ω={ T}；When in the 1st row that current maximum coding unit is present frame
During the maximum coding unit of remaining in addition to the 1st maximum coding unit, Ω={ L}；When current maximum coding unit is in present frame
During remaining maximum coding unit in addition to the 1st row and the 1st row, Ω={ L, LT, T}；
If present frame is the 1st frame in the non-I group of picture in HD video or last 1 frame, then when current maximum
When coding unit is the 1st maximum coding unit in present frame, Ω={ COL1, COL2}；When current maximum coding unit is for working as
In 1st row of front frame during remaining the maximum coding unit in addition to the 1st maximum coding unit, Ω={ COL1, COL2, T}；When working as
Front maximum coding unit be present frame the 1st row in remaining maximum coding unit in addition to the 1st maximum coding unit time, Ω=
{COL1,COL2,L}；When current maximum coding unit is the maximum coding unit of remaining in addition to the 1st row and the 1st row in present frame
Time, Ω={ COL1, COL2, L, LT, T}；
If present frame is any frame in the 2nd frame to the 7th frame in the non-I group of picture in HD video, then when working as
When front maximum coding unit is the 1st maximum coding unit in present frame, Ω={ COL1, COL2}；When current maximum coding is single
When unit is remaining the maximum coding unit during the 1st of present frame arranges in addition to the 1st maximum coding unit, Ω=COL1, COL2,
T}；When remaining maximum coding unit in addition to the 1st maximum coding unit in the 1st row that current maximum coding unit is present frame
Time, Ω={ COL1, COL2, L}；Compile when current maximum coding unit is that in present frame, remaining in addition to the 1st row and the 1st row is maximum
During code unit, Ω={ COL1, COL2, L, LT, T}.
Described step 4. middle DRpredThe one-to-one relationship interval with the extreme saturation of current maximum coding unit is:
Work as DRpredWhen=0, the extreme saturation interval of current maximum coding unit is [0,1]；Work as DRpredWhen=1, current maximum coding unit
Extreme saturation interval be [0,2]；Work as DRpredWhen=2, the extreme saturation interval of current maximum coding unit is [1,2]；When
DRpredWhen=3, the extreme saturation interval of current maximum coding unit is [1,3]；Work as DRpredWhen=4, current maximum coding unit
Extreme saturation interval is [2,3]；Work as DRpredWhen=5, the extreme saturation interval of current maximum coding unit is [0,3].
Described step 5. in the DR that directly determinespredValue be 5；Described step detailed process 6. is:
6. exhausted when given reference depth value is respectively 0,1,2,3 of each maximum coding unit in Ω-1, is calculated
To depth error and, by the jth maximum coding unit in Ω given reference depth value be absolute depth error during d and
It is designated as Wherein, 1≤j≤5, depthiRepresent that the jth maximum in Ω is compiled
The depth value of the basic unit of storage that i-th size is 4 × 4 in code unit, depthiSpan be [0,3], d
Value be 0 or 1 or 2 or 3, symbol " | | " is the symbol that takes absolute value；
6.-2, jth maximum coding unit currently pending in Ω is defined as active cell；
6. order-3, the most from small to large, to active cell when given reference depth value is respectively 0,1,2,3
Absolute depth error and being ranked up, two absolute depth errors that then selective value is minimum and two times as active cell
Option, when after sequence the 2nd and the 3rd absolute depth error with value identical time, then select absolute depth error that d value is little with
One of them candidate item as active cell；
If 6. two candidate item of-4 active cells are respectivelyWithAnd meet
Then determine that the interval types value of the extreme saturation of active cell is 0；If the two of active cell candidate item are respectively
WithAnd meetThen determine that the interval types value of the extreme saturation of active cell is 2；As
Really two candidate item of active cell are respectivelyWithAnd meetThen determine and work as
The types value in the extreme saturation interval of front unit is 3；If the two of active cell candidate item are respectivelyWithAnd meetThen determine that the interval types value of the extreme saturation of active cell is 4；Wherein,The corresponding jth maximum coding unit represented in Ω is deep at given benchmark
Angle value be absolute depth error when 0,1,2,3 and；
-5 6., make j=j+1, using pending maximum coding unit next in Ω as active cell, be then back to step
Suddenly 6.-3 continue executing with, until five maximum coding units in Ω are all disposed, obtain each maximum coding in Ω single
The types value that the extreme saturation of unit is interval, wherein, in j=j+1 "=" it is assignment；
-6 6., a types value candidate list is built, and such offset candidate list is initialized as [1,5,5,5,5,5,
3]；
6.-7, with the types value alternative type value candidate list that the extreme saturation of five maximum coding units in Ω is interval
Five values of centre, obtain new types value candidate list, and order the most from small to large is to new types value candidate
Seven types values in list are ranked up, then take the intermediate value in the types value candidate list after sequence as DRpredValue.
Described step 7. in-3 when the depth value of current coded unit is 1, the decision threshold value set is as 65；When
When the depth value of current coded unit is 2, the decision threshold value set is as 8.
Compared with prior art, it is an advantage of the current invention that: carry out quad-tree structure by coding unit maximum to prediction
Type analysis, quick obtaining represents the types value that the extreme saturation of current maximum coding unit is interval, is obtaining such offset
During due to current maximum coding unit and adjacent encoded maximum coding unit and forward reference frame and backward
Between the maximum coding unit that in reference frame, coordinate position is identical, there is the biggest dependency, single hence with prediction maximum coding
The types value in the extreme saturation interval of unit obtains the types value in the extreme saturation interval of current maximum coding unit, thus keeps away
Exempt from many unnecessary extreme saturation in current maximum coding unit cutting procedure, meanwhile, single at current maximum coding
In the extreme saturation interval of unit, current maximum coding unit is carried out coding unit cutting in early days, decreases coding unit
Unnecessary cutting procedure, finally makes the inventive method on the premise of guarantee video quality and code check are constant, is effectively reduced
The computation complexity of coding.
Accompanying drawing explanation
Fig. 1 is segmentation and the cutting process schematic of a maximum coding unit in HEVC test model；
Fig. 2 be the inventive method totally realize block diagram；
Fig. 3 is the time-space domain dependency diagram of maximum coding unit；
Fig. 4 is the segmentation of a maximum coding unit and early stage cutting process schematic in the inventive method；
Fig. 5 is to utilize the inventive method to enter each cycle tests listed by table 1 compared to utilizing HM9.0 original coding method
The saving of time percentage ratio situation map of row coding；
Traffic cycle tests is encoded respectively by Fig. 6 a for utilizing the inventive method and HM9.0 original coding method
Distortion performance curve comparison figure；
Fig. 6 b is to utilize the inventive method and HM9.0 original coding method to encode Vidyo1 cycle tests respectively
Distortion performance curve comparison figure；
Fig. 6 c is to utilize the inventive method and HM9.0 original coding method to encode Johnny cycle tests respectively
Distortion performance curve comparison figure；
Kimono1 cycle tests is encoded respectively by Fig. 6 d for utilizing the inventive method and HM9.0 original coding method
Distortion performance curve comparison figure；
Fig. 7 a is to utilize HM9.0 original coding method to KristenAndSara cycle tests under conditions of QP=32
10th frame (1280 × 720) encode after Quadtree Partition result schematic diagram；
Fig. 7 b is the 10th frame utilizing the inventive method to KristenAndSara cycle tests under conditions of QP=32
(1280 × 720) encode after Quadtree Partition result schematic diagram.
Detailed description of the invention
Below in conjunction with accompanying drawing embodiment, the present invention is described in further detail.
A kind of HEVC fast encoding method that the present invention proposes, it totally realizes block diagram as in figure 2 it is shown, it includes following step
Rapid:
1. it is present frame by frame definition currently pending in HD video.
In HD video, mainly include two kinds of image sets (GOP, Group of Pictures): I frame (Intra
Frame) image sets and non-I group of picture, I group of picture only comprises 1 frame I two field picture, and non-I group of picture all comprises 8 frame non-I frame
Image, from the beginning of the 1st frame (the 1st I group of picture), there are an I group of picture, i.e. two adjacent I group of pictures in every 32 frames
Tundish contains 4 non-I group of pictures.
2. maximum coding unit the most to be encoded in present frame is defined as current maximum coding unit.
3. according to present frame position in HD video and current maximum coding unit position in the current frame, determine
The maximum coding unit of all predictions of current maximum coding unit, by by all prediction maximum codings of current maximum coding unit
The set that unit is constituted is defined as the prediction sets of current maximum coding unit, and is designated as Ω, and wherein, Ω is institute in empty set or Ω
The maximum coding unit comprised is at least one in L, LT, T, COL1 and COL2, and COL1 represents the forward reference frame of present frame
In the maximum coding unit identical with the coordinate position of current maximum coding unit, COL2 represents in the backward reference frame of present frame
The maximum coding unit identical with the coordinate position of current maximum coding unit, L represents the left side phase of current maximum coding unit
Adjacent maximum coding unit, i.e. L are the maximum coding unit on the left side of the current maximum coding unit of next-door neighbour in present frame, and LT represents and works as
The maximum coding that limit, upper left adjacent maximum coding unit, i.e. LT are the top being close to L in present frame of front maximum coding unit is single
Unit, T represents that the top adjacent maximum coding unit, i.e. T of current maximum coding unit is the current maximum coding of next-door neighbour in present frame
The maximum coding unit of the top of unit.Fig. 3 gives current maximum coding unit C Yu L, the position of LT, T, COL1 and COL2
Relation.
In this particular embodiment, step 3. in the determination process of prediction sets Ω of current maximum coding unit be:
If present frame is the 1st frame in the I group of picture in HD video, then it is current when current maximum coding unit
During the 1st maximum coding unit in frame, Ω is empty set；When the 1st row that current maximum coding unit is present frame remove the 1st
During the maximum coding unit of remaining outside maximum coding unit, Ω={ T}；When in the 1st row that current maximum coding unit is present frame
During the maximum coding unit of remaining in addition to the 1st maximum coding unit, Ω={ L}；When current maximum coding unit is in present frame
During remaining maximum coding unit in addition to the 1st row and the 1st row, Ω={ L, LT, T}.
If present frame is the 1st frame in the non-I group of picture in HD video or last 1 frame, then when current maximum
When coding unit is the 1st maximum coding unit in present frame, Ω={ COL1, COL2}；When current maximum coding unit is for working as
In 1st row of front frame during remaining the maximum coding unit in addition to the 1st maximum coding unit, Ω={ COL1, COL2, T}；When working as
Front maximum coding unit be present frame the 1st row in remaining maximum coding unit in addition to the 1st maximum coding unit time, Ω=
{COL1,COL2,L}；When current maximum coding unit is the maximum coding unit of remaining in addition to the 1st row and the 1st row in present frame
Time, Ω={ COL1, COL2, L, LT, T}.Here, for the present frame in the case of above-mentioned, only exist encoded forward direction reference
, there is not encoded backward reference frame in frame, now COL2 and COL1 is completely the same, therefore still uses COL1 at this.
If present frame is any frame in the 2nd frame to the 7th frame in the non-I group of picture in HD video, then when working as
When front maximum coding unit is the 1st maximum coding unit in present frame, Ω={ COL1, COL2}；When current maximum coding is single
When unit is remaining the maximum coding unit during the 1st of present frame arranges in addition to the 1st maximum coding unit, Ω=COL1, COL2,
T}；When remaining maximum coding unit in addition to the 1st maximum coding unit in the 1st row that current maximum coding unit is present frame
Time, Ω={ COL1, COL2, L}；Compile when current maximum coding unit is that in present frame, remaining in addition to the 1st row and the 1st row is maximum
During code unit, Ω={ COL1, COL2, L, LT, T}.
4. DR is madepredRepresent the types value that the extreme saturation of current maximum coding unit is interval, then establish DRpredWith work as
The one-to-one relationship in the extreme saturation interval of front maximum coding unit, wherein, DRpredFor integer, and 0≤DRpred≤5。
In this particular embodiment, step 4. middle DRpredInterval one by one with the extreme saturation of current maximum coding unit
Corresponding relation is: work as DRpredWhen=0, the extreme saturation interval of current maximum coding unit is [0,1]；Work as DRpredWhen=1, currently
The extreme saturation interval of maximum coding unit is [0,2]；Work as DRpredWhen=2, the extreme saturation of current maximum coding unit is interval
For [1,2]；Work as DRpredWhen=3, the extreme saturation interval of current maximum coding unit is [1,3]；Work as DRpredWhen=4, currently maximum
The extreme saturation interval of coding unit is [2,3]；Work as DRpredWhen=5, the extreme saturation interval of current maximum coding unit be [0,
3]。
5. judge whether Ω is equal to complete or collected works U={COL1, COL2, L, LT, T}, if it is, perform step 6., otherwise, directly
Connect and determine DRpredValue, then perform step 7..
In this particular embodiment, step 5. in the DR that directly determinespredValue be 5.
6. each maximum coding unit in Ω is carried out quad-tree structure type analysis, determine each maximum volume in Ω
The types value in the extreme saturation interval of code unit, then according to the class that the extreme saturation of each maximum coding unit in Ω is interval
Offset, obtains DRpredValue, then perform step 7..Here, owing to video image has certain dependency on time-space domain,
Current maximum coding unit and adjacent encoded maximum coding unit and the forward reference frame of present frame and backward reference frame
Between the maximum coding unit that middle coordinate position is identical, there is the biggest dependency, single hence with each maximum coding in Ω
The types value in the extreme saturation interval of unit obtains DRpredValue.
In this particular embodiment, step detailed process 6. is:
6. exhausted when given reference depth value is respectively 0,1,2,3 of each maximum coding unit in Ω-1, is calculated
To depth error and, by the jth maximum coding unit in Ω given reference depth value be absolute depth error during d and
It is designated as Wherein, 1≤j≤5, depthiRepresent the jth maximum coding in Ω
The depth value of the basic unit of storage that i-th size is 4 × 4 in unit, depthiSpan be [0,3], d's
Value is 0 or 1 or 2 or 3, and symbol " | | " is the symbol that takes absolute value.
6.-2, jth maximum coding unit currently pending in Ω is defined as active cell.
6. order-3, the most from small to large, to active cell when given reference depth value is respectively 0,1,2,3
Absolute depth error and being ranked up, two absolute depth errors that then selective value is minimum and two times as active cell
Option, when after sequence the 2nd and the 3rd absolute depth error with value identical time, then select absolute depth error that d value is little with
One of them candidate item as active cell.
If 6. two candidate item of-4 active cells are respectivelyWithAnd meet
Then determine that the interval types value of the extreme saturation of active cell is 0；If the two of active cell candidate item are respectively
WithAnd meetThen determine that the interval types value of the extreme saturation of active cell is 2；As
Really two candidate item of active cell are respectivelyWithAnd meetThen determine and work as
The types value in the extreme saturation interval of front unit is 3；If the two of active cell candidate item are respectivelyWithAnd meetThen determine that the interval types value of the extreme saturation of active cell is 4；Wherein,The corresponding jth maximum coding unit represented in Ω is deep at given benchmark
Angle value be absolute depth error when 0,1,2,3 and.
-5 6., make j=j+1, using pending maximum coding unit next in Ω as active cell, be then back to step
Suddenly 6.-3 continue executing with, until five maximum coding units in Ω are all disposed, obtain each maximum coding in Ω single
The types value that the extreme saturation of unit is interval, wherein, in j=j+1 "=" it is assignment.
-6 6., a types value candidate list is built, and such offset candidate list is initialized as [1,5,5,5,5,5,
3]。
6.-7, with the types value alternative type value candidate list that the extreme saturation of five maximum coding units in Ω is interval
Five values of centre, obtain new types value candidate list, and order the most from small to large is to new types value candidate
Seven types values in list are ranked up, then take the intermediate value in the types value candidate list after sequence as DRpredValue.
7. according to DRpredValue, determine that the extreme saturation of current maximum coding unit is interval, then maximum compile according to current
The extreme saturation of code unit is interval carries out traversal coding to current maximum coding unit, in traversal cataloged procedure, to
Big coding unit carry out coding unit cutting in early days (itself there is cutting procedure and cutting process in a maximum coding unit, and
The inventive method carries out cutting in early days, it is possible to reduce the further cutting procedure of coding unit, such that it is able to reduce coding complexity
Degree), as shown in Figure 4, detailed process is:
7.-1, currently pending coding unit in the extreme saturation interval of current maximum coding unit is defined as currently
Coding unit, is defined as current layer by the layer at current coded unit place.
-2 7., current coded unit is carried out the predictive coding of various predictive mode, thus obtain current coded unit
Rate distortion costs, then according to depth value and the current coded unit position in current layer of current coded unit, it is determined that when
Whether next layer of all coding unit of front coding unit can carry out cutting in early days, and detailed process is:
If the depth value of current coded unit is 0, then judge next layer to current coded unit all coding unit
Do not carry out in early days cutting, then perform step 7.-4.
If the depth value of current coded unit is 1 or 2, then the 1st or the 2nd in current coded unit is current layer
During individual or the 3rd coding unit, it is determined that next layer of all coding unit of current coded unit are not carried out cutting in early days, then
Perform step 7.-4；And when the 4th coding unit during current coded unit is current layer (CU1,3 and CU1 in such as Fig. 4,
0,3), it is judged that the maximum that the depth value of current coded unit is the most interval less than the extreme saturation of current maximum coding unit,
If it is, judge that next layer of all coding unit of current coded unit can carry out in early days cutting, then perform step 7.-
3, otherwise, do not deal with, then perform step 7.-5.
If the depth value of current coded unit is 3, do not deal with, then perform step 7.-5.
7.-3, the rate distortion costs of the last layer coding unit of current coded unit is compared, with four volumes in current layer
The rate distortion costs sum of code unit is plus the value obtained after the decision threshold set, if the former is less than the latter, then explanation is worked as
The last layer coding unit of front coding unit is divided into four next layer of coding units more excellent than it, and therefore current coded unit does not has
It is necessary to split further, in advance current coded unit can be carried out cutting in early days, determine current coded unit
Next layer of coding unit carries out cutting in early days, then performs step 7.-5, if the former is more than or equal to the latter, it is determined that to working as
Next layer of coding unit of front coding unit does not carry out in early days cutting, then performs step 7.-4.
In this particular embodiment, step 7. in-3 when the depth value of current coded unit is 1, the decision threshold of setting
Value is 65；When the depth value of current coded unit is 2, the decision threshold value set is as 8.Here, the decision threshold set
Value is obtained by great many of experiments.
7.-4, judge that the depth value of current coded unit is the most interval less than the extreme saturation of current maximum coding unit
Maximum, if it is, current coded unit is divided further into 4 next layer of identical coding units of size, then will
Coding unit currently pending in this next layer of coding unit is as current coded unit, and by current coded unit place
Layer, as current layer, returns again to step and 7.-2 continues executing with, otherwise, and directly execution step 7.-5.Here, the coding in current layer
The depth value of unit is that the depth value of next layer of coding unit subtracts 1.
-5 7., current coded unit cataloged procedure terminate, then judge that the extreme saturation of current maximum coding unit is interval
Interior all coding units are the most all disposed, if it is, current maximum coding unit cataloged procedure terminates, then perform
8. step, otherwise, then judges that four coding units in current layer are the most all disposed, if four codings in current layer
Unit is all disposed, then using pending coding unit next in the last layer coding unit of current layer as present encoding
Unit, and using the layer at current coded unit place as current layer, be then back to step and 7.-2 continue executing with, if in current layer
Four coding units untreated complete, then using pending coding unit next in current layer as current coded unit,
It is then back to step 7.-2 continue executing with.Here, cataloged procedure terminates to refer to that current coded unit completes various predictive mode
Selection, will not further be divided into four coding units of next layer or four coding units codings of next layer simultaneously
Process terminates, and current coded unit the most really terminates cataloged procedure.
8. using maximum coding unit to be encoded next in present frame as current maximum coding unit, it is then back to step
Suddenly 3. continue executing with, until all maximum coding unit in present frame all encodes complete.
9. using frame pending for next frame in HD video as present frame, it is then back to step and 2. continues executing with, until
All frames in HD video are all disposed, and so far complete the fast coding of HD video.
Below for the inventive method is tested, so that effectiveness and the feasibility of the inventive method to be described.
The inventive method test is mainly carried out on HEVC test model HM9.0.The hardware configuration of test platform is:
Intel (R) Core (TM) i7-2600CPU, dominant frequency 3.40GHz, internal memory 16.0GB；Operating system is Windows7,64；Open
The instrument of sending out is Microsoft Visual Studio2008.The main code parameter of test model HM9.0 is: high efficiency configures,
Random access mode, coding frame number be 100 frames, quantization parameter QP(Quantization Parameters) be respectively 22,27,
32 and 37, I group of picture GOP(Group of Pictures) a length of 1, a length of the 8 of non-I group of picture, the I frame period
Length IntraPeriod(Period of I-Frame) it is 32.Use BD-PSNR(delta peak
Signal-to-noise rate) and BDBR(Delta bit rate) represent average peak signal to noise ratio PSNR and
The amplitude of variation of code check, Δ T (%) is used for presentation code time percentage change,Wherein,
Tpro、THMIt is respectively the scramble time used by HM9.0 method and the inventive method.
Table 1 gives the cycle tests used by test, and table 2 gives and utilizes the inventive method to each test listed by table 1
Sequence carries out the encoder bit rate behavior pattern of fast coding.Compared with HM9.0 original coding method, the inventive method is visited random
Asking that the pattern lower scramble time decreases 39.60%～47.28%, BDBR merely add about 1.88%, and BD-PSNR only reduces
0.05dB.On the whole, the video quality of the inventive method substantially keep with HM9.0 original coding method consistent in the case of,
Averagely can reduce by the scramble time of 43.76%, significantly reduce encoder complexity.
Fig. 5 gives and utilizes the inventive method compared to utilizing HM9.0 original coding method to respectively testing sequence listed by table 1
Row carry out the saving of time percentage ratio situation encoded.From figure 5 it can be seen that along with the increase of coded quantization parameter QP, coding
Time reduces further, and this is mainly due to quantifying what more rough segmentation block caused the most greatly.Scramble time saves percentage ratio average out to 40%
Above, therefore, encoder complexity reduces obvious.
Fig. 6 a gives and utilizes the inventive method and HM9.0 original coding method to carry out Traffic cycle tests respectively
The distortion performance curve comparison figure of coding, Fig. 6 b gives and utilizes the inventive method and HM9.0 original coding method the most right
Vidyo1 cycle tests carries out the distortion performance curve comparison figure encoded, and Fig. 6 c gives and utilizes the inventive method and HM9.0
The distortion performance curve comparison figure that Johnny cycle tests is encoded by original coding method respectively, Fig. 6 d give utilization
The distortion performance curve pair that Kimono1 cycle tests is encoded by the inventive method and HM9.0 original coding method respectively
Than figure.It can be seen that utilize the distortion performance curve that cycle tests is encoded by the inventive method from Fig. 6 a to Fig. 6 d
Substantially coincident with the distortion performance curve utilizing HM9.0 original coding method that cycle tests is encoded, therefore, two kinds
The video quality of coded method keeps constant.
Fig. 7 a gives and utilizes HM9.0 original coding method, under conditions of QP=32, KristenAndSara is tested sequence
Row the 10th frame encode after Quadtree Partition result schematic diagram, Fig. 7 b gives and utilizes the inventive method QP=32's
Under the conditions of the 10th frame of KristenAndSara cycle tests is encoded after Quadtree Partition result schematic diagram.Fig. 7 a and
In Fig. 7 b white box represent the two do not mate part, it can be seen that white box region is whole from Fig. 7 a and Fig. 7 b
Occupying the minority in image, and the segmentation degree of depth is close, therefore, overall distortion performance keeps relative stability.
Table 1 cycle tests
| Sequence names | Resolution | Frame number | Frame per second | Bit-depth |
| Traffic | 2560×1600 | 150 | 30fps | 8 |
| Kimono1 | 1920×1080 | 240 | 24fps | 8 |
| ParkScene | 1920×1080 | 240 | 24fps | 8 |
| Cactus | 1920×1080 | 500 | 50fps | 8 |
| BQTerrace | 1920×1080 | 600 | 60fps | 8 |
| Johnny | 1280×720 | 600 | 60fps | 8 |
| KristenAndSara | 1280×720 | 600 | 60fps | 8 |
| Vidyo1 | 1280×720 | 600 | 60fps | 8 |
Table 2 utilizes the inventive method that each cycle tests listed by table 1 is carried out the encoder bit rate performance of fast coding
| Cycle tests | BDBR/% | BD-PSNR/dB | ΔT/% |
| Traffic | 2.39 | -0.08 | -43.99 |
| Kimono1 | 0.95 | -0.03 | -45.50 |
| ParkScene | 2.10 | -0.06 | -39.60 |
| Cactus | 2.07 | -0.04 | -40.56 |
| BQTerrace | 0.86 | -0.02 | -40.92 |
| Johnny | 2.35 | -0.05 | -47.28 |
| KristenAndSara | 2.76 | -0.10 | -46.70 |
| Vidyo1 | 1.55 | -0.05 | -45.51 |
| Averagely | 1.88 | -0.05 | -43.76 |
Claims (4)
1. a HEVC fast encoding method, it is characterised in that comprise the following steps:
1. it is present frame by frame definition currently pending in HD video；
2. maximum coding unit the most to be encoded in present frame is defined as current maximum coding unit；
3. according to present frame position in HD video and current maximum coding unit position in the current frame, determine current
The maximum coding unit of all predictions of maximum coding unit, by by the maximum coding unit of all predictions of current maximum coding unit
The set constituted is defined as the prediction sets of current maximum coding unit, and is designated as Ω, and wherein, Ω is included in empty set or Ω
Maximum coding unit be at least one in L, LT, T, COL1 and COL2, COL1 represent in the forward reference frame of present frame with
The maximum coding unit that the coordinate position of current maximum coding unit is identical, COL2 represent in the backward reference frame of present frame with work as
The maximum coding unit that the coordinate position of front maximum coding unit is identical, L represents that the left side of current maximum coding unit is adjacent
Big coding unit, LT represents the adjacent maximum coding unit in limit, upper left of current maximum coding unit, and T represents that current maximum coding is single
The adjacent maximum coding unit in top of unit；
4. DR is madepredRepresent the types value that the extreme saturation of current maximum coding unit is interval, then establish DRpredWith currently
The one-to-one relationship in the extreme saturation interval of big coding unit, wherein, DRpredFor integer, and 0≤DRpred≤5；
5. judge whether Ω is equal to complete or collected works U={COL1, COL2, L, LT, T}, if it is, perform step 6., otherwise, the most really
Determine DRpredValue be 5, then perform step 7.；
6. each maximum coding unit in Ω is carried out quad-tree structure type analysis, determine that each maximum coding in Ω is single
The types value that the extreme saturation of unit is interval, then according to the type that the extreme saturation of each maximum coding unit in Ω is interval
Value, obtains DRpredValue, then perform step 7.；
Described step detailed process 6. is:
6. the deepest when given reference depth value is respectively 0,1,2,3 of each maximum coding unit in Ω-1, is calculated
Degree error and, be absolute depth error during d by the jth maximum coding unit in Ω in given reference depth value and be designated as Wherein, 1≤j≤5, depthiRepresent that the jth maximum coding in Ω is single
The depth value of the basic unit of storage that i-th size is 4 × 4 in unit, depthiSpan be [0,3], the value of d
Being 0 or 1 or 2 or 3, symbol " | | " is the symbol that takes absolute value；
6.-2, jth maximum coding unit currently pending in Ω is defined as active cell；
6. order-3, the most from small to large, to absolute when given reference depth value is respectively 0,1,2,3 of active cell
Depth error and being ranked up, two absolute depth errors that then selective value is minimum and two candidates as active cell
, when after sequence the 2nd and the 3rd absolute depth error with value identical time, then selection d value is little absolute depth error and work
One of them candidate item for active cell；
If 6. two candidate item of-4 active cells are respectivelyWithAnd meet
Then determine that the interval types value of the extreme saturation of active cell is 0；If the two of active cell candidate item are respectively
WithAnd meetThen determine that the interval types value of the extreme saturation of active cell is 2；As
Really two candidate item of active cell are respectivelyWithAnd meetThen determine current
The types value in the extreme saturation interval of unit is 3；If the two of active cell candidate item are respectivelyWithAnd
MeetThen determine that the interval types value of the extreme saturation of active cell is 4；Wherein,The corresponding jth maximum coding unit represented in Ω is deep at given benchmark
Angle value be absolute depth error when 0,1,2,3 and；
-5 6., make j=j+1, using pending maximum coding unit next in Ω as active cell, be then back to step
6.-3 continue executing with, until five maximum coding units in Ω are all disposed, obtain each maximum coding unit in Ω
The interval types value of extreme saturation, wherein, in j=j+1 "=" be assignment；
-6 6., build a types value candidate list, and such offset candidate list is initialized as [1,5,5,5,5,5,3]；
6.-7, with in the interval types value alternative type value candidate list of the extreme saturation of five maximum coding units in Ω
Between five values, obtain new types value candidate list, order the most from small to large is to new types value candidate list
In seven types values be ranked up, then take the intermediate value in the types value candidate list after sequence as DRpredValue；
7. according to DRpredValue, determine that the extreme saturation of current maximum coding unit is interval, then single according to current maximum coding
The extreme saturation of unit is interval to carry out traveling through coding to current maximum coding unit, in traversal cataloged procedure, to current maximum volume
Code unit carries out coding unit cutting in early days, and detailed process is:
7.-1, currently pending coding unit in the extreme saturation interval of current maximum coding unit is defined as present encoding
Unit, is defined as current layer by the layer at current coded unit place；
7.-2, according to depth value and the current coded unit position in current layer of current coded unit, it is determined that present encoding
Whether next layer of all coding unit of unit can carry out cutting in early days, and detailed process is:
If the depth value of current coded unit is 0, then judge that next layer to current coded unit all coding unit do not enter
Row in early days cutting, then performs step 7.-4；
If the depth value of current coded unit is 1 or 2, then the 1st in current coded unit is current layer or the 2nd or
During the 3rd coding unit, it is determined that next layer of all coding unit of current coded unit are not carried out cutting in early days, then performs
Step 7.-4；And when the 4th coding unit during current coded unit is current layer, it is judged that the depth value of current coded unit
The maximum the most interval less than the extreme saturation of current maximum coding unit, if it is, judge under current coded unit
One layer of all coding unit can carry out cutting in early days, then performs step 7.-3, otherwise, does not deals with, then perform step
⑦-5；
If the depth value of current coded unit is 3, do not deal with, then perform step 7.-5；
-3 7., the rate distortion costs of the last layer coding unit of current coded unit is compared, single with four codings in current layer
The rate distortion costs sum of unit is plus the value obtained after the decision threshold set, if the former is less than the latter, it is determined that to currently
Next layer of coding unit of coding unit carries out cutting in early days, then performs step 7.-5, if the former is more than or equal to the latter,
Then determine that next layer of coding unit to current coded unit does not carry out in early days cutting, then perform step 7.-4；
7. the maximum that the depth value of current coded unit is the most interval less than the extreme saturation of current maximum coding unit-4, is judged
Value, if it is, be divided further into 4 next layer of identical coding units of size, then by under this by current coded unit
Coding unit currently pending in one layer of coding unit is as current coded unit, and is made by the layer at current coded unit place
For current layer, return again to step and 7.-2 continue executing with, otherwise, directly perform step 7.-5；
7.-5, current coded unit cataloged procedure terminates, in then judging the extreme saturation interval of current maximum coding unit
All coding units are the most all disposed, if it is, current maximum coding unit cataloged procedure terminates, then perform step
8., otherwise, then judge that four coding units in current layer are the most all disposed, if four coding units in current layer
All it is disposed, then using pending coding unit next in the last layer coding unit of current layer as present encoding list
Unit, and using the layer at current coded unit place as current layer, be then back to step and 7.-2 continue executing with, if in current layer
Four coding units are untreated complete, then using pending coding unit next in current layer as current coded unit, so
7. rear return step-2 continues executing with；
8. using maximum coding unit to be encoded next in present frame as current maximum coding unit, it is then back to step 3.
Continue executing with, until all maximum coding unit in present frame all encodes complete；
9. using frame pending for next frame in HD video as present frame, it is then back to step and 2. continues executing with, until high definition
All frames in video are all disposed, and so far complete the fast coding of HD video.
A kind of HEVC fast encoding method the most according to claim 1, it is characterised in that described step 3. in
The determination process of prediction sets Ω of big coding unit is:
If present frame is the 1st frame in the I group of picture in HD video, then it is in present frame when current maximum coding unit
The 1st maximum coding unit time, Ω is empty set；When the 1st row that current maximum coding unit is present frame remove the 1st maximum
During the maximum coding unit of remaining outside coding unit, Ω={ T}；When the 1st row that current maximum coding unit is present frame removes
During the maximum coding unit of remaining outside the 1st maximum coding unit, Ω={ L}；When current maximum coding unit is in present frame
During remaining maximum coding unit in addition to the 1st row and the 1st row, Ω={ L, LT, T}；
If present frame is the 1st frame in the non-I group of picture in HD video or last 1 frame, then when current maximum coding
When unit is the 1st maximum coding unit in present frame, Ω={ COL1, COL2}；When current maximum coding unit is current
In 1st row of frame during remaining the maximum coding unit in addition to the 1st maximum coding unit, Ω={ COL1, COL2, T}；When currently
Maximum coding unit be present frame the 1st row in remaining maximum coding unit in addition to the 1st maximum coding unit time, Ω=
{COL1,COL2,L}；When current maximum coding unit is the maximum coding unit of remaining in addition to the 1st row and the 1st row in present frame
Time, Ω={ COL1, COL2, L, LT, T}；
If present frame is any frame in the 2nd frame to the 7th frame in the non-I group of picture in HD video, then when currently
When big coding unit is the 1st maximum coding unit in present frame, Ω={ COL1, COL2}；When current maximum coding unit
In arranging for the 1st of present frame during remaining the maximum coding unit in addition to the 1st maximum coding unit, Ω={ COL1, COL2, T}；
When remaining maximum coding unit in addition to the 1st maximum coding unit in the 1st row that current maximum coding unit is present frame,
Ω={ COL1, COL2, L}；When current maximum coding unit is the maximum coding of remaining in addition to the 1st row and the 1st row in present frame
During unit, Ω={ COL1, COL2, L, LT, T}.
A kind of HEVC fast encoding method the most according to claim 1 and 2, it is characterised in that described step 4. middle DRpred
The one-to-one relationship interval with the extreme saturation of current maximum coding unit is: work as DRpredWhen=0, current maximum coding is single
The extreme saturation interval of unit is [0,1]；Work as DRpredWhen=1, the extreme saturation interval of current maximum coding unit is [0,2]；When
DRpredWhen=2, the extreme saturation interval of current maximum coding unit is [1,2]；Work as DRpredWhen=3, current maximum coding unit
Extreme saturation interval be [1,3]；Work as DRpredWhen=4, the extreme saturation interval of current maximum coding unit is [2,3]；When
DRpredWhen=5, the extreme saturation interval of current maximum coding unit is [0,3].
A kind of HEVC fast encoding method the most according to claim 1, it is characterised in that described step 7. in-3 when working as
When the depth value of front coding unit is 1, the decision threshold value set is as 65；When the depth value of current coded unit is 2, if
Fixed decision threshold value is 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310470508.3A CN103533355B (en) | 2013-10-10 | 2013-10-10 | A kind of HEVC fast encoding method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310470508.3A CN103533355B (en) | 2013-10-10 | 2013-10-10 | A kind of HEVC fast encoding method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103533355A CN103533355A (en) | 2014-01-22 |
| CN103533355B true CN103533355B (en) | 2016-08-17 |
Family
ID=49934970
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310470508.3A Expired - Fee Related CN103533355B (en) | 2013-10-10 | 2013-10-10 | A kind of HEVC fast encoding method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103533355B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103813178B (en) * | 2014-01-28 | 2017-01-25 | 浙江大学 | Rapid high efficiency video coding (HEVC) method based on depth and space-time relevancy of coding units |
| CN105530518B (en) * | 2014-09-30 | 2019-04-26 | 联想(北京)有限公司 | A kind of Video coding, coding/decoding method and device |
| CN104506860A (en) * | 2014-12-16 | 2015-04-08 | 上海国茂数字技术有限公司 | Video coding reference image selecting method and system |
| CN104602000B (en) * | 2014-12-30 | 2018-02-23 | 北京奇艺世纪科技有限公司 | The dividing method and device of a kind of coding unit |
| CN104853191B (en) * | 2015-05-06 | 2017-09-05 | 宁波大学 | A kind of HEVC fast encoding method |
| CN105141954B (en) * | 2015-08-19 | 2018-03-13 | 浙江工业大学 | A kind of HEVC interframe encodes fast schema selection method |
| CN105847798A (en) * | 2016-03-30 | 2016-08-10 | 乐视控股（北京）有限公司 | Method and device for dividing fast coding unit during video coding process |
| CN107295336B (en) * | 2017-06-21 | 2019-10-29 | 鄂尔多斯应用技术学院 | Adaptive fast coding dividing elements method and device based on image correlation |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013032576A2 (en) * | 2011-06-30 | 2013-03-07 | General Instrument Corporation | Quantization parameter derivation from qp predictor |
| CN102984521A (en) * | 2012-12-12 | 2013-03-20 | 四川大学 | High-efficiency video coding inter-frame mode judging method based on temporal relativity |
| CN103338371A (en) * | 2013-06-07 | 2013-10-02 | 东华理工大学 | Fast and efficient video coding intra mode determining method |
-
2013
- 2013-10-10 CN CN201310470508.3A patent/CN103533355B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013032576A2 (en) * | 2011-06-30 | 2013-03-07 | General Instrument Corporation | Quantization parameter derivation from qp predictor |
| CN102984521A (en) * | 2012-12-12 | 2013-03-20 | 四川大学 | High-efficiency video coding inter-frame mode judging method based on temporal relativity |
| CN103338371A (en) * | 2013-06-07 | 2013-10-02 | 东华理工大学 | Fast and efficient video coding intra mode determining method |
Non-Patent Citations (5)
| Title |
|---|
| Adaptive CU Depth Range;Xiang Li,Jicheng An,et al.;《Joint Collaborative Team on Video Coding (JCT-VC)of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11,Document: JCTVC-E090,5th Meeting: Geneva, CH》;20110323;1-6 * |
| An Effective CU Size Decision Method for HEVC Encoders;Liquan Shen,Zhi Liu,et al.;《IEEE TANSACTIONS ON MULTIMEDIA》;20130228;第15卷(第2期);1-6 * |
| Content Based Hierarchical Fast Coding Unit Decision AlgorithmFor HEVC;Jie Leng,Lei Sun,et al.;《2011 INTERNATIONAL CONFERENCE ON MULTIMEDIA AND SIGNAL PROCESSING》;20110515;1-4 * |
| Fast coding unit depth decision algorithm for interframe coding in HEVC;Yongfei Zhang,Haibo Wang,and Zhe Li;《2013 DATA COMPRESSION CONFERENCE》;20130322;1-10 * |
| Fast CU Splitting and Pruning for Suboptimal CU partitioning in HEVC inra coding;Seunghyun Cho and Munchurl Kim.;《IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY》;20130225;第23卷(第9期);1-10 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103533355A (en) | 2014-01-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103533355B (en) | A kind of HEVC fast encoding method | |
| CN103873861B (en) | Coding mode selection method for HEVC (high efficiency video coding) | |
| CN103220528B (en) | Method and apparatus by using large-scale converter unit coding and decoding image | |
| CN104581165B (en) | For the method and apparatus that video is decoded | |
| CN103339938B (en) | Perform the motion vector prediction of video coding | |
| CN102792692B (en) | By using the method and apparatus that video is encoded by block elimination filtering and method and apparatus video being decoded by use block elimination filtering | |
| CN104581181B (en) | A kind of inner frame coding method based on alternative mode list optimization | |
| CN104853191B (en) | A kind of HEVC fast encoding method | |
| CN101964906B (en) | Rapid intra-frame prediction method and device based on texture characteristics | |
| CN102415097B (en) | Distortion weighing | |
| US20140161193A1 (en) | Video encoding method and apparatus and video decoding method and apparatus, based on hierarchical coded block pattern information | |
| CN104243997B (en) | Method for quality scalable HEVC (high efficiency video coding) | |
| CN103067704B (en) | A kind of method for video coding of skipping in advance based on coding unit level and system | |
| CN106686379A (en) | Video decoding method | |
| KR20150059141A (en) | Method and apparatus for video encoding with intra prediction, method and apparatus for video decoding with intra prediction | |
| CN105491385A (en) | Quick deciding method for division of HEVC intraframe coding units | |
| CN107277506B (en) | Motion vector accuracy selection method and device based on adaptive motion vector precision | |
| CN104811696B (en) | A kind of coding method of video data and device | |
| KR20110112178A (en) | Method and apparatus for video encoding transformation index regarding structure of data unit for transformation, method and apparatus for video decoding based on the transformation index | |
| CN104639940B (en) | A kind of quick HEVC method for choosing frame inner forecast mode | |
| KR20130004548A (en) | Method and apparatus for video encoding with intra prediction by unification of availability check, method and apparatus for video decoding with intra prediction by unification of availability check | |
| KR20110010324A (en) | Method and apparatus for image encoding, and method and apparatus for image decoding | |
| CN104883565A (en) | Decision-making method and device for intra-frame prediction mode of high efficiency video coding | |
| CN105959699A (en) | Fast inter-frame prediction method based on motion estimation and temporal-spatial correlation | |
| CN103596003B (en) | Interframe predication quick mode selecting method for high-performance video coding |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160817 |