CN103237223A - LCU (Largest Coding Unit) quick partition based on entropy - Google Patents
LCU (Largest Coding Unit) quick partition based on entropy Download PDFInfo
- Publication number
- CN103237223A CN103237223A CN201310169748XA CN201310169748A CN103237223A CN 103237223 A CN103237223 A CN 103237223A CN 201310169748X A CN201310169748X A CN 201310169748XA CN 201310169748 A CN201310169748 A CN 201310169748A CN 103237223 A CN103237223 A CN 103237223A
- Authority
- CN
- China
- Prior art keywords
- entropy
- lcu
- mark
- pixel
- perhaps
- 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
Images
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention relates to LCU (Largest Coding Unit) quick partition based on entropy. An LCU partition method based on high efficient video coding (HEVC) comprises the following steps that quadric quantization is performed on an LCU, so as to reduce a pixel level; entropy values of all CUs (coding units) which may be partitioned in the LCU are calculated; and determine whether the CUs should be continuously partitioned or not in accordance with the calculated entropy values of the CUs, the partition rules and a threshold.
Description
Joint study
The application is by North China University of Tech and the joint study of information institute of Beijing Jiaotong University, and obtain following fund assistance: state natural sciences fund (No.61103113, No.60903066), Beijing talent of institution of higher education directly under the jurisdiction of a municipal government teaches in-depth planning item (PHR201008187) by force; Jiangsu Province's natural science fund (BK2011455), Beijing's natural science fund (No.4102049), the beginning teacher of Ministry of Education fund (No.20090009120006); Country's 973 plans (2012CB316400), central colleges and universities' basic research funds (No.2011JBM214).
Technical field
The present invention relates to image processing field, more specifically, relate in efficient video coding HEVC and based on entropy LCU being cut apart fast.
Background technology
In April, 2010, two big international video encoding standards organize VCEG and MPEG to set up the video compression associating JCT-VC of group (Joint collaborative Team on Video Coding), together develop efficient video coding HEVC (High efficiency video coding) standard, H.265 it be also referred to as.HEVC standard main target is H.264/AVC to realize the significantly raising of code efficiency with the previous generation standard, especially at high-resolution video sequence.Its target be same video quality (PSNR) down code check reduce to 50% of standard H.264.
With regard to the current stage, HEVC still continues to use and H.264 just begins the hybrid encoding frame that adopts.Interframe and intraframe predictive coding: the correlation of eliminating time-domain and spatial domain.Transition coding: residual error is carried out transition coding to eliminate spatial coherence.Entropy coding: eliminate statistical redundancy.HEVC will put forth effort to study new coding tools or technology in hybrid encoding frame, improve video compression efficiency.
At present, the new features of the many codings that proposed in the discussion of JCT-VC tissue might add in the HEVC standard, the concrete document of each time discussion can from
Http:// wftp3.itu.intObtain.
In HEVC, bigger coding unit (CU) and quad-tree structure are more flexibly provided.The size of CU among the HEVC has 64x64 (LCU), 32x32,16x16, and8x8.The CU of this 64x64 wherein is defined by maximum coding unit (LCU), and each LCU can recurrence splits into 4 equal-sized CU, up to the CU of minimum (8x8).In order to find optimized CU splitting scheme, encoder must be considered all dividing condition.Fig. 2 has showed as an example how a LCU is divided into CU.The process of this traversal is called rate-distortion optimization RDO (Rate Distortion Optimization), and the RDO process can scan the CU combination that all possible CU goes to select to bring minimum rate distortion costs.Adopting this bigger CU is to be a good scheme for the validity that improves coding section.Fig. 3 A and 3B show respectively a pictures by H.264 with the HEVC division result, from Fig. 3 B we as can be seen bigger CU make encoder that the coding of emphasis can be arranged: the zone that amount of information is very little can be divided into big relatively CU; The zone that contains much information can be divided into relatively little CU.Yet bigger CU can bring a negative effect, because the coding side of HEVC need travel through all possible CU, the amount of calculation of this ergodic process is too big, and big like this computation burden is inappropriate for the application that much needs real-time coding.
The application is with reference to following each document, and these documents are incorporated herein thus, with the part as this paper disclosure.
[1]Woo-Jin?Han.Improved?Video?Compression?Efficiency?Through?Flexible?Unit?Representation?and?Corresponding?Extension?of?Coding?Tools.Circuits?and?Systems?for?Video?Technology.Dec.2010，20，1709-1720.
[2]Il-Koo?Kim.HM7：High?Efficiency?Video?Coding(HEVC)Test?Model7Encoder?Description.JCT-VC9th?Meeting，Geneva，CN，27April-7May，2012.
[3]Benjamin?Bross.High?efficiency?video?coding(HEVC)text?specification?draft7，JCT-VC5th?Meeting，Geneva，March，2011
[4]Bossen，F.Video?Coding?Using?a?Simplified?Block?Structure?and?Advanced?Coding?Techniques，Circuits?and?Systems?for?Video?Technology.Dec.2010，20，1667-1675.
[5]Cassa，M.B.Fast?rate?distortion?optimization?for?the?emerging?HEVC?standard.Picture?Coding?Symposium(PCS)，2012.7-9May2012，493-496.
[6]Woo-Jin?Han.Improved?Video?Compression?Efficiency?Through?Flexible?Unit?Representation?and?Corresponding?Extension?of?Coding?Tools.Circuits?and?Systems?for?Video?Technology.Dec.2010.20，12，1709-1720.
[7]G.?J.Sullivan，T.Wiegand，“Rate-distortion?optimization?for?video?compression”，IEEE?Signal?Processing?Magazine，vol.15，6，pp.74-90，Nov.1998.
[8]Ihara，Shunsuke.Information?theory?for?continuous?systems.1993World?Scientific.p.2.
[9]Frank?Bossen，2011，Common?test?conditions?and?software?reference?configurations，JCT-VC-F900，JCT-VC6th?Meeting，Torino，July，2011，14-22.
Summary of the invention
When HEVC is studied, the applicant notices that all researchs of cutting apart at LCU at present all are limited to based on RDO, and do not consider that whether can adopt other technologies to substitute the RDO algorithm realizes that preferable LCU is cut apart and lower amount of calculation, cut apart compromise between quality and the calculated load thereby reach LCU.
In research process of the present invention, the applicant notices that the amount of information of the CU that marked off by the RDO process and these CU itself has much relations.Fig. 2 B has showed the correlation of cutting apart LCU and amount of information as an example.Because Shannon entropy has defined the average unpredictability of stochastic variable, this is equivalent to its amount of information.
So proposing technology based on Shannon entropy, the applicant replaces cutting apart RDO process among the LCU.
According to an aspect, a kind of maximum coding unit (LCU) division methods based on efficient video coding (HEVC) is provided, comprising:
LCU is carried out second quantization, to reduce Pixel-level;
Calculate among the described LCU the entropy of the CU that might mark off;
According to the entropy of the CU that calculates, division rule and threshold value determine whether described CU should be continued to divide, wherein:
If the entropy of one of them CU is very little, then this CU does not need to divide again, perhaps
If the entropy of this CU is very big, then this CU need continue to be divided, perhaps
If the entropy of this CU is close to the mean value of the entropy of described the CU that might mark off, then this CU will can not divide again.
According on the other hand, a kind of computer program is provided, comprise the computer-readable medium with storage computer instruction thereon, described computer instruction makes processor carry out following operation:
LCU is carried out second quantization, to reduce Pixel-level;
Calculate among the described LCU the entropy of the CU that might mark off;
According to the entropy of the CU that calculates, division rule and threshold value determine whether described CU should be continued to divide, wherein:
If the entropy of one of them CU is very little, then this CU does not need to divide again, perhaps
If the entropy of this CU is very big, then this CU need continue to be divided, perhaps
If the entropy of this CU is close to the mean value of the entropy of described the CU that might mark off, then this CU will can not divide again.
According on the other hand, a kind of device is provided, comprising:
Be used for LCU is carried out second quantization, to reduce the module of Pixel-level;
Be used for to calculate described LCU the module of entropy of the CU that might mark off;
Be used for the entropy according to the CU that calculates, division rule and threshold value determine whether described CU should be continued the module of dividing, wherein:
If the entropy of one of them CU is very little, then this CU does not need to divide again, perhaps
If the entropy of this CU is very big, then this CU need continue to be divided, perhaps
If the entropy of this CU is close to the mean value of the entropy of described the CU that might mark off, then this CU will can not divide again.
According on the other hand, a kind of encoder based on HEVC is provided, it comprises:
The CU dispenser, it is configured to:
LCU is carried out second quantization, to reduce Pixel-level;
Calculate among the described LCU the entropy of the CU that might mark off;
According to the entropy of the CU that calculates, division rule and threshold value determine whether described CU should be continued to divide, wherein:
If the entropy of one of them CU is very little, then this CU does not need to divide again, perhaps
If the entropy of this CU is very big, then this CU need continue to be divided, perhaps
If the entropy of this CU is close to the mean value of the entropy of described the CU that might mark off, then this CU will can not divide again.
Description of drawings
Fig. 1 shows an embodiment of the encoder block diagram of HEVC.
Fig. 2 shows the schematic diagram that utilizes quaternary tree that LCU is progressively cut apart among the HEVC.
Fig. 3 A and 3B show respectively a pictures by H.264 with the HEVC division result.
Fig. 4 shows the high level flow chart that has embodied principle of the present invention.
Fig. 5 A shows according to one embodiment of present invention, is used for the method flow diagram of LCU being cut apart based on entropy.
Fig. 5 B shows according to one embodiment of present invention, is used for the device block diagram of LCU being cut apart based on entropy.
The LCU that Fig. 6 is based on the RDO algorithm cut apart and the figure of cutting apart based on the LCU of entropy as a result of the present invention relatively.
Embodiment
With reference now to accompanying drawing, various schemes is described.In the following description, in order to make an explanation, a plurality of details have been set forth in order to thorough understanding to one or more schemes is provided.Yet, obviously, do not having can to realize these schemes under the situation of these details yet.
As employed in this application, term " assembly ", " module ", " system " etc. are intended to refer to the entity relevant with computer, such as but not limited to, the combination of hardware, firmware, hardware and software, software, or executory software.For example, assembly can be but be not limited to: process, processor, the object that moves at processor, can carry out body (executable), execution thread, program and/or computer.For example, application program and this computing equipment that operates on the computing equipment can be assembly.One or more assemblies can be positioned at executive process and/or execution thread, and assembly can be positioned on the computer and/or is distributed on two or more the computers.In addition, these assemblies can be carried out from the various computer-readable mediums with storage various data structures thereon.Assembly can communicate by means of this locality and/or remote process, for example according to the signal with one or more packets, for example, come from by means of another component interaction in signal and local system, the distributed system and/or with on the network such as the internet by means of the data of a mutual assembly of signal and other system.
Fig. 1 shows the general configuration figure of the video encoder that efficient video coding (HEVC) realizes.The encoder architecture of HEVC is with H.264 employed encoder architecture is roughly the same, mainly be to have carried out further research, improvement at employed algorithm in each module, especially at high-resolution video sequence, its improved target be same video quality (PSNR) down code check reduce to 50% of standard H.264.
Because the encoder architecture of HEVC with H.264 employed encoder architecture is roughly the same, is not therefore obscured the present invention, the overall architecture among Fig. 1 is not described among the application, cuts apart and only pay close attention to based on the LCU of HEVC standard.
As described above, when HEVC is studied, the applicant notices that all researchs of cutting apart at LCU at present all are limited to based on RDO, and do not consider that whether can adopt other technologies to substitute the RDO algorithm realizes that preferable LCU is cut apart and lower amount of calculation, cut apart compromise between quality and the calculated load thereby reach LCU.
Therefore, the applicant has proposed technology based on Shannon entropy and has replaced cutting apart RDO process among the LCU.Key of the present invention is: find the relation between the entropy of the CU that is selected and these CU.Based on this point, target of the present invention is to make the CU and the optimized CU that are marked off by the present invention that maximum similarity be arranged.
Fig. 4 shows a high level flow chart that has embodied principle of the present invention.
At first, the formula of entropy is as follows:
In this formula, H (x) is entropy, p
iThe probability that represent pixel level i occurs, j is pixel progression.
In order to obtain the amount of information of all CU, we will calculate the entropy of all possible CU among the LCU.
Yet before calculating, preferably carry out the process of a second quantization, in order to the sum of Pixel-level is become as far as possible little.As shown from the above formula, under the situation that Pixel-level sum j diminishes, can reduce amount of calculation.
Usually, represent normally 1-2 byte, for example 8 digital videos or 10 digital videos for the computer digit of each pixel value.Therefore, it is contemplated that adopting the SIMD instruction simultaneously the pixel value of representing a plurality of pixels to be carried out right shift (for example, N position) implements this second quantization.A hypothesis of this second quantization is: when carrying out second quantization, the minimizing of the amount of information among the image LCU is roughly proportional with the minimizing of total pixel technique, or its monotonic function.Therefore, even LCU is carried out having lost a large amount of information behind the second quantization, but this information lose not can be to the optimum segmentation of LCU determine to cause appreciable impact.Therefore, to the total Pixel-level quantity behind the second quantization determine can be mainly cut apart the figure place of every pixel in the compromise of quality and calculated load and the original video based on LCU.For example, under the situation of 256 Pixel-level of every pixel, can be 32 Pixel-level of every pixel, i.e. above N=3 with its second quantization.
In another implementation, no matter how many positions are every pixel have in the original video, all are 32 Pixel-level of every pixel with its second quantization.
In addition, another purpose of this second quantization is to remove background noise, namely serves as one and removes the background noise filter.
Next step will calculate the entropy of all CU that may occur among the LCU.One has 85 CU that may be divided out among the LCU, comprising: the CU of 1 64x64,4 32x32,16 16x16,32 8x8 sizes.Next, statistics every kind of probability that pixel value occurs in a CU.These probability can be used in the calculating of entropy.The formula of calculating probability is as follows:
Wherein, N is the number of pixel among this CU, n
iThe expression pixel value is the number of the pixel of i.
We will use formula 3. to calculate the pixel value of each CU after drawing probability.Drawing 85 entropy will be as the foundation of CU division.
Based on the entropy that obtains in the theory of second portion and the A part, the inventor does a lot of work to seek contacting between CU entropy and the CU division.
By these research, the inventor has found that these cut apart the criterion of LCU:
The entropy of a.CU is very little, and this CU can not continue to divide probably so.
The entropy of b.CU is very big, and this CU will continue to be divided down probably so.
The entropy of c.CU is close to the mean value of all 85 entropy, and this CU appears among the optimum division result possibly so.
On the basis of these rules, the inventor has attempted a lot of threshold values, has found optimum threshold values:
If a. the entropy of CU is less than 1.2, this CU does not need to divide again so.
If b. the entropy of CU is greater than 3.5, this CU will continue to divide so.
If c. the entropy of CU average entropy ± 0.15 scope within, this CU will can not divide again so.
Through experiment, than HM8.0, the algorithm that the applicant proposes has 40.9% reduction in the scramble time, and BD-rate has lost 3.82%, PSNR and reduced by 0.117%.
This experiment in, the inventor use formula 4. come the calculation code time minimizing what.
Wherein, T
HBVCBe the scramble time of HM8.0, T
ProposedExpression joins scramble time behind the HM8.0 with this algorithm.Δ T representative reduces the result of scramble time.
Its experimental result is as shown in table 1:
Table 1. experimental result
The LCU that Fig. 6 is based on the RDO algorithm cut apart and the figure of cutting apart based on the LCU of entropy as a result of the present invention relatively.As we know from the figure, algorithm in this paper and the matching degree that has based on the optimized division of RDO algorithm about 80%.
Fig. 5 A shows according to one embodiment of present invention, is used for the method flow diagram of LCU being cut apart based on entropy.
In step 501, LCU is carried out second quantization, to reduce Pixel-level.
In step 503, calculate among the described LCU the entropy of the CU that might mark off.For example, as described above, under the situation of 32 Pixel-level, calculate the entropy of 85 CU altogether.
In step 505, according to the entropy of the CU that calculates, division rule and threshold value determine whether described CU should be continued to divide.If the entropy of one of them CU is very little, then this CU does not need to divide again, if perhaps the entropy of this CU is very big, then this CU need continue to be divided, if perhaps the entropy of this CU is close to the mean value of the entropy of described the CU that might mark off, then this CU will can not divide again.
In a preferred embodiment, if the entropy of a CU is less than 1.2, think that then the entropy of this CU is very little and do not need to divide again, if the entropy of a CU is greater than 3.5, think that then the entropy of this CU is very big and need continue to be divided, if the entropy of a CU the mean value of the entropy of described the CU that might mark off ± 0.15 scope within, then the entropy of this CU is close to the mean value of the entropy of described the CU that might mark off and will can not divide again.
Fig. 5 B shows according to one embodiment of present invention, is used for the device block diagram of LCU being cut apart based on entropy.The function that its each module realizes is consistent with the method step among Fig. 5 A, does not therefore repeat them here.
The above embodiment of the present invention all can be embodied as the encoder based on HEVC, particularly intra-prediction encoder wherein.Should can be as shown in Figure 1 based on the internal structure of the encoder of HEVC, and infra-frame prediction choice box wherein and infra-frame prediction frame have constituted described intra-prediction encoder.It should be appreciated by those skilled in the art that this decoder can be implemented as software, hardware and/or firmware.
When realizing with hardware, video encoder can or be designed to carry out its combination in any of function described herein with general processor, digital signal processor (DSP), application-specific integrated circuit (ASIC) (ASIC), field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, realizes or carries out.General processor can be microprocessor, but replacedly, this processor also can be processor, controller, microcontroller or the state machine of any routine.Processor also can be implemented as the combination of computing equipment, for example, and the combination of the combination of DSP and microprocessor, the combination of a plurality of microprocessors, one or more microprocessor and DSP kernel or any other this kind structure.In addition, at least one processor can comprise and can operate to carry out above-mentioned one or more steps and/or one or more modules of operation.
When realizing video encoder with hardware circuits such as ASIC, FPGA, it can comprise the various circuit blocks that are configured to carry out various functions.Those skilled in the art can design in every way and realize these circuit according to being applied to various constraintss on the whole system, realize various function disclosed in this invention.
Although aforementioned open file has been discussed exemplary arrangement and/or embodiment, it should be noted that under situation about not deviating from by the scope of the scheme of the description of claims definition and/or embodiment, can make many variations and modification at this.And, although describe or the described scheme of requirement and/or the key element of embodiment with singulative, also it is contemplated that the situation of plural number, unless clearly represented to be limited to odd number.In addition, all or part of of scheme and/or embodiment can be used in combination with any other scheme and/or all or part of of embodiment arbitrarily, unless shown different.
Claims (8)
1. maximum coding unit (LCU) division methods based on efficient video coding (HEVC) comprises:
LCU is carried out second quantization, to reduce Pixel-level;
Calculate among the described LCU the entropy of the CU that might mark off;
According to the entropy of the CU that calculates, division rule and threshold value determine whether described CU should be continued to divide, wherein:
If the entropy of one of them CU is very little, then this CU does not need to divide again, perhaps
If the entropy of this CU is very big, then this CU need continue to be divided, perhaps
If the entropy of this CU is close to the mean value of the entropy of described the CU that might mark off, then this CU will can not divide again.
2. the method for claim 1, wherein, if the entropy of this CU is less than 1.2, think that then the entropy of this CU is very little, if the entropy of this CU is greater than 3.5, think that then the entropy of this CU is very big, if the entropy of this CU the mean value of the entropy of described the CU that might mark off ± 0.15 scope within, then the entropy of this CU is close to the mean value of the entropy of described the CU that might mark off.
3. the method for claim 1, wherein described is by the computer digit of representing each pixel value being represented what realized right shift N position to LCU execution second quantization.
4. the method for claim 1, wherein N is preferably 3.
5. the Pixel-level after the method for claim 1, wherein reducing is preferably every pixel 32 Pixel-level.
6. a computer program comprises the computer-readable medium with storage computer instruction thereon, and described computer instruction makes processor carry out following operation:
LCU is carried out second quantization, to reduce Pixel-level;
Calculate among the described LCU the entropy of the CU that might mark off;
According to the entropy of the CU that calculates, division rule and threshold value determine whether described CU should be continued to divide, wherein:
If the entropy of one of them CU is very little, then this CU does not need to divide again, perhaps
If the entropy of this CU is very big, then this CU need continue to be divided, perhaps
If the entropy of this CU is close to the mean value of the entropy of described the CU that might mark off, then this CU will can not divide again.
7. device comprises:
Be used for LCU is carried out second quantization, to reduce the module of Pixel-level;
Be used for to calculate described LCU the module of entropy of the CU that might mark off;
Be used for the entropy according to the CU that calculates, division rule and threshold value determine whether described CU should be continued the module of dividing, wherein:
If the entropy of one of them CU is very little, then this CU does not need to divide again, perhaps
If the entropy of this CU is very big, then this CU need continue to be divided, perhaps
If the entropy of this CU is close to the mean value of the entropy of described the CU that might mark off, then this CU will can not divide again.
8. encoder based on HEVC, it comprises:
The CU dispenser, it is configured to:
LCU is carried out second quantization, to reduce Pixel-level;
Calculate among the described LCU the entropy of the CU that might mark off;
According to the entropy of the CU that calculates, division rule and threshold value determine whether described CU should be continued to divide, wherein:
If the entropy of one of them CU is very little, then this CU does not need to divide again, perhaps
If the entropy of this CU is very big, then this CU need continue to be divided, perhaps
If the entropy of this CU is close to the mean value of the entropy of described the CU that might mark off, then this CU will can not divide again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310169748.XA CN103237223B (en) | 2013-05-10 | 2013-05-10 | LCU based on entropy divides fast |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310169748.XA CN103237223B (en) | 2013-05-10 | 2013-05-10 | LCU based on entropy divides fast |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103237223A true CN103237223A (en) | 2013-08-07 |
| CN103237223B CN103237223B (en) | 2016-01-13 |
Family
ID=48885235
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310169748.XA Expired - Fee Related CN103237223B (en) | 2013-05-10 | 2013-05-10 | LCU based on entropy divides fast |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103237223B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104539949A (en) * | 2014-12-12 | 2015-04-22 | 北方工业大学 | HEVC screen coding quick slicing based on edge directions |
| WO2015089693A1 (en) * | 2013-12-16 | 2015-06-25 | Mediatek Singapore Pte. Ltd. | Approximation method for division operation |
| CN106899850A (en) * | 2017-03-02 | 2017-06-27 | 北方工业大学 | The New Fast Algorithms of the HEVC infra-frame predictions based on SATD |
| CN108881908A (en) * | 2018-05-28 | 2018-11-23 | 北方工业大学 | Quick partitioning based on coding unit Texture complication in Video coding |
| CN114205613A (en) * | 2021-12-02 | 2022-03-18 | 北京智美互联科技有限公司 | Method and system for synchronously compressing internet audio and video data |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101938657A (en) * | 2010-10-07 | 2011-01-05 | 西安电子科技大学 | Self-adaptively dividing method for code units in high-efficiency video coding |
| US20120106622A1 (en) * | 2010-11-03 | 2012-05-03 | Mediatek Inc. | Method and Apparatus of Slice Grouping for High Efficiency Video Coding |
| US20120114034A1 (en) * | 2010-11-08 | 2012-05-10 | Mediatek Inc. | Method and Apparatus of Delta Quantization Parameter Processing for High Efficiency Video Coding |
| CN103096090A (en) * | 2013-02-20 | 2013-05-08 | 广州柯维新数码科技有限公司 | Method of dividing code blocks in video compression |
-
2013
- 2013-05-10 CN CN201310169748.XA patent/CN103237223B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101938657A (en) * | 2010-10-07 | 2011-01-05 | 西安电子科技大学 | Self-adaptively dividing method for code units in high-efficiency video coding |
| US20120106622A1 (en) * | 2010-11-03 | 2012-05-03 | Mediatek Inc. | Method and Apparatus of Slice Grouping for High Efficiency Video Coding |
| US20120114034A1 (en) * | 2010-11-08 | 2012-05-10 | Mediatek Inc. | Method and Apparatus of Delta Quantization Parameter Processing for High Efficiency Video Coding |
| CN103096090A (en) * | 2013-02-20 | 2013-05-08 | 广州柯维新数码科技有限公司 | Method of dividing code blocks in video compression |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015089693A1 (en) * | 2013-12-16 | 2015-06-25 | Mediatek Singapore Pte. Ltd. | Approximation method for division operation |
| CN104539949A (en) * | 2014-12-12 | 2015-04-22 | 北方工业大学 | HEVC screen coding quick slicing based on edge directions |
| CN104539949B (en) * | 2014-12-12 | 2018-02-06 | 北方工业大学 | The method and device of quick partitioning based on edge direction in HEVC screen codings |
| CN106899850A (en) * | 2017-03-02 | 2017-06-27 | 北方工业大学 | The New Fast Algorithms of the HEVC infra-frame predictions based on SATD |
| CN106899850B (en) * | 2017-03-02 | 2020-08-14 | 北方工业大学 | HEVC intra-frame prediction method and device based on SATD |
| CN108881908A (en) * | 2018-05-28 | 2018-11-23 | 北方工业大学 | Quick partitioning based on coding unit Texture complication in Video coding |
| CN108881908B (en) * | 2018-05-28 | 2022-07-01 | 北方工业大学 | Coding unit texture complexity based fast partitioning in video coding |
| CN114205613A (en) * | 2021-12-02 | 2022-03-18 | 北京智美互联科技有限公司 | Method and system for synchronously compressing internet audio and video data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103237223B (en) | 2016-01-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3417623B1 (en) | Efficient parameter storage for compact multi-pass transforms | |
| KR102453953B1 (en) | Encoding method and apparatus for transformming hierarchical variable block and decoding method and apparatus | |
| EP3417621A1 (en) | Multi-pass non-separable transforms for video coding | |
| KR102097281B1 (en) | Motion vector prediction using previous frame residuals | |
| CN103237223B (en) | LCU based on entropy divides fast | |
| CN102665078A (en) | Intra prediction mode decision based on direction vector for HEVC (High Efficiency Video Coding) | |
| CN103098473A (en) | Low complexity transform coding using adaptive DCT/DST for intra-prediction | |
| EP3417622A1 (en) | Efficient transform coding using optimized compact multi-pass transforms | |
| CN103004192A (en) | Variable localized bit depth increase for fixed-point transforms in video coding | |
| CN105684441A (en) | Hash-based block matching in video and image coding | |
| CN103957415A (en) | Coding unit (CU) segmentation method and apparatus based on screen content video | |
| US20200252609A1 (en) | Methods and apparatuses for signaling partioning information for picture encoding and decoding | |
| CN104539949A (en) | HEVC screen coding quick slicing based on edge directions | |
| CN1864177A (en) | Video encoding and decoding methods and corresponding devices | |
| CN103813173A (en) | BCIM-based 3D-HEVC rapid intra-frame predication scheme | |
| CN105163130B (en) | A kind of Lossless Image Compression Algorithm method based on discrete Tchebichef orthogonal polynomial | |
| KR101419689B1 (en) | Decoding apparatus for performing inverse quantiation \and inverse transform in h.264/avc decoder and decoding method using decoding apparatus | |
| CN105338365A (en) | Video coding method and video coding apparatus | |
| Naveen et al. | Comparative analysis of video compression mechanisms based on EZW coded 3D-DWT and AVI | |
| Sun et al. | Modified distortion redistribution problem for high efficiency video coding (HEVC) | |
| CN109413446B (en) | Gain control method in multiple description coding | |
| Dvir et al. | Trapezoidal block split using orthogonal c2 transforms for HEVC video coding | |
| Yu et al. | Lossless Image Compression using Differential Pulse Code Modulation and Its purpose | |
| CA2841143C (en) | Compressing image data | |
| Micallef et al. | Adaptive rounding operator for efficient Wyner-Ziv 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160113 Termination date: 20160510 |