A Trace Lasso Regularized Ll-norm Graph Cut for Highly Correlated Noisy Hyperspectral Image

摘要

Ahstract-This work proposes an adaptive trace lasso regularized Ll-norm based graph cut method for dimensionality reduction of Hyperspectral images, called as `Trace Lasso-Ll Graph Cut' (TL-LIGC). The underlying idea of this method is to generate the optimal projection matrix by considering both the sparsity as well as the correlation of the data samples. The conventional L2-norm used in the objective function is sensitive to noise and outliers. Therefore, in this work Ll-norm is utilized as a robust alternative to L2-norm. Besides, for further improvement of the results, we use a penalty function of trace lasso with the LIGC method. It adaptively balances the L2-norm and Ll-norm simultaneously by considering the data correlation along with the sparsity. We obtain the optimal projection matrix by maximizing the ratio of between-class dispersion to within-class dispersion using Ll-norm with trace lasso as the penalty. Furthermore, an iterative procedure for this TL-LIGC method is proposed to solve the optimization function. The effectiveness of this proposed method is evaluated on two benchmark HSI datasets.