MINIMUM METHOD AND CIRCUITS FOR CHARACTERS PATTERN STRING

摘要

The apparatus optimizes 4-directional chain-codes representing the boundary of a binary character image. In the preprocessing procedure, unnecessary repeated unidirectional chain-codes and short length codes are eliminated and the groups of the equal length chain- codes having opposite directional chain-codes are purged for eliminating the duplication in the following next step. The optimizing procedure is implemented on the dedicated hardware for neal time processing.