摘要 |
The method involves forming the distances between a first and a second characteristic vector for the points in any part region of a vector matrix, and also the average distance of all these along an optimal path using a dynamic programming (DP) algorithm. This average distance at least one point is evaluated as a measure of the agreement. At the edges of the region, the increase in the optimal path is determined and from this, the region is reduced for later calculations. |