CN101106695A - Real time fine flexible coding method based on H.264 - Google Patents
Real time fine flexible coding method based on H.264 Download PDFInfo
- Publication number
- CN101106695A CN101106695A CN 200710038784 CN200710038784A CN101106695A CN 101106695 A CN101106695 A CN 101106695A CN 200710038784 CN200710038784 CN 200710038784 CN 200710038784 A CN200710038784 A CN 200710038784A CN 101106695 A CN101106695 A CN 101106695A
- Authority
- CN
- China
- Prior art keywords
- piece
- sub
- zero
- current residual
- value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention relates to a real-time fine granularity scalable encoding method based on H.264. According to the overall situation of current residual frames and the local distribution of current residual blocks, the invention finds singular points from the global analysis, makes the bit plane number wholly equilibrated through downward shift of the singular values, and makes corresponding upper shift at the decoding end; the invention determines all-zero blocks from the local analysis. The invention will use a 4*4 whole number transformation in the reinforced layer conversion fraction during encoding. Compared with the general FGS method, the complexity in the invention is obviously reduced, the video quality is higher, and the overall PSNR (peak signal noise ratio) change is smoother. Evidenced by experiments, compared with the FGS method of MPEG-4, when keeping a close code rate, the invention can increase the average brightness PSNR by 0.37dB, and increase the average encoding speed by 13.86fps, namely by 97 percent.
Description
Technical field
The present invention relates to a kind of method of coding and decoding video, particularly a kind of based on real-time fine granular scalability (FGS) method H.264.
Background technology
Since H.261 ITU-T has issued, H.263, greatly promoted application of multimedia technology after the international standard such as MPEG-1, MPEG-2, MPEG-4.Yet, along with rolling up of new service and be about to popularizing of HDTV (High-Definition Television), and existing transmission network such as Cable Modem, Xdsl, transmission bandwidth that UMTS is lower, press for and improve video coding efficient; Also require video encoding standard can adapt to existing or future network simultaneously.These problems provide practical foundation for the generation H.264 of new video coding standard.
Along with the increase of network-multimedia application, based on network video coding and decoding technology is also corresponding to seem extremely important.Bit-Plane Encoding is the key technology in fine granular scalable (FGS) coding, and it makes enhancement layer bitstream to block at any location point, thereby has scalability.Send in the application of video flowing to client at server, the retractility of FGS can be adjusted code check according to the variation of the network bandwidth, when the network condition difference, only sends basic layer, and when the network bandwidth was more abundant, the code stream of transmission enhancement layer improved video quality.This scalability techniques is suitable for use in the streaming media service of transmission of video information under the environment of Internet or radio communication.But because the prediction of the movable information of the low resolution that enhancement layer adopts, so the code efficiency of FGS is lower.This there are usually two kinds of different solutions, the one, repeatedly quantification or monocycle, multiring structure are for example adopted in structural adjustment; The 2nd, the transform method of enhancement layer is made improvements, for example 8 * 8DCT and the 4 * 4DCT mode selecting method that propose of the Jungong of Microsoft Research, Asia Han based on MPFG-4.
Based on H.264 in real time the fine granularity scalable coding face two problems: code efficiency and encoder complexity.Though H.264 code efficiency is very high, expand to that the coding of its enhancement layer has brought the not high new problem of code efficiency behind the FGS, traditional 8 * 8DCT pattern is not considered the correlation between bit-plane coding middle level and the layer, has lowered efficient.People such as Jungong Han propose the correlation that method that 8 * 8DCT and 4 * 4DCT pattern conversion select has been considered the bit-planes interlayer, and code efficiency has more significantly and improves, but its complexity is higher, so the fast coding of not being suitable for.What repeatedly quantization coding method adopted at present is many, but equally also is to be cost to increase complexity.In addition; Kenji Matsuo etc. propose a kind of new position bits of encoded scheme; to avoid the situation of enhancement layer in low bit-plane coding decrease in efficiency; mainly be that each data is divided into remarkable bit and meticulous bit; it can adopt different safeguard measures to these two groups according to the importance difference, again transmission respectively.But this belongs to back-end processing, overall distribution character is not analyzed, and is not considered modules consuming time such as conversion.
Based on MPEG-4 fine granular scalability method.As shown in Figure 1, the residual information that subtracts each other acquisition by original image and basic layer reconfiguration information is looked for maximum after through change quantization and bit displacement, adopts bit-plane coding at last.This method can obtain the effect of encoding preferably, but it does not have to consider to do the front end preliminary treatment before the transform/quantization of enhancement layer coding, and encoder complexity is bigger, can not reach real-time coding.Present invention is directed at this, propose a kind of based on real-time fine granular scalability method H.264, as shown in Figure 2, in the coding of enhancement layer, by the front end preliminary treatment, do distribution statistics analysis of overall importance and do all-zero block decision in advance, can effectively reduce the scramble time and reach real-time coding.And in enhancement layer, adopt 4 * 4 integer transforms so that H.264 pattern conversion coupling in the pattern conversion of enhancement layer and the basic layer, though the adding preliminary treatment can be introduced a little additional bit but can significantly reduce its follow-up coded-bit, thereby can obviously improve code efficiency generally.
Summary of the invention
The object of the present invention is to provide a kind ofly based on real-time fine granular scalability method H.264, than the FGS decoding method based on MPEG-4, it can improve video quality when considering extra overhead-bits, reduce the encoding and decoding time greatly.
For achieving the above object, the present invention adopts following technical proposals:
A kind of based on real-time fine granular scalability method H.264, it is characterized in that locality according to of overall importance and the current residual block of current residual frame distributes to analyze enhancement layer conversion fraction employing 4 * 4 integer transforms in the encoder; In global analysis, find out singular point, and, make corresponding superior displacement in decoding end by singular value being descended displacement make that the bit-planes number overall situation is balanced; In partial analysis, do the judgement of complete zero piece.
Performing step is as follows:
(1) current residual frame is carried out distribution statistics of overall importance, the distribution situation of in difference, adding up singular point based on the reconstruction value of H.264 basic layer and original value, overall singular value is descended displacement, in header to the position of record singular point with move down value information and encode;
(2) current residual block is carried out the locality distribution statistics, obtaining the maximal bit figure place after finishing (1) is L, and establishing intercepting bit-planes number is N, service condition value T=2
L-N-1Whether be complete zero sub-piece, because complete zero sub-piece does not need to do the change quantization of back, so can save scramble time and code check greatly to the processing of complete zero sub-piece if adjudicating current residual block; Complete zero sub-piece is not done change quantization, only the sub-piece of non-full zero is carried out conversion, quantize and coding;
(3) in enhancement layer, the sub-piece of non-zero is adopted 4 * 4 integer transforms, and to change quantization coefficients by using bit-plane coding;
(4), from header, put forward in the step (1) under the global portions pan position and move down value information, and do corresponding superior displacement in decoding end.
It is as follows in the above-mentioned step (1) current residual frame to be carried out the concrete steps of distribution statistics of overall importance:
1. to the current residual frame whole scan of input, write down unusual point value size;
2. according to distributed intelligence, determine singular point, the singular point absolute value moved down operation, when the singular point absolute value greater than 64, it is moved down 2, when its between 32-64, it is moved down 1;
3. (X is Y) with the big or small S of the value of moving down to write down unusual point value position in header;
4. obtain maximum M after analyzing, then the maximal bit figure place is L=[Log2M+0.5].
It is as follows in the above-mentioned step (2) current residual block to be carried out the concrete steps of locality distribution statistics:
1. the current residual block to input carries out scan round;
2. judge whether to satisfy complete zero sub-piece condition: obtaining the maximal bit figure place after global analysis finishes is L, and establishing intercepting bit-planes number is N, service condition value O=2
L-N-1Whether be complete zero sub-piece, if this 4 * 4 sub-piece be complete zero sub-piece then it goes without doing change quantization, and the blocK_cbp of current block is set to ALL_ZERO, otherwise is set to 1 if adjudicating current residual block;
3. 2. repeating step finishes whole all-zero block decisions, is complete zero group as a group Group, and then group_cbp is set to ALL_ZERO, otherwise is set to 1.Though the judgement to complete zero group can increase some additional bit and amount of calculation, but can improve the efficient and the binary encoding efficient of coding header here; After this, only in enhancement layer, carry out conversion, quantification and coding to being set to 1 sub-piece.
Wherein two sections pseudo-codes are as follows during realization:
1.8 * 8 complete zero group judgement pseudo-codes:
8 * 8 circulations
{
Complete zero judgement of 4 * 4 sub-pieces;
If (complete zero sub-piece number=16)
group_cbp＝ALL_ZERO；
else
group_cbp＝1；
Jump out circulation;
}
2.4 the complete zero judgement pseudo-code of * 4 sub-pieces:
4 * 4 sub-piece circulations
{
(residual absolute value is smaller or equal to 2 for if
L-N-1)
Zero number adds 1;
else
Jump out circulation;
}
If (zero number=16)
{
block cbp＝ALL_ZERO；
}
else
block_cbp＝1；
As follows to the concrete steps that the sub-piece of non-full zero carries out conversion, quantification and coding in the above-mentioned step (3) at enhancement layer:
1. be 48 * 8 luminance block and 28 * 8 chrominance block at enhancement layer with 16 * 16 macroblock partitions, then with 8 * 8 sub-pieces that are divided into 44 * 4;
2. 44 * 4 sub-piece is called a group Group, each macro block is totally 6 Group, the method for division such as accompanying drawing 4;
3. 4 * 4 integer transforms are adopted in the conversion of the sub-piece of non-zero, when header is encoded, first code set header, the coded sub-blocks header is introduced group mode and can be improved the header code efficiency again;
4. the coefficient after adopting QPL to quantize carries out the 16 i.e. bit-plane codings of 4 * 4 length.
The present invention compared with the prior art, have following outstanding feature and remarkable advantage: the FGS enhancement layer in MPEG-4 adopts 8 * 8DCT pattern conversion usually, this and a H.264 basic layer coding mode do not match, and the present invention substitutes and can effectively mate with the pattern conversion of basic layer with 4 * 4 integer transforms; The method that adopts analysis of overall importance and locality analysis to combine has not only significantly reduced the scramble time, and compares with original method, and its video reconstruction quality is higher.The present invention compares with FGS based on MPEG-4, and brightness signal to noise ratio (Y-PSNR) has improved 0.37dB, the fast 13.86fps of coding rate.
Description of drawings
Fig. 1 is based on the FGS enhancement layer coding block diagram of MPEG-4
Fig. 2 is this method based on H.264 FGS enhancement layer coding block diagram
Fig. 3 is the all-zero block decision flow chart
Fig. 4 is the mode division figure of module unit
Embodiment
One embodiment of the present of invention are as described below:
Based on H.264 in real time improving one's methods of FGS enhancement layer pattern conversion be that 4 * 4 integer transforms are adopted in enhancement layer conversion in cataloged procedure, distribute according to the locality of the of overall importance and current residual block of current residual frame and analyze.In global analysis, find out singular point, and, make corresponding superior displacement in decoding end by singular value being descended displacement make that the bit-planes number overall situation is balanced; In partial analysis, do the judgement of complete zero piece.
Implementation step is as follows:
A) in the pretreatment module as shown in Figure 2 current residual frame is carried out distribution statistics of overall importance, the distribution situation of statistics singular point in the difference of basic layer reconstruction value and original value, overall singular value is descended displacement, in header to the position of record singular point with move down value information and encode;
B) in pretreatment module current residual block is carried out the locality distribution statistics, being located at and obtaining the maximal bit figure place after finishing a) is L, and establishing intercepting bit-planes number is N, service condition value O=2
L-N-1Whether be complete zero sub-piece, if complete zero sub-piece is then skipped follow-up transform/quantization module if adjudicating current residual block;
C) if current block is not complete zero sub-piece, adopt 4 * 4 integer transforms at the enhancement layer conversion fraction, and then to change quantization coefficients by using bit-plane coding;
D) decoding is the inverse process of above-mentioned coding, but pan position and move down value information under the global portions in must from header, extracting a), and do corresponding superior displacement.
Above-mentioned statistical analysis concrete steps of overall importance a) are as follows:
(1) to the current residual frame whole scan of input, writing down unusual point value size is 32 and 64.
(2) according to distributed intelligence, determine singular point, the singular point absolute value is moved down operation, for example the singular point absolute value moves down 2 greater than 64 to it, as between 32-64, it is moved down 1.
(3) (X is Y) with the big or small S of the value of moving down to write down unusual point value position in header.
(4) establish that to obtain maximum after the analysis be M, then the maximal bit figure place is L=[Log
2M+0.5].
As shown in Figure 3, locality statistical analysis concrete steps above-mentioned b) are as follows:
(1) the current residual block to input carries out scan round.
(2) judge whether to satisfy complete zero sub-piece condition.Obtaining the maximal bit figure place after global analysis finishes is L, and establishing intercepting bit-planes number is N, service condition value O=2
L-N-1Whether be complete zero piece, if this 4 * 4 sub-piece be complete zero sub-piece then the change quantization process of it goes without doing back, and the block_cbp of current block is set to ALL_ZERO, otherwise is set to 1 if adjudicating current residual block.
(3) repeating for (2) step, finish complete zero whole sub-piece judgements, is complete zero group as a group (Group), and then group_cbp is set to ALL_ZERO, otherwise is set to 1.
As shown in Figure 4, concrete steps above-mentioned c) are as follows:
(1) to each macroblock partitions of 16 * 16 of enhancement layer be 48 * 8 brightness (Y) piece and 28 * 8 chrominance block (U, V), then with each 8 * 8 sub-pieces that are divided into 44 * 4;
(2) 44 * 4 sub-piece is called a group (Group), each macro block is totally 6 Group, the beneath figure of the method for division such as accompanying drawing 4;
(3) the sub-piece of non-zero is adopted 4 * 4 integer transforms, when header is encoded, first code set header group_cbp (), coded sub-blocks header block_cbp () again;
(4) in example, adopt QP
LThe bit-plane coding of (promptly 4 * 4) length that=30 coefficients after quantizing carry out 16.
Above-mentioned d) shift-up operation concrete steps are as follows:
(1) the decoding header obtains under the global portions pan position and moves down value information;
(2) (X Y) does corresponding superior displacement with the big or small S of the value of moving down according to the unusual point value of record position in the header.
The FGS method of the example method and MPEG-4 has been carried out test relatively, and both are 3.0GHzIntel CPU test environment, the 512M internal memory; Gop structure is IPPP..; The encoder major parameter is: entropy coding adopts CABAC, and estimation adopts full search, and the hunting zone is 16,1/4 search precisions, and the reference frame number is 2, and quantization parameter is 30.
Table 1 is given under the cycle tests of Foreman, Tempete and three different qualities of Stefan, and this method compares with respect to the brightness PSNR of the FGS of MPEG-4 and with coding rate when the CIF form.As seen compare the FGS based on MPEG-4, the inventive method is under the CIF form, and the Y-PSNR average gain has 0.37dB; And the average fast 13.86fps of coding rate, promptly speed increases by 97%; And both average bit rates only change 0.67%, and are almost constant.
3 kinds of sequence C IF of table 1 form, and the comparison of two kinds of methods (352 * 288@30fps, 300Frames)
| FGS encoder based on MPEG-4 | Real-time FGS encoder of the present invention | Gain |
| Cycle tests | Brightness peak signal to noise ratio (dB) | Coding rate (fps) | Actual bit rate (kbit/s) | Brightness peak signal to noise ratio (dB) | Coding rate (fps) | Actual bit rate (kbit/s) | Brightness peak snr gain (dB) | Coding rate gain (fps) |
| Foreman | 33.45 | 14.28 | 354.7240 | 33.81 | 28.15 | 356.9824 | 0.36 | 13.87 |
| Tempete | 31.75 | 14.06 | 431.6550 | 32.16 | 28.07 | 435.4478 | 0.41 | 14.01 |
| Stefan | 30.16 | 14.58 | 485.6410 | 30.50 | 28.28 | 488.1588 | 0.34 | 13.70 |
| On average | 31.79 | 14.31 | 424.0067 | 32.16 | 28.17 | 426.8630 | 0.37 | 13.86 |
Claims (4)
1. one kind based on real-time fine granular scalability method H.264, it is characterized in that locality according to of overall importance and the current residual block of current residual frame distributes to analyze the enhancement layer conversion fraction employing 4x4 integer transform in the encoder; In global analysis, find out singular point, and, make corresponding superior displacement in decoding end by singular value being descended displacement make that the bit-planes number overall situation is balanced; In partial analysis, do the judgement of complete zero piece; The steps include:
(1) current residual frame is carried out distribution statistics of overall importance, in difference, add up the distribution of singular point based on the reconstruction value of H.264 basic layer and original value, overall singular value is descended displacement, in header to the position of record singular point with move down value information and encode;
(2) current residual block is carried out the locality distribution statistics, be located at and finish that to obtain the maximal bit figure place after (1) be L, intercepting bit-planes number is N, service condition value O=2
L-N-1Whether be complete zero sub-piece, complete zero sub-piece is not done change quantization if adjudicating the sub-piece of current residual error, only the sub-piece of non-full zero is carried out conversion, quantizes and coding;
(3) in enhancement layer, the sub-piece of non-zero is adopted the 4x4 integer transform, and to change quantization coefficients by using bit-plane coding;
(4) in decoding end, pan position and move down value information under the global portions in the extraction step from header (1), and do corresponding superior displacement.
2. according to claim 1 a kind of based on real-time fine granular scalability method H.264, the concrete steps that it is characterized in that in the described step (1) current residual frame is carried out distribution statistics of overall importance are as follows:
1. to the current residual frame whole scan of input, write down unusual point value size;
2. according to distributed intelligence, determine singular point, the singular point absolute value moved down operation, when the singular point absolute value greater than 64, it is moved down 2, when its between 32-64, it is moved down 1;
3. (X is Y) with the big or small S of the value of moving down to write down unusual point value position in header;
4. obtain maximum M after analyzing, then the maximal bit figure place is L=[Log
2M+0.5].
3. according to claim 1 a kind of based on real-time fine granular scalability method H.264, the concrete steps that it is characterized in that in the described step (2) current residual block is carried out the locality distribution statistics are as follows:
1. the current residual block to input carries out scan round;
2. judge whether to satisfy complete zero sub-piece condition: obtaining the maximal bit figure place after global analysis finishes is L, and establishing intercepting bit-planes number is N, service condition value O=2
L-N-1Whether be complete zero sub-piece, if this 4x4 piece be complete zero sub-piece then it goes without doing change quantization, and the block_cbp of current block is set to ALL_ZERO, otherwise is set to 1 if adjudicating the sub-piece of current residual error;
3. 2. repeating step finishes complete zero whole sub-piece judgements, is complete zero group as a group Group, and then group_cbp is set to ALL_ZERO, otherwise is set to 1.After this, only in enhancement layer, carry out conversion, quantize and coding being set to 1 sub-piece.
4. according to claim 1ly a kind ofly it is characterized in that at enhancement layer the piece of non-full zero being carried out conversion in the described step (3), quantize and coding based on real-time fine granular scalability method H.264; Its concrete steps are as follows:
1. be the luminance block of 4 8x8 and the chrominance block of 2 8x8 at enhancement layer with the macroblock partitions of 16x16, then the 8x8 piece be divided into the sub-piece of 4 4x4;
2. the sub-piece of 4 4x4 is called a group Group, each macro block is totally 6 Group;
3. the 4x4 integer transform is adopted in the conversion of the sub-piece of non-zero; When header is encoded, first code set header, coded sub-blocks header again;
4. it is the bit-plane coding of 4x4 length that the coefficient after adopting QPL to quantize carries out 16.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200710038784 CN100568952C (en) | 2007-03-29 | 2007-03-29 | Based on real-time fine granular scalability method H.264 |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200710038784 CN100568952C (en) | 2007-03-29 | 2007-03-29 | Based on real-time fine granular scalability method H.264 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101106695A true CN101106695A (en) | 2008-01-16 |
| CN100568952C CN100568952C (en) | 2009-12-09 |
Family
ID=39000336
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200710038784 Expired - Fee Related CN100568952C (en) | 2007-03-29 | 2007-03-29 | Based on real-time fine granular scalability method H.264 |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100568952C (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101516008B (en) * | 2008-02-22 | 2011-01-26 | 奇景光电股份有限公司 | Coding system and method for a bit-plane |
| WO2011047520A1 (en) * | 2009-10-21 | 2011-04-28 | 深圳市融创天下科技发展有限公司 | Method for determing threshold of zero blocks based on quantization step and method for judging zero blocks in advance |
| CN102611675A (en) * | 2011-01-20 | 2012-07-25 | 鸿富锦精密工业（深圳）有限公司 | Desktop sharing management control system and method |
| CN103546749A (en) * | 2013-10-14 | 2014-01-29 | 上海大学 | Method for optimizing HEVC (high efficiency video coding) residual coding by using residual coefficient distribution features and bayes theorem |
| CN105282557A (en) * | 2015-09-28 | 2016-01-27 | 天津大学 | H264 rapid movement estimation method for prediction movement vector |
| CN106888355A (en) * | 2015-12-15 | 2017-06-23 | 安讯士有限公司 | Bit-rate controller and the method for limiting output bit rate |
| CN107277513A (en) * | 2011-10-19 | 2017-10-20 | 株式会社Kt | The method of decoding video signal |
| CN107809680A (en) * | 2017-11-07 | 2018-03-16 | 长沙曙通信息科技有限公司 | A kind of multimedia system transmits control method |
| CN109981545A (en) * | 2017-12-28 | 2019-07-05 | 北京松果电子有限公司 | Encoder bit rate adjusts device, method and electronic equipment |
| WO2020233179A1 (en) * | 2019-05-22 | 2020-11-26 | 上海富瀚微电子股份有限公司 | Bitrate estimation core unit, bitrate estimation device and bitrate estimation method |
| CN113489987A (en) * | 2021-06-11 | 2021-10-08 | 翱捷科技股份有限公司 | HEVC sub-pixel motion estimation method and device |
| CN113489988A (en) * | 2021-06-11 | 2021-10-08 | 翱捷科技股份有限公司 | HEVC integer pixel motion estimation method and device |
-
2007
- 2007-03-29 CN CN 200710038784 patent/CN100568952C/en not_active Expired - Fee Related
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101516008B (en) * | 2008-02-22 | 2011-01-26 | 奇景光电股份有限公司 | Coding system and method for a bit-plane |
| WO2011047520A1 (en) * | 2009-10-21 | 2011-04-28 | 深圳市融创天下科技发展有限公司 | Method for determing threshold of zero blocks based on quantization step and method for judging zero blocks in advance |
| CN102611675A (en) * | 2011-01-20 | 2012-07-25 | 鸿富锦精密工业（深圳）有限公司 | Desktop sharing management control system and method |
| CN107277513A (en) * | 2011-10-19 | 2017-10-20 | 株式会社Kt | The method of decoding video signal |
| CN107277513B (en) * | 2011-10-19 | 2020-03-06 | 株式会社Kt | Method for decoding video signal |
| CN103546749A (en) * | 2013-10-14 | 2014-01-29 | 上海大学 | Method for optimizing HEVC (high efficiency video coding) residual coding by using residual coefficient distribution features and bayes theorem |
| CN103546749B (en) * | 2013-10-14 | 2017-05-10 | 上海大学 | Method for optimizing HEVC (high efficiency video coding) residual coding by using residual coefficient distribution features and bayes theorem |
| CN105282557A (en) * | 2015-09-28 | 2016-01-27 | 天津大学 | H264 rapid movement estimation method for prediction movement vector |
| CN105282557B (en) * | 2015-09-28 | 2018-05-18 | 天津大学 | A kind of H.264 rapid motion estimating method of predicted motion vector |
| CN106888355B (en) * | 2015-12-15 | 2018-10-26 | 安讯士有限公司 | Bit-rate controller and method for limiting output bit rate |
| CN106888355A (en) * | 2015-12-15 | 2017-06-23 | 安讯士有限公司 | Bit-rate controller and the method for limiting output bit rate |
| CN107809680A (en) * | 2017-11-07 | 2018-03-16 | 长沙曙通信息科技有限公司 | A kind of multimedia system transmits control method |
| CN109981545A (en) * | 2017-12-28 | 2019-07-05 | 北京松果电子有限公司 | Encoder bit rate adjusts device, method and electronic equipment |
| WO2020233179A1 (en) * | 2019-05-22 | 2020-11-26 | 上海富瀚微电子股份有限公司 | Bitrate estimation core unit, bitrate estimation device and bitrate estimation method |
| CN113489987A (en) * | 2021-06-11 | 2021-10-08 | 翱捷科技股份有限公司 | HEVC sub-pixel motion estimation method and device |
| CN113489988A (en) * | 2021-06-11 | 2021-10-08 | 翱捷科技股份有限公司 | HEVC integer pixel motion estimation method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100568952C (en) | 2009-12-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100568952C (en) | Based on real-time fine granular scalability method H.264 | |
| CN100348051C (en) | An enhanced in-frame predictive mode coding method | |
| CN101835042B (en) | Wyner-Ziv video coding system controlled on the basis of non feedback speed rate and method | |
| CN100401789C (en) | Quick selection of prediction modes in H.264/AVC frame | |
| CN102025995B (en) | Spatial enhancement layer rapid mode selection method of scalable video coding | |
| CN103634606B (en) | Video encoding method and apparatus | |
| CN1323555C (en) | Quick selecting method for H.264/AVC multiple reference frame | |
| CN106961610B (en) | Novel super-high-definition video compression framework combined with super-resolution reconstruction | |
| CN106791848B (en) | Two-Pass code rate control method based on HEVC | |
| CN104333754B (en) | Based on the SHVC enhancement-layer video coding methods that predictive mode is quickly selected | |
| CN106101709B (en) | A kind of Primary layer inter-frame prediction method of SHVC quality scalability that combining enhancement layer | |
| CN108471531B (en) | Quality gradable rapid coding method based on compressed sensing | |
| CN107071422A (en) | Low complex degree HEVC rate adaption transformation coding methods based on image correlation model | |
| Schroeder et al. | Block structure reuse for multi-rate high efficiency video coding | |
| CN1194544C (en) | Video encoding method based on prediction time and space domain conerent movement vectors | |
| CN101179729A (en) | Interframe mode statistical classification based H.264 macroblock mode selecting method | |
| CN101115200A (en) | Effective motion vector telescopic encoding method | |
| CN100586185C (en) | Mode selection method for transcoding 264 video to reduce resolving capability | |
| CN115002482B (en) | End-to-end video compression method and system using structural preserving motion estimation | |
| CN105791868A (en) | Video coding method and equipment | |
| Schroeder et al. | Multi-rate encoding for HEVC-based adaptive HTTP streaming with multiple resolutions | |
| CN100515088C (en) | A SVC smooth reconstruction method based on rate distortion function analysis module | |
| CN101277449A (en) | Method for transferring code of pixel field capable of reducing resolution with random proportion for 264 video | |
| Wang et al. | Off-line motion description for fast video stream generation in MPEG-4 AVC/H. 264 | |
| KR100718468B1 (en) | Method and device for video down-sampling transcoding |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20091209 Termination date: 20120329 |