CN107396121B - A kind of coding unit depth prediction approach and device based on hierarchical B-frame structure - Google Patents
A kind of coding unit depth prediction approach and device based on hierarchical B-frame structure Download PDFInfo
- Publication number
- CN107396121B CN107396121B CN201710725511.3A CN201710725511A CN107396121B CN 107396121 B CN107396121 B CN 107396121B CN 201710725511 A CN201710725511 A CN 201710725511A CN 107396121 B CN107396121 B CN 107396121B
- Authority
- CN
- China
- Prior art keywords
- current
- depth
- curdepth
- ismerge
- frame
- 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
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/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
- H04N19/31—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability in the temporal domain
-
- 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
-
- 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/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/146—Data rate or code amount at the encoder output
- H04N19/147—Data rate or code amount at the encoder output according to rate distortion criteria
-
- 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
- H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
- H04N19/51—Motion estimation or motion compensation
- H04N19/577—Motion compensation with bidirectional frame interpolation, i.e. using B-pictures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
- H04N19/96—Tree coding, e.g. quad-tree coding
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 coding unit depth prediction approach and device based on hierarchical B-frame structure, this method is according to the characteristic of hierarchical B-frame structure, the depth of the parameter predictions CU quad-tree partition such as depth, motion vector and quantization parameter in conjunction with same position CU, prediction and rate distortion costs calculate between intra frame to skip certain non-optimal depth, save the scramble time；Inventive algorithm is simple, and calculation amount is small, it is convenient to put into practical application.
Description
Technical field
The invention belongs to field of video encoding, in particular to a kind of coding unit depth prediction based on hierarchical B-frame structure
Method and device.
Background technique
HEVC is the abbreviation of efficient video coding standard, and on April 13rd, 2013, by ITU-T, (international telecommunication joined the standard
Telecommunication standardization sector, alliance) formally receive to be international standard.HEVC uses the block based on quaternary tree as shown in Figure 1 and divides knot
The frame of input coding device is divided into and does not overlap and the CTU of equal sizes (coding tree unit), then using CTU as root by structure
Node carries out circulation quad-tree partition, and obtained sub-block is known as CU (coding unit), and CU minimum can be to 8 × 8.Therefore CTU is most
Big CU, size are 64 × 64.Level in figure where CU is known as the depth of CU, and the CU depth that size is 64 × 64 is 0, greatly
The small CU depth for being 32 × 32 is 1, and so on, the depth of CU minimum 0 is up to 3.In CTU partition process, first calculate
The rate distortion costs of current CU, then calculate the rate distortion costs of each sub- CU.Finally the rate distortion costs of more current CU with
The size of the sum of the rate distortion costs of its sub- CU selects rate distortion costs lesser as forced coding result.It can be seen that
HEVC encodes a CTU and at least needs to carry out 1+4+16+64=85 rate distortion costs calculating, and complexity is very high, it is therefore desirable to
Coding rate is improved to meet real-time application demand.
Hierarchical B-frame structure is a kind of coding structure put forward in H.264 coding standard, is normally used for Video coding
Picture group (GOP) in generate different frame rates to improve coded time domain ductility.By taking GOP size is 16 as an example, hierarchical B-frame structure
As shown in Figure 2.As seen from the figure, when GOP size is 16, GOP is divided into 5 layers: level 0, level 1, level 2, level
3,level 4.Frame in GOP is known as time horizon (temporal level) in the level of hierarchical B-frame structure.No matter GOP size
To be how many, in hierarchical B-frame structure, always I frame or P frame, the frame type of other layers are B frame to the frame type of level 0.In figure
Arrow indicate the reference frame position of present frame, it is seen that in hierarchical B-frame structure, the time horizon of frame is higher, then with itself join
The distance for examining frame is closer, therefore in coding, small in depth of the CU depth usually than the CU of low time horizon of high time horizon.
Although there are many video coding algorithms for being directed to hierarchical B-frame structure, such as Manoranjan Paul scholar to exist at present
It is proposed on the IEEE Transactions on Circuits and Systems in October, 2014 a kind of based on hierarchical B-frame
The video coding algorithm of the long-range reference frame of structure, the algorithm effectively improve the compression ratio of each video encoder, but simultaneously
Its high complexity also improves the scramble time.Though in addition there is the fast coding algorithm based on hierarchical B-frame structure, both for
H.264 coding standard, on HEVC standard encoder and is not suitable for.Therefore HEVC standard encoder how to be made to guarantee vision
It is a urgent problem to be solved that the scramble time is reduced under the premise of quality.
Summary of the invention
The purpose of the present invention is being directed to the defect and the deficiencies in the prior art of HEVC standard encoder HM scramble time length,
The depth prediction approach and device based on hierarchical B-frame for proposing a kind of HEVC coding standard, shorten its scramble time, improve in fact
Border application.
A kind of coding unit depth prediction approach based on hierarchical B-frame structure, during to coding video frames, according to volume
Code unit where frame time horizon, skip a part of depth be 0 CU intra frame between predict and rate distortion computation or in advance
Four forks for terminating CU divide, and complete the depth prediction of coding unit.
Further, if the framing bit where current CU skips the current CU's for meeting the following conditions when minimum time horizon
Prediction and rate distortion computation between intra frame:
CurDepth==0&&ColDepth > CurDepth (1)
Wherein, CurDepth is the depth of current CU, and ColDepth is the depth of the same position CU of current CU, " && " it indicates to patrol
Collect AND operator.
The positive integer that the depth bounds of CU are 0 to 3 in HEVC coding standard.
Further, if the framing bit where current CU is when highest time horizon, if current CU meets in following two condition
Any one, then four forks for terminating current CU in advance divide:
CurDepth==2&& (IsMerge | | (MVx < α &&MVy < β)) (2)
ColDepth≤CurDepth&&ColQp < CurQp (3)
Wherein, CurDepth is the depth of current CU, and ColDepth is the depth of the same position CU of current CU；IsMerge table
Show in inter predication process, the optimal mode of current CU, take in 0 or 1 journey, if optimal mode is Merge, IsMerge is
1, it is otherwise 0；MVx, MVy are the motion vector that current CU is obtained in inter predication process, indicate present encoding block to reference
The displacement of block；α and β is the positive real number of setting；CurQp and ColQp is respectively the quantization ginseng of current CU and corresponding same position CU
Number, quantization parameter has been obtained by rate control process before CU coding, takes 0 to 51 positive integer；Expression formula IsMerge | | (MVx
< 1&&MVy < 1) indicating both IsMerge and MVx < 1&&MVy < 1, any one is very that then the logical value of expression formula is true；"||"
With " && " it respectively indicates logic or is accorded with logic and operation.
Further, the value of the α and β is 1.
A kind of coding unit depth prediction device based on hierarchical B-frame structure, comprising:
Time horizon judging unit, for the time number of plies of frame where judging coding unit, the time number of plies of the frame is by low
It is respectively Level0, Level1, Level2, Level3, Level4 to height；
Unit is skipped, using the framing bit where current CU when minimum time horizon, skips the frame of qualified current CU
Interior inter-prediction and rate distortion computation；
Unit is terminated in advance, using the framing bit where current CU when highest time horizon, terminates qualified work as in advance
Four forks of preceding CU divide.
Further, described to skip condition described in unit and refer to:
CurDepth==0&&ColDepth > CurDepth
Wherein, CurDepth is the depth of current CU, and ColDepth is the depth of the same position CU of current CU, " && " it indicates to patrol
Collect AND operator.
Further, condition described in the unit of termination in advance refers to:
CurDepth==2&& (IsMerge | | (MVx < α &&MVy < β))
Or
ColDepth≤CurDepth&&ColQp < CurQp
Wherein, CurDepth is the depth of current CU, and ColDepth is the depth of the same position CU of current CU；IsMerge table
Show in inter predication process, the optimal mode of current CU, take in 0 or 1 journey, if optimal mode is Merge, IsMerge is
1, it is otherwise 0；MVx, MVy are the motion vector that current CU is obtained in inter predication process, indicate present encoding block to reference
The displacement of block；α and β is the positive real number of setting；CurQp and ColQp is respectively the quantization ginseng of current CU and corresponding same position CU
Number, quantization parameter has been obtained by rate control process before CU coding, takes 0 to 51 positive integer；Expression formula IsMerge | | (MVx
< 1&&MVy < 1) indicating both IsMerge and MVx < 1&&MVy < 1, any one is very that then the logical value of expression formula is true；"||"
With " && " it respectively indicates logic or is accorded with logic and operation.
Beneficial effect
The present invention provides a kind of coding unit depth prediction approach and device based on hierarchical B-frame structure, this method roots
According to the characteristic of hierarchical B-frame structure, in conjunction with the parameter predictions CU quad-tree partition such as depth, motion vector and quantization parameter of same position CU
Depth save the scramble time so that prediction and rate distortion costs calculate between skipping the intra frames of certain non-optimal depth；This
Invention algorithm is simple, and calculation amount is small, it is convenient to put into practical application.
Detailed description of the invention
Fig. 1 is that the block based on quaternary tree divides schematic diagram；
Fig. 2 is hierarchical B-frame structure chart；
Fig. 3 is with position CU schematic diagram；
Fig. 4 is inventive algorithm flow diagram.
Specific embodiment
Below in conjunction with attached drawing and example, the present invention is described further.
In the present embodiment, GOP size takes 16, i.e. hierarchical B-frame structure has 5 time horizons, as shown in Figure 2.
As shown in figure 4, a kind of coding unit depth prediction approach based on hierarchical B-frame structure of the present invention, specifically
Steps are as follows:
Step 1: current CU predict between doing intra frame and rate distortion computation before, the frame where first judging the CU is being layered B
Time horizon in frame structure goes to step 2, such as if the frame where current CU is in lowermost layer in hierarchical B-frame structure
Frame where the current CU of fruit is in top in hierarchical B-frame structure, then goes to step 3.
Step 2: according to step 1 as a result, the frame where current CU is in lowermost layer, continuation in hierarchical B-frame structure
Judge whether the CU meets the following conditions:
CurDepth==0&&ColDepth > CurDepth (1)
Wherein, CurDepth is the depth of current CU, and ColDepth is the depth with position CU.If the condition that meets (1)
The CU skips prediction and rate distortion computation between the intra frame of current depth, directly does the division of four forks down.If being unsatisfactory for item
Part (1) first does prediction and rate distortion generation between the intra frame of CU current depth then according to HEVC coding standard encoder coded sequence
Valence calculates, and then does the division of four forks down again.
The depth bounds of above-mentioned CU are 0 to 3 positive integer in HEVC coding standard.
Step 3: according to step 1 as a result, frame where current CU in hierarchical B-frame structure in top, then should
CU first makees prediction and rate distortion costs meter between the intra frame of CU current depth according to HEVC coding standard encoder coded sequence
It calculates, then proceedes to judge whether the CU meets the following conditions:
CurDepth==2&& (IsMerge | | (MVx < α &&MVy < β)) (2)
ColDepth≤CurDepth&&ColQp < CurQp (3)
Four forks are terminated in advance if current CU meets condition (2) or condition (3) to divide, and are otherwise encoded and are marked according to HEVC
The division of four forks is done in quasi- encoder coded sequence continuation down.Wherein, CurDepth is the depth of current CU, and ColDepth is same position
The depth of CU.IsMerge is logical variable.If obtained optimal mode is Merge, then in inter predication process
IsMerge is true, is otherwise false.MVx, MVy are the motion vector of current CU obtained in inter predication process, it indicates to work as
Displacement of the preceding encoding block to reference block.MVx, MVy may be any real number.α and β can take any real number, by many experiments,
When α and β take 1, encoding efficiency is best.ColQp is the quantization parameter with position CU, and CurQp is the quantization parameter of current CU.Amount
Change parameter to have been obtained by rate control process before CU coding, usually takes 0 to 51 positive integer.
In order to verify the feasibility and validity of proposed interframe fast algorithm, surveyed based on HEVC video encoding standard
Die trial type HM16.8 realizes depth prediction algorithm of the present invention.The configuration selection HM of the specific coding parameter of all experiments
Standard configuration file: encoder_randomaccess_main.cfg, and the standard configuration file of corresponding cycle tests.
Experimental result is as shown in table 1.Wherein, QP is the quantization parameter of input, and Δ Bits% is to have added calculation of the present invention
The variation percentage of encoder Video coding bit compared with traditional encoder after method, the value are that positive value illustrates calculation of the present invention
On the contrary the coded-bit of method increased compared to bit used in encoder, then be reduction.Δ PSNR/dB is of the present invention to have added
The variation of encoder and traditional encoder ratioing signal quality after algorithm, the value are that positive value illustrates this algorithm to original encoding device
Coding quality increased, it is on the contrary then reduce.TS/% is the encoder and traditional coding after having added algorithm of the present invention
Device compares saved percentage of time, which is that positive value illustrates that the scramble time of this algorithm is subtracted with respect to conventional codec
It is few.Δ BDBR% illustrates under same objective quality, code rate situation of the improved encoder relative to conventional codec, Δ
BDBR% is that positive value illustrates that algorithm code rate increased.
1 experimental result of table
By the way that in experiment simulation, the experimental result of depth prediction proposed in the present invention is as shown in table 1.It is last by table 1
A line it is found that be added the method for the invention after encoder compared with traditional encoder coded-bit averagely increase
0.39%, illustrate that the coded-bit variation of the method for the invention is more stable.Encoder after having added the method for the invention
Averagely reduce 0.020 with traditional encoder ratioing signal quality, illustrates the video objective quality damage of the method for the invention
It loses smaller.Under same objective quality, improved encoder averagely increases 0.536 relative to the code rate of conventional codec,
Value is smaller, illustrates that the method for the invention effect is preferable.Finally, the scramble time of this algorithm averagely subtracts with respect to conventional codec
Lack 33.075%.In conclusion the algorithm has reached under the premise of guaranteeing the quality and compression ratio of video, coding is improved
Efficiency purpose.
A kind of coding unit depth prediction device based on hierarchical B-frame structure, comprising:
Time horizon judging unit, for the time number of plies of frame where judging coding unit, the time number of plies of the frame is by low
It is respectively Level0, Level1, Level2, Level3, Level4 to height；
Unit is skipped, using the framing bit where current CU when minimum time horizon, skips the frame of qualified current CU
Interior inter-prediction and rate distortion computation；
Unit is terminated in advance, using the framing bit where current CU when highest time horizon, terminates qualified work as in advance
Four forks of preceding CU divide.
It is described to skip condition described in unit and refer to:
CurDepth==0&&ColDepth > CurDepth
Wherein, CurDepth is the depth of current CU, and ColDepth is the depth of the same position CU of current CU, " && " it indicates to patrol
Collect AND operator.
Condition described in the unit of termination in advance refers to:
CurDepth==2&& (IsMerge | | (MVx < α &&MVy < β))
Or
ColDepth≤CurDepth&&ColQp < CurQp
Wherein, CurDepth is the depth of current CU, and ColDepth is the depth of the same position CU of current CU；IsMerge table
Show in inter predication process, the optimal mode of current CU, take in 0 or 1 journey, if optimal mode is Merge, IsMerge is
1, it is otherwise 0；MVx, MVy are the motion vector that current CU is obtained in inter predication process, indicate present encoding block to reference
The displacement of block；α and β is the positive real number of setting；CurQp and ColQp is respectively the quantization ginseng of current CU and corresponding same position CU
Number, quantization parameter has been obtained by rate control process before CU coding, takes 0 to 51 positive integer；Expression formula IsMerge | | (MVx
< 1&&MVy < 1) indicating both IsMerge and MVx < 1&&MVy < 1, any one is very that then the logical value of expression formula is true；"||"
With " && " it respectively indicates logic or is accorded with logic and operation.
Specific embodiment described herein is only an example for the spirit of the invention.The neck of technology belonging to the present invention
The technical staff in domain can make various modifications or additions to the described embodiments or replace by a similar method
In generation, however, it does not deviate from the spirit of the invention or beyond the scope of the appended claims.
Claims (3)
1. a kind of coding unit depth prediction approach based on hierarchical B-frame structure, which is characterized in that coding video frames process
In, according to the time horizon of frame where coding unit, skip prediction and rate distortion computation between the intra frame for the CU that a part of depth is 0
Or the four fork divisions of CU are terminated in advance, complete the depth prediction of coding unit；
If the framing bit where current CU when minimum time horizon, skip between the intra frame for meeting the current CU of the following conditions prediction and
Rate distortion computation:
CurDepth==0 && ColDepth > CurDepth
If the framing bit where current CU when highest time horizon, if current CU meets any one in following two condition, mentions
Preceding four forks for terminating current CU divide:
CurDepth==2 && IsMerge | | MVx < α && MVy < β
ColDepth≤CurDepth && ColQp < CurQp
Wherein, CurDepth is the depth of current CU, and ColDepth is the depth of the same position CU of current CU；IsMerge is indicated
In inter predication process, the optimal mode of current CU takes 0 or 1, if optimal mode be Merge, IsMerge 1, otherwise for
0；MVx, MVy are the motion vector that current CU is obtained in inter predication process, indicate the displacement of present encoding block to reference block；
α and β is the positive real number of setting；CurQp and ColQp is respectively the quantization parameter of current CU and corresponding same position CU, quantization ginseng
Number has been obtained by rate control process before CU coding, takes 0 to 51 positive integer；Expression formula IsMerge | | (MVx < 1&&MVy <
1) indicating the two of IsMerge and MVx < 1&&MVy < 1, any one is very that then the logical value of expression formula is true；" | | " and " && " point
Not Biao Shi logic or with logic and operation accord with.
2. the method according to claim 1, wherein the value of the α and β is 1.
3. a kind of coding unit depth prediction device based on hierarchical B-frame structure characterized by comprising
Time horizon judging unit, for the time number of plies of frame where judging coding unit, the time number of plies of the frame is from low to high
Respectively Level0, Level1, Level2, Level3, Level4；
Unit is skipped, using the framing bit where current CU when minimum time horizon, skips the intra frame of qualified current CU
Between predict and rate distortion computation；
Unit is terminated in advance, using the framing bit where current CU when highest time horizon, terminates qualified current CU in advance
Four fork divide；
It is described to skip condition described in unit and refer to:
CurDepth==0&&ColDepth > CurDepth
Condition described in the unit of termination in advance refers to:
CurDepth==2&&IsMerge | | MVx < α &&MVy < β
Or
ColDepth≤CurDepth&&ColQp < CurQp
Wherein, CurDepth is the depth of current CU, and ColDepth is the depth of the same position CU of current CU；IsMerge is indicated
In inter predication process, the optimal mode of current CU takes 0 or 1, if optimal mode be Merge, IsMerge 1, otherwise for
0；MVx, MVy are the motion vector that current CU is obtained in inter predication process, indicate the displacement of present encoding block to reference block；
α and β is the positive real number of setting；CurQp and ColQp is respectively the quantization parameter of current CU and corresponding same position CU, quantization ginseng
Number has been obtained by rate control process before CU coding, takes 0 to 51 positive integer；Expression formula IsMerge | | (MVx < 1&&MVy <
1) indicating the two of IsMerge and MVx < 1&&MVy < 1, any one is very that then the logical value of expression formula is true；" | | " and " && " point
Not Biao Shi logic or with logic and operation accord with.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710725511.3A CN107396121B (en) | 2017-08-22 | 2017-08-22 | A kind of coding unit depth prediction approach and device based on hierarchical B-frame structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710725511.3A CN107396121B (en) | 2017-08-22 | 2017-08-22 | A kind of coding unit depth prediction approach and device based on hierarchical B-frame structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107396121A CN107396121A (en) | 2017-11-24 |
| CN107396121B true CN107396121B (en) | 2019-11-01 |
Family
ID=60353725
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710725511.3A Active CN107396121B (en) | 2017-08-22 | 2017-08-22 | A kind of coding unit depth prediction approach and device based on hierarchical B-frame structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107396121B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11375192B2 (en) | 2017-12-14 | 2022-06-28 | Beijing Kingsoft Cloud Network Technology Co., Ltd. | Coding unit division decision method and device, encoder, and storage medium |
| CN108347605B (en) * | 2018-01-31 | 2021-09-17 | 南京理工大学 | Quick decision-making method for 3D video depth image quad-tree coding structure division |
| CN110198443B (en) * | 2018-05-10 | 2022-09-13 | 腾讯科技（深圳）有限公司 | Video frame coding unit dividing method and device, storage medium and electronic device |
| CN108737819B (en) * | 2018-05-20 | 2021-06-11 | 北京工业大学 | Flexible coding unit partitioning method based on quadtree binary tree structure |
| CN111064968B (en) * | 2019-12-18 | 2021-02-12 | 南华大学 | VVC inter-frame CU deep rapid dividing method |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1723797A1 (en) * | 2004-03-12 | 2006-11-22 | THOMSON Licensing | Motion-compensated spatio-temporal wavelet compression of video data with optimised permutation of the frames |
| US8340181B2 (en) * | 2005-02-14 | 2012-12-25 | Samsung Electronics Co., Ltd. | Video coding and decoding methods with hierarchical temporal filtering structure, and apparatus for the same |
| CN104604226A (en) * | 2012-07-03 | 2015-05-06 | 三星电子株式会社 | Method and apparatus for coding video having temporal scalability, and method and apparatus for decoding video having temporal scalability |
| CN105284113A (en) * | 2013-06-17 | 2016-01-27 | 高通股份有限公司 | Inter-component filtering |
| CN106454342A (en) * | 2016-09-07 | 2017-02-22 | 中山大学 | Interframe mode fast selecting method and system of video compressed coding |
| CN106961606A (en) * | 2017-01-26 | 2017-07-18 | 浙江工业大学 | The HEVC intra-frame encoding mode systems of selection of feature are divided based on texture |
| CN107071416A (en) * | 2017-01-06 | 2017-08-18 | 华南理工大学 | A kind of HEVC Adaptive Mode Selection Method for Intra-Prediction |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100596706B1 (en) * | 2003-12-01 | 2006-07-04 | 삼성전자주식회사 | Method for scalable video coding and decoding, and apparatus for the same |
| KR100664936B1 (en) * | 2005-04-13 | 2007-01-04 | 삼성전자주식회사 | Method and apparatus of context-based adaptive arithmetic coding and decoding with improved coding efficiency, and method and apparatus for video coding and decoding including the same |
-
2017
- 2017-08-22 CN CN201710725511.3A patent/CN107396121B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1723797A1 (en) * | 2004-03-12 | 2006-11-22 | THOMSON Licensing | Motion-compensated spatio-temporal wavelet compression of video data with optimised permutation of the frames |
| US8340181B2 (en) * | 2005-02-14 | 2012-12-25 | Samsung Electronics Co., Ltd. | Video coding and decoding methods with hierarchical temporal filtering structure, and apparatus for the same |
| CN104604226A (en) * | 2012-07-03 | 2015-05-06 | 三星电子株式会社 | Method and apparatus for coding video having temporal scalability, and method and apparatus for decoding video having temporal scalability |
| CN105284113A (en) * | 2013-06-17 | 2016-01-27 | 高通股份有限公司 | Inter-component filtering |
| CN106454342A (en) * | 2016-09-07 | 2017-02-22 | 中山大学 | Interframe mode fast selecting method and system of video compressed coding |
| CN107071416A (en) * | 2017-01-06 | 2017-08-18 | 华南理工大学 | A kind of HEVC Adaptive Mode Selection Method for Intra-Prediction |
| CN106961606A (en) * | 2017-01-26 | 2017-07-18 | 浙江工业大学 | The HEVC intra-frame encoding mode systems of selection of feature are divided based on texture |
Non-Patent Citations (1)
| Title |
|---|
| 《基于HEVC帧内预测的复杂度控制》;张昊，李林格等;《电视技术》;20161117;第40卷(第11期);第18-24页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107396121A (en) | 2017-11-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107396121B (en) | A kind of coding unit depth prediction approach and device based on hierarchical B-frame structure | |
| CN106454342B (en) | A kind of the inter-frame mode fast selecting method and system of video compression coding | |
| CN104023233A (en) | Fast inter-frame prediction method of HEVC (High Efficiency Video Coding) | |
| CN104023234B (en) | Fast inter-frame prediction method applicable to high efficiency video coding (HEVC) | |
| CN105959699B (en) | A kind of quick inter-frame prediction method based on estimation and time-space domain correlation | |
| CN107396102B (en) | A kind of inter-frame mode fast selecting method and device based on Merge technological movement vector | |
| CN104796693A (en) | Rapid HEVC CU deep partition coding method | |
| CN104243997B (en) | Method for quality scalable HEVC (high efficiency video coding) | |
| CN110493596B (en) | Video coding system and method based on neural network | |
| CN103873861A (en) | Coding mode selection method for HEVC (high efficiency video coding) | |
| CN105306944A (en) | Chrominance component prediction method in hybrid video coding standard | |
| CN104394409B (en) | HEVC predictive mode fast selecting methods based on spatial correlation | |
| CN100574447C (en) | Fast intraframe predicting mode selecting method based on the AVS video coding | |
| CN110351557A (en) | A kind of quick interframe prediction encoding method in Video coding | |
| CN104853191A (en) | HEVC fast coding method | |
| CN110365982A (en) | The different transform of intraframe coding selects accelerated method in a kind of multipurpose coding | |
| CN104333754A (en) | SHVC (scalable high efficiency video coding) enhancement layer video coding method based on rapid prediction mode selection | |
| CN103929652A (en) | Intra-frame prediction fast mode selecting method based on autoregressive model in video standard | |
| CN103118262A (en) | Rate distortion optimization method and device, and video coding method and system | |
| CN101304529A (en) | Method and device for selecting macro block pattern | |
| CN106101709A (en) | A kind of Primary layer inter-frame prediction method of the SHVC quality scalability combining enhancement layer | |
| CN103596003B (en) | Interframe predication quick mode selecting method for high-performance video coding | |
| CN109302616A (en) | A kind of HEVC Inter Prediction High-speed Algorithm based on RC prediction | |
| CN102196253B (en) | Video coding method and device based on frame type self-adaption selection | |
| CN110351552B (en) | Fast coding method in video coding |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |