CN108012152A - A kind of quickly HEVC coding methods - Google Patents
A kind of quickly HEVC coding methods Download PDFInfo
- Publication number
- CN108012152A CN108012152A CN201711289816.0A CN201711289816A CN108012152A CN 108012152 A CN108012152 A CN 108012152A CN 201711289816 A CN201711289816 A CN 201711289816A CN 108012152 A CN108012152 A CN 108012152A
- Authority
- CN
- China
- Prior art keywords
- rdcost
- gop
- skip
- merge
- 2nx2n
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/124—Quantisation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/103—Selection of coding mode or of prediction mode
- H04N19/114—Adapting the group of pictures [GOP] structure, e.g. number of B-frames between two anchor frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/177—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a group of pictures [GOP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention discloses a kind of quickly HEVC coding methods.It specifically comprises the following steps：(1) two threshold value the array T_8x8 and T_16x16 using quantization parameter QP as index are established, and T_8x8 and T_16x16 are initialized as 0；(2) set per N number of GOP as a GOP group, first GOP is statistics GOP in GOP groups, counts all frames in GOP and carries out normal encodings, is calculated in threshold value T_8x8 or T_16x16 using value that quantization parameter QP is the array element indexed；(3) in GOP groups the 2nd to n-th GOP be fast coding GOP, the frame in fast coding GOP uses fast algorithm, if meeting that condition directly selects Merge＆Skip_2Nx2N, skips the calculating of other follow-up predicting units；Otherwise, it is necessary to calculate the RDCost of all prediction modes, the minimum predicting units as CU of RDCost are selected.The beneficial effects of the invention are as follows：It can at utmost save calculation amount, while not loss coding quality substantially；The common coding quality rank of 265 encoders of ArcVideo is applied the invention to, the scramble time saves 7%, and BDRate only increases by 0.5%.
Description
Technical field
The present invention relates to Video coding correlative technology field, refers in particular to a kind of quickly HEVC coding methods.
Background technology
H.264, video encoding standards of the HEVC as latest generation, is lifted than previous generation coding standard in compression efficiency
One times, while encoder complexity also greatly promotes.This introduces more complicated coding techniques mainly due to HEVC：Including more
Big more flexible coding unit, the more predicting units of species, finer prediction mode etc..Specifically：(1)、
H.264 coding unit is lifted to 64x64, in addition HEVC supports and carries out four forks from maximum coding unit by HEVC from 16x16
Tree recurrence be divided into four sub- coding units, minimum coding unit 8x8, therefore HEVC can according to the complexity of scene texture,
Amplitude of movement etc. selects optimal coding unit for target scene, improves compression efficiency, but coding unit more flexible at the same time
Selection mean that encoder needs to do more codings and attempt, calculation amount increase.(2), HEVC can be into inside coding unit
The division of row predicting unit, for inter-frame encoding frame, predicting unit contains Merge_2Nx2N, Skip_2Nx2N, Inter_
2Nx2N, Inter_2NxN, Inter_Nx2N, Inter_NxN, Inter_2NxnU, Inter_2NxnD, Inter_nLx2N,
The prediction modes such as Inter_nRx2N, Intra_2Nx2N and Intra_NxN, coding unit select compression from numerous predicting units
The highest predicting unit of rate, lifts code efficiency, and corresponding calculation amount can also increase.
Coding unit calculates the Coding cost of each predicting unit, therefrom selects the conduct of Least-cost finally to predict mould
Formula, therefore, the selection of prediction mode is calculation amount the best part in encoder cataloged procedure.
Prediction mode Merge＆Skip_2Nx2N is used as current PU using the motion vector of time domain and the adjacent block in spatial domain
Candidate motion vector, select wherein optimal MV, the call number Merge_idx, Merge_ of MV then transmitted in code stream
The bit number of idx consumption is seldom；Other inter prediction units outside Merge＆Skip_2Nx2N are required for carrying out each PU
Motion search finds optimal MV, and MVD (MV Difference) need to be transmitted in code stream to represent that MV, MVD usually compare
Merge_idx consumes more multi-bit, and due to there is motion search process, calculation amount is usual compared to Merge＆Skip_2Nx2N
Bigger.From the point of view of coding result, the ratio highest of inter-frame encoding frame selection Merge＆Skip_2Nx2N, Inter_2Nx2N,
The calculation amount accounting of these prediction modes of Inter_2NxN, Inter_Nx2N, Inter_NxN, Intra_2Nx2N, Intra_NxN
More, but final checked ratio is but very low, therefore, can there is very that maximum probability skips these prediction modes, not influence to encode
The scramble time is saved while compression efficiency.
Current existing fast algorithm scheme carries out further four to terminate using Skip_2Nx2N to coding unit
Fork tree division, so as to save the calculation amount of sub-block；Also have using the RDCost of current PU to skip the side of follow-up PU calculating process
Method.Paper [J Vanne, " Efficient Mode Decision Schemes for HEVC Inter Prediction ",
In IEEE Transactions on Circuits and Systems for Video Technology, Vol 24, Sept
2014] symmetrical prediction mode SMP (Inter_2NxN and Inter_Nx2N) and asymmetric prediction mode AMP (Inter_ is analyzed
2NxnU, Inter_2NxnD, Inter_nLx2N, Inter_nRx2N) computation complexity, inquired into reduce SMP and AMP calculation
Method, effectively saves the scramble time.Paper [L Shen, " Adaptive Inter-Mode Decision for HEVC
Jointly Utilizing Inter-Level and Spatiotemporal Correlations ", in IEEE
Transactions on Circuits and Systems for Video Technology, Vol 24.OCTOBER
2014] using current CU adjacent C U PU information and RDCost skip the calculating process of the SMP of current CU and AMP, obtain
Good effect.But existing scheme is typically necessary and finishes Skip＆Merge_2Nx2N at present, this is several by Inter_2Nx2N
Kind prediction mode, and in the real-time application of HEVC encoders, SMP and AMP prediction modes are typically pent, so
Scheme does not just reach real-time coding allocative effect optimal at present.
The content of the invention
The present invention is above-mentioned in order to overcome the shortcomings of to exist in the prior art, there is provided a kind of to greatly save the fast of calculation amount
The HEVC coding methods of speed.
To achieve these goals, the present invention uses following technical scheme：
A kind of quickly HEVC coding methods, specifically comprise the following steps：
(1) two threshold value the array T_8x8 and T_16x16 using quantization parameter QP as index are established, and by T_8x8 and T_
16x16 is initialized as 0；
(2) set per N number of GOP as a GOP group, first GOP is statistics GOP in GOP groups, counts in GOP and owns
Frame carries out normal encoding, by the Merge＆Skip_2Nx2N and Inter_ of the coding unit CU of the 8x8 and 16x16 that count in GOP
The RDCost of 2Nx2N carries out statistic of classification according to quantization parameter QP, and the coding unit CU of identical quantization parameter QP is one group, if
Statistical sample quantity under some quantization parameter QP is more than M, then is calculated using this group of sample in threshold value T_8x8 or T_16x16
Value using quantization parameter QP as the array element of index；
(3) in GOP groups the 2nd to n-th GOP be fast coding GOP, the frame in fast coding GOP uses fast algorithm：
Specific as follows, the coded quantization parameter of current coded unit CU is QP, calculates the RDCost of Merge＆Skip_2Nx2N first, it
Afterwards if the RDCost of Merge＆Skip_2Nx2N is less than in threshold value T_8x8 or T_16x16 the number using quantization parameter QP as index
The value of constituent element element, then coding unit CU directly select Merge＆Skip_2Nx2N, skip the calculating of other follow-up predicting units；
Otherwise, it is necessary to calculate the RDCost of all prediction modes, the minimum predicting units as coding unit CU of RDCost are selected.
Wherein：Here T_8x8 and T_16x16 is not a numerical value, but an array using QP as index, QP value models
Enclose for 0~51.GOP (Group OfPicture) refers to one group of continuous image between two I frames.RDCost refers to compiling
Code cost.The present invention directly skips follow-up all prediction modes according to the Coding cost of Merge＆Skip_2Nx2N and calculates, can
At utmost to save calculation amount, while not loss coding quality substantially.This is because when the prediction of Merge＆Skip_2Nx2N
The distortion then encoded when effect is good enough and bit number all very littles, for Inter_2Nx2N, due to encoded motion
Vector consumes more bits compared to coding Merge_Idx, so the RDCost for causing Inter_2Nx2N is difficult to be less than Merge＆ again
The RDCost of Skip_2Nx2N.
Preferably, in step (2), the array element in threshold value T_8x8 or T_16x16 using quantization parameter QP as index
Value be to meet the maximum of following condition：When the RDCost of Merge＆Skip_2Nx2N is less than threshold value T, Merge＆Skip_
The probability of RDCosts of the RDCost of 2Nx2N less than Inter_2Nx2N is more than or equal to 98%.
Preferably, in step (2), N 10, M 1000.
Preferably, in step (3), the frame in fast coding GOP uses fast algorithm：For the coding list of 16x16
First CU, the quantization parameter of coding is QP, calculates the RDCost of Merge＆Skip_2Nx2N first, is as a result RDCost_Merge＆
Skip_16x16；If the array element in RDCost_Merge＆Skip_16x16 ＜ T_16x16 using quantization parameter QP as index
Value, then the coding unit CU of the 16x16 directly select Merge＆Skip_2Nx2N, skip the meter of other follow-up predicting units
Calculate；Otherwise, it is necessary to calculate the RDCost of all prediction modes, the prediction list as coding unit CU of RDCost minimums is selected
Member.
Preferably, in step (3), the frame in fast coding GOP uses fast algorithm：For the coding unit of 8x8
CU, the quantization parameter of coding is QP, calculates the RDCost of Merge＆Skip_2Nx2N first, is as a result RDCost_Merge＆
Skip_8x8；If the value in RDCost_Merge＆Skip_8x8 ＜ T_8x8 using quantization parameter QP as the array element of index,
Then the coding unit CU of the 8x8 directly selects Merge＆Skip_2Nx2N, skips the calculating of other follow-up predicting units；Otherwise,
Need to calculate the RDCost of all prediction modes, select the minimum predicting units as coding unit CU of RDCost.
The beneficial effects of the invention are as follows：It can at utmost save calculation amount, while not loss coding quality substantially；It incite somebody to action this
Invention is applied to the common coding quality rank of 265 encoders of ArcVideo, and the scramble time saves 7%, and BDRate only increases
0.5%.
Brief description of the drawings
Fig. 1 is Basketballdrive, QP=32, Merge＆Skip_2Nx2N and Inter_ in the embodiment of the present invention
The RDCost distribution character figures of 2Nx2N；
Fig. 2 is Bcactus in the embodiment of the present invention, QP=32, Merge＆Skip_2Nx2N and Inter_2Nx2N's
RDCost distribution character figures.
Embodiment
The present invention will be further described with reference to the accompanying drawings and detailed description.
A kind of quickly HEVC coding methods, specifically comprise the following steps：
(1) two threshold value the array T_8x8 and T_16x16 using quantization parameter QP as index are established, and by T_8x8 and T_
16x16 is initialized as 0；
(2) set per N number of GOP as a GOP group, first GOP is statistics GOP in GOP groups, counts in GOP and owns
Frame carries out normal encoding, by the Merge＆Skip_2Nx2N and Inter_ of the coding unit CU of the 8x8 and 16x16 that count in GOP
The RDCost of 2Nx2N carries out statistic of classification according to quantization parameter QP, and the coding unit CU of identical quantization parameter QP is one group, if
Statistical sample quantity under some quantization parameter QP is more than M, then is calculated using this group of sample in threshold value T_8x8 or T_16x16
Value using quantization parameter QP as the array element of index；Wherein：Using quantization parameter QP as index in threshold value T_8x8 or T_16x16
The value of array element be to meet the maximum of following condition：When the RDCost of Merge＆Skip_2Nx2N is less than threshold value T,
The probability of RDCosts of the RDCost of Merge＆Skip_2Nx2N less than Inter_2Nx2N is more than or equal to 98%；N is that 10, M is
1000；
(3) in GOP groups the 2nd to n-th GOP be fast coding GOP, the frame in fast coding GOP uses fast algorithm：
Specific as follows, the coded quantization parameter of current coded unit CU is QP, calculates the RDCost of Merge＆Skip_2Nx2N first, it
Afterwards if the RDCost of Merge＆Skip_2Nx2N is less than in threshold value T_8x8 or T_16x16 the number using quantization parameter QP as index
The value of constituent element element, then coding unit CU directly select Merge＆Skip_2Nx2N, skip the calculating of other follow-up predicting units；
Otherwise, it is necessary to calculate the RDCost of all prediction modes, the minimum predicting units as coding unit CU of RDCost are selected.
Wherein：For the coding unit CU of 16x16, the quantization parameter of coding is QP, calculates Merge＆Skip_ first
The RDCost of 2Nx2N, is as a result RDCost_Merge＆Skip_16x16；If RDCost_Merge＆Skip_16x16 ＜ T_
In 16x16 using quantization parameter QP as index array element value, then the coding unit CU of the 16x16 directly select Merge＆
Skip_2Nx2N, skips the calculating of other follow-up predicting units；Otherwise, it is necessary to calculate the RDCost of all prediction modes, selection
The minimum predicting units as coding unit CU of RDCost.For the coding unit CU of 8x8, the quantization parameter of coding is QP, first
The RDCost of Merge＆Skip_2Nx2N is first calculated, is as a result RDCost_Merge＆Skip_8x8；If RDCost_Merge＆
In Skip_8x8 ＜ T_8x8 using quantization parameter QP as index array element value, then the coding unit CU of the 8x8 directly select
Merge＆Skip_2Nx2N, skips the calculating of other follow-up predicting units；Otherwise, it is necessary to calculate all prediction modes
RDCost, selects the minimum predicting units as coding unit CU of RDCost.
Four subgraphs correspond to the statistics feelings of the coding unit CU of 8x8,16x16,32x32 and 64x64 respectively in as shown in Figure 1, Figure 2
Condition, abscissa are the RDCost of Merge＆Skip_2Nx2N, and ordinate is (RDCost_Merge＆Skip_2Nx2N-RDCost_
Inter_2Nx2N)/RDCost_Merge&Skip_2Nx2N.Therefore, if some point ordinate is less than 0, then it represents that Merge＆
The RDCost of Skip_2Nx2N is less than the RDCost of Inter_2Nx2N, coding final choice Merge＆Skip_2Nx2N.From Fig. 1,
Fig. 2 can be seen that when the RDCost of Merge＆Skip_2Nx2N is less than some threshold value T, then all points have all fallen on y ＜'s 0
Region (particularly evident for the coding unit CU of 8x8 and 16x16).This is because when the prediction effect of Merge＆Skip_2Nx2N
The distortion then encoded when good enough and bit number all very littles, for Inter_2Nx2N, due to encoding motion vector
More bits are consumed compared to coding Merge_Idx, so the RDCost for causing Inter_2Nx2N is difficult to be less than Merge＆ again
The RDCost of Skip_2Nx2N.
Drawn from Fig. 1, during quantization parameter QP=32, to the CU of 8x8, when the RDCost of Merge＆Skip_2Nx2N is less than
During threshold value 2381,98.82% point falls in the region of y ＜ 0；To the CU of 16x16, when the RDCost of Merge＆Skip is less than threshold value
When 3816,98.75% point falls in the region of y ＜ 0.Drawn from Fig. 2, during quantization parameter QP=32, to the CU of 8x8, when
When the RDCost of Merge＆Skip_2Nx2N is less than threshold value 2601,98.82% point falls in the region of y ＜ 0；To the CU of 16x16,
When the RDCost of Merge＆Skip_2Nx2N is less than threshold value 3974,98.75% point falls in the region of y ＜ 0.By to difference
Sequence different Q P is counted, and for 8x8 and 16x16, under identical QP, threshold value is all relatively；Different Q P threshold values are different：
QP is bigger, and threshold value is bigger.
Applying the invention to the common coding quality rank of 265 encoders of ArcVideo, the scramble time saves 7%, and
BDRate only increases by 0.5%.
Claims (5)
1. a kind of quickly HEVC coding methods, it is characterized in that, specifically comprise the following steps：
(1) two threshold value the array T_8x8 and T_16x16 using quantization parameter QP as index are established, and by T_8x8 and T_
16x16 is initialized as 0；
(2) set per N number of GOP as a GOP group, first GOP is statistics GOP in GOP groups, count in GOP all frames into
Row normal encoding, by the Merge＆Skip_2Nx2N and Inter_2Nx2N of the coding unit CU of the 8x8 and 16x16 that count in GOP
RDCost carry out statistic of classification according to quantization parameter QP, the coding unit CU of identical quantization parameter QP is one group, if some
Statistical sample quantity under quantization parameter QP is more than M, then is calculated using this group of sample in threshold value array T_8x8 or T_16x16
Value using quantization parameter QP as the array element of index；
(3) in GOP groups the 2nd to n-th GOP be fast coding GOP, the frame in fast coding GOP uses fast algorithm：Specifically
As follows, the coded quantization parameter of current coded unit CU is QP, calculates the RDCost, Zhi Houru of Merge＆Skip_2Nx2N first
The RDCost of fruit Merge＆Skip_2Nx2N is less than in threshold value array T_8x8 or T_16x16 the number using quantization parameter QP as index
The value of constituent element element, then coding unit CU directly select Merge＆Skip_2Nx2N, skip the calculating of other follow-up predicting units；
Otherwise, it is necessary to calculate the RDCost of all prediction modes, the minimum predicting units as coding unit CU of RDCost are selected.
2. a kind of quickly HEVC coding methods according to claim 1, it is characterized in that, in step (2), threshold value array
The value of array element in T_8x8 or T_16x16 using quantization parameter QP to index is to meet the maximum of following condition：When
When the RDCost of Merge＆Skip_2Nx2N is less than some threshold value T, the RDCost of Merge＆Skip_2Nx2N is less than Inter_
The probability of the RDCost of 2Nx2N is more than or equal to 98%.
3. a kind of quickly HEVC coding methods according to claim 1 or 2, it is characterized in that, in step (2), N is
10, M 1000.
4. a kind of quickly HEVC coding methods according to claim 1, it is characterized in that, in step (3), fast coding
Frame in GOP uses fast algorithm：For the coding unit CU of 16x16, the quantization parameter of coding is QP, calculates Merge＆ first
The RDCost of Skip_2Nx2N, is as a result RDCost_Merge＆Skip_16x16；If RDCost_Merge＆Skip_16x16
In ＜ T_16x16 using quantization parameter QP as index array element value, then the coding unit CU of the 16x16 directly select
Merge＆Skip_2Nx2N, skips the calculating of other follow-up predicting units；Otherwise, it is necessary to calculate all prediction modes
RDCost, selects the predicting unit as coding unit CU of RDCost minimums.
5. a kind of quickly HEVC coding methods according to claim 1, it is characterized in that, in step (3), fast coding
Frame in GOP uses fast algorithm：For the coding unit CU of 8x8, the quantization parameter of coding is QP, calculates Merge＆ first
The RDCost of Skip_2Nx2N, is as a result RDCost_Merge＆Skip_8x8；If RDCost_Merge＆Skip_8x8 ＜ T_
In 8x8 using quantization parameter QP as index array element value, then the coding unit CU of the 8x8 directly select Merge＆Skip_
2Nx2N, skips the calculating of other follow-up predicting units；Otherwise, it is necessary to calculate the RDCost of all prediction modes, RDCost is selected
The minimum predicting unit as coding unit CU.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711289816.0A CN108012152B (en) | 2017-12-07 | 2017-12-07 | Fast HEVC coding method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711289816.0A CN108012152B (en) | 2017-12-07 | 2017-12-07 | Fast HEVC coding method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108012152A true CN108012152A (en) | 2018-05-08 |
| CN108012152B CN108012152B (en) | 2021-04-13 |
Family
ID=62057467
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711289816.0A Active CN108012152B (en) | 2017-12-07 | 2017-12-07 | Fast HEVC coding method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108012152B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103051896A (en) * | 2012-12-14 | 2013-04-17 | 华中科技大学 | Mode skipping-based video frequency coding method and mode skipping-based video frequency coding system |
| US20130188736A1 (en) * | 2012-01-19 | 2013-07-25 | Sharp Laboratories Of America, Inc. | High throughput significance map processing for cabac in hevc |
| CN104125469A (en) * | 2014-07-10 | 2014-10-29 | 中山大学 | Fast coding method for high efficiency video coding (HEVC) |
| CN105657433A (en) * | 2015-12-30 | 2016-06-08 | 航天恒星科技有限公司 | Image complexity based signal source real-time coding method and system |
-
2017
- 2017-12-07 CN CN201711289816.0A patent/CN108012152B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130188736A1 (en) * | 2012-01-19 | 2013-07-25 | Sharp Laboratories Of America, Inc. | High throughput significance map processing for cabac in hevc |
| CN103051896A (en) * | 2012-12-14 | 2013-04-17 | 华中科技大学 | Mode skipping-based video frequency coding method and mode skipping-based video frequency coding system |
| CN104125469A (en) * | 2014-07-10 | 2014-10-29 | 中山大学 | Fast coding method for high efficiency video coding (HEVC) |
| CN105657433A (en) * | 2015-12-30 | 2016-06-08 | 航天恒星科技有限公司 | Image complexity based signal source real-time coding method and system |
Non-Patent Citations (2)
| Title |
|---|
| JARNO VANNE: "Efficient Mode Decision Schemes for HEVC Inter Prediction", 《IEEE TRANSACTIONS ON CTRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY》 * |
| LIQUAN SHEN, ZHAOYANG ZHANG,ZHI LIU: "Adaptive Inter-Mode Decision for HEVC Jointly Utilizing Inter-Level and Spatiotemporal Correlations", 《IEEE TRANSACTIONS ON CTRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108012152B (en) | 2021-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106713935B (en) | A kind of HEVC block division fast method based on Bayesian decision | |
| CN103997646B (en) | Fast intra-mode prediction mode selecting method in a kind of HD video coding | |
| CN109688414B (en) | VVC intra-frame coding unit candidate prediction mode reduction and block division early termination method | |
| CN104023234B (en) | Fast inter-frame prediction method applicable to high efficiency video coding (HEVC) | |
| CN105141954A (en) | HEVC interframe coding quick mode selection method | |
| CN102090065A (en) | Image encoding device, image decoding device, image encoding method, and image decoding method | |
| CN110662078B (en) | 4K/8K ultra-high-definition coding inter-frame coding fast algorithm suitable for AVS2 and HEVC | |
| CN104601992B (en) | SKIP mode quick selecting methods based on Bayesian Smallest Risk decision | |
| CN104394409B (en) | HEVC predictive mode fast selecting methods based on spatial correlation | |
| CN103997645B (en) | Quick HEVC intra-frame coding unit and pattern decision method | |
| CN103348681A (en) | Method and device for determining reference unit | |
| CN105187826B (en) | For the fast intra mode decision method of high efficiency video encoding standard | |
| CN105681808B (en) | A kind of high-speed decision method of SCC interframe encodes unit mode | |
| CN106534849B (en) | A kind of quick HEVC inter-frame encoding methods | |
| CN110312131B (en) | Content self-adaptive online video coding method based on deep learning | |
| CN104168480A (en) | Fast selecting method for intra-frame prediction encoding modes based on HEVC standard | |
| Chiang et al. | Fast zero block detection and early CU termination for HEVC video coding | |
| CN109302616A (en) | A kind of HEVC Inter Prediction High-speed Algorithm based on RC prediction | |
| CN104333755B (en) | The CU based on SKIP/Merge RD Cost of B frames shifts to an earlier date terminating method in HEVC | |
| WO2022121787A1 (en) | Method and apparatus for video predictive coding | |
| CN104954787A (en) | HEVC interframe prediction mode selection method and apparatus | |
| CN105704494B (en) | Screen content based on depth correlation encodes interframe fast encoding method | |
| CN110139098B (en) | Decision tree-based intra-frame fast algorithm selection method for high-efficiency video encoder | |
| CN109547798B (en) | Rapid HEVC inter-frame mode selection method | |
| CN107613294A (en) | A kind of method for fast skipping P, B frame intra prediction mode in HEVC |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 310000 E, 16 floor, A block, Paradise software garden, 3 West Gate Road, Xihu District, Hangzhou, Zhejiang. Applicant after: Hangzhou Dang Hong Polytron Technologies Inc Address before: 310030, 16 floor, E software, Paradise Software Park, 3 West Gate Road, Xihu District, Hangzhou, Zhejiang. Applicant before: HANGZHOU DANGHONG TECHNOLOGY CO., LTD. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |