Semi-supervised kernel orthogonal subspace projection

The Orthogonal Subspace Projection (OSP) algorithm is substantially a kind of matched filter that requires the evaluation of a prototype for each class to be detected. The kernel OSP (KOSP) has recently demonstrated improved results for target detection in hyperspectral images. The use of kernel helps to combat the high dimensionality problem and makes the method robust to noise. This paper presents a semi-supervised graph-based approach to improve KOSP. The proposed algorithm deforms the kernel by approximating the marginal distribution using the unlabeled samples. The good performance of the proposed method is illustrated in a toy dataset and an hyperspectral image target detection problem.