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.

Artificial Intelligence in Knowledge-based Technologies and Systems

“…The justification of the algorithm guarantees that α'=α. Of course, this does not takes off pathological heuristic nature [10] of practical problems that is the consequence of incompleteness of a priori knowledge. The introduced paradigm somewhat change the essence of problem solution as well.…”

Models and Methods for Solving Face Recognition Problem by Photos

“…Then pattern recognition problem can be formulated through concepts such as objects and their representation, classes and their characteristics, the algorithm as the decision rule that allows to get the result in the form of affiliation to the criteria classes (Table I). [1,2] Examples of objects taking into account their nature and solved tasks are presented on Figure 1 [3]. Thus objects can be represented directly by an object (object, person), situation, system.…”