Multi-class pattern recognition with the group match competition method

Abstract High recognition rate of multi-class pattern recognition is difficult to obtain, especially when the feature extraction is not ideal. So achieving a high recognition rate with nonideal feature extraction makes great sense. Based on the early study of multiple-set-compete method (MSCM) and the algorithm of result reliability, this article proposes a new recognition method named group match competition method (GMCM). The GMCM precedes the early work with a larger scope of applications. Early work which the authors did can only deal with the recognition work with the number of powers of 2 classes, while GMCM can cope with the classes of any number. This article further illustrates the MSCM, the algorithm of result reliability and their functions in the GMCM. Three sets of cases are demonstrated and formats of grouping are discussed. The recognition results show that the GMCM is a robust method and it is capable of achieving the high recognition rate of the multi-class pattern recognition.