Algorithms for algebraic and logical correction and their applications

Abstract

Practical algorithms for precedent-based recognition are considered that are based on the logical or algebraic correction of various heuristic algorithms or m odels of recognition. The recognition problem is solved in two stages. First, algorithms from a certain group are independently applied to recognition of an arbitrary object, and then an appropriate corrector is used to calculate the final collective solution. General concepts of the algebraic approach, descriptions of practical algorithms for logical and algebraic correction, and the results of comparison of these algorithms are presented