CN105847796A - Bit distribution method and device used for video coding - Google Patents

Bit distribution method and device used for video coding Download PDF

Info

Publication number
CN105847796A
CN105847796A CN201610201011.5A CN201610201011A CN105847796A CN 105847796 A CN105847796 A CN 105847796A CN 201610201011 A CN201610201011 A CN 201610201011A CN 105847796 A CN105847796 A CN 105847796A
Authority
CN
China
Prior art keywords
frame
bit number
sub
gop
takies
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.)
Pending
Application number
CN201610201011.5A
Other languages
Chinese (zh)
Inventor
蔡砚刚
白茂生
杨帆
祁海
刘阳
魏伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
LeTV Holding Beijing Co Ltd
LeTV Cloud Computing Co Ltd
Original Assignee
LeTV Holding Beijing Co Ltd
LeTV Cloud Computing Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by LeTV Holding Beijing Co Ltd, LeTV Cloud Computing Co Ltd filed Critical LeTV Holding Beijing Co Ltd
Priority to CN201610201011.5A priority Critical patent/CN105847796A/en
Publication of CN105847796A publication Critical patent/CN105847796A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H04N19/114—Adapting the group of pictures [GOP] structure, e.g. number of B-frames between two anchor frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/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/115—Selection of the code volume for a coding unit prior to coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • 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
    • 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/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

The invention discloses a bit distribution method and device used for video coding. The method comprises: setting a target code rate and target frame rate of video streaming; dividing the video screaming into one or more than one group of pictures (GOP) according to preset rules; calculating the frame occupation bits of each coding frame in the GOP, and calculating first average bits averagely occupied by the coding frame in the GOP according to the frame occupation bits; and calculating second average bits averagely occupied by the coding frame of the video streaming in unit time according to the target code rate and target frame rate, and distributing bits for the coding frame in the GOP based on the first average bits and the second average bits. The bit distribution method and device distribute bits in coding for each frame according to the frame occupation bits of each frame in the GOP and by employing a preset average allocation algorithm, thereby improving video compression quality, watching quality, and coding efficiency, and saving coding time.

Description

A kind of Bit distribution method for Video coding and device
Technical field
The present invention relates to technical field of video coding, particularly to a kind of bit distribution side for Video coding Method and device.
Background technology
At present, the video encoding standard that on market, Video coding based on software is applied is mainly HEVC (High Efficiency Video Coding) video encoding standard etc..For HEVC video encoding standard, Relatively the most H.264 and AVS video encoding standard it has higher compression performance, and HEVC is relative to always Generation coding standard is H.264 and its computational complexity of AVS video encoding standard is greatly improved the most relatively. Each pixel of HEVC video image can reduce this picture by relative pixel prediction The redundancy of element.The Predicting Technique of HEVC image/video coding is divided into infra-frame prediction (Intra-prediction) With inter prediction (Inter-prediction).Inter prediction be divided into again according to prediction direction forward prediction and Bi-directional predicted.As it is shown in figure 1, be referred to as I (Intra) frame with the two field picture of intraframe predictive coding, with front It is referred to as P frame to the two field picture of predictive coding, is referred to as B frame with the two field picture of bi-directional predictive coding.? In video compress, the dynamics of Normal squeezing is the biggest, and video quality will be the poorest, and the volume of video is also Corresponding the least.Key modules indispensable during Rate Control is video encoder in video compression, one As require that the mean value of the volume that its frame of video takies is constant within a period of time, say, that Within a period of time, the bit number that some frame of video take is many, the bit that some frame of video take Number is few.At present, in Video coding for how the actual bit number taken of the every frame of reasonable distribution Mesh does not also have good method, owing in video, frame takies bit number number and arranges unreasonable so that The quality of image is affected, and affects the susceptibility of user.
Summary of the invention
In view of this, it is an object of the invention to propose a kind of Bit distribution method for Video coding and dress Put.
Based on above-mentioned purpose, the present invention provides a kind of Bit distribution method for Video coding, including: set Put target bit rate and the target frame rate of video flowing；According to default rule, described video flowing is divided into one Individual or multiple image sets GOP；The frame calculating each coded frame in described GOP takies bit number, And take that number of bits calculates that the coded frame in described GOP averagely takies according to described frame first Average number of bits；Calculate within the unit interval described according to described target bit rate and described target frame rate The second average number of bits that the coded frame of video flowing averagely takies, and based on the described first average bit Number and described second average number of bits are the coded frame distribution bit number in described GOP；Wherein, institute State the coded frame in GOP and include one or more in I frame, P frame and B frame.
Alternatively, described according to default rule, described video flowing is divided into one or more GOP Including using the I frame in described video flowing or P frame as segmentation frame；By one in described video flowing B frame between segmentation frame and this segmentation frame and next segmentation frame is combined as a GOP.
Alternatively, the frame of the described each coded frame calculated successively in described GOP takies bit number bag Include: obtain and be close to the P frame P1 in described GOP and be positioned at a P frame of described P1 forward direction P0；Calculate the difference of each pixel numerical value of described P1 and described P0, generate residual block R1；Right Described R1 carries out Hadamard transform, generates the first residual matrix；Calculate in described first residual matrix each The absolute value sum of individual element, it is thus achieved that the first frame takies bit number；The frame of described P1 is taken bit Number is set to described first frame and takies bit number.
Alternatively, described R1 carries out Hadamard transform to generate the first residual matrix, calculate described first The absolute value sum of each element in residual matrix, obtain the first frame and take bit number and include: giving birth to After becoming described R1, based on default relic cutting unit, described R1 is divided into multiple first sub-residual error Block；The plurality of first sub-residual block is carried out Hadamard transform, generates multiple first sub-residual matrix； Calculate the absolute value sum of each element in the plurality of first sub-residual matrix, it is thus achieved that multiple first sons Block takies bit number；The plurality of first sub-block takies bit number be added, it is thus achieved that described first frame Take bit number.
Alternatively, the frame of the described each coded frame calculated successively in described GOP takies bit number bag Include: obtain and be close to the B frame B1 in described GOP and be positioned at a P of described B1 forward direction Frame P2, obtains and is close to the B frame B1 in described GOP and is positioned at backward for described B a P Frame P3；Calculate the difference of each pixel numerical value of described B1 and described P2, generate residual block R2； Calculate the difference of each pixel numerical value of described B1 and described P3, generate residual block R3；Judge institute State the absolute value sum of each element in R2 whether absolute less than each element in described R3 Value sum；If it is, described R2 is carried out Hadamard transform, generate the second residual matrix；Calculate The absolute value sum of each element in described second residual matrix, it is thus achieved that the second frame takies bit number, The frame of described B1 takies bit number be set to described second frame and take bit number；If it is not, then it is right Described R3 carries out Hadamard transform, generates the 3rd residual matrix；Calculate in described 3rd residual matrix each The absolute value sum of individual element, it is thus achieved that the 3rd frame takies bit number；The frame of described B1 is taken bit Number is set to the 3rd frame and takies bit number.
Alternatively, also include: based on default relic cutting unit, described R2 or described R3 is split For multiple second sub-residual blocks or multiple 3rd sub-residual block；To the plurality of second sub-residual block or The plurality of 3rd sub-residual block carries out Hadamard transform, generates multiple second sub-residual matrix or multiple Three sub-residual matrixes；Calculate the absolute value sum of each element in the plurality of second sub-residual matrix, Obtain multiple second sub-block and take bit number, the plurality of second sub-block is taken bit number and is added, Obtain described second frame and take bit number；Or calculate each element in the plurality of 3rd sub-residual matrix Absolute value sum, it is thus achieved that multiple 3rd sub-blocks take bit number, the plurality of 3rd sub-block are accounted for It is added with bit number, it is thus achieved that described 3rd frame takies bit number.
Alternatively, the frame of the described each coded frame calculated successively in described GOP takies bit number bag Include: the frame of I frame in described GOP is taken bit number and is set to the frame of B frame in this GOP and takies 2 times of bit number maximum.
Alternatively, described is institute based on described first average number of bits and described second average number of bits State the distribution bit number of each coded frame in GOP to include: calculate the frame of coded frame in described GOP Take the mean value of bit number, this mean value is set to described first average number of bits AF；By institute State target bit rate and obtain described second average number of bits AB divided by described target frame rate；By described GOP In the frame of coded frame take bit number and be multiplied by described AB and divided by described AF, it is thus achieved that encode for this The bit number of frame distribution.
Alternatively, the form of described video flowing includes: HEVC.
According to another aspect of the present invention, the present invention provides a kind of bit for Video coding to distribute dress Put, including: parameter setting module, for arranging target bit rate and the target frame rate of video flowing；Image sets Segmentation module, for being divided into one or more image sets according to default rule by described video flowing GOP；Take bit number computing module, account for for calculating the frame of each coded frame in described GOP Use bit number；Bits allocation module, calculates described for taking number of bits according to described frame The first average number of bits that coded frame in GOP averagely takies, according to described target bit rate and described mesh Mark frame per second calculates the second average specific that the coded frame of described video flowing within the unit interval averagely takies Special number, and be in described GOP based on described first average number of bits and described second average number of bits Coded frame distribution bit number；Wherein, the coded frame in described GOP includes I frame, P frame and B One or more in frame.
Alternatively, described image sets segmentation module is specifically for by the I frame in described video flowing or P frame As segmentation frame, in described video flowing is split frame and this segmentation frame and next segmentation B frame between frame is combined as a GOP.
Alternatively, described in take bit number computing module, including residual block acquiring unit, be used for Obtain and be close to the P frame P1 in described GOP and be positioned at a P frame P0 of described P1 forward direction, Calculate the difference of each pixel numerical value of described P1 and described P0, generate residual block R1；Hadamard Converter unit, for described R1 is carried out Hadamard transform, generates the first residual matrix；Bit number obtains Take unit, for calculating the absolute value sum of each element in described first residual matrix, it is thus achieved that the One frame takies bit number, the frame of described P1 takies bit number and is set to described first frame and takies bit Number.
Alternatively, described residual block acquiring unit, it is additionally operable to after generating described R1, based on presetting Relic cutting unit described R1 is divided into multiple first sub-residual block；Described Hadamard transformation element, It is additionally operable to carry out Hadamard transform to the plurality of first sub-residual block, generates multiple first sub-residual error square Battle array；Described bit number acquiring unit, is additionally operable to calculate each yuan in the plurality of first sub-residual matrix The absolute value sum of element, it is thus achieved that multiple first sub-blocks take bit number；By the plurality of first sub-block Take bit number to be added, it is thus achieved that described first frame takies bit number.
Alternatively, described residual block acquiring unit, for obtaining and the B frame B1 in described GOP It is close to and is positioned at a P frame P2 of described B1 forward direction, obtain and the B frame B1 in described GOP It is close to and is positioned at backward for described B a P frame P3；Calculate each of described B1 and described P2 The difference of pixel numerical value, generates residual block R2；Calculate each pixel of described B1 and described P3 The difference of numerical value, generates residual block R3；The absolute value sum judging each element in described R2 is The no absolute value sum less than each element in described R3；If described residual block acquiring unit is sentenced It is yes for breaking, and the most described Hadamard transformation element carries out Hadamard transform to described R2, generates the second residual error Matrix；Described bit number acquiring unit calculate in described second residual matrix the absolute value of each element it With, it is thus achieved that the second frame takies bit number, the frame of described B1 is taken bit number and is set to described second Frame takies bit number；If described residual block acquiring unit is judged as NO, the most described Hadamard transform list Unit carries out Hadamard transform to described R3, generates the 3rd residual matrix；Described bit number acquiring unit meter Calculate the absolute value sum of each element in described 3rd residual matrix, it is thus achieved that the 3rd frame takies bit number； The frame of described B1 takies bit number be set to the 3rd frame and take bit number.
Alternatively, described residual block acquiring unit, it is additionally operable to institute based on default relic cutting unit State R2 or described R3 and be divided into multiple second sub-residual block or multiple 3rd sub-residual block；Described Kazakhstan Reach code conversion unit, be additionally operable to residual to the plurality of second sub-residual block or the plurality of 3rd son respectively Difference block carries out Hadamard transform, generates multiple second sub-residual matrix or multiple 3rd sub-residual matrix；Institute State bit number acquiring unit, be additionally operable to calculate the exhausted of each element in the plurality of second sub-residual matrix Value sum is obtained multiple second sub-blocks and takies bit number, the plurality of second sub-block is taken bit Number is added described second frame of acquisition and takies bit number；Or, calculate the plurality of 3rd sub-residual matrix In the absolute value sum of each element obtain multiple 3rd sub-blocks and take bit number, by the plurality of the Three sub-blocks take bit number addition described 3rd frame of acquisition and take bit number.
Alternatively, described in take bit number computing module, be additionally operable to the frame of I frame in described GOP Take bit number to be set to the frame of B frame in this GOP and take 2 times of bit number maximum.
Alternatively, described bits allocation module, account for for calculating the frame of coded frame in described GOP With the mean value of bit number, this mean value is set to described first average number of bits AF；By described Target bit rate obtains described second average number of bits AB divided by described target frame rate；By in described GOP The frame of coded frame take bit number and be multiplied by described AB and divided by described AF, it is thus achieved that for this coded frame The bit number of distribution.
The Bit distribution method for Video coding of the present invention and device, lean on most with reference to forward direction according to P frame Its P frame nearly, B frame with reference to forward direction P frame and backward P frame calculates P frame respectively, the frame of B frame takies Bit number, and the frame that the frame of I frame is taken the B frame that bit number is set in same GOP take several Big value, frame based on each frame in GOP takies bit number and uses the mean allocation algorithm preset to be Each frame distribution in GOP bit number in coding, can improve video compress quality and viewing matter Amount, it is possible to improve code efficiency, saves the scramble time.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to enforcement In example or description of the prior art, the required accompanying drawing used is briefly described, it should be apparent that, retouch below Accompanying drawing in stating is only some embodiments of the present invention, for those of ordinary skill in the art, not On the premise of paying creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the prediction principle schematic diagram of I frame in prior art, P frame and B frame；
Fig. 2 is the flow process of an embodiment of the Bit distribution method for Video coding according to the present invention Schematic diagram；
Fig. 3 is the module of an embodiment of the bit allocation for Video coding according to the present invention Schematic diagram；
Fig. 4 is according to taking bit number calculating mould in the bit allocation for Video coding of the present invention The module diagram of one embodiment of block.
Detailed description of the invention
For making the object, technical solutions and advantages of the present invention clearer, below in conjunction with specific embodiment, And referring to the drawings, the present invention is described in more detail.
It should be noted that the statement of all uses " first " and " second " is in the embodiment of the present invention Distinguish the entity of two same names non-equal or the parameter of non-equal, it is seen that " first " " second " only for The convenience of statement, should not be construed as the restriction to the embodiment of the present invention, and this is said by subsequent embodiment the most one by one Bright.
Fig. 2 is the flow process of an embodiment of the Bit distribution method for Video coding according to the present invention Schematic diagram, as shown in Figure 2:
Step 101, arranges target bit rate and the target frame rate of video flowing.
Such as, the target bit rate of video flowing is B, and unit is bits per second, is current video The levelling bit number taken the most per second is B.The target frame rate of video flowing is F, and unit is frames per Second, the number of the frame of video of viewing in i.e. a second.
Step 102, is divided into one or more image sets GOP according to default rule by video flowing. GOP is made up of multiple continuous print frames, and the coded frame in GOP includes in I frame, P frame and B frame One or more.The form of video flowing includes: HEVC, H.26X etc..
Step 103, the frame calculating each coded frame in GOP takies bit number, and accounts for according to frame The first average number of bits that the coded frame calculated in GOP with number of bits averagely takies.
Step 104, calculates the volume of video flowing within the unit interval according to target bit rate and target frame rate The second average number of bits that code frame averagely takies, and based on the first average number of bits and the second average specific Special number is the coded frame distribution bit number in GOP.
The Bit distribution method for Video coding in above-described embodiment, it is proposed that a kind of quickly HEVC Bit allocation scheme, the viewing quality of video can be improved, it is possible to improve code efficiency, save Scramble time.
According to multiple default rule, video flowing can be divided into one or more GOP.Such as, will I frame in video flowing or P frame are as segmentation frame, by a segmentation frame in video flowing and this point The B frame cut between frame and next segmentation frame is combined as a GOP.Such as, video is currently extracted Frame in stream is IBBPBBPBIBBP, can be divided into 5 GOP, GOP according to above-mentioned method Interior frame sequence is respectively as follows: IBB, PBB, PB, IBB and P.
The frame that multiple method can be used to calculate each coded frame in GOP takies bit number.Regarding In frequency compression, every frame represents a static image, needs the capacity taking various algorithm to reduce data.I Frame is key frame, belongs to frame data compression, and P is the meaning searched for forward, and B is bidirectional research.I frame decoding Time have only to these frame data and just can complete, what P frame represented is this frame with before a key frame (or P frame) difference, need to be superimposed with the picture that caches before the difference of this frame definition during decoding, generate Whole picture.
P frame does not has complete picture data, only with the data of the picture difference of former frame.B frame is two-way difference Other frame, record is this frame and the difference of frame front and back, during decoding B frame, the caching before not only obtaining Picture, the picture after also decoding, obtain final picture by front and back's picture with superposing of these frame data Face.
B frame recording is the difference of before and after's frame, can save more space than P frame, and B frame also contains picture in fact Surface information.Therefore, when distributing, for P frame and B frame, the bit taken, P frame only with reference to above near Its P frame, B frame is with P frame above and P frame below as reference frame.
In one embodiment, acquisition is close to the P frame P1 in GOP and is positioned at P1 forward direction One P frame P0.Calculate the difference of each pixel numerical value of P1 Yu P0, generate residual block R1.Right R1 carries out Hadamard transform, generates the first residual matrix, calculates each element in the first residual matrix Absolute value sum, it is thus achieved that the first frame takies bit number, takies bit number by the frame of P1 and is set to first Frame takies bit number.
In Video coding, coding unit can be different from the form of relic cutting unit, such as, Coding unit can be the matrix etc. of 8 × 8,16 × 16, and relic cutting unit can be 4 × 4 matrixes etc.. The matrix that the difference of each pixel numerical value of P1 Yu P0 is formed can be single according to concrete relic segmentation Unit, carries out splitting or not splitting, and forms the P1 residual block relative to P0.
Such as, after generating R1, based on default relic cutting unit, R1 is split, segmentation For multiple first sub-residual blocks.Hadamard (Hadamard) matrix is that be made up of+1 and-1 element and full The n rank square formation of foot Hn*Hn '=nI (Hn ' be the transposition of Hn, I is unit square formation).Based on Hadamard square Battle array carries out Hadamard transform to the first sub-residual block, generates multiple first sub-residual matrix, calculates multiple the The absolute value sum of each element in one sub-residual matrix, it is thus achieved that multiple first sub-blocks take bit number, Multiple first sub-blocks take bit number be added, it is thus achieved that the first frame takies bit number.
Such as, as a example by the frame sequence extracted from video data, obtain from video flowing P0BBP1B1B2P2 frame sequence, by above-mentioned method segmentation GOP, in the 2nd GOP P1 frame, with reference to the P0 frame before it, then has the frame for P1 frame to take bit number by following formula 1.1 Can obtain.
F r a m e cos t P ( P 1 , P 0 ) = Σ i = 0 n cos t ( R i ) ; - - - ( 1.1 )
Calculate the difference of P1 frame and each pixel numerical value of P0 frame, generate 8 × 8 matrixes, in matrix Each element be the difference of the pixel numerical value in this position of P1 frame and P0 frame.Relic is split The form of unit is 4 × 4 matrixes, based on relic cutting unit by 8 × 8 Factorization algorithm is 4x4 4 Individual sub-block.
The wherein R in 1.1 formulasiIt is the 4x4 sub-block that is divided into of the residual block (P1 frame-P0 frame) of two non-B frames, N is the number of 4x4 sub-block, and n is 4.The sub-block of the most each 4x4 sub-block takies bit number:HAD be R after Hadamard transform the absolute value of coefficient and. The frame that calculate 4 sub-blocks take bit number addition acquisition P0 frame takies bit number.
In one embodiment, forward and backward P frame is then taken for B frame as reference.Such as, Obtain and be close to and be positioned at a P frame P2 of B1 forward direction with the B frame B1 in GOP, obtain and B frame B1 in GOP is close to and is positioned at backward for B a P frame P3.Calculate B1 and P2 The difference of each pixel numerical value, generate residual block R2；Calculate each pixel number of B1 Yu P3 The difference of value, generates residual block R3.
Judge the absolute value sum of each element in R2 whether exhausted less than each element in R3 To value sum；If it is, R2 is carried out Hadamard transform, generate the second residual matrix；Calculate the The absolute value sum of each element in two residual matrixes, it is thus achieved that the second frame takies bit number, by B1's Frame takies bit number and is set to the second frame and takies bit number.
If it is not, then R3 to be carried out Hadamard transform, generate the 3rd residual matrix；Calculate the 3rd residual error The absolute value sum of each element in matrix, it is thus achieved that the 3rd frame takies bit number；The frame of B1 is taken Bit number is set to the 3rd frame and takies bit number, the frame of B1 takies bit number and is set to the second frame and accounts for The smaller in bit number is taken with bit number and the 3rd frame.
In Video coding, coding unit can be different from relic cutting unit.B1's with P2 is each The matrix that the difference of individual pixel numerical value generates, and the bad student of each pixel numerical value of B1 Yu P3 The matrix become can carry out splitting or not splitting.Such as, after generating R2, R3, based in advance If relic cutting unit respectively R2, R3 are divided into multiple second sub-residual block, multiple 3rd son Residual block.
Respectively multiple second sub-residual blocks and multiple 3rd sub-residual block are carried out Hadamard transform, generate Multiple second sub-residual matrixes and multiple 3rd sub-residual matrix.Calculate in multiple second sub-residual matrix each The absolute value sum of individual element, it is thus achieved that multiple second sub-blocks take bit number, by multiple second sub-blocks Take bit number to be added, it is thus achieved that the second frame takies bit number.Calculate in multiple 3rd sub-residual matrix each The absolute value sum of individual element, it is thus achieved that multiple 3rd sub-blocks take bit number, by multiple 3rd sub-blocks Take bit number to be added, it is thus achieved that the 3rd frame takies bit number.
Such as, when the frame carrying out B frame takies bit calculating, following 1.2 formulas:
F r a m e cos t B ( P 1 , B i , P 2 ) = Σ i = 0 n cos t ( R i ) - - - ( 1.2 )
In 1.2 formulas, P1 frame, P2 frame is BiThe P frame of forward, backward, when calculating, Ri in 1.2 formulas can be chosen by following formula:
R ( x , y ) = { B i ( x , y ) - P 1 ( x , y ) , a b s ( B i ( x , y ) - P 1 ( x , y ) ) < = a b s ( B i ( x , y ) - P 2 ( x , y ) ) B i ( x , y ) - P 2 ( x , y ) , a b s ( B i ( x , y ) - P 1 ( x , y ) ) > a b s ( B i ( x , y ) - P 2 ( x , y ) ) ;
Judge to calculate BiEach element in the matrix formed with the difference of each pixel numerical value of P1 frame The sum of absolute value, if more than BiWith in the difference generator matrix of each pixel numerical value of P2 frame each The sum of the absolute value of element, if it is, take the residual block of B1 Yu P2, if it is not, then take B1 With the residual block of P1, i.e. select BiDifference formation with P1 frame, each pixel numerical value of P2 frame The P frame that in matrix, the absolute value sum of each element is less.
In one embodiment, acquisition is close to the P frame P1 in GOP and is positioned at P1 forward direction One P frame P0, the frame calculating P1 takies bit number FramecostP (P0, P1).
First, calculate P1 Yu P0 residual error R, pixel each for P0 and P1 frame we represent P0 (x, y) P1 (x, y), its height be h, width is w, then R (x, y)=P1 (and x, y)-P0 (x, y).I.e. calculate P1 and P0 The difference of each pixel numerical value, generate the matrix of 8 × 8:
- 1 - 5 - 2 - 3 - 7 - 4 - 3 - 8 - 4 - 4 - 1 - 2 - 6 - 8 - 9 - 5 - 2 - 3 - 5 - 4 - 5 - 8 - 7 - 4 2 - 3 - 2 - 3 - 6 - 2 0 1 1 - 1 - 5 - 7 - 5 - 6 - 4 - 3 0 - 5 - 8 - 3 - 5 - 1 - 1 - 5 - 3 - 9 - 3 - 5 - 5 - 5 - 8 - 7 - 10 - 2 2 - 3 - 5 - 7 - 6 1 .
Form based on relic cutting unit is the transformation matrix of 4 × 4, and R is divided into 4 4x4 sub-blocks Ri, The residual error sub-block (matrix) of i.e. 4 4x4, as follows:
- 1 - 5 - 2 - 3 - 4 - 4 - 1 - 2 - 2 - 3 - 5 - 4 2 - 3 - 2 - 3 - 7 - 4 - 3 - 8 - 6 - 8 - 9 - 5 - 5 - 8 - 7 - 4 - 6 - 2 0 1 1 - 1 - 5 - 7 0 - 5 - 8 - 3 - 3 - 9 - 3 - 5 - 10 - 2 2 - 3 - 5 - 6 - 4 - 3 - 5 - 1 - 1 - 5 - 5 - 5 - 8 - 7 - 5 - 7 - 6 1 .
Calculate 4 4x4 sub-blocks RiBy the value of Hadamard transform: HAD (R), to each 4x4 sub-block Ri Make Hadamard transform:
H A D ( R i ) = 1 1 1 1 1 1 - 1 - 1 1 - 1 - 1 1 1 - 1 1 - 1 R i 1 1 1 1 1 1 - 1 - 1 1 - 1 - 1 1 1 - 1 1 - 1 .
For first 4x4 sub-block by the value of Hadamard transform it is such as:
H A D ( R 0 ) = 1 1 1 1 1 1 - 1 - 1 1 - 1 - 1 1 1 - 1 1 - 1 * - 1 - 5 - 2 - 3 - 4 - 4 - 1 - 2 - 2 - 3 - 5 - 4 2 - 3 - 2 - 2 * - 42 2 8 12 - 2 - 14 - 4 0 8 4 6 10 - 8 4 2 - 2 .
Then the sub-block of first 4x4 sub-block of current residual block takies bit number cost and isCalculate other 3 4x4 sub-blocks in the same manner The sub-block of sub-block takies bit number.
Based on formulaThe sub-block of sub-block of 4x4 sub-block will take bit number It is added, it is thus achieved that the first frame of P1 frame takies bit number.The frame of B frame takies bit number and above-mentioned P1 The computational methods that first frame of frame takies bit number are essentially identical, are only when choosing reference, choose The less P frame of each element absolute value sum in residual matrix is as reference frame.
For I frame, the frame of I frame in GOP can be taken bit number and be set to B frame in this GOP Frame 2 times that take bit number maximum etc., for example, it is also possible to be 3,4 times etc..Calculate GOP The frame of middle coded frame takies the mean value of bit number, and this mean value is set to the first average number of bits AF, obtains the second average number of bits AB by target bit rate divided by target frame rate, by the coding in GOP The frame of frame takies bit number and is multiplied by AB and divided by AF, it is thus achieved that the bit number distributed for this coded frame.
Such as, the frame taking current GOP takies the mean value AF of bit number framecost.Such as when Front GOP is: IB1B2, and the frame having the I frame in 3 frames, i.e. these 3 frames takies bit number Framecost_I=2*Max (Framecost_B1, Framecost_B2)；AF=(Framecost_I+ Framecost_B1+Framecost_B2)/3。
Taking the current average often bit number AB=B/F, B that frame takies is current target bit rate, The target frame rate that F is current.To 3 frame distribution bit numbers: distribute bit number: B_I=to I frame Framecost_I*AB/AF.Bit number: B_B1=Framecost_B1*AB/AF is distributed to B1 frame, Bit number: B_B1=Framecost_B2*AB/AF is distributed to B2 frame.
Based on the Bit distribution method for Video coding in above-described embodiment, by by video flowing I frame or P frame as segmentation frame and by the B frame between segmentation frame and itself and next segmentation frame Being combined as GOP, P frame with reference to above near its P frame, B frame is with reference to P frame above and below P frame, calculating P frame, the frame of B frame take bit number respectively, and it is same GOP that the frame of I frame takies bit number In the frame of B frame take several maximums, and the mean allocation algorithm through presetting is each in GOP Frame distribution bit number in coding, can improve the viewing quality of video, it is possible to improve code efficiency, Save the scramble time.
In one embodiment, as shown in Figure 3,4, a kind of bit for Video coding of the present invention distributes Device 20.Parameter setting module 21 arranges target bit rate and the target frame rate of video flowing.Image sets is split Video flowing is divided into one or more image sets GOP according to default rule by module 22.At one In embodiment, image sets segmentation module 22 specifically for using the I frame in video flowing or P frame as segmentation Frame, by a segmentation frame in video flowing and the B frame between this segmentation frame and next segmentation frame It is combined as a GOP.
Take bit number computing module 23 to calculate the frame of each coded frame in GOP and take bit number. Bits allocation module 24 takies, according to frame, the coded frame that number of bits calculates in GOP and averagely accounts for The first average number of bits, calculate video within the unit interval according to target bit rate and target frame rate The second average number of bits that the coded frame of stream averagely takies, and based on the first average number of bits and second Average number of bits is the coded frame distribution bit number in GOP.
As shown in Figure 4, take bit number computing module 23 to include: residual block acquiring unit 231, Hadamard transformation element 232 and bit number acquiring unit 233.Residual block acquiring unit 231 obtain with P frame P1 in GOP is close to and is positioned at a P frame P0 of P1 forward direction, calculates P1 and P0 The difference of each pixel numerical value, generate residual block R1.
Hadamard transformation element 232 carries out Hadamard transform to R1, generates the first residual matrix.Bit Number acquiring unit 233 calculates the absolute value sum of each element in the first residual matrix, it is thus achieved that first Frame takies bit number, the frame of P1 takies bit number and is set to the first frame and takies bit number.
Residual block acquiring unit 231 can be after generating R1, will based on default relic cutting unit R1 is divided into multiple first sub-residual block.Hadamard transformation element 232 is to multiple first sub-residual blocks Carry out Hadamard transform, generate multiple first sub-residual matrix.Bit number acquiring unit 233 calculates multiple The absolute value sum of each element in first sub-residual matrix, it is thus achieved that multiple first sub-blocks take bit number, Multiple first sub-blocks take bit number be added, it is thus achieved that the first frame takies bit number.
In one embodiment, when the frame calculating B frame takies bit number, residual block acquiring unit 231 acquisitions are close to and are positioned at a P frame P2 of B1 forward direction with the B frame B1 in GOP, obtain It is close to the B frame B1 in GOP and is positioned at backward for B a P frame P3；Residual block obtains single Unit 231 calculates the difference of each pixel numerical value of B1 Yu P2, generates residual block R2；Residual block obtains Take the difference that unit 231 calculates each pixel numerical value of B1 Yu P3, generate residual block R3；Residual error It is every that block acquiring unit 231 judges whether the absolute value sum of each element in R2 is less than in R3 The absolute value sum of individual element.
If residual block acquiring unit 231 is judged as YES, then R2 is carried out by Hadamard transformation element 232 Hadamard transform, generates the second residual matrix；Bit number acquiring unit 233 calculates the second residual matrix In the absolute value sum of each element, it is thus achieved that the second frame takies bit number, and the frame of B1 is taken bit Number is set to the second frame and takies bit number.
If residual block acquiring unit 231 is judged as NO, then R3 is carried out by Hadamard transformation element 232 Hadamard transform, generates the 3rd residual matrix；Bit number acquiring unit 233 calculates the 3rd residual matrix In the absolute value sum of each element, it is thus achieved that the 3rd frame takies bit number；The frame of B1 is taken bit Number is set to the 3rd frame and takies bit number.
R2 or R3 is divided into respectively by residual block acquiring unit 231 based on default relic cutting unit Multiple second sub-residual blocks or multiple 3rd sub-residual block.Hadamard transformation element 232 is respectively to multiple Second sub-residual block or multiple 3rd sub-residual block carry out Hadamard transform, generate multiple second sub-residual error Matrix or multiple 3rd sub-residual matrix.
Bit number acquiring unit 233 calculate in multiple second sub-residual matrix the absolute value of each element it Take bit number with obtaining multiple second sub-blocks, multiple second sub-blocks are taken bit number and is added acquisition Second frame takies bit number；Bit number acquiring unit 233 calculates in multiple 3rd sub-residual matrix each The absolute value sum of element obtains multiple 3rd sub-blocks and takies bit number, multiple 3rd sub-blocks is taken Bit number is added acquisition the 3rd frame and takies bit number.
In one embodiment, take bit number computing module 23 and the frame of I frame in GOP is taken ratio Special number is set to the frame of B frame in this GOP and takies 2 times of bit number maximum.
Bits allocation module 24 calculates the frame of coded frame in GOP and takies the mean value of bit number, This mean value is set to the first average number of bits AF；Target bit rate is removed by bits allocation module 24 The second average number of bits AB is obtained with target frame rate；The frame of the coded frame in GOP is taken bit number It is multiplied by AB and divided by AF, it is thus achieved that the bit number distributed for this coded frame.
The Bit distribution method for Video coding of above-described embodiment offer and device are logical according to P frame ginseng Face calculates P frame, B near its P frame, B frame respectively with reference to P frame above and P frame below before examination The frame of frame takies bit number, and the frame of I frame takies the frame that bit number is B frame in same GOP and takies several Maximum, and be that each frame in GOP distributes the bit in coding through default mean allocation algorithm Number, can improve the viewing quality of video.
Those of ordinary skill in the field it is understood that the discussion of any of the above embodiment is exemplary only, It is not intended to imply that the scope of the present disclosure (including claim) is limited to these examples；Think of in the present invention Under road, can also be combined between the technical characteristic in above example or different embodiment, step can With with random order realize, and exist the present invention as above different aspect many other change, for Simple and clear they do not provide in the details.
It addition, for simplifying explanation and discussing, and in order to obscure the invention, provided Accompanying drawing can illustrate or can not illustrate and integrated circuit (IC) chip and the known power supply of other parts / grounding connection.Furthermore, it is possible to illustrate device in block diagram form, in order to avoid obscuring the invention, And this have also contemplated that following facts, i.e. the details about the embodiment of these block diagram arrangements is highly to depend on In will implement the present invention platform (that is, these details should be completely in the reason of those skilled in the art In the range of solution).Elaborating that detail (such as, circuit) is to describe the exemplary embodiment of the present invention In the case of, it will be apparent to those skilled in the art that can there is no these details In the case of or these details change in the case of implement the present invention.Therefore, these descriptions should be recognized For being illustrative and not restrictive.
Although invention has been described to have been incorporated with the specific embodiment of the present invention, but according to above Description, these embodiments a lot of replace, amendment and modification will be for those of ordinary skills Obviously.Such as, other memory architecture (such as, dynamic ram (DRAM)) can use The embodiment discussed.
Embodiments of the invention be intended to fall within the broad range of claims all so Replacement, amendment and modification.Therefore, all within the spirit and principles in the present invention, any omission of being done, Amendment, equivalent, improvement etc., should be included within the scope of the present invention.

Claims (17)

1. the Bit distribution method for Video coding, it is characterised in that including:
Target bit rate and the target frame rate of video flowing are set；
According to default rule, described video flowing is divided into one or more image sets GOP；
The frame calculating each coded frame in described GOP takies bit number, and takies according to described frame Number of bits calculates the first average number of bits that the coded frame in described GOP averagely takies；
Described video flowing within the unit interval is calculated according to described target bit rate and described target frame rate The second average number of bits that coded frame averagely takies, and based on described first average number of bits and described Second average number of bits is the coded frame distribution bit number in described GOP；
Wherein, one or more during the coded frame in described GOP includes I frame, P frame and B frame.
2. the method for claim 1, it is characterised in that described according to default rule general Described video flowing is divided into one or more GOP and includes:
Using the I frame in described video flowing or P frame as segmentation frame；
By a segmentation frame in described video flowing and between this segmentation frame and next segmentation frame B frame is combined as a GOP.
3. method as claimed in claim 2, it is characterised in that described calculate described GOP successively In the frame of each coded frame take bit number and include:
Obtain and be close to the P frame P1 in described GOP and be positioned at a P frame of described P1 forward direction P0；
Calculate the difference of each pixel numerical value of described P1 and described P0, generate residual block R1；
Described R1 is carried out Hadamard transform, generates the first residual matrix；
Calculate the absolute value sum of each element in described first residual matrix, it is thus achieved that the first frame takies Bit number；
The frame of described P1 takies bit number be set to described first frame and take bit number.
4. method as claimed in claim 3, it is characterised in that described R1 is carried out Hadamard Conversion generate the first residual matrix, calculate the absolute value sum of each element in described first residual matrix, Obtain the first frame to take bit number and include:
Generating after described R1, based on default relic cutting unit, described R1 is being divided into multiple the One sub-residual block；
The plurality of first sub-residual block is carried out Hadamard transform, generates multiple first sub-residual matrix；
Calculate the absolute value sum of each element in the plurality of first sub-residual matrix, it is thus achieved that Duo Ge One sub-block takies bit number；
The plurality of first sub-block takies bit number be added, it is thus achieved that described first frame takies bit number.
5. method as claimed in claim 2, it is characterised in that described calculate described GOP successively In the frame of each coded frame take bit number and include:
Obtain and be close to the B frame B1 in described GOP and be positioned at a P of described B1 forward direction Frame P2, obtains and is close to the B frame B1 in described GOP and is positioned at backward for described B a P Frame P3；
Calculate the difference of each pixel numerical value of described B1 and described P2, generate residual block R2；Meter Calculate the difference of each pixel numerical value of described B1 and described P3, generate residual block R3；
Judge the absolute value sum of each element in described R2 whether each less than in described R3 The absolute value sum of element；
If it is, described R2 is carried out Hadamard transform, generate the second residual matrix；Calculate described The absolute value sum of each element in second residual matrix, it is thus achieved that the second frame takies bit number, by institute State the frame of B1 to take bit number and be set to described second frame and take bit number；
If it is not, then described R3 to be carried out Hadamard transform, generate the 3rd residual matrix；Calculate described The absolute value sum of each element in 3rd residual matrix, it is thus achieved that the 3rd frame takies bit number；By institute State the frame of B1 to take bit number and be set to the 3rd frame and take bit number.
6. method as claimed in claim 5, it is characterised in that also include:
Based on default relic cutting unit, described R2 or described R3 is divided into multiple second sub-residual error Block or multiple 3rd sub-residual block；
The plurality of second sub-residual block or the plurality of 3rd sub-residual block are carried out Hadamard transform, Generate multiple second sub-residual matrix or multiple 3rd sub-residual matrix；
Calculate the absolute value sum of each element in the plurality of second sub-residual matrix, it is thus achieved that Duo Ge Two sub-blocks take bit number, the plurality of second sub-block takies bit number and is added, it is thus achieved that described the Two frames take bit number；Or
Calculate the absolute value sum of each element in the plurality of 3rd sub-residual matrix, it is thus achieved that Duo Ge Three sub-blocks take bit number, the plurality of 3rd sub-block takies bit number and is added, it is thus achieved that described the Three frames take bit number.
7. method as claimed in claim 2, it is characterised in that described calculate described GOP successively In the frame of each coded frame take bit number and include:
The frame of I frame in described GOP takies bit number be set to the frame of B frame in this GOP and take 2 times of bit number maximum.
8. the method for claim 1, it is characterised in that described based on described first average Bit number and described second average number of bits are each coded frame distribution bit number bag in described GOP Include:
Calculate the frame of coded frame in described GOP and take the mean value of bit number, this mean value is arranged For described first average number of bits AF；
Described target bit rate is obtained described second average number of bits AB divided by described target frame rate；
The frame of the coded frame in described GOP is taken bit number and is multiplied by described AB and divided by described AF, Obtain the bit number for the distribution of this coded frame.
9. the method as described in claim 1 to 8 any one, it is characterised in that:
The form of described video flowing includes: HEVC.
10. the bit allocation for Video coding, it is characterised in that including:
Parameter setting module, for arranging target bit rate and the target frame rate of video flowing；
Image sets segmentation module, for being divided into one or more according to default rule by described video flowing Image sets GOP；
Take bit number computing module, take for calculating the frame of each coded frame in described GOP Bit number；
Bits allocation module, calculates in described GOP for taking number of bits according to described frame The first average number of bits of averagely taking of coded frame, according to described target bit rate and described target frame rate Calculate the second average number of bits that the coded frame of described video flowing within the unit interval averagely takies, and It is the coded frame in described GOP based on described first average number of bits and described second average number of bits Distribution bit number；
Wherein, one or more during the coded frame in described GOP includes I frame, P frame and B frame.
11. devices as claimed in claim 10, it is characterised in that:
Described image sets segmentation module specifically for using the I frame in described video flowing or P frame as segmentation Frame, by a segmentation frame in described video flowing and the B between this segmentation frame and next segmentation frame Frame is combined as a GOP.
12. devices as claimed in claim 11, it is characterised in that:
Described take bit number computing module, including:
Residual block acquiring unit, is close to for obtaining with the P frame P1 in described GOP and is positioned at One P frame P0 of described P1 forward direction, calculates each pixel numerical value of described P1 and described P0 Difference, generate residual block R1；
Hadamard transformation element, for described R1 is carried out Hadamard transform, generates the first residual matrix；
Bit number acquiring unit, for calculating the absolute value of each element in described first residual matrix Sum, it is thus achieved that the first frame takies bit number, takies the frame of described P1 bit number and is set to described One frame takies bit number.
13. devices as claimed in claim 12, it is characterised in that:
Described residual block acquiring unit, is additionally operable to, after generating described R1, divide based on default relic Cut unit and described R1 is divided into multiple first sub-residual block；
Described Hadamard transformation element, is additionally operable to carry out Hadamard change to the plurality of first sub-residual block Change, generate multiple first sub-residual matrix；
Described bit number acquiring unit, is additionally operable to calculate each yuan in the plurality of first sub-residual matrix The absolute value sum of element, it is thus achieved that multiple first sub-blocks take bit number；By the plurality of first sub-block Take bit number to be added, it is thus achieved that described first frame takies bit number.
14. devices as claimed in claim 13, it is characterised in that:
Described residual block acquiring unit, for obtain with described GOP in B frame B1 next-door neighbour and Be positioned at a P frame P2 of described B1 forward direction, obtain with the B frame B1 next-door neighbour in described GOP and It is positioned at backward for described B a P frame P3；Calculate each pixel number of described B1 and described P2 The difference of value, generates residual block R2；Calculate the difference of each pixel numerical value of described B1 and described P3, Generate residual block R3；Judge whether the absolute value sum of each element in described R2 is less than described The absolute value sum of each element in R3；
If described residual block acquiring unit is judged as YES, the most described Hadamard transformation element is to described R2 Carry out Hadamard transform, generate the second residual matrix；Described bit number acquiring unit calculates described second The absolute value sum of each element in residual matrix, it is thus achieved that the second frame takies bit number, by described B1 Frame take bit number and be set to described second frame and take bit number；
If described residual block acquiring unit is judged as NO, the most described Hadamard transformation element is to described R3 Carry out Hadamard transform, generate the 3rd residual matrix；Described bit number acquiring unit calculates the described 3rd The absolute value sum of each element in residual matrix, it is thus achieved that the 3rd frame takies bit number；By described B1 Frame take bit number and be set to the 3rd frame and take bit number.
15. devices as claimed in claim 14, it is characterised in that:
Described residual block acquiring unit, be additionally operable to based on default relic cutting unit by described R2 or Described R3 is divided into multiple second sub-residual block or multiple 3rd sub-residual block；
Described Hadamard transformation element, is additionally operable to respectively to the plurality of second sub-residual block or described many Individual 3rd sub-residual block carries out Hadamard transform, generates multiple second sub-residual matrix or multiple 3rd son is residual Difference matrix；
Described bit number acquiring unit, is additionally operable to calculate each yuan in the plurality of second sub-residual matrix The absolute value sum of element obtains multiple second sub-blocks and takies bit number, the plurality of second sub-block is accounted for It is added described second frame of acquisition with bit number and takies bit number；Or, calculate the plurality of 3rd son residual In difference matrix, the absolute value sum of each element obtains multiple 3rd sub-blocks and takies bit number, by described many Individual 3rd sub-block takies bit number addition described 3rd frame of acquisition and takies bit number.
16. devices as claimed in claim 11, it is characterised in that:
Described take bit number computing module, be additionally operable to the frame of I frame in described GOP is taken bit Number is set to the frame of B frame in this GOP and takies 2 times of bit number maximum.
17. devices as claimed in claim 10, it is characterised in that:
Described bits allocation module, takies bit number for calculating the frame of coded frame in described GOP Mean value, this mean value is set to described first average number of bits AF；By described target bit rate Described second average number of bits AB is obtained divided by described target frame rate；By the coded frame in described GOP Frame take bit number and be multiplied by described AB and divided by described AF, it is thus achieved that the ratio distributed for this coded frame Special number.
CN201610201011.5A 2016-03-31 2016-03-31 Bit distribution method and device used for video coding Pending CN105847796A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610201011.5A CN105847796A (en) 2016-03-31 2016-03-31 Bit distribution method and device used for video coding

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610201011.5A CN105847796A (en) 2016-03-31 2016-03-31 Bit distribution method and device used for video coding

Publications (1)

Publication Number Publication Date
CN105847796A true CN105847796A (en) 2016-08-10

Family

ID=56597813

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610201011.5A Pending CN105847796A (en) 2016-03-31 2016-03-31 Bit distribution method and device used for video coding

Country Status (1)

Country Link
CN (1) CN105847796A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106331705A (en) * 2016-09-05 2017-01-11 电子科技大学 Novel HEVC (High Efficiency Video Coding) rate control GOP (Group Of Pictures)-level bit allocation method
WO2020037501A1 (en) * 2018-08-21 2020-02-27 深圳市大疆创新科技有限公司 Bit rate allocation method, bit rate control method, encoder, and recording medium
CN113055673A (en) * 2021-04-23 2021-06-29 北京汇钧科技有限公司 Video stream processing method and device, electronic equipment and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002071639A1 (en) * 2001-03-05 2002-09-12 Intervideo, Inc. Systems and methods for error resilient encoding
EP1549074A1 (en) * 2002-07-22 2005-06-29 Institute of Computing Technology Chinese Academy of Sciences A bit-rate control method and device combined with rate-distortion optimization
US20060140267A1 (en) * 2004-12-28 2006-06-29 Yong He Method and apparatus for providing intra coding frame bit budget
CN101511026A (en) * 2009-02-23 2009-08-19 四川长虹电器股份有限公司 Code rate control method for AVS secondary encode based on scene
CN101917614A (en) * 2010-06-03 2010-12-15 北京邮电大学 Bit rate control method based on H.264 hierarchical B-frame coding structure

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002071639A1 (en) * 2001-03-05 2002-09-12 Intervideo, Inc. Systems and methods for error resilient encoding
EP1549074A1 (en) * 2002-07-22 2005-06-29 Institute of Computing Technology Chinese Academy of Sciences A bit-rate control method and device combined with rate-distortion optimization
US20060140267A1 (en) * 2004-12-28 2006-06-29 Yong He Method and apparatus for providing intra coding frame bit budget
CN101511026A (en) * 2009-02-23 2009-08-19 四川长虹电器股份有限公司 Code rate control method for AVS secondary encode based on scene
CN101917614A (en) * 2010-06-03 2010-12-15 北京邮电大学 Bit rate control method based on H.264 hierarchical B-frame coding structure

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106331705A (en) * 2016-09-05 2017-01-11 电子科技大学 Novel HEVC (High Efficiency Video Coding) rate control GOP (Group Of Pictures)-level bit allocation method
CN106331705B (en) * 2016-09-05 2018-12-18 电子科技大学 A kind of new HEVC code rate GOP grades of Bit distribution methods of control
WO2020037501A1 (en) * 2018-08-21 2020-02-27 深圳市大疆创新科技有限公司 Bit rate allocation method, bit rate control method, encoder, and recording medium
CN113055673A (en) * 2021-04-23 2021-06-29 北京汇钧科技有限公司 Video stream processing method and device, electronic equipment and storage medium

Similar Documents

Publication Publication Date Title
CN1037888C (en) Apparatus for hierarchically dividing video signals
CN103024387B (en) A kind of multi-view video rate control based on perception
CN100459707C (en) Mode coding method and apparatus for use in interlaced shape coder
CN106683053B (en) A kind of GF (26) the progressive secret image sharing of finite field multi-threshold and reconstructing method
CN1037804C (en) Apparatus for splitting video signal between two channels
CN101835056B (en) Allocation method for optimal code rates of texture video and depth map based on models
CN101325698B (en) Bit rate control method and apparatus for intra-only video sequence coding
CN101674472A (en) Multistage code rate control method of video code with a plurality of visual points
CN105847796A (en) Bit distribution method and device used for video coding
CN104994382B (en) A kind of optimization method of perception rate distortion
CN103347188B (en) A kind of distributed video coding non-key frame compressed sensing decoding method
CN107197267A (en) The distribution method of efficient video coding criterion and quantity parameter
CN101572806A (en) Frame I code rate control method based on H264
CN102377993B (en) Intra-frame prediction mode selection method and system
CN106937112A (en) Bit rate control method based on H.264 video compression standard
CN102938840A (en) Key frame quantization parameter selecting method applied to multi-viewpoint video coding system
CN103458238A (en) Scalable video code rate controlling method and device combined with visual perception
CN101888561A (en) Multi-view video transmission error control method for rate distortion optimization dynamic regulation
CN101977313B (en) Video signal coding device and method
CN103096076B (en) Method for video coding
CN105898331A (en) Bit allocation and rate control method for deep video coding
CN104038769A (en) Rate control method for intra-frame coding
CN102547282B (en) Extensible video coding error hiding method, decoder and system
WO2023000695A1 (en) Video encoding reference block compression method, encoding method, and apparatuses
CN105898329A (en) Code rate control method and code rate control device used for 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
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20160810

WD01 Invention patent application deemed withdrawn after publication