The task-oriented optimization of bases in recognition problems

MaRDI QIDQ1572692zbMATH OpenFDO

Authors K. V. Vorontsov

Publication date 23 July 2000

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

correction operationsiterative processrecognition problemstask-oriented optimization

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Applications of mathematical programming (90C90)

Review text

This work is performed within the framework of the algebraic approach to the recognition problem. To construct a basis set of algorithmic operators, an iterative process is proposed such that the problem of joint optimization of the recurrent operator and a correction operation is solved at each step of this process. It is shown that the choice of the basis operator is reduced to the standard problem of finding a subsystem of inequalities of maximal weight. An efficient numerical procedure for constructing a monotone correction operation is described.

Recommendations

• Methods of optimization and monotone correction in the algebraic approach to the recognition problem
• Optimization methods for linear and monotone correction in the algebraic approach to the recognition problem
• scientific article; zbMATH DE number 5006730
• The construction of a recognition algorithm in the algebraic closure.
• Practical algorithms for algebraic and logical correction in precedent-based recognition problems

Cited in

(4)

• A approach to the recognition problem
• Logical correctors in the problem of classification by precedents
• On optimization of a two-stage procedure for object detection and recognition on an image
• Optimization methods for linear and monotone correction in the algebraic approach to the recognition problem

This page was built for publication: The task-oriented optimization of bases in recognition problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1572692)