Pattern recognition system using hueristic search technique

摘要

The input pattern to a pattern recognition system is defined as a candidate graph composed of several possibly valid category strings. The most valid category string is selected as the input pattern. Each category string is composed of linked category segments, each category segment being bounded by category nodes or branching points to which are connected one or more category segments. The most valid category string is developed by establishing the most valid midway path from the start node and extending to the terminal node. A most valid midway path to each midway node (n) is established by using the minimum valid estimation value determined for all possible midway paths from the start node to the midway node (n).