Skip to Main Content
In this paper, a multistage linear programming method of pattern recognition is proposed. The usual n-dimensional linear program has been split up into n stages of a one-dimensional linear program in such a way that more and more patterns belonging to two classes A and B are correctly classified as we proceed to higher and higher stages. It has been shown that if the threshold is kept fixed for ali the stages, the formulation of the problem entails a preprocessing of the feature coordinates; on the other hand, if the threshold is allowed to be different values in different stages, no such preprocessing is required. The application of the proposed method for the recognition of two handwritten Bengali characters has been discussed and compared with the results of other methods.