A robust subspace classification scheme based on empirical intersection removal and sparse approximation

doi:10.3233/ICA-140470

A robust subspace classification scheme based on empirical intersection removal and sparse approximation

2015-01-01

9

OA

AI

DOI：10.3233/ICA-140470

原文链接

查看原文

摘要

En 中文

Subspace models are widely used in many applications. By assuming an individual subspace model for each class, linear regression is applied and combined with minimum distance criteria for making the final decision. In a generalized subspace model, the full linear subspace of each class is split into subspaces with lower dimensions, and the unknown basis needs to be estimated with respect to the testing pattern using adaptively selected training samples. The training data selection is implemented using either least-squares regression or sparse approximation. In this paper, to further improve the classification performance, instead of attempting to minimize the regression error for each class, the between class separability is enhanced by a novel approach called Empirical Subspace Intersection (ESI) Removal technique. Evaluations are performed on (1) standard UCI data set, and (2) a computer aided system along with the proposed classification technique to determine the quality in wooden logs using microwave signals. The experimental results are shown and compared with classical methods.

Keyword:

Classification

linear subspace

sparse representation

training data selection

A robust subspace classification scheme based on empirical intersection removal and sparse approximation

摘要

AI总结

期刊

机构

引用论文