The invention relates to the field of digital video compression and specifically to a method for producing a motion vector while reducing the complexity and increasing the speed of the required computations.
Historically, in communication systems, a transmitter would send information to a receiver in an analog format. This means a continuous stream of data (generally voltage variations) is sent from the transmitter to the receiver. The problem with this type of transmission is that there will inevitably be some loss in information. To reduce this loss, many transmission systems have moved to a digital format where the data is converted into a binary digital stream (a sequence of zeros and ones). This type of transmission is useful in that it is robustxe2x80x94it can be stored, recovered, transmitted, processed, etc., all without virtually any error. Any system using the data merely has to distinguish between a zero and a one which is generally easy to do.
A problem arises, however, with a digital transmission that was generally not present in analog transmission. A video stream can be broken down into a series of juxtaposed frames. When a frame is digitized so that it can be transmitted digitally, the frame contains a large amount of data (the series of zeroes and ones), which is much greater than the data required to represent an analog picture. This data is sent to the receiver through a transmission medium which can handle only a finite amount of data per time interval. This becomes problematic when a user requires continuously updated data. For example, in television, film, or other types of video communications, the illusion of motion would be frustrated if there was too large a time interval between consecutive frames. A typical transmission medium may not be able to handle the large amount of data present in a digital transmission in the time interval necessary for many applications. This problem led to the introduction of compression technology which is focused on representing and transmitting a frame of data using fewer bits than without compression.
Briefly, compression algorithms recognize that not every bit of every frame of data need be encoded and transmitted. Samples of data are generally similar enough to each other so that one sample could be used as an estimate of the next sample. These similarities can be further broken down into spatial and temporal relations. Spatial similarities assume that for a given frame of data, information in one portion of the frame will be similar to other information in the same frame. Temporal similarities assume that consecutive frames will generally be similar. This means a frame can basically be represented by a frame which came immediately before it. The temporal similarities are determined using motion estimation algorithms.
There are many types of motion estimation algorithms. These include: the block-based method, pixel-based recursion, and feature based. The block based method, generally referred to as a block matching algorithm, has been adopted by several video compression standards including H.261 and MPEG (Moving Picture Experts Group), and is the focus of the invention.
In the block matching algorithm, a field or frame (collectively referred to hereinafter as a xe2x80x9cpicturexe2x80x9d) which is to be motion compressed is compared to a previously encoded picture which is not motion compressed. The comparison is a correlation of the luminance values between the pictures. The non-motion compressed pictures are called I-pictures (or intra-pictures). They are compressed using only spatial techniques such as a discrete cosine transform. During compression, the first picture to be encoded, which is compared to the I-picture, is called a P-picture (predictive). The P-picture or I-picture could also be used as a reference for encoding a B-picture (bi-directional, prediction can come from prior or subsequent I- or P-pictures). Therefore the terms xe2x80x9creference picturexe2x80x9d and xe2x80x9ccoded picturexe2x80x9d will be used throughout the specification to avoid limitation in scope. All of the pictures (both coded and reference) are divided into a plurality of picture elements (xe2x80x9cpixelsxe2x80x9d or xe2x80x9cpelsxe2x80x9d). A macroblock is defined as a rectangular block having 16 by 16 pixels and is the foundation of block matching compression techniques.
For each macroblock of coded picture, a search is performed in a corresponding search area of a reference picture for the macroblock yielding the best match. A best match motion vector is ascertained which starts at the origin of the coded macroblock and points to the macroblock in the reference picture within the search area. The search area is basically a window of the reference picture which generally corresponds spatially to the macroblock of the coded picture. The best match is usually determined by subtracting the corresponding pixels in each macroblock from one another, squaring the result, and then adding up all the squared subtracted values. This is known as the Mean Square Error and is mathematically expressed as             MSE      ⁡              (                  i          ,          j                )              =                  1                  N          2                    ⁢                        ∑                      m            =            1                    N                ⁢                  xe2x80x83                ⁢                              ∑                          n              =              1                        N                    ⁢                      xe2x80x83                    ⁢                                    (                                                                    S                    t                                    ⁡                                      (                                          m                      ,                      n                                        )                                                  -                                                      S                                          t                      -                      1                                                        ⁡                                      (                                                                  m                        -                        i                                            ,                                              n                        -                        j                                                              )                                                              )                        2                                ,            -      w        ≤          (              i        ,        j            )        ≤    w  
where Nxc3x97N is a rectangular block size, w is the search range, St is the block to be motion compressed in the coded picture, Stxe2x88x921 is the reference picture, and i and j represent the horizontal and vertical shift, respectively, of the reference macroblock in the reference picture. This produces the most accurate comparison because any differences between the compared blocks are squared thereby emphasizing larger differences.
As can easily be discerned, this comparison is an expensive process because it requires a multiplier which is not cheaply realized in silicon technologies. Moreover, this comparison is performed for each possible macroblock location in the search range. Considering the large amount of computations required, and the need for a multiplier, this comparison is generally not used in real world applications, but is useful in computer simulations.
One example of a more practical comparison is the Mean Absolute Error (MAE). This computation is similar to the MSE but takes the absolute value of the results instead of squaring them. The Mean Absolute Error is thus defined as:             MAE      ⁢              xe2x80x83            ⁢              (                  i          ,          j                )              =                  1                  N          2                    ⁢              xe2x80x83            ⁢                        ∑                      m            =            1                    N                ⁢                  xe2x80x83                ⁢                              ∑                          n              =              1                        N                    ⁢                      xe2x80x83                    ⁢                      "LeftBracketingBar"                                                            S                  t                                ⁢                                  xe2x80x83                                ⁢                                  (                                      m                    ,                    n                                    )                                            -                                                S                                      t                    -                    1                                                  ⁢                                  xe2x80x83                                ⁢                                  (                                                            m                      -                      i                                        ,                                          n                      -                      j                                                        )                                                      "RightBracketingBar"                                ,            -      w        ≤          (              i        ,        j            )        ≤    w  
However, even this comparison causes problems because the search area chosen could be quite large and each computation requires many circuits. To illustrate, the following 10 stages of circuitry would be necessary:
Stage 1: 256 subtraction circuits (comparing the coded picture to the reference picture).
Stage 2: 256 square compute circuits (if using the MSE) or absolute value circuits (if using MAE).
Stage 3: 128 summation circuits to add 256 numbers.
Stage 4: 64 summation circuits to add 128 numbers.
Stage 5: 32 summation circuits to add 64 numbers.
Stage 6: 16 summation circuits to add 32 numbers.
Stage 7: 8 summation circuits to add 16 numbers.
Stage 8: 4 summation circuits to add 8 numbers.
Stage 9: 2 summation circuits to add 4 numbers.
Stage 10: 1 summation circuit to add 2 numbers.
Ten stages are required for every macroblock being compared. Each adder can generally perform only one addition per clock cycle. So, even when the Mean Absolute Error is used, there is still a 10 stage delay.
One prior art solution utilizing a hierarchical approach, decimates the reference picture thereby reducing the number of pixels which need to be analyzed. The decimation process generally includes taking a specified number of pixels, usually 4, in the horizontal and vertical direction, and replacing them with their average value. This yields a picture with 16 times less information which can be more easily processed but with decreased precision. The decimated image is searched and a relatively imprecise motion vector is determined. Then, based on the imprecise motion vector, a second detailed search is performed on the full image centered around the imprecise motion vector but with a smaller search range. However, even during the decimated search portion, this technique still requires an enormous amount of computations to be performed for each iteration of computing the MSE or MAE. This hierarchical technique is thus costly because a large amount of hardware is still necessary due to pixels with full precision accuracy being analyzed even within the decimated image.
Therefore, there exists a need for a motion estimation technique which is less expensive to implement and which requires less processing time than the techniques of the prior art.
One aspect of the invention is a method for locating a first block in a first picture which corresponds to a second block in a second picture. The method includes dividing the first and second pictures into a plurality of pixels, each of the pixels having a value with a first precision, and defining a first search area within the first picture. The method further includes reducing the precision of the values of the pixels in the first and second pictures thereby producing pixels with a second precision. The method still further includes comparing the pixels with the second precision in the second block with pixels with the second precision in all blocks disposed within the first search area, thereby producing a plurality of best match candidates, and averaging the best match candidates to produce the first block.
This aspect, like the ones which follow, yields a method of finding a motion vector which is faster and less costly than prior art techniques. This is accomplished through the comparison of reduced precision pixels.
In another aspect of the invention a computer readable storage medium contains data for locating a first block in a first picture which corresponds to a second block in a second picture. The data includes the steps of dividing the first and second pictures into a plurality of pixels, each of the pixels having a value with a first precision, and defining a first search area within the first picture. The data further includes steps for reducing the precision of the values of the pixels in the first and second pictures thereby producing pixels with a second precision. The data still further includes steps for comparing the pixels with the second precision in the second block with pixels with the second precision in all blocks disposed within the first search area, thereby producing a plurality of best match candidates; and averaging the best match candidates to produce the first block.
Yet another aspect of the invention is a transmitter for transmitting data from a transmitter to a receiver, the data including a plurality of pictures of at least a first and second type. The transmitter comprising transmitting means for transmitting the data; means for dividing the pictures of first and second type into a plurality of pixels, each of the pixels having a value with a first precision. The transmitter further includes means for dividing the pictures of first and second type into a plurality of blocks, the blocks each including a plurality of the pixels; means for defining a first search area within the pictures of the first type; and means for reducing the precision of the values of the pixels in the pictures of a first and second type thereby producing pixels with a second precision. The transmitter still further includes means for comparing the pixels with the second precision in a first block in a picture of the second type with pixels with the second precision in all blocks disposed within the first search area, thereby producing a plurality of best match candidates; and means for averaging the best match candidates to produce a computed best match.
It is an object of the invention to produce a method of determining a motion vector which faster and less expensive than prior art techniques.
These objects, as well as others, will become more apparent from the following description read in conjunction with the accompanying drawings where like reference numerals are intended to designate the same elements.
USPTO Backgrounds
USPTO Backgrounds