CN102075756B - Video multiframe prediction encoding and decoding method and device - Google Patents
Video multiframe prediction encoding and decoding method and device Download PDFInfo
- Publication number
- CN102075756B CN102075756B CN 201110030291 CN201110030291A CN102075756B CN 102075756 B CN102075756 B CN 102075756B CN 201110030291 CN201110030291 CN 201110030291 CN 201110030291 A CN201110030291 A CN 201110030291A CN 102075756 B CN102075756 B CN 102075756B
- Authority
- CN
- China
- Prior art keywords
- frame
- video pictures
- possibly
- reappear
- tabulation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention relates to a video multiframe prediction encoding and decoding method and a device. The encoding method comprises the following steps of: building a reproducible frame list and a reference frame list after code initialization; coding first frame video pictures of codes to be encoded in each collected group of pictures (GOP) into I frames, and obtaining complete reconstruction frame data of the I frames; and if video pictures of other codes to be encoded in the collected GOP are encoded into P frames, executing the following steps of: selecting the optimum reference frame from the reference frame list, encoding the video pictures of other codes to be encoded into the P frames by the optimum reference frame, putting the number of the optimum reference frame into encoding code flows of the P frames, and obtaining the complete reconstruction frame data of the P frames; determining whether the P frames are reproducible frames or not, if YES, building thumbnails for original pictures of the P frames, and obtaining thumbnail data of the P frames; adding the thumbnail data of the P frames and the complete reconstruction frame data of the P frames into the reproducible frame list; and executing encoding completion procedures to release the reproducible frame list.
Description
Technical field
The present invention relates to coding and decoding video, relate in particular to a kind of video multi-frame prediction decoding method and device.
Background technology
Cloud computing is a kind of new trend of computational resource occupation mode.Video cloud computing (VCC, Video Cloud Computing) is one of multiple cloud computing implementation method.One cover video cloud computing system (VCCS; Video Cloud Computing System) the simple sketch map of framework is as shown in Figure 1; Wherein, VEE (Video Encoding End) and VDE (Video Decoding End) are supporting, realize coding, decoding to the display frame of front end main frame.Used algorithm is generally general in the world coding and decoding video algorithm among VEE and the VDE at present.But general in the world coding and decoding video algorithm generally is to encode to the video pictures in the real scene; And the coded picture in the cloud computing is the display frame of front end main frame; Comprising the video pictures in the real scene; Also comprise game picture, computer normal operations picture or the like type, this has quite different with video pictures in the pure real scene.Therefore general coding and decoding video algorithm is used in this occasion, and compression efficiency is not the highest.
According to associated video encoding and decoding international standard, like MPEG4, H.264 wait, the coding and decoding video algorithm roughly is divided into some piths such as interframe encode, intraframe coding, quantization encoding, transition coding, entropy coding.Wherein interframe encode is to improve the key of compression ratio, and its main thought is the redundancy of utilizing between the consecutive frame, and the frame prediction frame at the back with the front carries out other next code to motion vector and residual error then.Concrete forecast method is the process of a search matched: use each the macro block MBc in the present frame to go to carry out search matched with preceding frame picture; Find the minimum piece MBm of residual error, be best matching blocks, then with best matching blocks MBm prediction MBc; The gained residual error is minimum, and the subsequent compression rate is just the highest.
The inventor finds in realizing process of the present invention; Interframe encode adopts the mode of the former frame predictive pictures present frame picture of present frame; The redundancy of some pictures before not making full use of; More do not use the redundancy that repeats to occur picture (hereinafter referred reproduction frame) in the computer use, so compression efficiency is lower.Interframe encode adopts the mode of the predictive pictures present frame picture of the continuous some frames in present frame front, and it is too big with the ratio of compression ratio raising amount to calculate recruitment, and does not also make full use of the redundancy of reproduction frame in the computer use, and is therefore practical inadequately.
Summary of the invention
The embodiment of the invention provides a kind of video multi-frame prediction decoding method and device, so that under the less condition of computing recruitment, improves the compression efficiency of video code between frames.
On the one hand; The embodiment of the invention provides the coding method of a kind of video multi-frame prediction; Said method comprises: structure possibly reappear frame tabulation and reference frame lists after the coding initialization was accomplished; Saidly possibly reappear frame tabulation and be used to deposit the thumbnail data of video pictures to be encoded and the complete reconstructed frame data behind the coding thereof, said reference frame lists comprises saidly possibly reappear frame tabulation and preceding frame reconstruct picture data; It is the I frame that the first frame video pictures to be encoded within each the picture group GOP that collects is compiled, and obtains the complete reconstructed frame data of said I frame; For other video pictures to be encoded except that the said first frame video pictures to be encoded within the said GOP that collects; Be the P frame if compile; Then carry out following steps: from said reference frame lists, select the optimal reference frame; Utilize said optimal reference frame that said other video pictures to be encoded are compiled and be the P frame, the numbering of said optimal reference frame is put into the encoding code stream of said P frame, obtain the complete reconstructed frame data of said P frame; Confirm whether said P frame is possibly reappear frame, if, then be that the raw frames of said P frame is created thumbnail, obtain the thumbnail data of said P frame; The thumbnail data of said P frame and the said frame that possibly reappear of complete reconstructed frame data adding of said P frame are tabulated; Carry out endizations program after the end-of-encode, and discharge the said frame that possibly reappear and tabulate.
On the other hand; The embodiment of the invention also provides a kind of video multi-frame prediction coding/decoding method; Said method comprises: structure possibly reappear frame tabulation and reference frame lists after the decoding initialization was accomplished; Saidly possibly reappear the decoded full frames of data of compressed bit stream that frame tabulation is used to deposit video pictures to be decoded, said reference frame lists comprises saidly possibly reappear frame tabulation and preceding frame reconstruct picture data; I frame within each GOP that gets access to is decoded; P frame within the said GOP that parsing gets access to obtains the optimal reference frame number; From said reference frame lists, find corresponding optimal reference frame that said P frame is decoded according to said optimal reference frame number.
On the one hand; The embodiment of the invention provides a kind of encoder; Said encoder comprises collecting unit, and said encoder also comprises: construction unit is used for after the coding initialization, making up and possibly reappears frame tabulation and reference frame lists; Saidly possibly reappear the decoded full frames of data of compressed bit stream that frame tabulation is used to deposit video pictures to be decoded, said reference frame lists comprises saidly possibly reappear frame tabulation and preceding frame reconstruct picture data; First coding unit, the first frame video pictures to be encoded within each GOP that is used for said collecting unit is collected are compiled and are the I frame, obtain the complete reconstructed frame data of said I frame; Second coding unit; Other video pictures to be encoded within the said GOP that is used for said collecting unit is collected except that the said first frame video pictures to be encoded; Be the P frame if compile, then from said reference frame lists, select the optimal reference frame, utilize said optimal reference frame that said other video pictures to be encoded are compiled and be the P frame; The numbering of said optimal reference frame is put into the encoding code stream of said P frame, obtain the complete reconstructed frame data of said P frame; First processing unit; Being used at said P frame is in the time of possibly reappearing frame; Create thumbnail for the raw frames of said P frame, obtain the thumbnail data of said P frame, and the thumbnail data of said P frame and the said frame that possibly reappear of complete reconstructed frame data adding of said P frame are tabulated; Second processing unit is used for finishing the back in decoding and carries out endizations program, and discharges the said frame that possibly reappear and tabulate.
On the other hand; The embodiment of the invention also provides a kind of decoder; Said decoder comprises acquiring unit, and said decoder also comprises: construction unit is used for after the decoding initialization, making up and possibly reappears frame tabulation and reference frame lists; Saidly possibly reappear the decoded full frames of data of compressed bit stream that frame tabulation is used to deposit video pictures to be decoded, said reference frame lists comprises saidly possibly reappear frame tabulation and preceding frame reconstruct picture data; First decoding unit, the I frame within each GOP that is used for said acquiring unit is got access to is decoded; First resolution unit is used to resolve the P frame within the said GOP that said acquiring unit gets access to, and obtains the optimal reference frame number; Second decoding unit is used for finding corresponding optimal reference frame that said P frame is decoded according to said optimal reference frame number from said reference frame lists.
Method and apparatus through the embodiment of the invention provides can improve the compression efficiency of video code between frames under the less condition of computing recruitment.
Description of drawings
Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes the application's a part, does not constitute qualification of the present invention.In the accompanying drawings:
Fig. 1 is a video cloud computing system configuration diagram;
Fig. 2 is the flow chart of the video multi-frame prediction coding method of the embodiment of the invention;
Fig. 3 A and Fig. 3 B are the method flow diagram of from reference frame lists, selecting the optimal reference frame in the embodiment of the invention;
Fig. 4 is the flow chart of the video multi-frame prediction coding/decoding method of the embodiment of the invention;
Fig. 5 is the composition frame chart of the encoder of the embodiment of the invention;
Fig. 6 is the composition frame chart of the decoder of the embodiment of the invention.
Embodiment
For the purpose, technical scheme and the advantage that make the embodiment of the invention is clearer,, the embodiment of the invention is explained further details below in conjunction with embodiment and accompanying drawing.At this, illustrative examples of the present invention and explanation thereof are used to explain the present invention, but not as to qualification of the present invention.
The flow chart of a kind of video multi-frame prediction coding method that Fig. 2 provides for the embodiment of the invention, please with reference to Fig. 2, this method comprises:
Step 201: structure possibly reappear frame tabulation and reference frame lists after the coding initialization was accomplished; Saidly possibly reappear frame tabulation and be used to deposit the thumbnail data of video pictures to be encoded and the complete reconstructed frame data behind the coding thereof, said reference frame lists comprises saidly possibly reappear frame tabulation and preceding frame reconstruct picture data;
Wherein, preceding frame reconstruct picture data is meant the complete reconstructed frame data after the former frame video pictures of current video pictures to be encoded is encoded.
Step 202: the first frame video pictures to be encoded within each GOP that will collect (Group Of Picture, picture group) is compiled and is the I frame, obtains the complete reconstructed frame data of said I frame;
For other video pictures to be encoded except that the said first frame video pictures to be encoded within the said GOP that collects, can compile frame into B, also can compile frame into P.Be the B frame if compile, then can realize, repeat no more at this according to the means of prior art; Be the P frame if compile, then can carry out following steps:
Step 203: from said reference frame lists, select the optimal reference frame; Utilize said optimal reference frame that said other video pictures to be encoded are compiled and be the P frame; The numbering of said optimal reference frame is put into the encoding code stream of said P frame, obtain the complete reconstructed frame data of said P frame;
Step 204: confirm whether said P frame is possibly reappear frame, if, then be that the raw frames of said P frame is created thumbnail, obtain the thumbnail data of said P frame;
Step 205: the thumbnail data of said P frame and the said frame that possibly reappear of complete reconstructed frame data adding of said P frame are tabulated;
Step 206: carry out common end program after the end-of-encode, and discharge and saidly possibly reappear the frame tabulation.
In the step 203 of present embodiment, from said reference frame lists, select the optimal reference frame, can realize that please with reference to Fig. 3 A and Fig. 3 B, this method comprises through the method for Fig. 3 A or Fig. 3 B illustrated embodiment:
Step 301: whether the former frame video pictures of confirming video pictures to be encoded possibly reappear in the frame tabulation said; If the former frame video pictures of video pictures to be encoded possibly reappear in the frame tabulation said; Then execution in step 302, otherwise execution in step 303-307 (Fig. 3 A) or step 303 '-307 ' (Fig. 3 B);
Wherein, can confirm that this former frame video pictures is whether in possibly reappearing the frame tabulation through the numbering of this former frame video pictures.
Step 302: confirm that the corresponding complete reconstructed frame of said former frame video pictures is the optimal reference frame;
Step 303: the absolute value of difference of pixel value of corresponding ranks that calculates the thumbnail of said each pixel value that possibly reappear each width of cloth thumbnail in the frame tabulation and video pictures to be encoded;
Step 304: zero number in the said absolute value of corresponding each width of cloth thumbnail of statistics;
Step 305: whether confirm in the said absolute value of corresponding all thumbnails maximum among the merchant of number of total picture element of zero number and said thumbnail greater than first threshold, if then execution in step 306, otherwise execution in step 307;
Wherein, this first threshold can represent through q%, for example 70% or more than.
Step 306: confirm that the corresponding complete reconstructed frame of corresponding thumbnail is the optimal reference frame;
Step 307: the corresponding complete reconstructed frame of former frame picture of confirming the current video pictures to be encoded in the said reference frame lists is the optimal reference frame.
Step 303 ': calculate said each pixel value that possibly reappear each width of cloth thumbnail in the frame tabulation and the difference of the pixel value of the corresponding ranks of the thumbnail of video pictures to be encoded absolute value and;
Step 304 ': calculate said each pixel value that possibly reappear each width of cloth thumbnail in the frame tabulation and the corresponding ranks of the thumbnail of video pictures to be encoded pixel value and;
Step 305 ': whether confirm minimum value in the ratio of said the former sum and said latter's sum of corresponding all thumbnails less than second threshold value, if, execution in step 306 ' then, otherwise execution in step 307 ';
Wherein, second threshold value can represent through t%, for example 10% or below.
Step 306 ': confirm that the corresponding complete reconstructed frame of corresponding thumbnail is the optimal reference frame;
Step 307 ': the corresponding complete reconstructed frame of former frame picture of confirming the current video pictures to be encoded in the said reference frame lists is the optimal reference frame.
In the present embodiment, the wide height of all thumbnails is identical, also promptly, and the wide height of the thumbnail of creating for the raw frames of said P frame is all identical with the wide height of the thumbnail of said video pictures to be encoded.
In the step 205 of present embodiment, confirm whether the P frame is possibly reappear frame, can recently confirm through the shared percentage of the P piece in the P frame, if the shared percentage of P piece is more than or equal to the 3rd threshold value in the P frame, confirm that then this P frame is general reference frame; If the shared percentage of P piece is less than the 3rd threshold value in the P frame, confirm that then this P frame is for possibly reappear frame.Wherein, the 3rd threshold value can identify through r%, for example 30% or below.
Wherein, having confirmed whether the P frame is possibly reappear frame, is the encoding code stream that general reference frame or the flag information that possibly reappear frame are put into this P frame with this P frame just.In the present embodiment, for example can identify, for example can represent general reference frame, " 1 " the reproduction frame that expresses possibility through " 0 " through a byte.Below just illustrate, present embodiment not with this as restriction.
In the present embodiment; Possibly reappear the frame tabulation and can have preset length, be M for example, and adding these thumbnail data and complete reconstructed frame data thereof that possibly reappear in the frame tabulation can be from preset value value open numbering; For example from the m open numbering; M can be not 0 or 1, saidly possibly reappear the thumbnail data of frame tabulation and the quantity of complete reconstructed frame data possibly reappear the preset length of frame tabulation greater than this if add, for example greater than m+M-1; Then remove numbering minimum thumbnail data and complete reconstructed frame data thereof, and the said thumbnail data and the complete reconstructed frame data thereof that possibly reappear in the frame tabulation are renumberd according to above strategy.
In order to make method embodiment illustrated in fig. 2 clear more understandable, be elaborated below in conjunction with the method for embodiment to present embodiment.In this execution mode, suppose that the wide height of raw frames is respectively W and H, the coding flow process of then carrying out according to the method for present embodiment comprises:
S1:, carry out relevant initialize routine by the ordinary video coding method.
Wherein, the ordinary video coding method can be coding method at present commonly used, for example H.264, MPEG4 etc., present embodiment not with this as restriction.
Wherein, what can make up a sky possibly reappear the frame tabulation, and this possibly reappear the frame tabulation and be used to deposit the original thumbnail image data of video pictures to be encoded and the complete reconstructed frame data behind this video pictures coding to be encoded, with the selection reference as the optimal reference frame.In the present embodiment, the maximum length of supposing this tabulation is M.
Wherein, Can also make up a reference frame lists, this reference frame lists comprises the aforementioned frame that possibly reappear and tabulates frame reconstruct picture data before also comprising; Also promptly, this reference frame lists also is used to deposit the complete reconstructed frame data behind the former frame video pictures coding of current video pictures to be encoded.
S2: gather first frame video pictures to be encoded within the GOP, be called the first frame video pictures in the present embodiment, by the ordinary video coding method this first frame video pictures being compiled is the I frame.
Wherein, this first frame video pictures is compiled to behind the I frame, obtained the complete reconstructed frame data of this I frame.
S3: gather the next frame video pictures within this GOP; In the present embodiment; So that this next frame video pictures is compiled is that the P frame is an example, from said reference frame lists, selects the optimal reference frame, utilizes the optimal reference frame of selecting that this next frame video pictures is compiled and is the P frame; And the numbering of this optimal reference frame put into encoding code stream, so that use during decoding.
Wherein, Also comprise the complete reconstructed frame data behind the former frame video pictures coding of current video pictures to be encoded in this reference frame lists; For example; When current video pictures to be encoded is the second frame video pictures that collects, then comprise the complete reconstructed frame data after the first frame video pictures is encoded in this reference frame lists, also promptly comprise the complete reconstructed frame data of said I frame.
Wherein, from reference frame lists, select the optimal reference frame to be accomplished in several ways, specifically will in following embodiment, explain.
Wherein, also to confirm with reference to effect whether this P frame is possibly reappear frame in order to obtain better; If; Then create one as long as gray value is not wanted the thumbnail of chromatic value, for convenience, the wide height of this thumbnail is designated as w, h for the raw frames of this P frame; Because this next width of cloth video pictures is compiled to having obtained the complete reconstructed frame data of this P frame behind the P frame, the thumbnail data of this P frame is put into the complete reconstructed frame data of this P frame possibly reappeared the frame tabulation here.
Wherein, confirm whether this P frame is possibly reappear frame can confirm that recently for example, if in the macro block in this P frame, the shared percentage of P piece is more than or equal to r% according to the shared percentage of P piece in the macro block in this P frame, and then writing down this P frame is general reference frame; If the shared percentage of P piece is less than r% in the macro block in this P frame, the macro block that also promptly surpasses (100-r) % all is the I piece, then writes down this P frame for possibly reappear frame.Wherein, can also in the encoding code stream of this P frame, put into this P frame is general reference frame or the flag information that possibly reappear frame, can realize through the sign of a byte, aforementionedly explains, repeats no more at this.
Wherein, Thumbnail and complete reconstructed frame data thereof that adding possibly reappear the frame tabulation can increase progressively later on from the m open numbering, possibly reappear the maximum of frame tabulation until this; Also be m+M-1; It is full if possible to reappear the frame tabulation, then removes the minimum record of numbering, and these all records that possibly reappear in the frame tabulation begin layout again from m.
S4: for other video pictures except that the first frame video pictures within this GOP that collects; Encode and handle if compile to the P frame all utilizes the method for step S3; Be the B frame if compile, then can realize, repeat no more at this through the means of prior art.
In the present embodiment, for the video pictures that collects within each GOP, all handle according to step S2-S4.
Wherein, in cataloged procedure, if compile IDR (instantaneous decoding refresh, decoding refresh immediately) frame, then emptying reference frame lists, also is that next code no longer utilizes the frame in the reference frame lists that makes up in the cataloged procedure within this GOP.If do not compile the IDR frame, also promptly still within this GOP, then utilize the frame of bringing in constant renewal in that possibly reappear in the frame tabulation to carry out next code.
Wherein, if cataloged procedure finishes, then withdraw from the coding flow process.
S5: carry out relevant common end program according to the ordinary video coding method, and release possibly reappear the frame tabulation.
In the step S3 of this execution mode, from reference frame lists, select the optimal reference frame, can realize through following method:
S31:, select to finish if the former frame video pictures of video pictures to be encoded in possibly reappearing the frame tabulation, confirms then that the former frame video pictures of this video pictures to be encoded is the optimal reference frame; Otherwise, carry out following steps.
Wherein, Can confirm that it is whether in possibly reappearing the frame tabulation, owing to when each width of cloth video pictures coding, corresponding numbers is arranged all according to the numbering of this former frame video pictures; I frame behind the coding or P frame also all have corresponding numbers; Therefore, according to this numbering, can confirm that it is whether in possibly reappearing the frame tabulation.
S32: for convenience, suppose to reappear the R that is numbered of thumbnail in the frame tabulation
mTo R
M+M-1The capable j row of note video pictures R i pixel value is R
Ij, the i span is 0 to h-1, the j span is 0 to w-1.For video pictures to be encoded carries out down-sampling, create a thumbnail C, wide, height is w, h.The capable j row of note picture C i pixel value is C
Ij, the i span is 0 to h-1, the j span is 0 to w-1.
S33: from 0 to h-1, the j value is from 0 to w-1 to the i value, calculates corresponding each width of cloth thumbnail respectively | C
Ij-R
Ij|, and the wherein zero number of statistics, count Z
c
S34: note Z
c/ (w*h) be L, each width of cloth thumbnail R relatively then
mR
M+M-1Corresponding L
mL
M+M-1In maximum, establishing this maximum is L
k, if m≤k≤m+M-1 is L
kGreater than q%, then confirm L
kCorresponding R
kCorresponding complete reconstructed frame is the optimal reference frame; If L
kBeing not more than q%, is the optimal reference frame with the corresponding complete reconstructed frame of the former frame video pictures in the reference frame lists still then.
Wherein, step S33 and step S34 can realize through step S33 ' and step S34 ' respectively, as follows:
S33 ': right | C
Ij-R
Ij| summation is designated as D; To C
Ij+ R
IjSummation is designated as A, and note D/A is J, R
mR
M+M-1The corresponding J of difference
mJ
M+M-1
S34 ': compare J
mJ
M+M-1, get its minimum value, establish the result and be J
k, if m≤k≤m+M-1 is J
kLess than t%, then confirm R
kBe the optimal reference frame; If J
kBeing not less than t%, is the optimal reference frame with the corresponding complete reconstructed frame of the former frame video pictures in the reference frame lists still then.
More than from reference frame lists, select the mode of optimal reference frame just to illustrate, present embodiment not with this as restriction.
Through the method for the embodiment of the invention, within acceptable computing raising amount, increased the compression ratio of video coding, reduced bandwidth consumption, finally reduced the overall cost of VCCS (Video Cloud Computing System, video cloud computing system).
Corresponding with video multi-frame prediction coding method embodiment illustrated in fig. 2, the embodiment of the invention also provides a kind of video multi-frame prediction coding/decoding method.
The flow chart of a kind of video multi-frame prediction coding/decoding method that Fig. 4 provides for the embodiment of the invention, please with reference to Fig. 4, this method comprises:
Step 401: structure possibly reappear frame tabulation and reference frame lists after the decoding initialization was accomplished; Saidly possibly reappear the decoded full frames of data of compressed bit stream that frame tabulation is used to deposit video pictures to be decoded, said reference frame lists comprises saidly possibly reappear frame tabulation and preceding frame reconstruct picture data;
Wherein, preceding frame reconstruct picture data is meant the decoded full frames of data of compressed bit stream of former frame video pictures of the compressed bit stream of current video pictures to be decoded.
Step 402: the I frame within each GOP that gets access to is decoded;
For each the P frame within this GOP that gets access to, decode in such a way and handle.
Step 403: resolve the P frame within the said GOP that gets access to, obtain the optimal reference frame number;
Step 404: from said reference frame lists, find corresponding optimal reference frame that said P frame is decoded according to said optimal reference frame number.
In the present embodiment, for each the P frame within this GOP that gets access to, can also carry out following steps:
Step 405: resolve said P frame, obtain flag information;
Step 406: confirm according to said flag information whether said P frame is possibly reappear frame,, then the full frames of data behind the said P frame decoding is added the said frame that possibly reappear and tabulate if said P frame is for possibly reappear frame;
Step 407: decoding finishes the back and carries out common end program, discharges the said frame that possibly reappear and tabulates.
Wherein, present embodiment is conditioning step 405 and the sequencing of step 406 with step 403 and step 404 not, for example also can be in execution in step 403 execution in step 405, execution in step 406 in execution in step 404; Perhaps execution in step 405 and step 406 again after execution in step 403 and step 404; Perhaps, execution in step 403 and step 404 again after execution in step 405 and step 406.Below just illustrate, present embodiment not with this as restriction.
In the present embodiment; Similar with method embodiment illustrated in fig. 2, this possibly reappear the frame tabulation and also have preset length, for example is M; Adding said possibly the reproduction possibly reappear full frames of data behind the frame decoding from the preset value open numbering in the frame tabulation; For example from the m open numbering, if add the said quantity that possibly reappear the full frames of data behind the frame decoding that possibly reappear the frame tabulation greater than maximum, for example greater than m+M-1; Then remove numbering minimum possibly reappear the full frames of data behind the frame decoding, and the said full frames of data that possibly reappear behind the frame decoding that possibly reappear in the frame tabulation is renumberd according to above strategy.
In order to make method embodiment illustrated in fig. 4 clear more understandable, be elaborated below in conjunction with the method for embodiment to present embodiment.In this execution mode, suppose that the wide height of raw frames is respectively W and H, the coding flow process of then carrying out according to the method for present embodiment comprises:
S1:, carry out relevant initialize routine by the ordinary video coding/decoding method.
Wherein, the ordinary video coding/decoding method is corresponding with common video coding method embodiment illustrated in fig. 2, repeats no more at this.
Wherein, what can make up a sky possibly reappear frame tabulation, and this possibly reappear the full frames of data after the frame tabulation is used to deposit a width of cloth picture codec, with the selection reference as the optimal reference frame.In the present embodiment, the maximum length of supposing this tabulation is M.
Wherein, Can also make up a reference frame lists, this reference frame lists comprises the aforementioned frame that possibly reappear and tabulates frame reconstruct picture data before also comprising; Also promptly, this reference frame lists also is used to deposit the decoded full frames of data of compressed bit stream of the former frame video pictures of current video pictures to be decoded.
S2: obtaining the first frame video pictures compressed bit stream to be decoded within the GOP, also is aforesaid I frame, by this I frame of ordinary video coding/decoding method decoding.
S3: obtain the next frame video pictures compressed bit stream to be decoded within this GOP; If this next frame video pictures is compiled the frame for P; Then can resolve this P frame and obtain the optimal reference frame number; Utilize this optimal reference frame number from said reference frame lists, to find out the optimal reference frame, utilize the optimal reference frame of finding out that this P frame is decoded.Can also resolve the frame type flag information in this P frame,, then the full frames of data behind this P frame decoding added and to reappear the frame tabulation if confirm this P frame for possibly reappear frame according to this frame type flag information.
Wherein, the numbering that adding possibly reappear the data of frame tabulation also can begin from preset value m, increases progressively later on, possibly reappear the maximum m+M-1 of frame tabulation to this.It is full if possible to reappear frame tabulation, then removes the minimum record of numbering, and this possibly reappear all records in the frame tabulation again from fixed value m open numbering.
S4: for the video pictures compressed bit stream to be decoded of other except that said I frame within this GOP that gets access to; If these other video pictures to be decoded is compiled the frame for B; Then can decode to the compressed bit stream of this video pictures according to the means of prior art; If these other video pictures to be decoded is compiled the frame for P, then all utilize the method for step S3 to carry out corresponding decoding and processing.
In the present embodiment, to the data in each GOP that gets access to, can decode and handle according to the mode of above-mentioned steps S2-S4.
Wherein, in decode procedure, if receive the IDR frame, also promptly a GOP finishes, and then empties reference frame lists.If the IDR frame does not occur, then possibly reappear the frame tabulation and exist always, internal data is brought in constant renewal in.
Wherein, if decode procedure finishes, then withdraw from decoding process.
S5: carry out relevant common end program by the ordinary video coding/decoding method, and release possibly reappear the frame tabulation.
Below just illustrate, present embodiment not with this as restriction.
Through the method for the embodiment of the invention, within acceptable computing raising amount, increased the compression ratio of video coding, reduced bandwidth consumption, finally reduced the overall cost of VCCS.
The composition frame chart of a kind of encoder that Fig. 5 provides for the embodiment of the invention, please with reference to Fig. 5, this encoder also comprises except comprising collecting unit 51:
Construction unit 52; Be used for after the coding initialization, making up and reappear frame tabulation and reference frame lists; Saidly possibly reappear the decoded full frames of data of compressed bit stream that frame tabulation is used to deposit video pictures to be decoded, said reference frame lists comprises saidly possibly reappear frame tabulation and preceding frame reconstruct picture data;
First processing unit 55; Being used at said P frame is in the time of possibly reappearing frame; Create thumbnail for the raw frames of said P frame, obtain the thumbnail data of said P frame, and the thumbnail data of said P frame and the said frame that possibly reappear of complete reconstructed frame data adding of said P frame are tabulated;
In one embodiment, second coding unit 54 can comprise:
It is that the former frame video pictures of video pictures to be encoded is not said possibly reappear the frame tabulation time that said determination module 542 also is used for judged result at judge module 541; Calculate the absolute value of difference of pixel value of corresponding ranks of the thumbnail of said each pixel value that possibly reappear each width of cloth thumbnail in the frame tabulation and video pictures to be encoded; Zero number in the said absolute value of corresponding each width of cloth thumbnail of statistics; If the maximum in the said absolute value of corresponding all thumbnails among the merchant of the number of total picture element of zero number and said thumbnail, confirms then that the corresponding complete reconstructed frame of corresponding thumbnail is the optimal reference frame greater than q%; If the maximum in the said absolute value of corresponding all thumbnails among the merchant of the number of total picture element of zero number and said thumbnail is not more than q%, confirm that then the corresponding complete reconstructed frame of former frame video pictures of the current video pictures to be encoded in the said reference frame lists is the optimal reference frame; Perhaps
It is that the former frame video pictures of video pictures to be encoded is not said possibly reappear the frame tabulation time that said determination module 542 also is used for judged result at judge module 541; Calculate said each pixel value that possibly reappear each width of cloth thumbnail in the frame tabulation and the difference of the pixel value of the corresponding ranks of the thumbnail of video pictures to be encoded absolute value and; And calculate said each pixel value that possibly reappear each width of cloth thumbnail in the frame tabulation and the corresponding ranks of the thumbnail of video pictures to be encoded pixel value and; If the minimum value in the ratio of the former sum of corresponding all thumbnails and latter's sum confirms then that less than t% the complete reconstructed frame of corresponding thumbnail correspondence is the optimal reference frame; If the minimum value in the ratio of the former sum of corresponding all thumbnails and latter's sum is not less than t%, confirm that then the complete reconstructed frame of the former frame video pictures correspondence of the current video pictures to be encoded in the said reference frame lists is the optimal reference frame.
In the present embodiment, first processing unit 55 is the wide height of the thumbnail created of the raw frames of said P frame, and is identical with the wide height of the thumbnail of said video pictures to be encoded.
In one embodiment, first processing unit 55 specifically is used for during more than or equal to r%, confirming that said P frame is general reference frame at the shared percentage of said P frame P piece; When the shared percentage of P piece is less than r% in said P frame, confirm that said P frame is for possibly reappear frame.It is the encoding code stream that general reference frame or the flag information that possibly reappear frame are put into said P frame that this first processing unit 55 also is used for said P frame.
Each part of the encoder of present embodiment is respectively applied for each step that realizes method embodiment illustrated in fig. 2, owing in embodiment illustrated in fig. 2, each step is specified, repeats no more at this.
Through the encoder of the embodiment of the invention, within acceptable computing raising amount, increased the compression ratio of video coding, reduced bandwidth consumption, finally reduced the overall cost of VCCS.
The composition frame chart of a kind of decoder that Fig. 6 provides for the embodiment of the invention, please with reference to Fig. 6, this decoder also comprises except comprising acquiring unit 61:
First decoding unit 63, the I frame within each GOP that is used for acquiring unit 61 is got access to is decoded;
In one embodiment, this decoder also comprises:
Judging unit 67 is used for confirming according to said flag information whether said P frame is possibly reappear frame;
First processing unit 68, being used at said P frame is in the time of possibly reappearing frame, the full frames of data behind the said P frame decoding is added the said frame that possibly reappear tabulate;
Each part of the decoder of present embodiment is respectively applied for each step that realizes method embodiment illustrated in fig. 4, because in the embodiment shown in fig. 4, each step is specified, and repeats no more at this.
Through the decoder of the embodiment of the invention, within acceptable computing raising amount, increased the compression ratio of video coding, reduced bandwidth consumption, finally reduced the overall cost of VCCS.
The method of describing in conjunction with embodiment disclosed herein or the step of algorithm can be directly with the software modules of hardware, processor execution, and perhaps the combination of the two is implemented.Software module can place the storage medium of any other form known in random asccess memory (RAM), internal memory, read-only memory (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or the technical field.
Above-described specific embodiment; The object of the invention, technical scheme and beneficial effect have been carried out further explain, and institute it should be understood that the above is merely specific embodiment of the present invention; And be not used in qualification protection scope of the present invention; All within spirit of the present invention and principle, any modification of being made, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (15)
1. video multi-frame prediction coding method is characterized in that, said method comprises:
Structure possibly reappear frame tabulation and reference frame lists after the coding initialization was accomplished; Saidly possibly reappear frame tabulation and be used to deposit the thumbnail data of video pictures to be encoded and the complete reconstructed frame data behind the coding thereof, said reference frame lists comprises saidly possibly reappear frame tabulation and preceding frame reconstruct picture data;
It is the I frame that the first frame video pictures to be encoded within each the picture group GOP that collects is compiled, and obtains the complete reconstructed frame data of said I frame;
For other video pictures to be encoded except that the said first frame video pictures to be encoded within the said GOP that collects, be the P frame if compile, then carry out following steps:
From said reference frame lists, select the optimal reference frame, utilize said optimal reference frame that said other video pictures volumes to be encoded are the P frame, the numbering of said optimal reference frame is put into the encoding code stream of said P frame, obtain the complete reconstructed frame data of said P frame;
Confirm whether said P frame is possibly reappear frame, if, then be that the raw frames of said P frame is created thumbnail, obtain the thumbnail data of said P frame;
The thumbnail data of said P frame and the said frame that possibly reappear of complete reconstructed frame data adding of said P frame are tabulated;
Carry out the endization program after the end-of-encode, discharge the said frame that possibly reappear and tabulate;
Wherein, confirm that whether said P frame is possibly reappear frame, specifically comprises:
If the shared percentage of P piece is more than or equal to the 3rd threshold value in the said P frame, confirm that then said P frame is general reference frame;
If the shared percentage of P piece is less than said the 3rd threshold value in the said P frame, confirm that then said P frame is for possibly reappear frame.
2. method according to claim 1 is characterized in that, from said reference frame lists, selects the optimal reference frame, comprising:
Whether the former frame video pictures of confirming video pictures to be encoded possibly reappear in the frame tabulation said;
If the former frame video pictures of video pictures to be encoded possibly reappear in the frame tabulation said, confirm that then the corresponding complete reconstructed frame of said former frame video pictures is the optimal reference frame;
If the former frame video pictures of video pictures to be encoded possibly not reappear in the frame tabulation said; Then calculate the absolute value of difference of pixel value of corresponding ranks of the thumbnail of said each pixel value that possibly reappear each width of cloth thumbnail in the frame tabulation and video pictures to be encoded; Zero number in the said absolute value of corresponding each width of cloth thumbnail of statistics; If the maximum in the said absolute value of corresponding all thumbnails among the merchant of the number of total picture element of zero number and said thumbnail, confirms then that the corresponding complete reconstructed frame of corresponding thumbnail is the optimal reference frame greater than first threshold; If the maximum in the said absolute value of corresponding all thumbnails among the merchant of the number of total picture element of zero number and said thumbnail is not more than said first threshold, confirm that then the corresponding complete reconstructed frame of former frame video pictures of the current video pictures to be encoded in the said reference frame lists is the optimal reference frame; Perhaps
If the former frame video pictures of video pictures to be encoded possibly not reappear in the frame tabulation said; Then calculate said each pixel value that possibly reappear each width of cloth thumbnail in the frame tabulation and the difference of the pixel value of the corresponding ranks of the thumbnail of video pictures to be encoded absolute value and; And calculate said each pixel value that possibly reappear each width of cloth thumbnail in the frame tabulation and the corresponding ranks of the thumbnail of video pictures to be encoded pixel value and; If the minimum value in the ratio of the former sum of corresponding all thumbnails and latter's sum confirms then that less than second threshold value complete reconstructed frame of corresponding thumbnail correspondence is the optimal reference frame; If the minimum value in the ratio of the former sum of corresponding all thumbnails and latter's sum is not less than said second threshold value, confirm that then the complete reconstructed frame of the former frame video pictures correspondence of the current video pictures to be encoded in the said reference frame lists is the optimal reference frame.
3. method according to claim 2 is characterized in that, the length and width of the thumbnail of creating for the raw frames of said P frame are identical with the length and width of the thumbnail of said video pictures to be encoded.
4. method according to claim 1 is characterized in that, confirms whether said P frame is possibly reappear after the frame, and said method also comprises:
With said P frame is the encoding code stream that general reference frame or the flag information that possibly reappear frame are put into said P frame.
5. method according to claim 1; It is characterized in that; Saidly possibly reappear frame tabulation and have preset length; Add and saidly possibly reappear thumbnail data and complete reconstructed frame data thereof in the frame tabulation from the preset value open numbering; If the quantity that adds said thumbnail data that possibly reappear frame tabulation and complete reconstructed frame data thereof greater than the said preset length that possibly reappear the frame tabulation, is then removed and saidly possibly reappeared minimum thumbnail data and the complete reconstructed frame data thereof of numbering in the frame tabulation, and according to above strategy the said thumbnail data and the complete reconstructed frame data thereof that possibly reappear in the frame tabulation is renumberd.
6. video multi-frame prediction coding/decoding method is characterized in that said method comprises:
Structure possibly reappear frame tabulation and reference frame lists after the decoding initialization was accomplished; Saidly possibly reappear the decoded full frames of data of compressed bit stream that frame tabulation is used to deposit video pictures to be decoded, said reference frame lists comprises saidly possibly reappear frame tabulation and preceding frame reconstruct picture data;
I frame within each GOP that gets access to is decoded;
P frame within the said GOP that parsing gets access to obtains the optimal reference frame number;
From said reference frame lists, find corresponding optimal reference frame that said P frame is decoded according to said optimal reference frame number;
Wherein, confirm that whether said P frame is possibly reappear frame, specifically comprises:
If the shared percentage of P piece is more than or equal to the 3rd threshold value in the said P frame, confirm that then said P frame is general reference frame;
If the shared percentage of P piece is less than said the 3rd threshold value in the said P frame, confirm that then said P frame is for possibly reappear frame.
7. method according to claim 6 is characterized in that, resolves the P frame within the said GOP that gets access to, and obtains after the optimal reference frame number, and said method also comprises:
Resolve said P frame, obtain flag information;
Confirm according to said flag information whether said P frame is possibly reappear frame;
If said P frame is for possibly reappear frame, then the full frames of data behind the said P frame decoding is added the said frame that possibly reappear and tabulate;
Decoding finishes the back and carries out the endization program, discharges the said frame that possibly reappear and tabulates.
8. method according to claim 6; It is characterized in that; Saidly possibly reappear frame tabulation and have preset length; Adding said possibly the reproduction possibly reappear full frames of data behind the frame decoding from the preset value open numbering in the frame tabulation; If add the said quantity that possibly reappear the full frames of data behind the frame decoding that possibly reappear frame tabulation greater than the said maximum that possibly reappear the preset length of frame tabulation, then remove said possibly reappear numbering in the frame tabulation minimum possibly reappear the full frames of data behind the frame decoding, and the said full frames of data that possibly reappear behind the frame decoding that possibly reappear in the frame tabulation is renumberd according to above strategy.
9. encoder, said encoder comprises collecting unit, it is characterized in that, said encoder also comprises:
Construction unit; Be used for after the coding initialization, making up and reappear frame tabulation and reference frame lists; Saidly possibly reappear frame tabulation and be used to deposit the thumbnail data of video pictures to be encoded and the complete reconstructed frame data behind the coding thereof, said reference frame lists comprises saidly possibly reappear frame tabulation and preceding frame reconstruct picture data;
First coding unit, the first frame video pictures to be encoded within each GOP that is used for said collecting unit is collected are compiled and are the I frame, obtain the complete reconstructed frame data of said I frame;
Second coding unit; Other video pictures to be encoded within the said GOP that is used for said collecting unit is collected except that the said first frame video pictures to be encoded; Be the P frame if compile, then from said reference frame lists, select the optimal reference frame, utilize said optimal reference frame that said other video pictures to be encoded are compiled and be the P frame; The numbering of said optimal reference frame is put into the encoding code stream of said P frame, obtain the complete reconstructed frame data of said P frame;
First processing unit; Being used at said P frame is in the time of possibly reappearing frame; Create thumbnail for the raw frames of said P frame, obtain the thumbnail data of said P frame, and the thumbnail data of said P frame and the said frame that possibly reappear of complete reconstructed frame data adding of said P frame are tabulated;
Second processing unit is used for after end-of-encode, carrying out the endization program, discharges the said frame that possibly reappear and tabulates;
Wherein, confirm that whether said P frame is possibly reappear frame, specifically comprises:
If the shared percentage of P piece is more than or equal to the 3rd threshold value in the said P frame, confirm that then said P frame is general reference frame;
If the shared percentage of P piece is less than said the 3rd threshold value in the said P frame, confirm that then said P frame is for possibly reappear frame.
10. encoder according to claim 9 is characterized in that, said second coding unit comprises:
Judge module is used for judging whether the former frame video pictures of video pictures to be encoded possibly reappear the frame tabulation said;
Determination module, the former frame video pictures that is used for judged result when said judge module and is video pictures to be encoded possibly reappear the frame tabulation time, confirms that the corresponding complete reconstructed frame of said former frame video pictures is the optimal reference frame said;
Wherein, It is that the former frame video pictures of video pictures to be encoded is not said possibly reappear the frame tabulation time that said determination module also is used for judged result when said judge module; Calculate the absolute value of difference of pixel value of corresponding ranks of thumbnail of each pixel value and the video pictures to be encoded of each width of cloth thumbnail in the said reference frame lists; Zero number in the said absolute value of corresponding each width of cloth thumbnail of statistics; If the maximum in the said absolute value of corresponding all thumbnails among the merchant of the number of total picture element of zero number and said thumbnail, confirms then that the corresponding complete reconstructed frame of corresponding thumbnail is the optimal reference frame greater than first threshold; If the maximum in the said absolute value of corresponding all thumbnails among the merchant of the number of total picture element of zero number and said thumbnail is not more than said first threshold, confirm that then the corresponding complete reconstructed frame of former frame video pictures of current video pictures to be encoded in the said reference frame lists is the optimal reference frame;
Perhaps; It is that the former frame video pictures of video pictures to be encoded is not said possibly reappear the frame tabulation time that said determination module also is used for judged result when said judge module; Calculate said each pixel value that possibly reappear each width of cloth thumbnail in the frame tabulation and the difference of the pixel value of the corresponding ranks of the thumbnail of video pictures to be encoded absolute value and; And calculate said each pixel value that possibly reappear each width of cloth thumbnail in the frame tabulation and the corresponding ranks of the thumbnail of video pictures to be encoded pixel value and; If the minimum value in the ratio of the former sum of corresponding all thumbnails and latter's sum confirms then that less than second threshold value complete reconstructed frame of corresponding thumbnail correspondence is the optimal reference frame; If the minimum value in the ratio of the former sum of corresponding all thumbnails and latter's sum is not less than said second threshold value, confirm that then the complete reconstructed frame of the former frame video pictures correspondence of current video pictures to be encoded in the said reference frame lists is the optimal reference frame.
11. encoder according to claim 10 is characterized in that, the length and width of the thumbnail that raw frames that said first processing unit is said P frame is created are identical with the length and width of the thumbnail of said video pictures to be encoded.
12. encoder according to claim 9 is characterized in that, said first processing unit specifically is used for during more than or equal to the 3rd threshold value, confirming that said P frame is general reference frame at the shared percentage of said P frame P piece; When the shared percentage of P piece is less than said the 3rd threshold value in said P frame, confirm that said P frame is for possibly reappear frame.
13. encoder according to claim 12 is characterized in that, it is the encoding code stream that general reference frame or the flag information that possibly reappear frame are put into said P frame that said first processing unit also is used for said P frame.
14. a decoder, said decoder comprises acquiring unit, it is characterized in that, said decoder also comprises:
Construction unit; Be used for after the decoding initialization, making up and reappear frame tabulation and reference frame lists; Saidly possibly reappear the decoded full frames of data of compressed bit stream that frame tabulation is used to deposit video pictures to be decoded, said reference frame lists comprises saidly possibly reappear frame tabulation and preceding frame reconstruct picture data;
First decoding unit, the I frame within each GOP that is used for said acquiring unit is got access to is decoded;
First resolution unit is used to resolve the P frame within the said GOP that said acquiring unit gets access to, and obtains the optimal reference frame number;
Second decoding unit is used for finding corresponding optimal reference frame that said P frame is decoded according to said optimal reference frame number from said reference frame lists;
Wherein, confirm that whether said P frame is possibly reappear frame, specifically comprises:
If the shared percentage of P piece is more than or equal to the 3rd threshold value in the said P frame, confirm that then said P frame is general reference frame;
If the shared percentage of P piece is less than said the 3rd threshold value in the said P frame, confirm that then said P frame is for possibly reappear frame.
15. decoder according to claim 14 is characterized in that, said decoder also comprises:
Second resolution unit is used to resolve said P frame, obtains flag information;
Judging unit is used for confirming according to said flag information whether said P frame is possibly reappear frame;
First processing unit, being used at said P frame is in the time of possibly reappearing frame, the full frames of data behind the said P frame decoding is added the said frame that possibly reappear tabulate;
Second processing unit is used for finishing the back in decoding and carries out the endization program, discharges the said frame that possibly reappear and tabulates.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110030291 CN102075756B (en) | 2011-01-27 | 2011-01-27 | Video multiframe prediction encoding and decoding method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110030291 CN102075756B (en) | 2011-01-27 | 2011-01-27 | Video multiframe prediction encoding and decoding method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102075756A CN102075756A (en) | 2011-05-25 |
| CN102075756B true CN102075756B (en) | 2012-10-24 |
Family
ID=44034078
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110030291 Active CN102075756B (en) | 2011-01-27 | 2011-01-27 | Video multiframe prediction encoding and decoding method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102075756B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104065966B (en) * | 2013-03-20 | 2017-09-29 | 三星电子（中国）研发中心 | The method and apparatus that thumbnail is extracted in H.264 video file |
| CN104754345B (en) * | 2013-12-27 | 2019-01-04 | 展讯通信（上海）有限公司 | Method for video coding and video encoder |
| CN107295340A (en) * | 2016-03-31 | 2017-10-24 | 中兴通讯股份有限公司 | A kind of method and device of remote desktop Video coding |
| CN106709493B (en) * | 2017-01-09 | 2019-09-13 | 同观科技（深圳）有限公司 | A kind of double dynamic video license plate locating methods and device |
| CN107911196B (en) * | 2017-10-27 | 2020-07-14 | 南京莱斯电子设备有限公司 | Radar track message transmission method |
| CN111279694A (en) * | 2018-11-28 | 2020-06-12 | 深圳市大疆创新科技有限公司 | GDR code stream encoding method, terminal device and machine readable storage medium |
| EP3796652B1 (en) | 2019-09-23 | 2022-05-18 | Axis AB | Video encoding method and method for reducing file size of encoded video |
| CN112714322B (en) * | 2020-12-28 | 2023-08-01 | 福州大学 | Inter-frame reference optimization method for game video |
| CN112822549B (en) * | 2020-12-30 | 2022-08-05 | 北京大学 | Video stream decoding method, system, terminal and medium based on fragmentation recombination |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1649413A (en) * | 2005-01-26 | 2005-08-03 | 上海大学 | Quick selecting method for H.264/AVC multiple reference frame |
| CN100341334C (en) * | 2005-01-14 | 2007-10-03 | 北京航空航天大学 | Multi-reference frame rapid movement estimation method based on effective coverage |
| CN101534442A (en) * | 2009-04-13 | 2009-09-16 | 腾讯科技（深圳）有限公司 | Video coding system and video coding method |
| CN101820547A (en) * | 2009-02-27 | 2010-09-01 | 源见科技（苏州）有限公司 | Inter-frame mode selecting method |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI442775B (en) * | 2009-02-05 | 2014-06-21 | Acer Inc | Low-power and high-performance video coding method for performing motion estimation |
| TWI389575B (en) * | 2009-02-18 | 2013-03-11 | Acer Inc | Motion estimation approach for real-time embedded multimedia design |
-
2011
- 2011-01-27 CN CN 201110030291 patent/CN102075756B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100341334C (en) * | 2005-01-14 | 2007-10-03 | 北京航空航天大学 | Multi-reference frame rapid movement estimation method based on effective coverage |
| CN1649413A (en) * | 2005-01-26 | 2005-08-03 | 上海大学 | Quick selecting method for H.264/AVC multiple reference frame |
| CN101820547A (en) * | 2009-02-27 | 2010-09-01 | 源见科技（苏州）有限公司 | Inter-frame mode selecting method |
| CN101534442A (en) * | 2009-04-13 | 2009-09-16 | 腾讯科技（深圳）有限公司 | Video coding system and video coding method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102075756A (en) | 2011-05-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102075756B (en) | Video multiframe prediction encoding and decoding method and device | |
| CN102835111B (en) | The motion vector of previous block is used as the motion vector of current block, image to be carried out to the method and apparatus of coding/decoding | |
| CN103220528B (en) | Method and apparatus by using large-scale converter unit coding and decoding image | |
| CN102714720B (en) | By selecting one group of predicting candidate motion vector the method and apparatus of coding/decoding carried out to motion vector and use described method and apparatus to carry out the method and apparatus of encoding/decoding image | |
| JP5313916B2 (en) | Video coding and decoding method and apparatus using texture synthesis | |
| JP5341024B2 (en) | Video compression method | |
| CN101204094B (en) | Method for scalably encoding and decoding video signal | |
| CN102595116B (en) | Encoding and decoding methods and devices for multiple image block division ways | |
| KR20060109249A (en) | Method and apparatus for predicting motion vector of a macro block using motion vectors of a picture of base layer when encoding/decoding video signal | |
| CN105141955A (en) | Apparatus for encoding and decoding image by skip encoding and method for same | |
| JP2010515400A (en) | Multi-view video encoding and decoding method and apparatus using global difference vector | |
| CN104333760B (en) | 3-D view coding method and 3-D view coding/decoding method and relevant apparatus | |
| FI3654650T3 (en) | Intra prediction based on interpolated reference samples | |
| CN105847793A (en) | Video coding method and device and video decoding method and device | |
| CN105723709A (en) | Method for encoding and decoding images, device for encoding and decoding images and corresponding computer programs | |
| CN104365100A (en) | Video encoding method and device and video decoding method and device for parallel processing | |
| CN105025298A (en) | A method and device of encoding/decoding an image | |
| CN102843555B (en) | A kind of intra-frame prediction method and system | |
| CN103109535A (en) | Image reproduction method, image reproduction device, image reproduction program, imaging system, and reproduction system | |
| KR20060063608A (en) | Method and apparatus for conducting residual prediction on a macro block when encoding/decoding video signal | |
| CN109618227B (en) | Video data storage method and system | |
| JP2012147291A (en) | Image coding apparatus, image coding method, program, image decoding apparatus, image decoding method, and program | |
| KR101602871B1 (en) | Method and apparatus for data encoding, method and apparatus for data decoding | |
| CN111726632B (en) | Encoding and decoding method, device and equipment | |
| CN106686380A (en) | Enhanced data processing apparatus employing multiple-block based pipeline and operation method thereof |
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 | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20110525 Assignee: Nanjing Bo Han Information Technology Co. Ltd. Assignor: Beijing Cyber Cloud Technology Co., Ltd. Contract record no.: 2017110000011 Denomination of invention: Video multiframe prediction encoding and decoding method and device Granted publication date: 20121024 License type: Common License Record date: 20170628 Application publication date: 20110525 Assignee: Nanjing Yun Yao super Mdt InfoTech Ltd Assignor: Beijing Cyber Cloud Technology Co., Ltd. Contract record no.: 2017110000012 Denomination of invention: Video multiframe prediction encoding and decoding method and device Granted publication date: 20121024 License type: Common License Record date: 20170628 |
|
| CP03 | Change of name, title or address |
Address after: 213017 No.2, Hongyang Road, Tianning District, Changzhou City, Jiangsu Province Patentee after: Jiangsu shiboyun Information Technology Co., Ltd Address before: 100085, Beijing, Haidian District, 5 East Road, Beijing, Mongolia hi tech building, block B, four Patentee before: BEIJING SUPER DIGITAL TV TECHNOLOGY Co.,Ltd. |
|
| CP03 | Change of name, title or address | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20110525 Assignee: Beijing shiboyun Information Technology Co.,Ltd. Assignor: Jiangsu shiboyun Information Technology Co., Ltd Contract record no.: X2021110000011 Denomination of invention: Video multi frame prediction encoding and decoding method and device Granted publication date: 20121024 License type: Common License Record date: 20210323 |
|
| EE01 | Entry into force of recordation of patent licensing contract |