CN101299818A - N level sub-pixel search method and apparatus based on whole pixel searching result - Google Patents
N level sub-pixel search method and apparatus based on whole pixel searching result Download PDFInfo
- Publication number
- CN101299818A CN101299818A CN 200810062406 CN200810062406A CN101299818A CN 101299818 A CN101299818 A CN 101299818A CN 200810062406 CN200810062406 CN 200810062406 CN 200810062406 A CN200810062406 A CN 200810062406A CN 101299818 A CN101299818 A CN 101299818A
- Authority
- CN
- China
- Prior art keywords
- sub
- pix
- pixel
- search
- unit
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention belongs to the technical field of the digital video code, particularly to a n-level sub-pixel searching method based on the integer-pixel searching result and a device thereof, characterized by selecting the coordinate position of the top left corner pixel besting matching with the integer-pixel in the reference picture as the center, then performing the n-level sub-pixel searching with variable complexity, obtaining the block matching error function value of the corresponding sub-pixel position point and the integer-pixel position point, comparing the block matching error function value of the corresponding sub-pixel position point and the integer-pixel position point, obtaining the optimum coordinate position at the top left corner of the block corresponding with the block matching error function value, wherein n is not less than 2 in the n-level sub-pixel searching. According to the invention, the sub-pixel searching with high level is independent of the sub-pixel searching result of the lower level, thereby increasing the computing parallelism, saving the coding time, effectively advancing the computing parallelism between different sub-pixel levels when the hardware implement; while the device based on the method can make full use of the parallelism characteristic between the sub-pixels with different levels to increase the processing speed of the hardware.
Description
Technical field
The invention belongs to the digital video coding technical field, particularly relate to a kind of n level sub-pix searching method and device thereof based on whole pixel Search Results.
Background technology
Digital picture, vision signal are handled and the research of coding techniques starts from the 1950's, and the coding method of original adoption is differential pulse coding modulation (being called for short DPCM) on the spatial domain.To the seventies in 20th century, transition coding technology and motion compensated prediction technology begin to occur.In 1974, Ahmed etc. introduced block-based two-dimension discrete cosine transform (being called for short DCT), become a core technology in the modern advanced video encoding framework.These technology are ripe gradually, develop into practical coding techniques in the eighties in 20th century, established block-based hybrid encoding frame, integrate the conventional hybrid coding framework of predictive coding, transition coding and entropy coding, i.e. Hybrid Coding framework.Based on this framework, in more than 20 year, a series of international video encoding standard has appearred in the back, formulate H.261 as ITU, H.263, the MPEG-1 that organizes to set up of the MPEG of standard and ISO H.26L, MPEG-2, MPEG-4 etc.To 21 century, development along with technology, people require video coding that the adaptive technique of compress technique and heterogeneous network more efficiently can be provided to the further demand of multimedia communication, H.264/MPEG-AVC, H.264 a new generation's video encoding standard (is called for short) is exactly to begin to formulate under such background, and issued in 2003.Meanwhile, the video encoding standard AVS second portion of China will also be formulated the end of the year 2003 and is finished, and win in February, 2006 and to be formal national standard (GB/T 20090.2).AVS, compression efficiency H.264 approximately are the twices of MPEG-2, and complexity also improves much simultaneously.Equally, AVS and H.264 all be based on the video encoding standard of conventional hybrid coding framework.
Predictive coding in the conventional video hybrid encoding frame comprises intraframe predictive coding and inter prediction encoding, sees H.264/AVC standard and AVS standard.Wherein intraframe predictive coding claims spatial domain prediction again, and inter prediction encoding claims time domain prediction again; Wherein spatial domain prediction comprises pixel domain prediction and transform domain prediction.
The coding method of predictive coding is as follows: at first, coded frame is divided into coding unit; Coding unit is carried out predictive coding (can be the prediction of spatial domain prediction or time domain prediction or time-space domain combination), and the difference of predicted value and value to be encoded is a residual error data, then residual error data is carried out the two-dimensional transform coding; In transform domain, conversion coefficient is quantized then; Convert 2D signal to one-dimensional signal through overscanning then; Carry out entropy coding at last.
The frame of video of inter prediction (time domain prediction) coding techniques compression is called inter-frame encoding frame, interframe encode comprise forward direction, back to two-way prediction (P frame, B frame), support the different masses size.The coding method of inter-frame encoding frame is as follows: at first, coded frame is divided into coding unit; Adopt the motion estimation techniques of motion search and motion prediction to obtain motion vector and reference unit to coding unit; Adopt motion compensation technique then, obtain the residual error data behind the inter prediction (time domain prediction).Pattern information is for inter prediction unit, and the prediction that comprises active cell divides block size, reference direction (forward direction, back to or two-way prediction) and the reference number of using, reference key, motion vector etc.
General estimation is meant block-based movement representation method; For the scenery that comprises a plurality of objects, the method that generally adopts in the reality is that a picture frame is divided into a plurality of, make the motion in each zone to characterize with a parameterized model, this method is called BMA, be about to image and be divided into some n * n (representative value: 16 * 16 macro blocks), for each macro block is sought a motion vector MV in previous two field picture, and carry out motion compensated predictive coding.
The similarity evaluation function of known block coupling mainly comprises mean square deviation MSE (Mean Square Error), absolute mean deviation MAD (Mean Absolute Difference) and absolute difference and SAD (Sum of AbsoluteDifference) etc.Various criterions are defined as follows:
S in the formula
k(m is that the K framing bit is in (i, j are respectively the side-play amount of level and vertical direction for m, pixel value n) n).Though can there be the difference of some amounts of calculation between each criterion, the selection that proves different criterions by experiment is not very big to the influence of the search speed of estimation match block.Wherein therefore the operand minimum of SAD is widely used as measurement criterion with SAD.
In the video compression standard of international popular,, all adopted the motion vector that divides pixel precision to improve the precision of motion search, thereby improved the performance of coding as H.264/MPEG-AVC and among the autonomous national standard AVS that formulates of MPEG-4 and China.Experiment shows that the motion search of the higher sub-pix of precision can improve the performance of coding effectively.Wherein H.264 all support the motion vector of 1/4th precision in brightness part, support the motion vector of 1/8th precision in chrominance section with AVS.
Traditional sub-pix is searched for as shown in Figure 1:
8 1/2 pixels carry out half pixel searching (comprising interpolation) around best whole pixel earlier, carry out the search of 1/4 precision pixels again around 1/2 best pixel, obtain optimum movement vector at last.Traditional algorithm has the advantage that search point is few, complexity is low, realizes also very meaningful for hardware.
The device of this traditional algorithm correspondence as shown in Figure 2 because the search of 1/2 precision pixels and 1/4 precision pixels is serial in time, 1/4 precision pixels must wait for that the final Search Results of 1/2 precision pixels comes out just can carry out.Like this because the data volume of filtering interpolation is very big, the filter function more complicated, application for high definition video, the time of each macroblock coding is very short, real-time coding per second 30 frames for example, 1920 * 1088 form is that example just needs per second to insert 501350400 pixel values with 1/2 pixel, and this realizes it being very big challenge for hardware.If adopt the search serial of the more high accuracy (as 1/4th precision) of traditional algorithm description to realize, the realization that finally causes hardware will be to increase several pipelining-stages, and this just means the double of memory cell, computing unit, and this cost will be huge.
If carry out hardware designs according to traditional sub-pix search strategy, the another one problem is exactly in 1/4 precision search, need earlier 1/4 precision pixels to be carried out interpolation, this just need use the interpolation result or the intermediate object program of 1/2 a large amount of precision pixels, major part obtained when these interpolation results or intermediate object program were done the search of 1/2 precision pixels in front, we are faced with two alternatives like this: (a) in 1/2 precision pixels search interpolation result or intermediate object program being existed in the middle of the buffer memory, generally is to exist among the SRAM; (b) be not stored in the interpolation result or the intermediate object program of 1/2 precision pixels, when doing 1/4 precision search, recomputate this part value; For first kind of scheme, a large amount of storage areas will be increased; For second kind of scheme, calculate owing to carry out a large amount of repeatability, will directly increase the processing time; The high level sub-pix search of deficiency, solution that how to overcome sub-pix searching method in the prior art depends on low-level sub-pix Search Results problem, increases and calculate degree of parallelism, raising code efficiency, and this is one of problem of the required solution of sub-pix searching method.
Summary of the invention
The object of the present invention is to provide a kind of high level sub-pix search not rely on low-level sub-pix Search Results, calculate the degree of parallelism height, can save a kind of of scramble time based on n level sub-pix searching method and the device thereof of putting in order the pixel Search Results.
A kind of n level sub-pix searching method based on whole pixel Search Results of the present invention is to adopt such technical solution to realize: it is characterized in that selecting whole pixel to search for the coordinate position of match block top left corner pixel in reference picture is the center, carry out the inferior pel search of the variable n level of complexity then, after obtaining corresponding sub-pixel location point and putting in order the block-matching error functional value of location of pixels point, again sub-pixel location point and the block-matching error functional value of putting in order location of pixels point are compared, obtain the coordinate position of the upper left corner in reference picture of the piece of optimum block-matching error functional value correspondence, the n span is n 〉=2 in the inferior pel search of described n level.
A kind of n level sub-pix searcher based on whole pixel Search Results of the present invention is to adopt such technical solution to realize: it comprises n level sub-pix search unit group, whole block of pixels matching error function calculation unit, comparing unit, it is characterized in that described n level sub-pix search unit group is made up of the first order to the n level sub-pix search unit, sub-pix search units at different levels are connected with comparing unit with reference frame storing device, current frame memory, whole pixel search unit respectively, and the n span is n 〉=2 in the inferior pel search of described n level.
Because the present invention adopts the method for searching motion based on the n level sub-pix of whole pixel Search Results, wherein high level sub-pix search does not rely on low-level sub-pix Search Results, thereby has increased the calculating degree of parallelism, has saved the scramble time.This searching method is compared with traditional algorithm under the prerequisite that computation complexity does not increase, coding efficiency does not have obviously to descend in assurance hard-wired the time, has effectively improved the calculating degree of parallelism between the different sub-pixels; The device of realizing based on this method, but made full use of concurrency feature between the sub-pixels with different levels, make the search Parallel Implementation of n level sub-pix, thereby improved hardware process speed.
Description of drawings
Fig. 1 is a pixel relationship schematic diagram in traditional sub-pix searching method
Fig. 2 is the apparatus structure principle schematic that is applied to traditional sub-pix searching method
The sub-pixel location point pixel relationship schematic diagram of searching for when Fig. 3 is n=3
Fig. 4 is the sub-pixel location point pixel relationship schematic diagram at some search of Standard N=2 H.264
Fig. 5 is the sub-pixel location point pixel relationship schematic diagram at AVS Standard N=2 o'clock search
Fig. 6 is one of structural principle schematic diagram of the present invention
Fig. 7 is two of a structural principle schematic diagram of the present invention
Drawing reference numeral explanation: 1-reference frame storing device, the 2-current frame memory, 3-puts in order the pixel search unit, 4-first order sub-pix search unit, 5-second level sub-pix search unit, 6-n level sub-pix search unit, 7-first order sub-pixel interpolation unit, sub-pixel interpolation unit, the 8-second level, 9-n level sub-pixel interpolation unit, 10-puts in order block of pixels matching error function calculation unit, 11-first order sub-pix block-matching error function calculation unit, sub-pix block-matching error function calculation unit, the 12-second level, 13-n level sub-pix block-matching error function calculation unit, the 14-comparing unit, 15-first order sub-pix comparing unit, 16-second level sub-pix comparing unit, 17-n level sub-pix comparing unit, 18-n level sub-pix search unit group, 19-reference window data storage, 20-current block data storage, 21-first order sub-pix search unit, 22-second level sub-pix search unit, 23-third level sub-pix search unit, 24-n level sub-pix search unit, 25-1/2 pixel interpolation filtering unit, 26-1/4 pixel interpolation filtering unit, 27-1/8 pixel interpolation filtering unit, 28-1/2
nThe pixel interpolation filtering unit, 29-first order category-B delay process unit, category-B delay process unit, the 30-second level, 31-3rd level category-B delay process unit, 32-n level category-B delay process unit, 33-puts in order block of pixels matching error function calculation unit, 34-first order sub-pix block-matching error function calculation unit, sub-pix block-matching error function calculation unit, the 35-second level, 36-third level sub-pix block-matching error function calculation unit, 37-n level sub-pix block-matching error function calculation unit, 38-first order category-A delay process unit, category-A delay process unit, the 39-second level, 40-n-1 level category-A delay process unit, 41-block-matching error function comparing unit.
Embodiment
N level sub-pix searching method based on whole pixel Search Results of the present invention is that to select whole pixel to search for the coordinate position of match block top left corner pixel in reference picture be the center, carry out the inferior pel search of the variable n level of complexity then, after obtaining corresponding sub-pixel location point and putting in order the block-matching error functional value of location of pixels point, again sub-pixel location point and the block-matching error functional value of putting in order location of pixels point are compared, obtain the coordinate position of the upper left corner in reference picture of the piece of optimum block-matching error functional value correspondence, the n span is n 〉=2 in the inferior pel search of described n level.
The inferior pel search of the n level that described complexity is variable be with (x y) is the center, divide the n level carry out precision from 1/2 pixel to
The search of pixel, n 〉=2 and n are integer; Obtain the search block of corresponding 8n sub-pix coordinate position point; Described 8n sub-pix coordinate position point can with whole location of pixels point (x, y) block-matching error functional value compares, the coordinate of the upper left corner of match block that obtains optimum block-matching error functional value correspondence in reference picture (x ', y '), x ' wherein, y ' is integer, non-integral a kind of at least;
The inferior pel search of the n level that described complexity is variable be with (x y) is the center, divide the n level carry out precision from 1/2 pixel to
The search of pixel, n 〉=2 and n are integer; Obtain the search block of corresponding 16n sub-pix coordinate position point; Described 16n sub-pix coordinate position point can with whole location of pixels point (x, y) block-matching error functional value compares, the coordinate of the upper left corner of match block that obtains optimum block-matching error functional value correspondence in reference picture (x ', y '), x ' wherein, y ' is integer, non-integral a kind of at least.
In Fig. 6: the n level sub-pix searcher based on whole pixel Search Results of the present invention, comprise n level sub-pix search unit group, whole block of pixels matching error function calculation unit 10, comparing unit 14, described n level sub-pix search unit group is by first order sub-pix search unit 4, second level sub-pix search unit 5, ... to n level sub-pix search unit 6 compositions, sub-pix search units at different levels respectively with reference frame storing device 1, current frame memory 2, whole pixel search unit 3 is connected with comparing unit 14, the n span is n 〉=2 in the inferior pel search of described n level, is in parallel between the sub-pix search units at different levels;
Described first order sub-pix search unit 4 is in series by corresponding first order sub-pixel interpolation unit 7, first order sub-pix block-matching error function calculation unit 11 and first order sub-pix comparing unit 15; Second level sub-pix search unit 5 is in series by sub-pixel interpolation unit, the corresponding second level 8, sub-pix block-matching error function calculation unit, the second level 12 and second level sub-pix comparing unit 16; N level sub-pix search unit 6 is in series by corresponding n level sub-pixel interpolation unit 9, n level sub-pix block-matching error function calculation unit 13 and n level sub-pix comparing unit 17; Sub-pix search units at different levels between the first order and the n level are in series by corresponding sub-pixel interpolation unit, sub-pix block-matching error function calculation unit and sub-pix comparing unit, described sub-pixel interpolation unit input and whole pixel search unit 3, reference frame storing device 1 join, described sub-pix block-matching error function calculation unit is connected with current frame memory 2, and the output of described sub-pix comparing unit is connected with comparing unit 14;
In Fig. 7: the another kind of n level sub-pix searcher of realizing of the present invention based on whole pixel Search Results, comprise n level sub-pix search unit group, reference window data storage 19, current block data storage 20, block-matching error function comparing unit 41 and whole block of pixels matching error function calculation unit 33, described n level sub-pix search unit group input respectively with reference window data storage 19, current block data storage 20 is connected, and described current block data storage 20 is connected with block-matching error function comparing unit 41 through whole block of pixels matching error function calculation unit 33.
Described n level sub-pix search unit group is made up of the first order to the n level sub-pix search unit, wherein, first order sub-pix search unit 21 is by 1/2 pixel interpolation filtering unit 25, first order category-B delay process unit 29, first order sub-pix block-matching error function calculation unit 34 is formed, described 1/2 pixel interpolation filtering unit 25 respectively with reference window data storage 19, whole block of pixels matching error function calculation unit 33 is connected the input of first order category-B delay process unit 29 with first order sub-pix block-matching error function calculation unit 34, output is joined with current block data storage 20 and block-matching error function comparing unit 41 respectively;
Described second level sub-pix search unit 22 is made up of 1/4 pixel interpolation filtering unit 26, category-B delay process unit, the second level 30, sub-pix block-matching error function calculation unit, the second level 35; Be connected with first order category-A delay process unit 38 in described 1/4 pixel interpolation filtering unit 26 and the first order sub-pix search unit 21 between the output of 1/2 pixel interpolation filtering unit 25, be connected with sub-pix block-matching error function calculation unit, the second level 35 between 1/4 pixel interpolation filtering unit 26 and the block-matching error function comparing unit 41, sub-pix block-matching error function calculation unit, the second level 35 joins with category-B delay process unit, the second level 30;
Described third level sub-pix search unit 23 is made up of 1/8 pixel interpolation filtering unit 27, third level category-B delay process unit 31, third level sub-pix block-matching error function calculation unit 36; Be connected with category-A delay process unit, the second level 39 between the output of 1/4 pixel interpolation filtering unit 26 in described 1/8 pixel interpolation filtering unit 27 and the second level sub-pix search unit, be connected with third level sub-pix block-matching error function calculation unit 36 between 1/8 pixel interpolation filtering unit 27 and the block-matching error function comparing unit 41, third level sub-pix block-matching error function calculation unit 36 joins with third level category-B delay process unit 31;
......；
N level sub-pix search unit is by 1/2
nPixel interpolation filtering unit 28, n level category-B delay process unit 32, n level sub-pix block-matching error function calculation unit 37 are formed; Described 1/2
nIn pixel interpolation filtering unit 28 and the upper level sub-pix search unit 1/2
N-1Be connected with upper level category-A delay process unit between the output of pixel interpolation filtering unit, 1/2
nBeing connected with 37, the n level sub-pix block-matching error function calculation unit 37, n level sub-pix block-matching error function calculation unit between pixel interpolation filtering unit 28 and the block-matching error function comparing unit 41 joins with upper level category-B delay process unit;
Above-mentioned sub-pix search unit at different levels is made up of corresponding sub-pixel interpolation filter unit, category-B delay process unit, block-matching error function calculation unit, sub-pixel interpolation filter unit at different levels and category-B delay process unit join with block-matching error function calculation unit respectively, block-matching error function calculation unit is connected with block-matching error function comparing unit, if sub-pix search units at different levels place progression is m, n 〉=m 〉=1 wherein, when m=1, this grade sub-pixel interpolation filter unit and reference window data storage join; In m 〉=2 o'clock, the input of corresponding sub-pixel interpolation filter units at different levels joins through the output of (m-1 level) category-A delay process unit and upper level sub-pixel interpolation filter unit.
Embodiment 1:
A kind of n level sub-pix searching method based on whole pixel Search Results, in this example, the sub-pix of regulation highest level is 1/8 precision, i.e. the situation of n=3, the sub-pix that needs so altogether to search for comprises 3 grades.Known whole pixel is searched for the coordinate of the match block upper left corner in reference picture for (x, y), middle x, y are integers.So that (x y) is the center, carries out 2 grades variable inferior pel search of complexity, as shown in Figure 3.
The searching position of the first order comprises that top left corner pixel is the search block of following coordinate position point:
(x-0.5，y-0.5)、(x，y-0.5)、(x+0.5，y-0.5)、(x-0.5，y)、(x+0.5，y)、(x-0.5，y+0.5)、(x，y+0.5)、(x+0.5，y+0.5)
Partial searching position comprises that top left corner pixel is the search block of following coordinate position point:
(x-0.25，y-0.25)、(x，y-0.25)、(x+0.25，y-0.25)、(x-0.25，y)、(x+0.25，y)、(x-0.25，y+0.25)、(x，y+0.25)、(x+0.25，y+0.25)
The searching position of 3rd level comprises that top left corner pixel is the search block of following coordinate position point:
(x-0.125，y-0.125)、(x，y-0.125)、(x+0.125，y-0.125)、(x-0.125，y)、(x+0.125，y)、(x-0.125，y+0.125)、(x，y+0.125)、(x+0.125，y+0.125)
After obtaining this sub-pixel location point of 24 and putting in order the MSE value of location of pixels point, for 24 sub-pixel location points with put in order location of pixels point (x, y) MSE value compares, the coordinate of the upper left corner that obtains the corresponding piece of minimum MSE value in reference picture (x ', y '), x ' wherein, y ' is integer, non-integral a kind of at least.
Embodiment 2:
A kind of n level sub-pix searching method based on whole pixel Search Results, in this example, at video encoding standard H.264, search precision is to 1/4 pixel, and the sub-pix that needs so altogether to search for comprises that 2 grades is n=2.H.264 to divide be 4 * 4 to the smallest blocks of video encoding standard, so the search of n level sub-pix also is based on 4 * 4 block sizes.Known whole pixel is searched for the coordinate of the match block upper left corner in reference picture for (x, y), middle x, y are integers.So that (x y) is the center, carries out 2 grades variable inferior pel search of complexity, as shown in Figure 4.
The searching position of the first order comprises that top left corner pixel is 4 * 4 search block of following coordinate position point:
(x-0.5，y-0.5)、(x，y-0.5)、(x+0.5，y-0.5)、(x-0.5，y)、(x+0.5，y)、(x-0.5，y+0.5)、(x，y+0.5)、(x+0.5，y+0.5)
Partial searching position comprises that top left corner pixel is 4 * 4 search block of following coordinate position point:
(x-0.25，y-0.25)、(x，y-0.25)、(x+0.25，y-0.25)、(x-0.25，y)、(x+0.25，y)、(x-0.25，y+0.25)、(x，y+0.25)、(x+0.25，y+0.25)
After obtaining this sub-pixel location point of 16 and putting in order the sad value of location of pixels point, for 8 1/2 location of pixels points, relatively more corresponding sad value, the coordinate of the upper left corner of 1/2 block of pixels that obtains minimum sad value correspondence in reference picture (x1, y1); For 8 1/4 location of pixels points, relatively more corresponding sad value, the coordinate of the upper left corner that obtains minimum sad value corresponding blocks in reference picture (x2, y2).Again with location point (x1, y1), (x1, y1), (x1, y1) corresponding sad value relatively, the coordinate of the upper left corner of piece that obtains minimum sad value correspondence in reference picture (x ', y '), x ' wherein, y ' is integer, non-integral a kind of at least.
Embodiment 3:
A kind of n level sub-pix searching method based on whole pixel Search Results, in this example, at the AVS video encoding standard, search precision is to 1/4 pixel, and the sub-pix that needs so altogether to search for comprises that 2 grades is n=2.It is 8 * 8 that the smallest blocks of AVS video encoding standard is divided, so n level sub-pix search also is based on 8 * 8 block sizes.Known whole pixel is searched for the coordinate of the match block upper left corner in reference picture for (x, y), middle x, y are integers.So that (x y) is the center, carries out 2 grades variable inferior pel search of complexity, as shown in Figure 5.
The searching position of the first order comprises that top left corner pixel is 8 * 8 search block of following coordinate position point:
(x-0.5，y-0.5)、(x，y-0.5)、(x+0.5，y-0.5)、(x-0.5，y)、(x+0.5，y)、(x-0.5，y+0.5)、(x，y+0.5)、(x+0.5，y+0.5)(x-1.5，y-1.5)、(x，y-1.5)、(x+1.5，y-1.5)、(x-1.5，y)、(x+1.5，y)、(x-1.5，y+1.5)、(x，y+1.5)、(x+1.5，y+1.5)
Partial searching position comprises that top left corner pixel is 8 * 8 search block of following coordinate position point:
(x-0.25，y-0.25)、(x，y-0.25)、(x+0.25，y-0.25)、(x-0.25，y)、(x+0.25，y)、(x-0.25，y+0.25)、(x，y+0.25)、(x+0.25，y+0.25)(x-0.75，y-0.75)、(x，y-0.75)、(x+0.75，y-0.75)、(x-0.75，y)、(x+0.75，y)、(x-0.75，y+0.75)、(x，y+0.75)、(x+0.75，y+0.75)
After obtaining this sub-pixel location point of 32 and putting in order the MAD value of location of pixels point, for 32 sub-pixel location points with put in order location of pixels point (x, y) MAD value compares, the coordinate of the upper left corner of piece that obtains minimum MAD value correspondence in reference picture (x ', y '), x ' wherein, y ' is integer, non-integral a kind of at least.
Embodiment 4:
A kind of device based on the n level sub-pix searching method of putting in order the pixel Search Results, as shown in Figure 6, n=2 in this example, at the AVS standard, the block-matching error function adopts MAD.
This device comprises 2 grades of sub-pix search unit groups, whole pixel MAD computing unit 10, comparing unit 14, described 2 grades of sub-pix search unit groups are made up of first order sub-pix search unit 4, second level sub-pix search unit 5, first order sub-pix search unit 4 is connected with comparing unit 14 with reference frame storing device 1, current frame memory 2, whole pixel search unit 3 respectively with second level sub-pix search unit 5, is in parallel between first order sub-pix search unit 4 and the second level sub-pix search unit 5.
Described first order sub-pix search unit 4 is in series by corresponding first order sub-pixel interpolation unit 7, first order sub-pix MAD computing unit 11 and first order sub-pix comparing unit 15; Second level sub-pix search unit 5 is in series by sub-pixel interpolation unit, the corresponding second level 8, second level sub-pix MAD computing unit 12 and second level sub-pix comparing unit 16.Input and whole pixel search unit 3, the reference frame storing device 1 of described first order sub-pixel interpolation unit 7 join, described first order sub-pix MAD computing unit 11 is connected with current frame memory 2, and the output of described first order sub-pix comparing unit 15 is connected with comparing unit 14; Input and whole pixel search unit 3, the reference frame storing device 1 of sub-pixel interpolation unit, the described second level 8 join, described second level sub-pix MAD computing unit 12 is connected with current frame memory 2, and the output of described second level sub-pix comparing unit 16 is connected with comparing unit 14.
Described first order sub-pixel interpolation unit 7 adopts 1/2 pixel interpolation filtering device of 4 taps to obtain 1/2 pixel value, exports 1/2 interpolation result; Described first order sub-pix MAD computing unit 11 calculates the MAD value of 1/2 location of pixels point; Described first order sub-pix comparing unit 15, (x1 is y1) as output to select minimum MAD value and corresponding coordinate position.
Sub-pixel interpolation unit, the described second level 8 adopts 1/2 pixel interpolation filtering device of 4 taps to obtain 1/2 pixel intermediate object program earlier, adopts 1/4 pixel interpolation filtering device of 4 taps to obtain 1/4 pixel value again, exports 1/4 interpolation result; Described second level sub-pix MAD computing unit 12 calculates the MAD value of 1/4 location of pixels point; Described second level sub-pix comparing unit 16, (x2 is y2) as output to select minimum MAD value and corresponding coordinate position.
Whole pixel MAD computing unit 10 inputs are respectively from reference frame storing device 1 and current frame memory 2, and (x, MAD value y) is to comparing unit 14 for the whole pixel of output.
Reference frame storing device 1: the pixel value of depositing reference frame.The whole pixel of input search for the coordinate of the match block upper left corner in reference picture (x, y); According to (x, y) value output reference window data to 2 grade sub-pix search unit.
Current frame memory 2: the pixel value of depositing present frame.
Comparing unit 14: finish sub-pixels with different levels Search Results function.Be input as (x, y), (x1, y1), (x2 y2) and the MAD value of correspondence position, exports final Search Results (x ', y ').
Embodiment 5:
A kind of device of n level (n 〉=2) the sub-pix searching method based on whole pixel Search Results, as shown in Figure 6, n=2 in this example, at standard H.264, the block-matching error function adopts SAD.
This device comprises 2 grades of sub-pix search unit groups, whole pixel SAD computing unit 10, comparing unit 14, described 2 grades of sub-pix search unit groups are made up of first order sub-pix search unit 4, second level sub-pix search unit 5, first order sub-pix search unit 4 is connected with comparing unit 14 with reference frame storing device 1, current frame memory 2, whole pixel search unit 3 respectively with second level sub-pix search unit 5, is in parallel between first order sub-pix search unit 4 and the second level sub-pix search unit 5.
Described first order sub-pix search unit 4 is in series by corresponding first order sub-pixel interpolation unit 7, first order sub-pix SAD computing unit 11 and first order sub-pix comparing unit 15; Second level sub-pix search unit 5 is in series by sub-pixel interpolation unit, the corresponding second level 8, second level sub-pix SAD computing unit 12 and second level sub-pix comparing unit 16.Input and whole pixel search unit 3, the reference frame storing device 1 of described first order sub-pixel interpolation unit 7 join, described first order sub-pix SAD computing unit 11 is connected with current frame memory 2, and the output of described first order sub-pix comparing unit 15 is connected with comparing unit 14; Input and whole pixel search unit 3, the reference frame storing device 1 of sub-pixel interpolation unit, the described second level 8 join, described second level sub-pix SAD computing unit 12 is connected with current frame memory 2, and the output of described second level sub-pix comparing unit 16 is connected with comparing unit 14.
Described first order sub-pixel interpolation unit 7 adopts 1/2 pixel interpolation filtering device of 6 taps to obtain 1/2 pixel value, exports 1/2 interpolation result; Described first order sub-pix SAD computing unit 11 calculates the sad value of 1/2 location of pixels point; Described first order sub-pix comparing unit 15, (x1 is y1) as output to select minimum sad value and corresponding coordinate position.
Sub-pixel interpolation unit, the described second level 8 adopts 1/2 pixel interpolation filtering device of 6 taps to obtain 1/2 pixel value earlier, adopts bilinear 1/4 pixel interpolation filtering device to obtain 1/4 pixel value again, exports 1/4 interpolation result; Described second level sub-pix SAD computing unit 12 calculates the sad value of 1/4 location of pixels point; Described second level sub-pix comparing unit 16, (x2 is y2) as output to select minimum sad value and corresponding coordinate position.
Whole pixel SAD computing unit 10 inputs are respectively from reference frame storing device 1 and current frame memory 2, and (x, sad value y) is to comparing unit 14 for the whole pixel of output.
Reference frame storing device 1: the pixel value of depositing reference frame.The whole pixel of input search for the coordinate of the match block upper left corner in reference picture (x, y); According to (x, y) value output reference window data to 2 grade sub-pix search unit.
Current frame memory 2: the pixel value of depositing present frame.
Comparing unit 14: finish sub-pixels with different levels Search Results function.Be input as (x, y), (x1, y1), (x2 y2) and the sad value of correspondence position, exports final Search Results (x ', y ').
Embodiment 6:
A kind of n level sub-pix searcher based on whole pixel Search Results, as
Shown in Figure 7.In this example, at the AVS video encoding standard.For the AVS standard, the highest 1/4 pixel precision (n=2) of supporting of its brightness.1/2 pixel interpolation filtering function adopts the filter of 4 taps, and 1/4 low precision value filtering device partly adopts 4 tap filtering, and part adopts bilinearity filtering.Simultaneously, this example adopts SAD as the block-matching error function.
This device comprises 2 grades of sub-pix search unit groups, reference window data storage 19, current block data storage 20, SAD comparing unit 41 and whole pixel SAD computing unit 33, described n level sub-pix search unit group input is connected with reference window data storage 19, current block data storage 20 respectively, and described current block data storage 20 is connected with SAD comparing unit 41 through whole pixel SAD computing unit 33.
Described 2 grades of sub-pix search unit groups are made up of the first order to second level sub-pix search unit, wherein, first order sub-pix search unit 21 is by 1/2 pixel interpolation filtering unit 25, first order category-B delay process unit 29, first order sub-pix SAD computing unit 34 is formed, described 1/2 pixel interpolation filtering unit 25 respectively with reference window data storage 19, whole pixel SAD computing unit 33 is connected the input of first order category-B delay process unit 29 with first order sub-pix SAD computing unit 34, output is joined with current block data storage 20 and SAD comparing unit 41 respectively;
Described second level sub-pix search unit 22 is made up of 1/4 pixel interpolation filtering unit 26, category-B delay process unit, the second level 30, second level sub-pix SAD computing unit 35; Be connected with first order category-A delay process unit 38 in described 1/4 pixel interpolation filtering unit 26 and the first order sub-pix search unit 21 between the output of 1/2 pixel interpolation filtering unit 25, be connected with second level sub-pix SAD computing unit 35 between 1/4 pixel interpolation filtering unit 26 and the SAD comparing unit 41, second level sub-pix SAD computing unit 35 joins with category-B delay process unit, the second level 30;
Described 1/2 pixel interpolation filtering unit 25 adopts 1/2 pixel interpolation filtering device of 4 taps to obtain 1/2 pixel value, exports 1/2 interpolation result; Described first order sub-pix SAD computing unit 34 calculates the sad value of different 1/2 location of pixels;
Described 1/4 pixel interpolation filtering unit 26 adopts 1/4 pixel interpolation filtering device of 4 taps to obtain 1/4 pixel value, exports 1/4 interpolation result; Described second level sub-pix SAD computing unit 35 calculates the sad value of different 1/4 location of pixels;
Described first order category-B delay process unit 29, category-B delay process unit, the second level 30 use registers group are finished the current block data of current block data storage output are carried out buffer memory, cooperate the corresponding filtering interpolation result of different stage; Described first order category-A delay process unit 38 uses registers group to finish filtering interpolation result to different stage to carry out the path cutting before sending into the next stage filtering interpolation, thereby obtains higher hardware synthesis frequency.
Embodiment 7:
A kind of device based on n level (n 〉=2) the sub-pix searching method of putting in order the pixel Search Results, as
Shown in Figure 7.In this example, at video encoding standard H.264, the highest 1/4 pixel precision (n=2) of supporting of its brightness.1/2 pixel interpolation filtering function adopts the filter of 6 taps, and 1/4 low precision value filtering device adopts bilinearity filtering.Simultaneously, this example adopts MAD as the block-matching error function.
This device comprises 2 grades of sub-pix search unit groups, reference window data storage 19, current block data storage 20, MAD comparing unit 41 and whole pixel MAD computing unit 33, described n level sub-pix search unit group input is connected with reference window data storage 19, current block data storage 20 respectively, and described current block data storage 20 is connected with MAD comparing unit 41 through whole pixel MAD computing unit 33.
Described 2 grades of sub-pix search unit groups are made up of the first order to second level sub-pix search unit, wherein, first order sub-pix search unit 21 is by 1/2 pixel interpolation filtering unit 25, first order category-B delay process unit 29, first order sub-pix MAD computing unit 34 is formed, described 1/2 pixel interpolation filtering unit 25 respectively with reference window data storage 19, whole pixel MAD computing unit 33 is connected the input of first order category-B delay process unit 29 with first order sub-pix MAD computing unit 34, output is joined with current block data storage 20 and MAD comparing unit 41 respectively;
Described second level sub-pix search unit 22 is made up of 1/4 pixel interpolation filtering unit 26, category-B delay process unit, the second level 30, second level sub-pix MAD computing unit 35; Be connected with first order category-A delay process unit 38 in described 1/4 pixel interpolation filtering unit 26 and the first order sub-pix search unit 21 between the output of 1/2 pixel interpolation filtering unit 25, be connected with second level sub-pix MAD computing unit 35 between 1/4 pixel interpolation filtering unit 26 and the MAD comparing unit 41, second level sub-pix MAD computing unit 35 joins with category-B delay process unit, the second level 30;
Described 1/2 pixel interpolation filtering unit 25 adopts 1/2 pixel interpolation filtering device of 6 taps to obtain 1/2 pixel value, exports 1/2 interpolation result; Described first order sub-pix MAD computing unit 34 calculates the MAD value of different 1/2 location of pixels;
Described 1/4 pixel interpolation filtering unit 26 adopts bilinear 1/4 pixel interpolation filtering device to obtain 1/4 pixel value, exports 1/4 interpolation result; Described second level sub-pix MAD computing unit 35 calculates the MAD value of different 1/4 location of pixels;
Described first order category-B delay process unit 29, category-B delay process unit, the second level 30 use registers group are finished the current block data of current block data storage output are carried out buffer memory, cooperate the corresponding filtering interpolation result of different stage; Described first order category-A delay process unit 38 uses registers group to finish filtering interpolation result to different stage to carry out the path cutting before sending into the next stage filtering interpolation, thereby obtains higher hardware synthesis frequency.
Claims (10)
1. n level sub-pix searching method based on whole pixel Search Results, it is characterized in that selecting whole pixel to search for the coordinate position of match block top left corner pixel in reference picture is the center, carry out the inferior pel search of the variable n level of complexity then, after obtaining corresponding sub-pixel location point and putting in order the block-matching error functional value of location of pixels point, again sub-pixel location point and the block-matching error functional value of putting in order location of pixels point are compared, obtain the coordinate position of the upper left corner in reference picture of the piece of optimum block-matching error functional value correspondence, the n span is n 〉=2 in the inferior pel search of described n level.
2. the n level sub-pix searching method based on whole pixel Search Results as claimed in claim 1, the inferior pel search that it is characterized in that the n level that described complexity is variable be with (x y) be the center, branch n level carry out precision from 1/2 pixel to
The search of pixel, n 〉=2 and n are integer; Obtain the search block of corresponding 8n sub-pix coordinate position point;
The searching position of the first order comprises that top left corner pixel is the search block of following coordinate position point:
(x-0.5，y-0.5)、(x，y-0.5)、(x+0.5，y-0.5)、(x-0.5，y)、(x+0.5，y)、(x-0.5，y+0.5)、(x，y+0.5)、(x+0.5，y+0.5)
Partial searching position comprises that top left corner pixel is the search block of following coordinate position point:
(x-0.25，y-0.25)、(x，y-0.25)、(x+0.25，y-0.25)、(x-0.25，y)、(x+0.25y)、(x-0.25，y+0.25)、(x，y+0.25)、(x+0.25，y+0.25)
The searching position coordinate points of 3rd level to the n-1 level: omit;
The searching position of n level comprises that top left corner pixel is the search block of following coordinate position point:
3. the n level sub-pix searching method based on whole pixel Search Results as claimed in claim 2, it is characterized in that described 8n sub-pix coordinate position point can with whole location of pixels point (x, y) block-matching error functional value compares, the coordinate of the upper left corner of match block that obtains optimum block-matching error functional value correspondence in reference picture (x ', y '), x ' wherein, y ' is integer, non-integral a kind of at least.
4. the n level sub-pix searching method based on whole pixel Search Results as claimed in claim 1, the inferior pel search that it is characterized in that the n level that described complexity is variable be with (x y) be the center, branch n level carry out precision from 1/2 pixel to
The search of pixel, n 〉=2 and n are integer; Obtain the search block of corresponding 16n sub-pix coordinate position point;
The searching position of the first order comprises that top left corner pixel is the search block of following coordinate position point:
(x-0.5，y-0.5)、(x，y-0.5)、(x+0.5，y-0.5)、(x-0.5，y)、(x+0.5，y)、(x-0.5，y+0.5)、(x，y+0.5)、(x+0.5，y+0.5)(x-1.5，y-1.5)、(x，y-1.5)、(x+1.5，y-1.5)、(x-1.5，y)、(x+1.5，y)、(x-1.5，y+1.5)、(x，y+1.5)、(x+1.5，y+1.5)
Partial searching position comprises that top left corner pixel is the search block of following coordinate position point:
(x-0.25，y-0.25)、(x，y-0.25)、(x+0.25，y-0.25)、(x-0.25，y)、(x+0.25，y)、(x-0.25，y+0.25)、(x，y+0.25)、(x+0.25，y+0.25)、(x-0.75，y-0.75)、(x，y-0.75)、(x+0.75，y-0.75)、(x-0.75，y)、(x+0.75，y)、(x-0.75，y+0.75)、(x，y+0.75)、(x+0.75，y+0.75)
The searching position coordinate points of 3rd level to the n-1 level: omit;
The searching position of n level comprises that top left corner pixel is the search block of following coordinate position point:
5. the n level sub-pix searching method based on whole pixel Search Results as claimed in claim 4, it is characterized in that described 16n sub-pix coordinate position point can with whole location of pixels point (x, y) block-matching error functional value compares, the coordinate of the upper left corner of match block that obtains optimum block-matching error functional value correspondence in reference picture (x ', y '), x ' wherein, y ' is integer, non-integral a kind of at least.
6. sub-pix searcher based on the n level of whole pixel Search Results, comprise n level sub-pix search unit group, whole block of pixels matching error function calculation unit, comparing unit, it is characterized in that described n level sub-pix search unit group is made up of the first order to the n level sub-pix search unit, sub-pix search units at different levels are connected with comparing unit with reference frame storing device, current frame memory, whole pixel search unit respectively, and the n span is n 〉=2 in the inferior pel search of described n level.
7. the n level sub-pix searcher based on whole pixel Search Results as claimed in claim 6 is characterized in that between the described sub-pix search unit at different levels in parallel.
8. the n level sub-pix searcher based on whole pixel Search Results as claimed in claim 6, it is characterized in that described sub-pix search unit at different levels is in series by corresponding sub-pixel interpolation unit, sub-pix block-matching error function calculation unit and sub-pix comparing unit, described sub-pixel interpolation unit input and whole pixel search unit, reference frame storing device join, described block-matching error function calculation unit is connected with current frame memory, and the output of described sub-pix comparing unit is connected with comparing unit.
9. n level sub-pix searcher based on whole pixel Search Results, comprise n level sub-pix search unit group, reference window data storage, current block data storage, block-matching error function comparing unit and whole block of pixels matching error function calculation unit, the input that it is characterized in that described n level sub-pix search unit group is connected with reference window data storage, current block data storage respectively, and described current block data storage is connected with block-matching error function comparing unit through whole block of pixels matching error function calculation unit.
10. the n level sub-pix searcher based on whole pixel Search Results as claimed in claim 8, it is characterized in that described n level sub-pix search unit group is made up of the first order-n level sub-pix search unit, sub-pix search units at different levels are by corresponding sub-pixel interpolation filtering unit group, category-B delay process unit, block-matching error function calculation unit is formed, the input of the output of described sub-pixel interpolation filtering unit group and category-B delay process unit and block-matching error function calculation unit joins, block-matching error function calculation unit is connected with the input of block-matching error function comparing unit, sub-pix search units at different levels place progression is m, n 〉=m 〉=1 wherein, when m=1, the input of this grade sub-pixel interpolation filter unit and the output of reference window data storage join; In m 〉=2 o'clock, the input of corresponding stage sub-pixel interpolation filter unit joins through the output of (m-1 level) category-A delay process unit and upper level sub-pixel interpolation filtering unit group.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200810062406 CN101299818B (en) | 2008-06-04 | 2008-06-04 | N level sub-pixel search method based on whole pixel searching result |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200810062406 CN101299818B (en) | 2008-06-04 | 2008-06-04 | N level sub-pixel search method based on whole pixel searching result |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101299818A true CN101299818A (en) | 2008-11-05 |
| CN101299818B CN101299818B (en) | 2010-11-17 |
Family
ID=40079482
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200810062406 Expired - Fee Related CN101299818B (en) | 2008-06-04 | 2008-06-04 | N level sub-pixel search method based on whole pixel searching result |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101299818B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101867815A (en) * | 2010-04-30 | 2010-10-20 | 西北工业大学 | Rapid fractional pixel hierarchical searching method |
| CN102547258A (en) * | 2010-12-14 | 2012-07-04 | 联芯科技有限公司 | Method for searching sub-pixels in interframe codes, motion searching method and module thereof |
| CN104837027A (en) * | 2015-04-20 | 2015-08-12 | 北京奇艺世纪科技有限公司 | Sub-pixel motion estimation method and device |
| CN109309837A (en) * | 2018-10-29 | 2019-02-05 | 珠海市杰理科技股份有限公司 | Method for estimating, the device of image frame data |
| CN109889851A (en) * | 2019-03-11 | 2019-06-14 | 珠海市杰理科技股份有限公司 | Block matching method, device, computer equipment and the storage medium of Video coding |
| CN112866719A (en) * | 2019-11-27 | 2021-05-28 | 北京博雅慧视智能技术研究院有限公司 | Rapid pixel-division prediction method for AVS2 |
| CN116208775A (en) * | 2023-03-03 | 2023-06-02 | 格兰菲智能科技有限公司 | Motion estimation method, motion estimation device, computer equipment and hardware encoder |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110223326B (en) * | 2019-06-18 | 2021-04-30 | 无锡英斯特微电子有限公司 | Method and system for determining sub-pixel region in photoelectric navigation system |
-
2008
- 2008-06-04 CN CN 200810062406 patent/CN101299818B/en not_active Expired - Fee Related
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101867815A (en) * | 2010-04-30 | 2010-10-20 | 西北工业大学 | Rapid fractional pixel hierarchical searching method |
| CN101867815B (en) * | 2010-04-30 | 2011-09-14 | 西北工业大学 | Rapid fractional pixel hierarchical searching method |
| CN102547258A (en) * | 2010-12-14 | 2012-07-04 | 联芯科技有限公司 | Method for searching sub-pixels in interframe codes, motion searching method and module thereof |
| CN104837027A (en) * | 2015-04-20 | 2015-08-12 | 北京奇艺世纪科技有限公司 | Sub-pixel motion estimation method and device |
| CN104837027B (en) * | 2015-04-20 | 2018-04-27 | 北京奇艺世纪科技有限公司 | The method for estimating and device of a kind of point of pixel |
| CN109309837A (en) * | 2018-10-29 | 2019-02-05 | 珠海市杰理科技股份有限公司 | Method for estimating, the device of image frame data |
| CN109889851A (en) * | 2019-03-11 | 2019-06-14 | 珠海市杰理科技股份有限公司 | Block matching method, device, computer equipment and the storage medium of Video coding |
| CN112866719A (en) * | 2019-11-27 | 2021-05-28 | 北京博雅慧视智能技术研究院有限公司 | Rapid pixel-division prediction method for AVS2 |
| CN112866719B (en) * | 2019-11-27 | 2022-09-23 | 北京博雅慧视智能技术研究院有限公司 | Rapid pixel-division prediction method for AVS2 |
| CN116208775A (en) * | 2023-03-03 | 2023-06-02 | 格兰菲智能科技有限公司 | Motion estimation method, motion estimation device, computer equipment and hardware encoder |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101299818B (en) | 2010-11-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101299818B (en) | N level sub-pixel search method based on whole pixel searching result | |
| CN101159875B (en) | Double forecast video coding/decoding method and apparatus | |
| KR100897880B1 (en) | Bi-directional predicting method for video coding/decoding | |
| CN101394560B (en) | Mixed production line apparatus used for video encoding | |
| CN101990100B (en) | Decoding method and coding method | |
| CN105191309A (en) | Content adaptive prediction distance analyzer and hierarchical motion estimation system for next generation video coding | |
| CN102263951B (en) | Quick fractal video compression and decompression method | |
| CN103098473A (en) | Low complexity transform coding using adaptive DCT/DST for intra-prediction | |
| CN104067622A (en) | Method for encoding image, method for decoding image, image encoder, and image decoder | |
| CN101860748A (en) | Side information generating system and method based on distribution type video encoding | |
| RU2573747C2 (en) | Video encoding method and apparatus, video decoding method and apparatus and programmes therefor | |
| CN102823250A (en) | Image encoding device, image decoding device, image encoding method, and image decoding method | |
| CN104079937B (en) | It is a kind of based on motion vector analysis by H.264 to the quick interframe code-transferring method and transcoding device of HEVC | |
| CN102291579B (en) | Rapid fractal compression and decompression method for multi-cast stereo video | |
| CN103188496A (en) | Fast motion estimation video encoding method based on motion vector distribution forecast | |
| CN103546758A (en) | Rapid depth map sequence interframe mode selection fractal coding method | |
| CN107318016A (en) | A kind of HEVC inter-frame forecast mode method for rapidly judging based on zero piece of distribution | |
| CN102291582A (en) | Distributed video encoding method based on motion compensation refinement | |
| CN101389028A (en) | Video intra-frame encoding method based on space domain decomposition | |
| CN102316323B (en) | Rapid binocular stereo-video fractal compressing and uncompressing method | |
| CN100502511C (en) | Method for organizing interpolation image memory for fractional pixel precision predication | |
| CN101309404A (en) | Resolution descending video transcoding method and transcoding device thereof | |
| CN112929629B (en) | Intelligent virtual reference frame generation method | |
| CN100377597C (en) | Video compressing method facing mobile apparatus | |
| CN106534855A (en) | Lagrange factor calculation method for SATD |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20101117 Termination date: 20190604 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |