Abstract
Classification decision tree algorithms have recently been used in pattern-recognition problems. In this paper, we propose a self-designing system that uses the classification tree algorithms and that is capable of recognizing a large number of signals. Preprocessing techniques are used to make the recognition process more effective. A combination of the original, as well as the preprocessed, signals is projected into different transform domains. Enormous sets of criteria that characterize the signals can be developed from the signal representations in these domains. At each node of the classification tree, an appropriately selected criterion is optimized with respect to desirable performance features such as complexity and noise immunity. The criterion is then employed in conjunction with a vector quantizer to divide the signals presented at a particular node in that stage into two approximately equal groups. When the process is complete, each signal is represented by a unique composite binary word index, which corresponds to the signal path through the tree, from the input to one of the terminal nodes of the tree. Experimental results verify the excellent classification accuracy of this system. High performance is maintained for both noisy and corrupt data.
© 2004 Optical Society of America
Full Article | PDF ArticleMore Like This
Eugene Yee and Jim Ho
Appl. Opt. 29(19) 2929-2938 (1990)
Hongquan Qu, Tingliang Feng, Yanping Wang, and Yuan Zhang
Appl. Opt. 58(21) 5612-5623 (2019)
Sekwon Yeom and Bahram Javidi
Appl. Opt. 43(2) 442-451 (2004)