Skip to Main Content
A speech model inspired by the signal subspace approach was recently proposed as a speech classifier with modest results. The method entails, in general, the assemblage of a set of subspace trajectories that consist of the right singular vectors of measurement matrices of the signal under consideration. Given an unknown signal, a simple distortion measure then applies in the classification procedure to pick the best matched class prototype. This letter examines the issue of robustness in the subspace classification scheme. Borrowing an important result on noisy measurement matrices, this letter formally establishes the notion of robustness in subspace classification and proceeds to propose a class of robust distortion measures for signal subspace models. Simulation results of subspace classifiers implementing the new distortion measures in an isolated digit speech recognition problem reveal no degradation in recognition accuracy, even under low SNR conditions.