A new sparse representation algorithm for signal classication

The performance of many Sparse Representation (SR) based signal classication tasks is highly dependent on the availability of the datasets with a large amount of labeled data points. However, in many cases, accessing to sucient labeled data may be expensive or time con- suming, whereas acquiring a large amount of unlabeled data is relatively easy. In this paper, we propose a new SR based classication method which utilizes the information of the unlabeled data as well as the labeled data. Experimental results show that the proposed method outperforms the state of the art SR based classication methods.