Abstract: Systems and methods for computing optical flow are provided. One exemplary method includes obtaining four input color vectors respectively associated with four input pixels. The four input pixels are at four known input positions of an initial image. The method further includes obtaining a subject color vector associated with a subject pixel. The subject pixel is at a known subject position of a subsequent image. Inverse bilinear interpolation is performed for the subject color vector with respect to the four input color vectors to obtain an estimated position. An optical flow vector is formed from the estimated position to the known subject position. An exemplary system for forming a plurality of optical flow fields includes a computing device having a memory and a processor.

Abstract: This invention related to a method for computing the minimum edit distance, measured as the number of insertions plus the number of deletions, between two sequences of data, which runs in an amount of time that is nearly proportional to the size of the input data under many circumstances. Utilizing the A* (or A-star) search, the invention searches for the answer using a novel counting heuristic that gives a lower bound on the minimum edit distance for any given subproblem. In addition, regions over which the heuristic matches the maximum value of the answer are optimized by eliminating the search over redundant paths. The invention can also be used to produce the edit script. The invention can be modified for other types of comparison and pattern recognition.

Abstract: This invention related to a method for computing the minimum edit distance, measured as the number of insertions plus the number of deletions, between two sequences of data, which runs in an amount of time that is nearly proportional to the size of the input data under many circumstances. Utilizing the A* (or A-star) search, the invention searches for the answer using a novel counting heuristic that gives a lower bound on the minimum edit distance for any given subproblem. In addition, regions over which the heuristic matches the maximum value of the answer are optimized by eliminating the search over redundant paths. The invention can also be used to produce the edit script. The invention can be modified for other types of comparison and pattern recognition.