Temporal Motion Vector Filtering

Abstract

Methods and apparatus, including computer program products, implementing and using techniques for performing temporal motion vector filtering in digital video are disclosed. A recursive hierarchical process is used to determine a motion vector. In the recursive hierarchical process, a neighborhood of old motion vectors is filtered to generate a first estimated motion vector for an image patch in a pair of two image frames. The filtering process uses multiple vectors in a neighborhood around the old motion vector to improve the prediction of the first estimated motion vector. The temporal vector partitioning process separates motion vectors associated with an object from motion vectors associated with a background before selecting a best motion vector, which improves the selection process.

Description

BACKGROUND

This invention relates to improving video and graphics processing.

At low display refresh rates (for example, 50 fields/sec for interlaced video material, and 24 frames/sec for film-originated material) on progressive digital display devices, a display artifact referred to as “area flicker” can occur. The area flicker becomes more visible as the size of the display increases, due to the high sensitivity to flicker in the human visual peripheral region. A simple solution for reducing the area flicker is to increase the display refresh rate by repeating the input fields or frames at a higher rate (for example, 100 fields/sec for interlaced video). This solves the area flicker problem for static scenes. However, the repetition introduces a new artifact in scenes with motion, known as “motion judder” or “motion smear,” particularly in areas with high contrast, due to the human eye's tendency to track the trajectory of moving objects. For this reason, motion compensated frame interpolation is preferred, in which the pixels are computed in an interpolated frame or field at an intermediate point on a local motion trajectory, so that there is no discrepancy between an expected image motion due to eye tracking and a displayed image motion. The local image motion trajectory from one field or frame to the next is described by a motion vector.

Motion vectors can be computed at different levels of spatial resolution, such as at a pixel level, at an image patch level, or at an object level. Computing a motion vector for every pixel independently would theoretically result in an ideal data set, but is unfeasible due to the large number of computations required. Computing a motion vector for each image patch reduces the number of computations, but can result in artifacts due to motion vector discontinuities within an image patch. Computing motion vectors on an object basis can theoretically result in high resolution and lower computational requirements, but object segmentation is a challenging problem.

Therefore what is needed is a way to determine motion vectors efficiently and accurately, such that little or no discrepancy exists between an expected image motion due to eye tracking and a displayed image motion in a digital video.

SUMMARY

The present invention provides methods and apparatus for determining motion vectors efficiently and accurately, such that little or no discrepancy exists between an expected image motion due to eye tracking and a displayed image motion in a digital video.

In general, in one aspect, the invention provides methods and apparatus, including computer program products, implementing and using techniques for performing temporal motion vector filtering in a digital video sequence. Several vectors are received, the vectors representing potential motion vectors for an image patch including one or more of an object and a background. The vectors are partitioned into two or more vector clusters. A representative vector is determined for each vector cluster. Each representative vector is tested to determine which representative vector most accurately reflects a displacement of the image patch between a first frame and a second frame of the digital video. The representative vector that most accurately reflects the displacement of the image patch is selected as a motion vector.

Advantageous implementations can include one or more of the following features. Partitioning can include determining a first seed vector for a first cluster and a second seed vector for a second cluster by identifying two vectors among the vectors that are furthest apart from each other, and for every other vector, placing the vector into the first cluster if the vector is closest to the first seed vector, and placing the vector into the second cluster if the vector is closest to the second seed vector. Determining a representative vector can include for each cluster, determining which vector in the cluster has a minimum total distance from all the other vectors in the cluster. Each cluster can represent an object or a background in the digital video. Each image patch can include several pixels. One vector can represent an old motion vector originating at a first pixel and ending at a second pixel, and the other vectors originate at the first pixel and end at pixels different from the second pixel in a horizontal direction or a vertical direction. The size of each image patch can be 8 by 8 pixels.

Testing each representative vector can include, for each representative vector, centering a first window on a pixel that forms an origin of the representative vector, centering a second window on a pixel that forms an end point of the representative vector, determining a sum of absolute differences of luma values for the pixels in the first window and pixels at corresponding positions in the second window, and selecting as the representative vector which most accurately reflects a displacement of the image patch, the representative vector that has a minimum sum of absolute differences. The dimensions of the first and second windows can be identical to the dimensions of the image patch.

The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the invention will be apparent from the description and drawings, and from the claims.

DESCRIPTION OF THE DRAWINGS

The foregoing aspects and many of the attendant advantages of this invention will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:

FIG. 1 shows a flowchart of a recursive hierarchical process for determining a motion vector;

FIG. 2 shows an example of vectors for determining a best motion vector at a resolution of 1:4 of an original resolution of a video frame;

FIG. 3 shows an example of vectors for determining a best motion vector at a resolution of 1:2 of an original resolution of a video frame;

FIG. 4 shows an example of vectors for determining a best motion vector at an original resolution of a video frame;

FIG. 5A shows a flowchart of a process for performing temporal vector partitioning;

FIG. 5B shows an exemplary set of neighborhood vectors that can be used in a temporal vector partitioning process; and

FIG. 6 illustrates a computer system employed to implement the invention. Like reference symbols in the various drawings indicate like elements.

DETAILED DESCRIPTION

The present invention provides methods and apparatus for determining motion vectors efficiently and accurately, such that little or no discrepancy exists between an expected image motion due to eye tracking and a displayed image motion in a digital video. This is accomplished by using a recursive hierarchical approach including a temporal vector partitioning scheme to determine motion vectors.

Generally, for motion compensated approaches to work well, including the recursive hierarchical approach described herein, two basic assumptions are made about the nature of the object motion: (1) moving objects have inertia, and (2) moving objects are large. The inertia assumption implies that a motion vector changes only gradually with respect to a temporal vector sampling interval (that is, the frame rate in the digital video). The large objects assumption implies that a motion vector changes only gradually with respect to a spatial vector sampling interval, that is, the vector field is smooth and has only few boundary motion discontinuities.

The goal of the recursive hierarchical method is to find a motion vector by applying a source correlation window to a first image frame and a target correlation window to a subsequent image frame, and placing the target correlation window such that a best match with the source correlation window is obtained, that is, the contents of the source correlation window and target correlation window are as similar as possible. At the same time, the number of calculations needed to perform the matching between the source correlation window and the target correlation window must be as low as possible, while still searching the entire vector space limit. In order to accomplish these goals, the recursive hierarchical method uses multiple resolution levels of the image frames. A best motion vector is first determined for the lowest resolution level by projecting the previous best motion vector at the highest resolution level down to the lowest resolution level, and testing it and one or more updates. This best motion vector is then propagated up to a higher resolution level, where some adjustments are made and a new best motion vector is determined. This new best motion vector is propagated up to yet another higher resolution level, where more adjustments are made and another new best motion vector is determined. This process is repeated until the highest, original, resolution level has been reached and a best motion vector has been identified for the original resolution level.

FIG. 1 shows one implementation of a recursive hierarchical process (100). It is assumed that multiple resolution levels of the image frames have already been generated. As can be seen in FIG. 1, the recursive hierarchical process (100) for determining a motion vector starts by projecting a motion vector from a previous image frame down to a lowest resolution level (step 102). A set of update vectors is generated and tested to find a best motion vector at this lowest resolution level (step 104). In one implementation this test is performed by comparing pixels in corresponding positions in a source correlation window centered on the origin of the motion vector and a target correlation window centered on the end point of each respective update vector. The comparison can, for example, be performed by subtracting a luma value for each pixel in the source window from the corresponding pixel in the respective target windows. In this case the best match would be defined by finding a minimum sum of absolute differences (SAD) for a source correlation window and a target correlation window pair, and the best motion vector would be the vector associated with this source correlation window and a target correlation window pair.

After the minimum SAD has been found, the best vector is selected (step 106). The process (100) then examines whether there are any higher resolution levels (step 108). If there are higher resolution levels, the process propagates the best vector up to the next higher resolution level (step 110) and repeats steps 104 through 108. If there are no higher resolution levels, the process proceeds to step 112, where the best vector is selected as the motion vector and is used for motion compensation, which completes the process for the current frame. The advantage of this approach is that at a lower level, an update of a pixel is equivalent to an update of two or more pixels at the next higher level, depending on the difference in resolution between the two levels. If there are, for example, three resolution levels, say 1:1, 1:2 and 1:4, and an update of +/−1 pixel at each level, the convergence delay is potentially reduced by a factor of four. Expressed differently, effectively the resolution hierarchy is used to accelerate the temporal recursion convergence. This results in significant improvements, in particular for frames containing small objects moving with high velocities.

The invention will now be explained in greater detail, by way of example of a recursive hierarchical scheme with three levels of resolution at 1:1, 1:2, and 1:4, with an image patch grid of 4×4 pixels, and with reference to FIGS. 1-4. It should be noted that the vectors shown in FIGS. 2-4 are representative only of this example, and that the number of resolution levels and the number and/or the types of vectors at each resolution level can be varied depending on various factors, such as computational cost, quality, processing speed, and so on.

FIG. 4 shows an image patch grid (400), which is divided into image patches (405) of 4×4 pixels, where each pixel is illustrated as a circle (410). The dark pixels (415) indicate locations at which motion vectors are computed for each 4×4 image patch of pixels. As can be seen in FIG. 4, one motion vector is computed for each 4×4 image patch of pixels and the locations within each 4×4 image patch of the motion vectors' origins are the same. FIG. 3 shows the same pixel grid (400) at half the resolution of the original pixel grid of FIG. 4. FIG. 2 shows the same pixel grid (400) at the lowest resolution, which in the present example is half the resolution of FIG. 3, or a fourth of the resolution of FIG. 4.

As shown in FIGS. 1 and 2, a recursive hierarchical process for determining a motion vector starts by projecting a motion vector (205) from a previous image down to a lowest resolution level (step 102), which in the present example is 1:4 of the original resolution, and is illustrated in FIG. 2. In one implementation the old motion vector (205) is filtered before it is projected, primarily to take care of cases in which the neighborhood contains an object-background boundary that causes a discontinuity in the vectors. This process is also referred to as temporal vector partitioning and will be explained in further detail below. The filtered output is a new base vector at the 1:1 level, which is subsequently projected down to 1:4 level. In the first frame of a sequence, that is, when there is no previous image, the process (100) starts with a zero vector as the old motion vector. In one implementation, the zero vector is also used when there is a scene break in the video, that is, when there is no continuity between two frames.

FIG. 5A shows one implementation of a temporal vector partitioning process (500). As was described above, the purpose of the temporal vector partitioning process (500) is to give a better estimation of an old motion vector (205) to be projected to the lowest resolution level, as shown in FIG. 2. Therefore, rather than simply projecting a single motion vector, a neighborhood (550) including multiple vectors, as shown in

FIG. 5B, is examined. Furthermore, it is assumed that the neighborhood of vectors (550) includes an object/background boundary. The temporal vector partitioning process (500) attempts to separate motion vectors associated with an object from motion vectors associated with a background before selecting a best motion vector, which further improves the selection process.

As can be seen in FIG. 5A, the process (500) starts with obtaining a set of neighborhood vectors (550) from a previous image frame. The set (550) shown in FIG. 5B includes nine vectors, each pointing to an image patch (560). In the present example, nine adjacent image patches (560) are used to define the neighborhood vectors, but only five of them (V1 through V5, arranged in an X-shaped pattern) are used for the computations in the implementation described herein. However, the reader should realize that any number of vectors can be selected, and that the neighborhood can have many different shapes. The set of five neighborhood vectors and a square shaped set of image patches (560) are only used herein for exemplary purposes.

The process then partitions the set of neighborhood vectors (550) into two clusters (step 504). In one implementation, the partitioning is performed by determining which two vectors are furthest apart from each other and using these two vectors as seeds for the two clusters. After the two seed vectors for the clusters have been determined, each remaining vector is sorted into one of the two clusters, based on which cluster seed vector they are closest to.

Next, the process determines a representative vector for each cluster (step 506). The purpose of determining representative vectors is to find existing vectors that are the best representatives for the respective clusters. In one implementation, the representative vectors are determined as the vectors that have the minimum distances from all the other vectors in their respective cluster. The minimum distance can, for example, be calculated by determining a distance from each vector in a cluster to all other vectors in the same cluster and adding the distances. The vector with the minimum total distance is selected as the representative vector.

When the two representative vectors have been found, the process determines which representative vector provides a best match when the image patch is moved the distance and direction defined by the respective representative vector (step 508). This can, for example, be done by using two correlation windows, where one correlation window is centered around the origin of the vector, and the other is centered around the end point of the vector, and determining a minimum sum of absolute differences (SAD) for the pixels in the two correlation windows. Exactly how this is done will be described in further detail below, but for the purposes of FIG. 5A, the important result is that a best match is found for one of the two representative vectors. The process then selects as a candidate vector the representative vector that has the best match (step 510). The selected vector is subsequently projected down to the lowest resolution level, and the process ends. The best match vector represents the object vector, and the other vector represents a background vector.

The partitioning described above helps in resolving object/background vector discontinuities around smaller boundary details, such as a hood ornament on a moving car. The partitioning also works equally well on neighborhoods that do not contain any object boundaries, since most of the vectors will be in one cluster and the other cluster will just contain one or a few “outlier” vectors.

Returning now to FIGS. 1 and 2, after the filtered vector has been projected to the lowest resolution level, a set of update vectors (210a-210f) is generated and tested to find a minimum SAD at +/−1 pixel or +/−2 pixels from the old filtered projected motion vector (step 104). In FIG. 2, six update vectors (210a-210f) are illustrated, two for +/−1 pixel and two for +/−2 pixels in the horizontal direction, and two for +/−1 pixel in the vertical direction, since horizontal movement is generally greater than vertical movement. However, as the reader skilled in the art will realize, any number of update vectors can be generated and tested at any horizontal and/or vertical location in relation to the projected vector (205). In one implementation, a predicted camera vector is also projected down to 1:4 level. The camera vector will be discussed in further detail below.

In one implementation, the SAD is computed by letting the candidate vectors for an image patch, which all originate at the same image patch location in the source frame, point to different pixel locations in a target frame. For each candidate vector, a rectangular window is centered in the target frame on the pixel pointed to by the respective candidate vector. A corresponding rectangular window is centered in the source frame on the pixel where the candidate vectors originate. Then a pair wise absolute difference of the corresponding luma pixels in the two windows, that is, the pixels that have the same relative location within the two windows, is calculated. The sum of all the absolute differences is the

SAD value. The SAD decreases as the window matching becomes better and is ideally zero when the pixels are identical. In practice, of course, due to noise and other factors, the best vector will have a non-zero SAD, but will have the minimum SAD of the vectors in the set of candidate vectors.

After the minimum SAD has been found the best vector, that is, the vector with the minimum SAD (2100 is selected and stored in memory (step 106). The process then examines whether there are any higher resolution levels (step 108). As was described above, in this example there are two higher resolution levels, so the process propagates the best vector (210f) is projected up to the 1:2 resolution level shown in FIG. 3 (step 110). Again, a set of update vectors (305a-305d) is generated around the best vector (210f) after it has been projected up to the 1:2 level (step 104). At this level, a second set of update vectors (310a-310d) is also generated around the old 1:1 filtered vector (205) projected down to the 1:2 resolution level. A new best vector (305a) is found, by computing the minimum SAD among all the update vectors, just like on the 1:4 resolution level. The best update vector is then selected and is stored in memory (step 106).

The process then examines again whether there are any higher resolution levels (step 108). At this point, there is one higher resolution level left in the resolution pyramid, so the process returns again to step 104, where the best vector (305a) from the 1:2 resolution level in FIG. 3 is filtered and projected up to the highest 1:I resolution level shown in FIG. 4. Again, a set of update vectors (405a-405d) is generated around the projected and filtered best vector (305a) (step 104). At this level, a second set of update vectors (410a 410d) is also generated around the old 1:1 filtered vector. A third set of update vectors (420a-420d) is generated around a camera vector (415).

The camera vector describes a global movement of the contents of the frame, as opposed to the local vectors at each image patch location that are computed completely independently, and can therefore be used to aid in finding a better true motion vector. In several commonly occurring scenarios a motion vector resulting from camera movements at every location in a frame can be predicted quite easily with a simple model. For example, in the case of a camera lens panning across a distant landscape, all the motion vectors will be identical and equivalent to the velocity of the camera. Another scenario is when a camera lens zooms into an object on a flat surface, such as a picture on a wall. All the motion vectors then have a radial direction and increase from zero at the image center to a maximum value at the image periphery.

In one implementation, the process tries to fit a mathematical model to the motion vectors that have been computed using a least squares method. A good fit between the camera motion vectors and the mathematical model indicates that one of the scenarios discussed above likely is present, and the camera model predicted vector can then be used as an additional candidate vector in the next recursive hierarchical vector estimation step. Taking the camera vector into consideration is advantageous in that the recursive portion of the recursive hierarchical search is a local search approach, which may converge into a false local minimum instead of the true minimum. The camera predicted vector candidate can potentially help in avoiding detection of false local minima and direct the process towards a true minimum.

The new best vector (405d) is then found, just like on the 1:4 and 1:2 resolution levels (step 106) and is stored in memory. The process then examines again whether there are any higher resolution levels available (step 108). This time there are no higher resolution levels, so the process proceeds to step 112, where the best vector is selected and used for motion compensation, which completes the process for the current frame.

The above process is performed for all the 4×4 image patches of pixels in the frame, and based on the determined motion vectors, an interpolation of frames between a source frame and a target frame can be made, so that there is a minimal or no discrepancy between an expected image motion due to eye-tracking, and a displayed image motion.

As can be seen from the above discussion, the invention provides a smooth and accurate vector field and uses only a fairly small number of calculations. Furthermore, there is reduced convergence delay since due to the multiple levels of resolution. Fewer resolution levels can be used compared to conventional approaches, and vector errors in lower levels are not amplified due to resolution changes at higher resolution levels due to safeguarding by testing projected vectors at each resolution. Performing a temporal vector partitioning during the filtering of a motion vector determined for a previous image pair can help with resolving object-background vector discontinuities around smaller boundary details, for example, a hood ornament on a moving car, or similar types of details. At the same time the temporal vector partitioning does not adversely affect image areas that do not contain object boundaries. In this scenario the outlier vector (i.e., the incorrect vector) or vectors will be separated out from the good vectors, and so the procedure will still be of benefit.

The invention can be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. Apparatus of the invention can be implemented in a computer program product tangibly embodied in a machine-readable storage device for execution by a programmable processor; and method steps of the invention can be performed by a programmable processor executing a program of instructions to perform functions of the invention by operating on input data and generating output. The invention can be implemented advantageously in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. Each computer program can be implemented in a high-level procedural or object-oriented programming language, or in assembly or machine language if desired; and in any case, the language can be a compiled or interpreted language. Suitable processors include, by way of example, both general and special purpose microprocessors. Generally, a processor will receive instructions and data from a read-only memory and/or a random access memory. Generally, a computer will include one or more mass storage devices for storing data files;

such devices include magnetic disks, such as internal hard disks and removable disks; magneto-optical disks; and optical disks. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM disks. Any of the foregoing can be supplemented by, or incorporated in, ASICs (application-specific integrated circuits).

FIG. 6 shows a computer system (600) employed to implement the invention. The computer system (600) is only an example of a graphics system in which the present invention can be implemented. The computer system (600 includes a central processing unit (CPU) (610), a random access memory (RAM) (620), a read only memory (ROM) (625), one or more peripherals (630), a graphics controller (660), primary storage devices (640 and 650), and a digital display unit (670). As is well known in the art, ROM acts to transfer data and instructions uni-directionally to the CPUs (610), while the RAM (620) is used typically to transfer data and instructions in a bi-directional manner. The

CPUs (610) can generally include any number of processors. Both primary storage devices (640 and 650) can include any suitable computer-readable media. A secondary storage medium (680), which is typically a mass memory device, is also coupled bi-directionally to the CPUs (610) and provides additional data storage capacity. The mass memory device (680) is a computer-readable medium that can be used to store programs including computer code, data, and the like. Typically, the mass memory device (680) is a storage medium such as a hard disk or a tape which generally slower than the primary storage devices (640, 650). The mass memory storage device (680) can take the form of a magnetic or paper tape reader or some other well- known device. It will be appreciated that the information retained within the mass memory device (680), can, in appropriate cases, be incorporated in standard fashion as part of the RAM (620) as virtual memory.

The CPUs (610) are also coupled to one or more input/output devices (690) that can include, but are not limited to, devices such as video monitors, track balls, mice, keyboards, microphones, touch-sensitive displays, transducer card readers, magnetic or paper tape readers, tablets, styluses, voice or handwriting recognizers, or other well-known input devices such as, of course, other computers. Finally, the CPUs (610) optionally can be coupled to a computer or telecommunications network, e.g., an Internet network or an intranet network, using a network connection as shown generally at (695). With such a network connection, it is contemplated that the CPUs (610) might receive information from the network, or might output information to the network in the course of performing the above-described method steps. The above-described devices and materials will be familiar to those of skill in the computer hardware and software arts.

The graphics controller (660) generates image data and a corresponding reference signal, and provides both to digital display unit (670). The image data can be generated, for example, based on pixel data received from the CPU (610) or from an external encode (not shown). In one embodiment, the image data is provided in RGB format and the reference signal includes the VSYNC and HSYNC signals well known in the art. However, it should be understood that the present invention can be implemented with data and/or reference signals in other formats. For example, image data can include video signal data also with a corresponding time reference signal.

A number of implementations of the invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. For example in addition to the hierarchical and temporal vectors in the intermediate layers, the camera model generated vector projected down can also be used as a candidate for SAD computation. Accordingly, other embodiments are within the scope of the following claims.

Claims

1-16. (canceled)

17. A computer-readable storage device having computer-executable instructions stored thereon that, in response to execution by one or more computing devices, cause the one or more computing devices to: obtain a previous motion vector generated at a highest resolution level in a previous frame;project the previous motion vector at a lowest resolution level in a current frame;generate a plurality of motion vectors at the lowest resolution level in the current frame using the previous motion vector as a base vector;identify a best motion vector from the plurality of motion vectors that most accurately reflects displacement of an image patch; andpropagate the best motion vector generated at the lowest resolution level in the current frame to a higher resolution level.

18. The computer-readable storage device of claim 17, wherein the instructions further cause the one or more computing devices to: for each resolution level in the current frame, propagate a best motion vector to a next highest resolution level until the highest resolution level is reached.

19. The computer-readable storage device of claim 17, wherein obtaining a previous motion vector further comprises: determining whether a scene break occurred between the previous frame and the current frame; andif a scene break occurred, setting the previous motion vector to equal a zero vector.

20. The computer-readable storage device of claim 17, wherein identifying a best motion vector further comprises partitioning the plurality of motion vectors into a first vector cluster and a second vector cluster.

21. The computer-readable storage device of claim 20, wherein partitioning the plurality of motion vectors further comprises: determining a first seed vector and a second seed vector by identifying two vectors among the plurality of vectors that are furthest apart from each other;associating the first seed vector with the first vector cluster;associating the second seed vector with the second vector cluster; andfor each other vector in the plurality of vectors:determining whether the other vector is closer to one of the first seed vector and the second seed vector;associating the other vector with the first vector cluster in response to determining that the other vector is closer to the first seed vector; andassociating the other vector with the second vector cluster if the other vector is closer to the second seed vector.

22. The computer-readable storage device of claim 20, wherein partitioning the plurality of motion vectors further comprises selecting from the plurality of motion vectors a subset of motion vectors that are within diagonally adjacent grid regions and excluding motion vectors that are not within the diagonally adjacent grid regions.

23. The computer-readable storage device of claim 17, wherein identifying a best motion vector further comprises: for a motion vector in the plurality of potential motion vectors, centering a first window on a pixel that forms an origin of the motion vector and centering a second window on a pixel that forms an end point of the motion vector; anddetermining a sum of absolute differences of luma values for the pixels in the first window and pixels at corresponding positions in the second window.

24. An apparatus comprising: one or more processors configured to execute modules that include executable instructions, the modules comprising: a generator configured to generate a plurality of motion vectors;a tester configured to identify a best motion vector from the plurality of motion vectors that most accurately reflects displacement of an image patch; anda propagator configured to: determine whether the best motion vector corresponds to a highest resolution level in a current frame;if the best motion vector corresponds to the highest resolution level in the current frame, the propagator is further configured to propagate the best motion vector to a lowest resolution level in a subsequent frame, andif the best motion vector does not correspond to the highest resolution level in the current frame, the propagator is further configured to propagate the best motion vector to a next higher resolution level in the current frame.

25. The apparatus as recited in claim 24, wherein the tester is further configured to: partition the motion vectors into a plurality of vector clusters comprising a first vector cluster and a second vector cluster by:determining a first seed vector and a second seed vector that are furthest apart in the plurality of vectors; andfor each other motion vector in the plurality of motion vectors: determining whether the other motion vector is closer to one of the first seed vector and the second seed vector;associating the other motion vector with the first vector cluster in response to determining that the other motion vector is closer to the first seed vector; andassociating the other motion vector with the second vector cluster in response to determining that the other motion vector is closer to the second seed vector.

26. The apparatus as recited in claim 24, wherein the tester is further configured to select from the plurality of motion vectors a subset of motion vectors that are within diagonally adjacent grid regions and to exclude motion vectors that are not within the diagonally adjacent grid regions.

27. The apparatus as recited in claim 24, wherein the propagator is further configured to: determine whether a scene break occurred between a previous frame and the current frame; andif a scene break occurred, set the previous motion vector to equal a zero vector.

28. A computer-implemented method performed under control of one or more computing devices, the method comprising: obtaining a previous motion vector generated at a highest resolution level in a previous frame;projecting the previous motion vector at a lowest resolution level in a current frame;generating a plurality of motion vectors at the lowest resolution level in the current frame using the previous motion vector as a base vector;identifying a best motion vector from the plurality of motion vectors that most accurately reflects displacement of an image patch; and propagating the best motion vector generated at the lowest resolution level in the current frame to a higher resolution level.

29. The computer-implemented method of claim 28, further comprising: for each resolution level in the current frame, propagating a best motion vector to a next highest resolution level until the highest resolution level is reached.

30. The computer-implemented method of claim 28, wherein obtaining a previous motion vector further comprises: determining whether a scene break occurred between the previous frame and the current frame; andif a scene break occurred, setting the previous motion vector to equal a zero vector.

31. The computer-implemented method of claim 28, wherein identifying a best motion vector further comprises partitioning the plurality of motion vectors into a first vector cluster and a second vector cluster.

32. The computer-implemented method of claim 31, wherein partitioning the plurality of motion vectors further comprises: determining a first seed vector and a second seed vector by identifying two vectors among the plurality of vectors that are furthest apart from each other;associating the first seed vector with the first vector cluster;associating the second seed vector with the second vector cluster; andfor each other vector in the plurality of vectors: determining whether the vector is closer to one of the first seed vector and the second seed vector;associating the vector with the first vector cluster if the vector is closer to the first seed vector; and associating the vector with the second vector cluster if the vector is closer to the second seed vector.

33. The computer-implemented method of claim 31, wherein partitioning the plurality of motion vectors further comprises selecting from the plurality of motion vectors a subset of motion vectors that are within diagonally adjacent grid regions and excluding motion vectors that are not within the diagonally adjacent grid regions.

34. The computer-implemented method of claim 28, wherein identifying a best motion vector further comprises: for a motion vector in the plurality of potential motion vectors, centering a first window on a pixel that forms an origin of the motion vector and centering a second window on a pixel that forms an end point of the motion vector; anddetermining a sum of absolute differences of luma values for the pixels in the first window and pixels at corresponding positions in the second window.