Abstract: Pattern recognition problem using properties of parts of a recognizable objects and relations between
them is NP-hard. That is why quick recognition of an object with many elements is a difficult problem. To
overcome such a difficulty the use of upper bound of steps for an algorithm solving such a problem based on
logic-objective approach is suggested. The possibility of the use of Prolog language family for image recognition
is investigated. An example of such a problem for which the use of these upper bounds of
complexity permits to decrease the time of its solution is presented.
Keywords: pattern recognition, predicate calculus, complexity of algorithms, Prolog language.
ACM Classification Keywords: I.2.4 ARTIFICIAL INTELLIGENCE Knowledge Representation Formalisms and
Methods – Predicate logic, I.5.1 PATTERN RECOGNITION Models – Deterministic, F.2.2 Nonnumerical
Algorithms and Problems – Complexity of proof procedures.
Link:
EFFICIENT SIMULATION FOR PROLOG IMPLEMENTATION OF IMAGE
RECOGNITION PROBLEM
Tatiana Kosovskaya, Maria Vlasova
http://www.foibg.com/ijita/vol20/ijita20-02-p07.pdf
Wiki
(1.00/10)
