“…Then by a graph search algorithm, DP matching costs are calculated between segment 5 and each of segments 2, 4, 3, 6, 7, 8, and 9. The final sequence (5,4,6,8) minimum cost is extracted as a set of segments corresponding to the line segment ' '. To apply DP matching to 2D patterns we extend this algorithm by concatenating DP matching cost planes according to the branch and bound control strategy.…”