TY - JOUR

T1 - Efficient Simulation for Prolog Implementation of Image Recognition Problem

AU - Kosovskaya, T.

AU - Vlasova, M.

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - pattern recognition

KW - predicate calculus

KW - complexity of algorithms

KW - Prolog language.

M3 - Article

VL - 20

SP - 156

EP - 161

JO - International Journal on Information Theory and Applications

JF - International Journal on Information Theory and Applications

SN - 1310-0513

IS - 2

ER -