Taking Advantage of Typical Testor Algorithms for Computing Non-reducible Descriptors.

The concepts of non-reducible descriptor (NRD) and typical testor (TT) have been used for solving quite different pattern recognition problems, the former related to feature selection problems and the latter related to supervised classification. Both TT and NRD concepts are based on the idea of discriminating objects belonging to different classes. In this paper, we theoretically examine the connection between these two concepts. Then, as an example of the usefulness of our study, we present how the algorithms for computing typical testors can be used for computing non-reducible descriptors. We also discuss several future research directions motivated by this work.