CN1535029A - Reference image buffer region management method - Google Patents
Reference image buffer region management method Download PDFInfo
- Publication number
- CN1535029A CN1535029A CNA2003101160851A CN200310116085A CN1535029A CN 1535029 A CN1535029 A CN 1535029A CN A2003101160851 A CNA2003101160851 A CN A2003101160851A CN 200310116085 A CN200310116085 A CN 200310116085A CN 1535029 A CN1535029 A CN 1535029A
- Authority
- CN
- China
- Prior art keywords
- reference picture
- frame
- field
- image
- present image
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
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/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
- H04N19/423—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation characterised by memory arrangements
-
- 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
Abstract
A method for managing the reference image buffer includes reserving the reference image for encode/decode in the buffer according to encode mode, marking each reference image with a reference index, determining the reference image of current image according to reference index, performing encode/decode, using the decoded I/P frame to replace the reference frame the most far from current image in buffer if current image is I/P frame and encoding/decoding next image, or not changing the reference index of reference image if current image is B frame and encoding/decoding next image, and deleting all images from buffer after after all images are encoded/decoded.
Description
Technical field
The present invention relates to a kind of buffer management method, in especially a kind of video encoding-decoding process, the reference picture buffer management method.
Background technology
Along with the develop rapidly of science and technology, digital TV in high resolution broadcasting, multimedia network communication, video monitoring, remote monitoring etc. are more and more outstanding to the demand of video coding and decoding technology efficiently.Video coding and decoding technology is to realize high-quality, storage of low-cost multi-medium data and the key of transmitting efficiently.Popular video coding international standard generally adopts the hybrid coding method of prediction/conversion now.Redundancy by on time, space and the subjective vision of prediction/conversion removal video image makes under the condition that keeps certain visual effect, data volume is dropped to minimum.This prediction can be to carry out in present image, also can be to carry out between image.For inter prediction, the general now motion search strategy that adopts based on the piece coupling both to each piece in the present image, was sought best match position according to certain strategy in its reference picture.In order to improve accuracy for predicting, usually may in several reference pictures, mate, use forward direction, back to two reference frames as the B frame, therefore in codec, need reference picture is effectively managed to improve the access efficiency of reference picture in the codec.Certainly the multiframe reference prediction has certain complexity in realization, distributes more buffer memory to preserve reference picture, need more calculate to carry out reference picture selection etc. as needs.
As MPEG-1, MPEG-2, MPEG-4 etc., inter prediction are divided into two kinds in the former coding standard, and a kind of is the P frame that only comes from forward prediction, and another kind is to carry out bi-directional predicted B frame.The prediction of the P frame here is based on all that a reference picture carries out, the B frame then uses two reference pictures of forward and backward to predict, the inter prediction here is comparatively simple, corresponding reference picture buffer management is also fairly simple, only needing to keep two nearest reference frames can be to P, and the B frame carries out inter prediction.
Along with the fast development of computing technique, the realization of multiframe reference prediction has not been very difficult problem, and can bring significant gain, is to improve an effectively approach of compression efficiency because adopt the multi-reference frame Predicting Technique.But, because the complexity that the prediction of too much reference frame is brought in realization far surpasses the gain that it brought, and because common B frame needs to use former and later two reference frames at least, in order to make full use of the reference picture buffering area, general restriction P frame uses two reference frames at the most, can needn't increase the size of image buffer like this under the condition of the P frame being carried out multi-frame prediction.
An important step of multi-reference frame Predicting Technique is how the reference picture buffering area effectively to be managed.H.264 also adopted the multiframe reference technique at up-to-date coding standard in, but reference picture buffer management wherein is very complicated, at first it is all preserved every width of cloth decoded picture, no matter whether this image is as reference picture, and with its order of index marker, and there is a mark to represent that whether this image is as reference picture in addition; In addition, very complicated regulation is also arranged, do not have only when it is not used as reference picture and is used for showing such as a, two field picture and just shift out from buffering area for reference picture turnover buffering area.Complex management like this, and taken a large amount of memory spaces, the buffering area service efficiency is low.
Summary of the invention
The present invention proposes a kind of effective reference picture buffer management method, only preserve all with reference picture for referencial use, and one current just at the buffering area of reconstructed image, realize the operations such as access, renewal of reference picture.
Technical scheme of the present invention comprises the steps:
Step 2, each reference picture all come mark by a reference key;
Step 3, present image are determined reference picture according to reference key, finish encoding and decoding;
If the current coding/decoding image of step 4 is I frame/field or P frame/field, then decoded I/P frame/field to be replaced in the buffering area from present image reference frame/field farthest, coding/decoding next one image re-executes step 2;
If the current coding/decoding image of step 5 is B frame/field, do not change the reference key of reference picture, the next image of coding/decoding re-executes step 3;
If all images of step 6 have all been finished coding/decoding, then all images in the delete buffer.
The present invention is by managing effectively reference picture, improve the access efficiency of codec to reference picture, only keep with image for referencial use, reduced the demand to buffer memory, the unified management of these reference pictures in internal memory simultaneously can improve memory access speed.
Description of drawings
Fig. 1 is that present image is an I frame and as two whens coding, current decoded field is second labeling method schematic diagram on DISPLAY ORDER;
Fig. 2 is that present image is a P frame and as the labeling method schematic diagram of frame coding;
Fig. 3 is that present image is P frame and this frame during as two codings, and current decoded field is first labeling method schematic diagram on DISPLAY ORDER;
Fig. 4 be present image be P frame and this frame as two codings, current decoded field is second labeling method schematic diagram on DISPLAY ORDER simultaneously;
Fig. 5 is that present image is a B frame and as the labeling method schematic diagram of frame coding;
Fig. 6 is that present image is B frame and this frame during as two codings, and current decoded field is first labeling method schematic diagram on DISPLAY ORDER;
Fig. 7 is that present image is B frame and this frame during as two codings, and current decoded field is second labeling method schematic diagram on DISPLAY ORDER;
Fig. 8 is the flow chart of reference picture in the update image buffering area of the present invention.
Embodiment
Reference picture buffer management mechanism of the present invention, make P/B frame or field energy enough carry out access efficiently to reference picture, simultaneously for the macro block of the specific coding pattern in P/B frame/field, as skip macroblock pattern (Skip mode), Direct Model (Direct mode), symmetric pattern (Symmetric mode) can very directly find its forward direction when the access reference picture, afterwards to reference picture.
Technical scheme of the present invention comprises the steps:
Step 2, each reference picture all come mark by a reference key;
Step 3, present image are determined reference picture according to reference key, finish encoding and decoding;
If the current coding/decoding image of step 4 is I frame/field or P frame/field, then decoded I/P frame/field to be replaced in the buffering area from present image reference frame/field farthest, coding/decoding next one image re-executes step 2;
If the current coding/decoding image of step 5 is B frame/field, do not change the reference key of reference picture, the next image of coding/decoding re-executes step 3;
If all images of step 6 have all been finished coding/decoding, then all images in the delete buffer.
No matter be in the coding or decode procedure of image, all relate to image and in buffering area, carry out coding/decoding, all relate to the management of buffering area of the present invention.
The mark of reference picture is a committed step of the present invention, and after the access of image and coding/decoding were finished in the buffering area, the renewal of reference picture all was that the mark according to image carries out.The present invention has realized image buffer management easily by simple mark mode.
Each reference picture all uses a reference key to come mark, and the principle of mark is: the forward direction reference picture is according to DISPLAY ORDER, and reference key is by descending, and the reference key from the nearest reference picture of present image on the DISPLAY ORDER is 0; According to DISPLAY ORDER, reference key is arranged by ascending order to reference picture in the back, and the reference key from the nearest reference picture of present image on the DISPLAY ORDER is 0.
For the coded system based on frame, if present image is the P frame, then its two forward reference frame are these two reference pictures in the buffering area, are 0 from the nearest image tagged of present image on DISPLAY ORDER wherein, and far away another is labeled as 1; For if present frame be the B frame, the back of it is the reference frame be positioned at present image on DISPLAY ORDER after to reference frame, be labeled as 0 in the back in reference sequence, forward reference frame is labeled as 0 for the reference frame before DISPLAY ORDER is positioned at present image in the forward direction reference sequence.
For coded system based on the field, if when the front court be the P field, its 4 forward directions are with reference to being these four reference pictures in the buffering area, are 0 from the nearest image tagged of present image on DISPLAY ORDER wherein; For if when the front court be the B field, the back of it is two reference field be positioned at present image on DISPLAY ORDER after to reference field, on DISPLAY ORDER, be 0 wherein from the nearest image tagged of present image, another is labeled as 1, the forward direction reference field is the reference picture before DISPLAY ORDER is positioned at present image, the field flag nearest from present image is 0, and another is labeled as 1.
Below by concrete a series of examples, the mark mode with under the different situations in the decoding illustrates labeling process of the present invention: the numeral reference key value among the figure, and the image of arrow indication is a reference picture,
As shown in Figure 1, if present image is the I image, and this image is as two codings, and current decoded field is second on DISPLAY ORDER simultaneously, and first of the current decoded field of mark top is 0;
As shown in Figure 2, if present image is the P image, and carry out the frame coding, mark is 0 from the nearest forward direction reference picture of present image; Forefront forward direction reference picture is 1;
As shown in Figure 3, if present image is the P image, and this image is as two codings, current decoded field is first on DISPLAY ORDER simultaneously, mark when second of the nearest forward direction reference picture in front court be 0, to direction away from present image, 4 fields of mark in turn.
As shown in Figure 4, if present image is the P image, and this frame is as two codings, and current decoded field is second on DISPLAY ORDER simultaneously, mark when first of top, front court be 0, to direction away from present image, 4 fields of mark in turn.
As shown in Figure 5, if present image is the B image, and as frame coding, mark forward direction reference picture is 0, also is 0 to reference picture behind the mark, these two images according to and present image different differentiation on sequential.
As shown in Figure 6, if present image is the B image, and as two codings, current decoded field is first on DISPLAY ORDER simultaneously, and it is 1 that second of mark forward direction reference picture is 0, the first; Being 0, the second to first of reference picture behind the mark is 1; The B image can only index before and after to reference picture, under second restriction of the current side after the match of mark not, be to mark 4 reference field equally like this according to the distance of distance when the front court.
As shown in Figure 7, if present image is the B image, and as two codings, current decoded field is second on DISPLAY ORDER simultaneously, and it is 1 that second of mark forward direction reference picture is 0, the first; Being 0, the second to first of reference picture behind the mark is 1, and reason as above.
Specific coding pattern in some P/B frame/fields, the present invention also considers it:
For the I two field picture encode in the field at the end time, the field into P is always compiled in field, the end, its reference picture has only one, promptly top also is to be labeled as 0 field in the reference picture buffering area.
For the Direct mode in B frame or the B field, its default front and back are nearest reference picture to reference picture, promptly are labeled as 0 reference picture.
For the Symmetric mode in the B frame, its default afterwards derives by the forward direction reference picture to reference picture, if the forward direction reference picture is the reference picture of mark 0, then the back is to be labeled as 1 reference picture to reference picture; Otherwise if the forward direction reference picture is the reference picture of mark 1, then the back is to be labeled as 0 reference picture to reference picture.
After finishing the mark of image in the buffering area, just can carry out the coding/decoding of image according to mark.In the coding/decoding process of present image, keep the data in the image buffer constant, finish up to the present image coding/decoding, need upgrade reference picture in the reference picture buffering area.
In the step 3 of the present invention, according to reference picture present image being carried out Methods for Coding can be that any one utilizes reference picture to carry out the method for predictive coding.
Be the flow chart of reference picture in the update image buffering area of the present invention as shown in Figure 8, the decoding piece image if present image is I or P frame/field, is then replaced reference picture buffering area middle distance present image frame/field farthest with this image, carries out index marker again.
For coding based on frame, if current decoded frame is I or P frame, then decoded I/P frame is replaced in the buffering area from present image reference frame farthest, carry out the mark in the step 2 then.
For example, if current decoded frame is I or P frame, then decoded this frame replaced and be labeled as 1 reference frame in the original buffering area, so the reference frame of this new insertion is wanted the nearest reference frame of decoded picture for next, be labeled as 0, another image originally was labeled as 0, and wanting update mark now is 1.
For coding based on the field, if current decoded frame is I or P field, then decoded I/P field is replaced in the buffering area from present image reference field farthest, carry out the mark in the step 2 then.
For example, if current decoded picture is I or P field, then decoded this image is replaced and be labeled as 3 reference field in the original buffering area, so the reference field of this new insertion is wanted the nearest reference field of decoded picture for next, be labeled as 0, another image originally was labeled as 2, and wanting update mark now is 3, former be labeled as 1 be updated to 2 earlier, former be labeled as 0 be updated to 1.
Decoding B frame or B field, buffer state remains unchanged.
If all images have all been finished coding/decoding, then whole coding/decoding process is finished, and all images in the delete buffer discharges resource.
It should be noted last that: above embodiment is the unrestricted technical scheme of the present invention in order to explanation only, although the present invention is had been described in detail with reference to the foregoing description, those of ordinary skill in the art is to be understood that: still can make amendment or be equal to replacement the present invention, and not breaking away from any modification or partial replacement of the spirit and scope of the present invention, it all should be encompassed in the middle of the claim scope of the present invention.
Claims (10)
1, a kind of reference picture buffer management method is characterized in that: comprise the steps:
Step 1, according to the mode of coding, in buffering area, be preserved for the reference picture of coding/decoding;
Step 2, each reference picture all come mark by a reference key;
Step 3, present image are determined reference picture according to reference key, finish encoding and decoding;
If the current coding/decoding image of step 4 is I frame/field or P frame/field, then decoded I or P frame/field to be replaced in the buffering area from present image reference frame/field farthest, coding/decoding next one image re-executes step 2;
If the current coding/decoding image of step 5 is B frame/field, do not change the reference key of reference picture, the next image of coding/decoding re-executes step 3;
If all images of step 6 have all been finished coding/decoding, then all images in the delete buffer.
2, reference picture buffer management method according to claim 1 is characterized in that: adopt following mode in the described step 2, and the mark reference picture,
The forward direction reference picture is according to DISPLAY ORDER, and reference key is by descending, and the reference key from the nearest reference picture of present image on the DISPLAY ORDER is 0; According to DISPLAY ORDER, reference key is arranged by ascending order to reference picture in the back, and the reference key from the nearest reference picture of present image on the DISPLAY ORDER is 0.
3, reference picture buffer management method according to claim 1 is characterized in that: adopt following mode in the described step 2, and the mark reference picture,
For the coded system based on frame, if present image is the P frame, then its two forward reference frame are these two reference pictures in the buffering area, are 0 from the nearest image tagged of present image on DISPLAY ORDER wherein, and far away another is labeled as 1; For if present frame be the B frame, the back of it is the reference frame be positioned at present image on DISPLAY ORDER after to reference frame, be labeled as 0 in the back in reference sequence, forward reference frame is labeled as 0 for the reference frame before DISPLAY ORDER is positioned at present image in the forward direction reference sequence.
4, according to claim 1 or 3 described reference picture buffer management methods, it is characterized in that: adopt following mode in the described step 2, the mark reference picture, for coded system based on the field, if when the front court is the P field, its 4 forward direction reference pictures are these four reference pictures in the buffering area, are 0 from the nearest image tagged of present image on DISPLAY ORDER wherein; For if when the front court be the B field, the back of it is two reference field be positioned at present image on DISPLAY ORDER after to reference field, on DISPLAY ORDER, be 0 wherein from the nearest image tagged of present image, another is labeled as 1, the forward direction reference field is the reference picture before DISPLAY ORDER is positioned at present image, the field flag nearest from present image is 0, and another is labeled as 1.
5, reference picture buffer management method according to claim 1 is characterized in that: in the described step 3, for the I two field picture encode in the field at the end time, the field into P is always compiled in field, the end, its reference picture is to be labeled as 0 field in the reference picture buffering area.
6, reference picture buffer management method according to claim 1 is characterized in that: in the described step 3, under the Direct Model in B frame or the B field, its default front and back are labeled as 0 reference picture to being referenced as.
7, reference picture buffer management method according to claim 1 is characterized in that: in the described step 3, for the symmetric pattern in the B frame, if the forward direction reference picture is the reference picture of mark 0, then the back is to be labeled as 1 reference picture to reference picture; If the forward direction reference picture is the reference picture of mark 1, then the back is to be labeled as 0 reference picture to reference picture.
8, reference picture buffer management method according to claim 1, it is characterized in that: in the described step 4, the decoding piece image is if present image is I or P frame/field, then replace reference picture buffering area middle distance present image frame/field farthest, carry out index marker again with this image.
9, reference picture buffer management method according to claim 1, it is characterized in that: in the described step 4, for coding based on frame, if current decoded frame is I or P frame, then decoded I/P frame is replaced in the buffering area from present image reference frame farthest, carried out the mark in the step 2 again.
10, reference picture buffer management method according to claim 1, it is characterized in that: in the described step 4, for coding based on the field, if current decoded frame is I or P field, then decoded I/P field is replaced in the buffering area from present image reference field farthest, carry out the mark in the step 2 again.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200310116085 CN1284380C (en) | 2003-12-31 | 2003-12-31 | Reference image buffer region management method |
| PCT/CN2004/000751 WO2005067297A1 (en) | 2003-12-31 | 2004-07-05 | Method for managing the reference image in the buffer |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200310116085 CN1284380C (en) | 2003-12-31 | 2003-12-31 | Reference image buffer region management method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1535029A true CN1535029A (en) | 2004-10-06 |
| CN1284380C CN1284380C (en) | 2006-11-08 |
Family
ID=34304830
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200310116085 Expired - Fee Related CN1284380C (en) | 2003-12-31 | 2003-12-31 | Reference image buffer region management method |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN1284380C (en) |
| WO (1) | WO2005067297A1 (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100455017C (en) * | 2006-05-12 | 2009-01-21 | 四川长虹电器股份有限公司 | Method for managing decoding image buffering area |
| CN102215399A (en) * | 2010-04-09 | 2011-10-12 | 新港传播媒介公司 | Frame buffer compression method, video encoder and system of video encoder |
| CN102547292A (en) * | 2012-02-15 | 2012-07-04 | 北京大学深圳研究生院 | Methods for realizing coding and decoding by using unfixed reference field forward prediction skipping mode |
| CN103916666A (en) * | 2013-01-09 | 2014-07-09 | 北京大学 | Video coding method, video decoding method, coder and decoder |
| CN112055231A (en) * | 2020-08-31 | 2020-12-08 | 浙江大华技术股份有限公司 | Video decoding method, decoding device, decoder and electronic equipment |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111193929B (en) | 2013-12-16 | 2022-04-12 | 浙江大学 | Method and device for coding and decoding forward double-hypothesis coding image block |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH1070727A (en) * | 1996-06-21 | 1998-03-10 | Sanyo Electric Co Ltd | Method and device for transmitting moving picture |
| US6453115B1 (en) * | 2000-08-31 | 2002-09-17 | Keen Personal Media, Inc. | Digital video recording system which generates an index data structure for displaying a video stream in trickplay mode |
| CN1229940C (en) * | 2002-04-30 | 2005-11-30 | 电子科技大学 | Video/data broadcasting co-channel multi-flow transparent transmitting method |
-
2003
- 2003-12-31 CN CN 200310116085 patent/CN1284380C/en not_active Expired - Fee Related
-
2004
- 2004-07-05 WO PCT/CN2004/000751 patent/WO2005067297A1/en active Application Filing
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100455017C (en) * | 2006-05-12 | 2009-01-21 | 四川长虹电器股份有限公司 | Method for managing decoding image buffering area |
| CN102215399A (en) * | 2010-04-09 | 2011-10-12 | 新港传播媒介公司 | Frame buffer compression method, video encoder and system of video encoder |
| CN102215399B (en) * | 2010-04-09 | 2014-07-09 | 新港传播媒介公司 | Frame buffer compression method, video encoder and system of video encoder |
| CN102547292A (en) * | 2012-02-15 | 2012-07-04 | 北京大学深圳研究生院 | Methods for realizing coding and decoding by using unfixed reference field forward prediction skipping mode |
| CN102547292B (en) * | 2012-02-15 | 2018-07-06 | 北京大学深圳研究生院 | Use the coding-decoding method of on-fixed reference field forward prediction skip mode |
| CN103916666A (en) * | 2013-01-09 | 2014-07-09 | 北京大学 | Video coding method, video decoding method, coder and decoder |
| CN103916666B (en) * | 2013-01-09 | 2017-07-14 | 北京大学 | Method for video coding, coding/decoding method, encoder and decoder |
| CN112055231A (en) * | 2020-08-31 | 2020-12-08 | 浙江大华技术股份有限公司 | Video decoding method, decoding device, decoder and electronic equipment |
| CN112055231B (en) * | 2020-08-31 | 2021-10-15 | 浙江大华技术股份有限公司 | Video decoding method, decoding device, decoder and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2005067297A1 (en) | 2005-07-21 |
| CN1284380C (en) | 2006-11-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1314272C (en) | Prediction method, apparatus, and medium for video encoder | |
| CN1225127C (en) | A coding/decoding end bothway prediction method for video coding | |
| CN1669321A (en) | A method for random access and gradual picture refresh in video coding | |
| CN101064849A (en) | Dynamic image coding method, apparatus and computer readable record medium | |
| CN1169373C (en) | Method of switching of coded video sequences and corresponding device | |
| CN1977539A (en) | Method and apparatus for generating coded picture data and for decoding coded picture data | |
| CN1617593A (en) | Signaling valid entry points in a video stream | |
| CN1258925C (en) | Multiple visual-angle video coding-decoding prediction compensation method and apparatus | |
| CN1719904A (en) | Adaptive coding method and device | |
| CN1306822C (en) | Vido decoder based on software and hardware cooperative control | |
| CN1694535A (en) | Complexity hierarchical mode selection method | |
| CN1631043A (en) | Adaptive universal variable length codeword coding for digital video content | |
| CN1209928C (en) | Inframe coding frame coding method using inframe prediction based on prediction blockgroup | |
| CN1284380C (en) | Reference image buffer region management method | |
| CN1399472A (en) | Multichannel image coding device and method | |
| CN1206994A (en) | Signal encoding device and method, signal recording medium and signal transmission method | |
| CN1643608A (en) | Editing of encoded A/V sequences | |
| CN1604650A (en) | Method for hierarchical motion estimation | |
| CN1268136C (en) | Frame field adaptive coding method based on image slice structure | |
| CN102387361B (en) | The reference frame processing method of coding and decoding video and Video Codec | |
| CN1656816A (en) | Improved efficiency fgst framework employing higher quality reference frames | |
| CN1263309C (en) | Motion vector prediction method used for video coding | |
| CN1588988A (en) | Synchronous control device and control method for video elecoding and display | |
| CN1306819C (en) | Video frequency decoding control method and device | |
| CN1306825C (en) | Reference storage device and method based on line buffer in video decoding chip |
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 | ||
| ASS | Succession or assignment of patent right |
Owner name: UNITED XINYUAN DIGITAL AUDIO-VIDEO TECHNOLOGY (BE Free format text: FORMER OWNER: INST. OF COMPUTING TECHN. ACADEMIA SINICA Effective date: 20080411 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20080411 Address after: Beijing city Haidian District East Road No. 1 Yingchuang power building block A room 701 Patentee after: UNITED XINYUAN DIGITAL AUDIO V Address before: Joint laboratory, South Gate graduate building, Institute of physics, Chinese Academy of Sciences, 8 South Avenue, Beijing, Haidian District, Zhongguancun Patentee before: Institute of Computing Technology, Chinese Academy of Sciences |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20061108 Termination date: 20211231 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |