Fast implementation of recursive diamond search

• US 20060155701A1
• Filed: 01/13/2005
• Published: 07/13/2006
• Est. Priority Date: 01/13/2005
• Status: Abandoned Application

• Current Assignee: ArcSoft, Inc.
• Original Assignee: ArcSoft, Inc.
• Inventors: Huang, Xiaojie, Wang, Xingguo
• Application Number:
  US11/035,661
• Publication Number:
  US 20060155701A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/7854 using shape G06F16/7837 takes precedence
• CPC Class Codes: G06F 16/786 using motion, e.g. object motion or camera motion

Abstract

A method for block matching includes performing a first search for a matching block in a frame using a search pattern centered at a first center point and determining a best point that produces a close match. If the best point does not produce a match satisfying a criterion, the method further includes storing the first center point in an array, setting the best point as a second center point, and performing a second search using the search pattern centered at the second center point. Performing the second search includes (1) at least approximating distances between (a) points in the search pattern centered at the second center point and (b) center points stored in the array; (2) excluding any point that has at least one distance less than a threshold; and (3) performing the second search for remaining points in the search pattern centered at the second center point.

Claims

1. A method for block matching between a first frame and a second frame, comprising:

performing a first search for a matching block in the first frame using a search pattern centered at a first center point;

from points in the search pattern centered at the first center point, determining a best point that produces a close match in the first search;

if the best point does not produce a match satisfying a criterion;

storing the first center point in an array;

setting the best point as a second center point;

performing a second search for the matching block in the first frame using the search pattern centered at the second center point, wherein said performing the second search comprises;

for each point in the search pattern centered at the second center point, at least approximating distances to center points stored in the array;

excluding any point in the search pattern centered at the second center point that has at least one distance less than a threshold;

performing the second search for remaining points in the search pattern centered at the second center point.

2. The method of claim 1, wherein the search pattern comprises a diamond search pattern.

3. The method of claim 1, wherein said determining a best point that produces a close match in the first search comprises:

determining differences between (1) blocks centered at the points in the search pattern in the first frame and (2) a block in the second frame, the close match being a point that produces a smallest difference.

4. The method of claim 3, wherein the best point does not produce a match satisfying a criterion when the smallest difference is greater than a threshold.

5. The method of claim 1, wherein said approximating distances to center points stored in the array comprises approximating actual distances as follows:

D≅

|x−

X_i|+y−

Y_i|,

where D is the distance, x and y are coordinates of the second center point, and Xi and Yi are coordinates of the ith center pointer in the array.

6. The method of claim 1, further comprising:

if the best point produces a match satisfying the criterion;

setting the best point as the second center point;

performing a third search for the matching block in the first frame using a another search pattern centered at the second center point;

from points in said another search pattern centered at the second center point, determining another best point that produces a close match in the second search;

storing said another best point for motion estimation.

7. The method of claim 6, wherein said another search pattern comprises a smaller search pattern than the search pattern.

8. The method of claim 6, further comprising:

if the best point produces a match satisfying another criterion, storing the best point for motion estimation.

9. A method for block matching in motion estimation, comprising:

performing a first search for a matching block in a frame using a first search pattern centered at a first center point;

from points in the first search pattern centered at the first center point, determining a first best point that produces a close match in the first search;

if the first best point does not produce a match satisfying a first criterion;

storing the first center point in an array;

setting the first best point as a second center point;

performing a second search for the matching block in the frame using the first search pattern centered at the second center point, wherein said performing the second search comprises;

for each point in the first search pattern centered at the second center point, at least approximating distances to center points stored in the array;

excluding any point in the first search pattern centered at the second center point that has at least one distance less than a threshold;

performing the second search for remaining points in the first search pattern centered at the second center point;

if the first best point produces a match satisfying the first criterion;

setting the first best point as the second center point;

performing a third search for the matching block in the frame using a second search pattern centered at the second center point;

from points in the second search pattern centered at the second center point, determining a second best point that produces a close match in the third search;

storing the second best point for motion estimation;

if the first best point produces a match satisfying a second criterion, storing the first best point for motion estimation.