Compressive Mahalanobis classifiers

We propose a new framework for detection/estimation designed to avoid the loss of salient information in the process of reducing the dimensionality of digitized data. The main idea is a semi-supervised learning pre-processing scheme based on compressed sensing. The proposed approach combines a first step - performed at the data acquisition level - with an energy based algorithm aimed at defining a global metric on the data. The latter is then used to drive the classification algorithm. We demonstrate the power of the new technique by applying it to the detection of cellular nuclei in large, high-dimensional, hyperspectral images.

[1]  Fu Jie Huang,et al.  A Tutorial on Energy-Based Learning , 2006 .

[2]  Richard G. Baraniuk,et al.  The Compressive Matched Filter , 2006 .

[3]  Yann LeCun,et al.  Dimensionality Reduction by Learning an Invariant Mapping , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[4]  Mauro Maggioni,et al.  Hyperspectral microscopic analysis of normal, benign and carcinoma microarray tissue sections , 2006, SPIE BiOS.

[5]  Ali Mohammad-Djafari,et al.  Joint Dimensionality Reduction, Classification and Segmentation of Hyperspectral Images , 2006, 2006 International Conference on Image Processing.

[6]  Xiaojin Zhu,et al.  Introduction to Semi-Supervised Learning , 2009, Synthesis Lectures on Artificial Intelligence and Machine Learning.

[7]  Richard G. Baraniuk,et al.  Sparse Signal Reconstruction from Noisy Compressive Measurements using Cross Validation , 2007, 2007 IEEE/SP 14th Workshop on Statistical Signal Processing.

[8]  Alexander Zien,et al.  Semi-Supervised Learning , 2006 .

[9]  Hyun Sung Chang,et al.  Learning Compressed Sensing , 2007 .

[10]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.