CN101064849A - Dynamic image coding method, apparatus and computer readable record medium - Google Patents
Dynamic image coding method, apparatus and computer readable record medium Download PDFInfo
- Publication number
- CN101064849A CN101064849A CN 200610079712 CN200610079712A CN101064849A CN 101064849 A CN101064849 A CN 101064849A CN 200610079712 CN200610079712 CN 200610079712 CN 200610079712 A CN200610079712 A CN 200610079712A CN 101064849 A CN101064849 A CN 101064849A
- Authority
- CN
- China
- Prior art keywords
- pixels
- block
- frame
- coding
- dynamic 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.)
- Pending
Links
Images
Abstract
The invention discloses a coding method of dynamic image, using time redundancy of dynamic image, saving calculating quality of coding. When the pixel block is decoded in frame, or analyzed in frame, comparing whether current pixel block is similar with coded pixel block, comparing character of current pixel block, such as direction of veins, whether it is similar with coded pixel block; if two are the same or similar, the middle result of pixel block coded or output code are used to replace data in current pixel block, then coding. In another example, current pixel block adopts possible forecast mode of similar pixel block to code, comparing error with a threshold value to decide whether current pixel block adopts the forecast mode.
Description
Technical field
The present invention relates to coding method of dynamic image, install and be loaded with the computer readable recording medium storing program for performing of the computer instruction of this method of execution, belong to the coding techniques field of dynamic image.
Technical background
Some specific technical terms have been used in this article, for example: frame (frame), sheet (slice), infra-frame prediction (intraprediction), inter prediction (inter prediction) or the like, but these notions may be known as other different nouns in the other technologies scheme.What it will be appreciated by those skilled in the art that is, if two notion is same or similar, two structure is same or similar, two features are same or similar, then they are considered to be equal to replacement.For example, image is a unit encoding with frame (frame) usually, but also some technical standard has proposed the notion of sheet (slice) and visual object (visual object), in this article, be without loss of generality, all call frame participating in image encoded unit, when mentioning frame head (frame header), in another kind of technical scheme, may refer to head (slice header); Again for example, a two field picture is divided into the rectangular block of M * N, and M, N are the integers greater than 1, this rectangular block is divided into the little rectangular block of L * K again, L, K are greater than 1, less than the integer of M or N, claim that herein large rectangular block is macro block (macroblock), claim that little rectangular block is piece (block).If a two field picture is divided into the unit that is not rectangle, this does not limit enforcement of the present invention yet.Illustration for example in this paper can not limit function and application scope of the present invention.
Disclosed by the invention is coding method of dynamic image, device and computer readable recording medium storing program for performing.The encoding and decoding technique of dynamic image is a multimedia technology that is widely used, and range of application has internet transmission, satellite broadcasting, television signal coding, video camera, mobile phone, and on media such as light, magnetic, semiconductor field such as video recording storage etc.There are a plurality of international organizations and company to propose multiple coding and decoding scheme at present, the for example MPEG-1 of International Standards Organization, MPEG-2 and MPEG-4 standard, H.261, H.263 and H.263+ the standard of International Telecommunications Union, H.264/MPEG-4AVC the standard of joint video team, the coding and decoding video scheme of Microsoft, Real Networks company, AVS standard of China or the like.Method and apparatus disclosed by the invention can widespread usage on these encoding schemes, but be not limited to above scheme.
Moving picture encoding generally includes prediction, conversion, quantification and four steps of entropy coding.Fig. 1 has shown the block diagram of a typical moving picture encoding device.The original image that collects is 101 li storages, image is exported successively according to coded sequence, original pixel value and predicted pixel values are subtracted each other, do spatial alternation through 102 then, 103 quantize, one tunnel input, 104 scannings, by obtaining output code flow behind 105 entropy codings, another road is gone to quantize by 106,107 inverse transformations and predicted pixel values addition, if the predictive mode of this moment is an infra-frame prediction, then this signal is delivered to 108 and is done infra-frame prediction, otherwise this signal is delivered to 110 storages through 109 filtering, as the reference image, original image and reference picture are delivered to 111 estimations of taking exercises, and the parameter of generation is delivered to 112 compensation of taking exercises, generation forecast image.
Usually image is divided into three types of I frame, P frame and B frames, and wherein the block of pixels in the I frame adopts intraframe predictive coding, and the block of pixels of P frame and B frame adopts intraframe predictive coding or inter prediction encoding.Adopt the macro block of intraframe predictive coding to be known as the I macro block, adopt the macro block of inter prediction encoding to be known as P macro block or B macro block.Infra-frame prediction has multiple predictive mode, and for example, in standard H.264, the luminance signal of 16 * 16 block of pixels has 4 kinds of intra prediction modes, and the luminance signal of 8 * 8 and 4 * 4 block of pixels respectively has 9 kinds of intra prediction modes.Inter prediction also has many kinds of patterns.Example for a macro block illustrates below.When a macro block is done coding, experience two processes usually, as shown in Figure 2.It at first is analytic process, according to the pixel value of current macro (currentmacroblock), its reconstructed value and the reference picture of surrounding pixel (neighbor pixel), analyze all possible macro block (mb) type and predictive mode, perhaps only select wherein several, calculate their cost (cost), macro block (mb) type (macroblock type) and the predictive mode of determining the cost minimum are best macro block (mb) type and optimum prediction mode, then current macro is encoded output code flow according to the result who analyzes.It should be noted that the time, should do the infra-frame prediction analysis, also will do the inter prediction analysis, decide best macro block (mb) type and optimum prediction mode by the size that compares the two cost to the macroblock analysis in P frame or the B frame.That is to say,, also will calculate its infra-frame prediction cost even if for the macro block in a P frame or the B frame.Fig. 3 is the demonstration of a macroblock coding flow process, the first step, and the cost of the various intra prediction modes of calculating current macro, selecting wherein, the pattern of cost minimum is the optimum frame inner estimation mode; Second step, the cost of the various inter-frame forecast modes of calculating current macro, selecting wherein, the pattern of cost minimum is best inter-frame forecast mode; The 3rd step, the relatively size of optimum frame inner estimation mode cost and best inter-frame forecast mode cost; In the 4th step,, then current macro is encoded by the optimum frame inner estimation mode if optimum frame inner estimation mode cost is little; If best inter-frame forecast mode cost is little, then current macro is encoded by best inter-frame forecast mode.
To a macroblock coding time, input is the pixel value of current macro, the reconstructed value and the reference picture of surrounding pixel, and output is code stream.The data that generate in analysis and cataloged procedure are known as intermediate object program.The intermediate object program that different algorithms produces is different.Common intermediate object program has predicted pixel values, residual pixels value, rebuilds pixel value, cost, best macro block (mb) type, optimum prediction mode, motion vector, reference picture numbers, entropy coder state parameter or the like.Some algorithm has been taked special data manipulation, for example, and the textural characteristics of some algorithm gradient of image and gray scale analytic approach, Fourier spectrum analytic approach analysis image.Again for example, the algorithm of list of references [1] is done the direction analysis to the current pixel piece, the grain direction of calculating pixel piece, and this algorithm will generate the intermediate object program that comprises the block of pixels directional information.
The cost function of mentioning herein has many forms, absolute difference sum cost function (sum of absolutedifference cost function) for example, absolute difference sum cost function after the conversion (sum of absolute transformeddifference cost function), difference of two squares cost function (sum of squared difference cost function), mean absolute difference cost function (mean of absolute difference cost function), Lagrange cost function (Lagrange cost function) or the like.
Because macro block has polytype, intraframe predictive coding, inter prediction encoding have multiple predictive mode again, and the required amount of calculation of encoding is big.Existing many algorithms that differ from one another satisfy different needs, claim that in this article these methods are additive method.The invention discloses fast encoding method, can reduce amount of calculation effectively, save resource, satisfy the requirement of real-time coding.
Summary of the invention
The moving picture encoding technology is utilized the spatial redundancy of original image and the purpose that time redundancy reaches compression.For example, a pixel is relevant with its pixel on every side usually; The optimum frame inner estimation mode of a block of pixels also usually with it around the optimum frame inner estimation mode of other block of pixels relevant; Before and after the identical and close block of pixels in two two field picture positions usually same or similar, their optimum frame inner estimation mode, their size of predictive mode cost are also relevant, for a less image sequence of motion, this correlation can continue a lot of frames, a macro block in the frame in back probably with previous frame in certain macro block same or similar, these data that just make macro block in the subsequent frames generate in the time of can utilizing macroblock coding in the previous frame reduce amount of calculation.As shown in Figure 4, I1, I2 are two I frames, and the coded sequence of I1 is preceding, the coded sequence of I2 after.If the block of pixels of I2 3 is same or similar with the block of pixels 3 of I1, and their surrounding pixel is also same or similar, the block of pixels 3 of I2 just can directly be taked its best matching blocks so---and the coding mode coding of the block of pixels 3 of I1 has significantly reduced the calculating of seeking optimum prediction mode.If image I 2 has displacement with respect to image I 1, the border of optimum Match block of pixels may not can the border coincidence of block of pixels just and in the I1, but because the predictive mode correlation of having living space, the optimum prediction mode of block of pixels still may be identical with the optimum prediction mode of block of pixels in the corresponding I1 in the I2.For example in the example of Fig. 5,401,402,403 and 404 is block of pixels of I1, the 405th, the optimum Match block of pixels of certain block of pixels of I2,405 border does not overlap with block boundary in the I1, but prevail at 405 li owing to 401, according to the correlation of having living space, 401 optimum frame inner estimation mode still can be the optimum prediction mode of 12 block of pixels.
If exist a block of pixels and current pixel piece same or similar in other frames of front, then be called the best matching blocks of current pixel piece.The motion of image hour, the identical block of pixels in position in the previous frame as best matching blocks.When the motion of image is violent, seek the position of best matching blocks with the motion vector in estimation or P frame and the B frame, such as the global motion vector that utilizes image.When a movement of objects, motion vector has been noted its displacement, when a back frame is encoded, can utilize motion vector to find best matching blocks.The I frame does not have motion vector, and it can be obtained by front P frame or B frame motion vector with respect to the displacement of former frame.For example in Fig. 6, I1 and I5 are the intraframe predictive coding images, P2, P3 and P4 are predictive-coded pictures forward, the block of pixels 602 of I5 can utilize the motion vector sum 603+604+605+606 of respective pixel piece in the P frame of front to find in the best matching blocks in the I1, I5 wherein is set equals motion vector 604 with respect to the displacement vector 603 of P4.Fig. 7 is the another one example, I1 and I4 are the intraframe predictive coding images, P2 and P3 are predictive-coded pictures forward, the 703rd, I4 is with respect to the displacement vector of P3, make 703 to equal the global motion vector of P3 with respect to P2, the block of pixels 702 of I4 utilizes 703 to seek best matching blocks, points to 701, and then 701 as 702 best matching blocks.In a word, the relative displacement of a block of pixels and its best matching blocks can utilize the extension (extrapolate) of a motion vector or a motion vector to obtain according to the DISPLAY ORDER (display order) of their place frames.
By comparing the pixel of two block of pixels, can judge whether two block of pixels are same or similar.For example, same or similar if the difference of the data of two pixels, two block of pixels or absolute difference sum (SAD), are then judged two pixels, two block of pixels less than a threshold value.If a block of pixels and its best matching blocks belong to two I frames respectively, P frame or B frame are arranged between two I frames, and that utilizes that P frame and B frame generate in cataloged procedure skips information such as identifier (skip flag), motion vector, residue signal and can judge also whether two block of pixels are same or similar.For example, if the residue signal behind block of pixels inter prediction is bigger, just can judge that the block of pixels in this block of pixels and the reference picture is inequality and dissimilar; When coding, detect scene change (scene change), just can judge the not free correlation of two I frames of scene change front and back.Make to use the same method, can judge whether the surrounding pixel of two block of pixels is same or similar.In addition, because said intermediate object program also obtains by original pixel value being done certain arithmetical operation, utilize intermediate object program can judge also whether two block of pixels are same or similar.For example, by comparing the grain direction of two block of pixels, judge whether two block of pixels are same or similar.List of references [1] has been given a kind of definition of grain direction.It should be noted that said same or similar the same or similar of pixel value that not only refer to herein, also refer to the same or similar of two block of pixels textures, grain direction or other characteristics.
During to current pixel block encoding or analysis, intermediate object program that generates in the time of just can directly utilizing the optimum Match block encoding or final result substitute some operation result of current pixel piece, reach the minimizing computation purpose.If the border of best matching blocks does not overlap with the border of block of pixels, then use the alternative best matching blocks of dominant block of pixels in the best matching blocks.For example, during to current pixel block encoding or analysis, directly quote the infra-frame prediction cost of best matching blocks, perhaps directly use the optimum frame inner estimation mode of best matching blocks, perhaps directly duplicate the output code flow of best matching blocks.
If former and later two I frames are identical, perhaps one part of pixel piece wherein is identical or close, so in the calculating that can also dispense entropy coding in some cases.For example, coder state does not change with context (context) in the cataloged procedure, that is to say encoder less than memory, then when a back I frame is encoded, can directly duplicate the part output code flow of previous I frame.In some technical scheme, as H.264, used context-adaptive (context adaptive) entropy coding, the state of encoder constantly changes in the entropy coding process.If when previous I frame is encoded, note the variation of coder state simultaneously, when a back I frame is encoded, the partial code streams that just can directly duplicate previous I frame.The example of Fig. 4 for example, if the block of pixels of I2 0,1,2 and 3 all with I1 in corresponding block of pixels same or similar, the partial code streams that so just can directly duplicate the I1 frame is correspondingly upgraded coder state then, dispenses the calculating of a part of entropy coding.Again for example, if two I frames are identical, a so back I frame just can duplicate whole code streams of previous I frame fully.In addition, for P frame and B frame, also can duplicate code stream in some cases.For example, after two P frames are encoded all is to skip indications (skip flag).
Quoted some concrete implementation methods in above explanation, but these implementation methods only playing illustration, is not the restriction to function and application scope of the present invention.During concrete enforcement, algorithm can have multiple variation, for example, replaces its reconstructed value with the original value of surrounding pixel, does infra-frame prediction; Only utilize the partial pixel of two block of pixels, rather than whole pixel, judge whether it is same or similar.What it will be appreciated by those skilled in the art that is, to any conspicuous modification that the present invention did, change, be equal to replacement, all in claim scope of the present invention.
List of references 1 Feng Pan, Xiao Lin, Susanto Rahardja, Keng Pang Lim, Z.G.Li, DajunWu, and Si Wu, " Fast mode decision algorithm for intraprediction in is videocoding H.264/AVC " IEEE Transactions on Circuits and Systems for Video Technology, vol 15, No7, July 2005.
Exemplary operational environment
Implement coding method of the present invention, install and to realize with a computing equipment, for example general-purpose computing system, special chip (ASIC), dsp chip or the like.Fig. 8 has shown an example operation environment, and it comprises processor, internal memory, communication interface, input-output equipment and an external memory storage, external memory storage can be fix or movably.Computing equipment comprises the computer-readable medium of some forms, for example RAM, ROM, EEPROM, flash memory, CD, DVD, disk, tape or the like.Computer-readable medium also comprises and can be used for wired, the wireless network of loading procedure and data in addition.Method among the present invention can be described with processor executable, is stored on the computer-readable medium work of control computing equipment.During work, program, storage are on internal memory or external memory storage, and program command is carried out by processor.More than only play illustration for example, can not limit function and application scope of the present invention.
Description of drawings
Fig. 1 is the demonstration of a coder structure.
Fig. 2 is the schematic diagram of a macroblock coding process, comprises two processes: analytic process and cataloged procedure.
Fig. 3 is the demonstration of a macroblock coding flow chart.
Fig. 4 is two intraframe predictive coding images arranging by coded sequence, and the schematic diagram of block of pixels position.
Fig. 5 is the schematic diagram of a best matching blocks and its main composition block of pixels position relation, wherein 401,402,403 and 404 is block of pixels of forming reference picture, the 405th, the optimum Match block of pixels of certain block of pixels of present frame, 405 border does not overlap with the block boundary of reference picture, but block of pixels 401 prevails at 405 li, is 405 main composition block of pixels.
Fig. 6 utilizes motion vector to seek the schematic diagram of optimum Match block of pixels, wherein I1 and I5 are the intraframe predictive coding images, P2, P3 and P4 are predictive-coded pictures forward, 603,604,605 and 606 is the relative displacements with respect to former frame of corresponding image, make 603 to equal 604, the relative displacement of the best matching blocks of block of pixels 602 in I1 of I5 is 603+604+605+606.
Fig. 7 utilizes motion vector to seek the schematic diagram of optimum Match block of pixels, wherein I1 and I4 are the intraframe predictive coding images, P2 and P3 are predictive-coded pictures forward, the block of pixels 701 of P3 adopts the intraframe predictive coding pattern, the 703rd, I4 can make it equal the global motion vector of P3 with respect to P2 with respect to the global motion vector of P3, when the block of pixels 702 of I4 utilizes 703 to seek best matching blocks, point to 701, then 701 as 702 best matching blocks.
Fig. 8 is an example operation environment of the present invention.
Fig. 9 is one embodiment of the present of invention.
Figure 10 is another one embodiment of the present invention.
Figure 11 is that the present invention judges the embodiment that duplicates code stream.
Embodiment
Embodiment one
Fig. 9 is the flow chart of one embodiment of the invention.The intra prediction mode and the output code flow of similar block of pixels in the encoded frame of present embodiment utilization reach the purpose of saving computational resource.Present embodiment can be used for the coding of I frame.
Step 11: read the current pixel piece.
Step 12: in other encoded frames, seek the optimum Match block of pixels of current pixel piece.The scope of seeking is in the encoded in front frame.The optimum Match block of pixels is to adopt intraframe predictive coding, perhaps does the block of pixels that infra-frame prediction is analyzed.If the border of optimum Match block of pixels does not have just and the border of this frame block of pixels overlaps, it is the optimum Match block of pixels that encoder can be specified a block of pixels in this frame.For example, specify a nearest block of pixels, perhaps specify in dominant block of pixels in the optimum Match block of pixels.
Step 13: judge whether current pixel piece and optimum Match block of pixels be same or similar.Utilize block of pixels original pixel value, rebuild the result of the arithmetical operation of the intermediate object program that produces in pixel value, analysis and the cataloged procedure or pixel value, judge whether two block of pixels same or similar.For example, if the absolute difference sum (SAD) of two block of pixels less than certain threshold value, thinks that then two block of pixels are similar.
Step 14:, seek the optimum frame inner estimation mode of current pixel piece, then to the current pixel block encoding if two block of pixels are inequality, dissimilar.Can adopt any known method to seek the optimum frame inner estimation mode of current pixel piece, for example full search method.
Step 15: if two block of pixels are same or similar, the code stream that generates when further judging whether to duplicate optimum Match block of pixels coding.Whether can duplicate code stream and depend on Methods for Coding in the concrete technical scheme.
Step 16: if can duplicate the code stream that generates when the optimum Match block of pixels is encoded, duplicate the code stream of best matching blocks, coder state is set according to the entropy coding scheme.
Step 17: if reproducible optimum Match block of pixels when coding the code stream that generates, the optimum frame inner estimation mode that adopts best matching blocks is to the current pixel block encoding.
Embodiment two
Figure 10 is the flow chart of another embodiment of the present invention.The optimum frame inner estimation mode and the cost of similar block of pixels in the encoded frame of present embodiment utilization reach the purpose of saving computational resource.
Step 21: in other encoded frames, seek the optimum Match block of pixels of current pixel piece.The scope of seeking is in the encoded in front frame.The optimum Match block of pixels is to adopt intraframe predictive coding, perhaps does the block of pixels that infra-frame prediction is analyzed.If the border of optimum Match block of pixels does not have just and the border of this frame block of pixels overlaps, it is the optimum Match block of pixels that encoder can be specified a block of pixels in this frame.For example, specify a nearest block of pixels, perhaps specify in dominant block of pixels in the optimum Match block of pixels.
Step 22: judge whether current pixel piece and optimum Match block of pixels be same or similar.Utilize block of pixels original pixel value, rebuild the result of the arithmetical operation of the intermediate object program that produces in pixel value, analysis and the cataloged procedure or pixel value, judge whether two block of pixels same or similar.For example, if the absolute difference sum of two block of pixels, thinks then that two block of pixels are similar less than certain threshold value.
Step 23: if two block of pixels are inequality and dissimilar, calculate the cost of the various intra prediction modes of current pixel piece, select wherein that the pattern of cost minimum is the optimum frame inner estimation mode, perhaps adopt any other known method to seek the optimum frame inner estimation mode of current pixel piece.
Step 24:, the optimum frame inner estimation mode of current pixel piece and intra prediction mode and the cost that cost equals the optimum Match block of pixels are set if two block of pixels are same or similar.
Step 25: calculate the cost of the various inter-frame forecast modes of current pixel piece, selecting wherein, the pattern of cost minimum is best inter-frame forecast mode.
Step 26: whether the cost of judging best infra-frame prediction is less than the cost of best inter prediction.
Step 27: if the cost of best infra-frame prediction is not less than the cost of best inter prediction, the current pixel piece adopts best inter-frame forecast mode coding.
Step 28: if the cost of best infra-frame prediction less than the cost of best inter prediction, the current pixel piece adopts optimum frame inner estimation mode coding.
Step 29: calculate residue signal, conversion quantizes, scanning, entropy coding, output code flow.
Embodiment three
Figure 11 is the flow chart of another embodiment of the present invention.
Step 31: the frame of front is preserved the coder state after each block of pixels is encoded when coding.
Step 32: during to the current pixel block encoding of present frame, judge whether to duplicate the code stream of encoded pixels piece; If can duplicate the code stream of encoded pixels piece, duplicate the code stream of encoded pixels piece, the encoder operating state of preserving before the encoder operating state is returned to; Otherwise press normal procedure to the current pixel block encoding; Preserve the coder state after each block of pixels is encoded.
Above-mentioned execution mode is just in order to be illustrated more clearly in the present invention, and the present invention is not limited to above-mentioned execution mode.What it will be appreciated by those skilled in the art that is, to any conspicuous modification that the present invention did, change, be equal to replacement, all in claim scope of the present invention.
Claims (10)
1, a kind of coding method of dynamic image is characterized in that, in the image sequence cataloged procedure, has a block of pixels at least when doing the analysis of intraframe predictive coding or infra-frame prediction, carries out one of following operation:
1) more said block of pixels and at least one block of pixels encoded, previous frame (previous frame) lining be same or similar;
2) more said block of pixels and at least one block of pixels encoded, in the previous frame is same or similar, and whether the surrounding pixel of two block of pixels of comparison is same or similar.
2, coding method of dynamic image according to claim 1, it is characterized in that, if result relatively is that two block of pixels are same or similar, the intermediate object program that said block of pixels is used is encoded, generate during the block of pixels coding in the previous frame is proceeded coding, the output code flow that generates when perhaps duplicating the block of pixels coding in encoded, the previous frame; Said intermediate object program comprises any data that generate in the block of pixels cataloged procedure.
3, coding method of dynamic image according to claim 1 is characterized in that, if result relatively is that two block of pixels are same or similar, carries out one of following operation at least:
1) said block of pixels adopts the optimum frame inner estimation mode coding of the block of pixels in encoded, the previous frame;
2), the numerical value of the infra-frame prediction cost of said block of pixels is set according to the infra-frame prediction cost of the block of pixels in encoded, the previous frame;
3) output code flow that duplicates the block of pixels in encoded, the previous frame is the output code flow of said block of pixels.
4, according to claim 1 or 2 or 3 described coding method of dynamic image, it is characterized in that, when relatively two pixels or two block of pixels be whether same or similar, used one of following data:
1) at least one original pixel value;
2) at least one rebuilds pixel value;
3) based on original pixel value or rebuild the result of the arithmetical operation of pixel value;
4) intermediate object program of encoded block of pixels generation when coding;
5) data of the grain direction of two block of pixels of expression.
5, a kind of coding method of dynamic image is characterized in that, in the image sequence cataloged procedure, has a block of pixels at least, claim that said block of pixels is the current pixel piece, the current pixel piece is carried out following steps when doing the analysis of intraframe predictive coding or infra-frame prediction:
1) the current pixel piece adopt with previous frame in the identical predictive mode of block of pixels of an intraframe predictive coding, calculate the cost of this intra prediction mode;
2) if the cost of this intra prediction mode less than a threshold value, the current pixel piece adopts this intra prediction mode coding.
6, coding method of dynamic image according to claim 5, it is characterized in that, the block of pixels of the intraframe predictive coding in the said previous frame, be in the previous frame with the identical block of pixels in current pixel piece position, the perhaps block of pixels that obtains by the motion vector computation in P frame, the B frame.
7, according to claim 5 or 6 described coding method of dynamic image, it is characterized in that said cost function satisfies one of following condition at least:
When 1) calculating said cost function, one of following data have been utilized at least: the predicted pixel values of the original pixel value of current pixel piece, current pixel piece;
2) said cost function is with one of minor function: absolute difference sum cost function (sum of absolute differencecost function), absolute difference sum cost function after the conversion (sum of absolute transformeddifference cost function), the quadratic sum cost function (sum of squared difference costfunction) of difference, mean absolute difference cost function (mean of absolute difference cost function), Lagrange cost function (Lagrange cost function).
According to claim 5 or 6 or 7 described coding method of dynamic image, it is characterized in that 8, said threshold value is determined according to quantization parameter (QP) at least.
9, a kind of coding method of dynamic image is characterized in that, in to the image sequence cataloged procedure, one of following operation is arranged:
1) operating state of preserving encoder at least once;
2) has once the encoder operating state of preserving before the encoder operating state returned at least.
10, coding method of dynamic image according to claim 9 is characterized in that, in to the image sequence cataloged procedure, has the code stream of block of pixels encoded before once duplicating at least, to the current location of output code flow.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200610079712 CN101064849A (en) | 2006-04-29 | 2006-04-29 | Dynamic image coding method, apparatus and computer readable record medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200610079712 CN101064849A (en) | 2006-04-29 | 2006-04-29 | Dynamic image coding method, apparatus and computer readable record medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101064849A true CN101064849A (en) | 2007-10-31 |
Family
ID=38965510
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200610079712 Pending CN101064849A (en) | 2006-04-29 | 2006-04-29 | Dynamic image coding method, apparatus and computer readable record medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101064849A (en) |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103227917A (en) * | 2012-01-31 | 2013-07-31 | 华为技术有限公司 | Decoding method and device |
| CN104967856A (en) * | 2015-06-25 | 2015-10-07 | 华为技术有限公司 | Coding method and corresponding device |
| WO2015180139A1 (en) * | 2014-05-30 | 2015-12-03 | 富士通株式会社 | Image coding method and apparatus, and image processing device |
| CN106550237A (en) * | 2015-09-16 | 2017-03-29 | 中国科学院深圳先进技术研究院 | A kind of monitoring video compression method |
| CN106797464A (en) * | 2014-10-06 | 2017-05-31 | 佳能株式会社 | For the method and apparatus of the vector coding in Video coding and decoding |
| CN106851310A (en) * | 2011-01-12 | 2017-06-13 | 佳能株式会社 | The improved Video coding of Fault recovery and decoding |
| CN107222743A (en) * | 2017-07-04 | 2017-09-29 | 苏睿 | A kind of image processing method, device and system |
| CN107483943A (en) * | 2011-02-09 | 2017-12-15 | Lg 电子株式会社 | Store the method for movable information and the method using this method export motion vector prediction value |
| CN108810532A (en) * | 2010-02-24 | 2018-11-13 | 夏普株式会社 | Picture decoding apparatus |
| CN110087075A (en) * | 2019-04-22 | 2019-08-02 | 浙江大华技术股份有限公司 | A kind of coding method of image, code device and computer storage medium |
| CN110312129A (en) * | 2019-06-17 | 2019-10-08 | 浙江大华技术股份有限公司 | The building of most probable mode list, intra prediction, coding method and apparatus |
| CN111279694A (en) * | 2018-11-28 | 2020-06-12 | 深圳市大疆创新科技有限公司 | GDR code stream encoding method, terminal device and machine readable storage medium |
| CN111586416A (en) * | 2020-06-02 | 2020-08-25 | 浙江大华技术股份有限公司 | Video coding method, video coding device, video coder and storage device |
| CN111953975A (en) * | 2020-07-03 | 2020-11-17 | 西安万像电子科技有限公司 | Progressive decoding method and device |
| US11095878B2 (en) | 2011-06-06 | 2021-08-17 | Canon Kabushiki Kaisha | Method and device for encoding a sequence of images and method and device for decoding a sequence of image |
| CN114584673A (en) * | 2020-12-01 | 2022-06-03 | 京东方科技集团股份有限公司 | Image processing method and device |
| CN116320405A (en) * | 2023-05-17 | 2023-06-23 | 西安畅榜电子科技有限公司 | Security monitoring video compression storage method |
| CN111953975B (en) * | 2020-07-03 | 2024-05-17 | 西安万像电子科技有限公司 | Progressive decoding method and device |
-
2006
- 2006-04-29 CN CN 200610079712 patent/CN101064849A/en active Pending
Cited By (34)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108810532B (en) * | 2010-02-24 | 2022-08-19 | 威勒斯媒体国际有限公司 | Image decoding device |
| CN108810532A (en) * | 2010-02-24 | 2018-11-13 | 夏普株式会社 | Picture decoding apparatus |
| CN106851310A (en) * | 2011-01-12 | 2017-06-13 | 佳能株式会社 | The improved Video coding of Fault recovery and decoding |
| US11146792B2 (en) | 2011-01-12 | 2021-10-12 | Canon Kabushiki Kaisha | Video encoding and decoding with improved error resilience |
| US10609380B2 (en) | 2011-01-12 | 2020-03-31 | Canon Kabushiki Kaisha | Video encoding and decoding with improved error resilience |
| US10609409B2 (en) | 2011-02-09 | 2020-03-31 | Lg Electronics Inc. | Method for storing motion information and method for inducing temporal motion vector predictor using same |
| US10848781B2 (en) | 2011-02-09 | 2020-11-24 | Lg Electronics Inc. | Method for storing motion information and method for inducing temporal motion vector predictor using same |
| CN107483943A (en) * | 2011-02-09 | 2017-12-15 | Lg 电子株式会社 | Store the method for movable information and the method using this method export motion vector prediction value |
| CN107483943B (en) * | 2011-02-09 | 2020-04-03 | Lg 电子株式会社 | Video encoding apparatus, video decoding apparatus, and method of deriving motion vector thereof |
| US11095878B2 (en) | 2011-06-06 | 2021-08-17 | Canon Kabushiki Kaisha | Method and device for encoding a sequence of images and method and device for decoding a sequence of image |
| CN103227917A (en) * | 2012-01-31 | 2013-07-31 | 华为技术有限公司 | Decoding method and device |
| CN105917651B (en) * | 2014-05-30 | 2019-05-14 | 富士通株式会社 | Image encoding method, device and image processing equipment |
| CN105917651A (en) * | 2014-05-30 | 2016-08-31 | 富士通株式会社 | Image coding method and apparatus, and image processing device |
| WO2015180139A1 (en) * | 2014-05-30 | 2015-12-03 | 富士通株式会社 | Image coding method and apparatus, and image processing device |
| CN106797464B (en) * | 2014-10-06 | 2020-10-30 | 佳能株式会社 | Method and apparatus for vector coding in video encoding and decoding |
| CN106797464A (en) * | 2014-10-06 | 2017-05-31 | 佳能株式会社 | For the method and apparatus of the vector coding in Video coding and decoding |
| US11051037B2 (en) | 2014-10-06 | 2021-06-29 | Canon Kabushiki Kaisha | Method and apparatus for vector encoding in video coding and decoding |
| CN104967856B (en) * | 2015-06-25 | 2018-10-19 | 华为技术有限公司 | A kind of coding method and relevant device |
| CN104967856A (en) * | 2015-06-25 | 2015-10-07 | 华为技术有限公司 | Coding method and corresponding device |
| CN106550237A (en) * | 2015-09-16 | 2017-03-29 | 中国科学院深圳先进技术研究院 | A kind of monitoring video compression method |
| CN106550237B (en) * | 2015-09-16 | 2020-05-19 | 中国科学院深圳先进技术研究院 | Monitoring video compression method |
| CN107222743B (en) * | 2017-07-04 | 2020-02-04 | 西安万像电子科技有限公司 | Image processing method, device and system |
| CN107222743A (en) * | 2017-07-04 | 2017-09-29 | 苏睿 | A kind of image processing method, device and system |
| CN111279694A (en) * | 2018-11-28 | 2020-06-12 | 深圳市大疆创新科技有限公司 | GDR code stream encoding method, terminal device and machine readable storage medium |
| CN110087075A (en) * | 2019-04-22 | 2019-08-02 | 浙江大华技术股份有限公司 | A kind of coding method of image, code device and computer storage medium |
| CN110087075B (en) * | 2019-04-22 | 2021-07-30 | 浙江大华技术股份有限公司 | Image coding method, coding device and computer storage medium |
| CN110312129A (en) * | 2019-06-17 | 2019-10-08 | 浙江大华技术股份有限公司 | The building of most probable mode list, intra prediction, coding method and apparatus |
| CN111586416A (en) * | 2020-06-02 | 2020-08-25 | 浙江大华技术股份有限公司 | Video coding method, video coding device, video coder and storage device |
| CN111953975A (en) * | 2020-07-03 | 2020-11-17 | 西安万像电子科技有限公司 | Progressive decoding method and device |
| CN111953975B (en) * | 2020-07-03 | 2024-05-17 | 西安万像电子科技有限公司 | Progressive decoding method and device |
| CN114584673A (en) * | 2020-12-01 | 2022-06-03 | 京东方科技集团股份有限公司 | Image processing method and device |
| CN114584673B (en) * | 2020-12-01 | 2024-01-09 | 京东方科技集团股份有限公司 | Image processing method and device |
| CN116320405A (en) * | 2023-05-17 | 2023-06-23 | 西安畅榜电子科技有限公司 | Security monitoring video compression storage method |
| CN116320405B (en) * | 2023-05-17 | 2023-10-27 | 西安畅榜电子科技有限公司 | Security monitoring video compression storage method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101064849A (en) | Dynamic image coding method, apparatus and computer readable record medium | |
| CN1136734C (en) | Variable bitrate video coding method and corresponding video coder | |
| EP3448038B1 (en) | Decoding method for intra predicting a block by first predicting the pixels at the boundary | |
| CN1314272C (en) | Prediction method, apparatus, and medium for video encoder | |
| JP5785285B2 (en) | Dynamic selection of motion prediction search range and extended motion vector range | |
| US8681873B2 (en) | Data compression for video | |
| US9078009B2 (en) | Data compression for video utilizing non-translational motion information | |
| US7764740B2 (en) | Fast block mode determining method for motion estimation, and apparatus thereof | |
| KR100643819B1 (en) | Parameterization for fading compensation | |
| CA2740467C (en) | Scalable video encoding method and scalable video encoding apparatus | |
| CN1819658A (en) | Method and device for coding a video picture in inter or intra mode | |
| CN1708132A (en) | Method and apparatus for predicting motion | |
| CN1647540A (en) | System and method for providing single-layer video encoded bitstreams suitable for reduced-complexity decoding | |
| US20190028732A1 (en) | Moving image encoding device, moving image encoding method, and recording medium for recording moving image encoding program | |
| CN112188196A (en) | Method for rapid intra-frame prediction of general video coding based on texture | |
| CN101888546A (en) | Motion estimation method and device | |
| US20090028241A1 (en) | Device and method of coding moving image and device and method of decoding moving image | |
| CN1134171C (en) | Signal encoding device and method, signal recording medium and signal transmission method | |
| CN1662066A (en) | Method for selecting predicting mode within frame | |
| US20080089418A1 (en) | Image encoding apparatus and memory access method | |
| CN1194544C (en) | Video encoding method based on prediction time and space domain conerent movement vectors | |
| JP4994877B2 (en) | Method and system for selecting a macroblock coding mode in a video frame sequence | |
| US20080137743A1 (en) | Intra-mode predication search method and apparatus for compression of real-time video signal | |
| CN1263309C (en) | Motion vector prediction method used for video coding | |
| CN101061722A (en) | Fast multi-frame motion estimation with adaptive search strategies |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |