Graph Scaling Cut with L1-Norm for Classification of Hyperspectral Images

09/09/2017
by   Ramanarayan Mohanty, et al.
0

In this paper, we propose an L1 normalized graph based dimensionality reduction method for Hyperspectral images, called as L1-Scaling Cut (L1-SC). The underlying idea of this method is to generate the optimal projection matrix by retaining the original distribution of the data. Though L2-norm is generally preferred for computation, it is sensitive to noise and outliers. However, L1-norm is robust to them. Therefore, we obtain the optimal projection matrix by maximizing the ratio of between-class dispersion to within-class dispersion using L1-norm. Furthermore, an iterative algorithm is described to solve the optimization problem. The experimental results of the HSI classification confirm the effectiveness of the proposed L1-SC method on both noisy and noiseless data.

READ FULL TEXT

page 4

page 5

research
07/22/2018

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

This work proposes an adaptive trace lasso regularized L1-norm based gra...
research
04/09/2015

A Multiphase Image Segmentation Based on Fuzzy Membership Functions and L1-norm Fidelity

In this paper, we propose a variational multiphase image segmentation mo...
research
12/08/2014

HyperSpectral classification with adaptively weighted L1-norm regularization and spatial postprocessing

Sparse regression methods have been proven effective in a wide range of ...
research
06/29/2019

Robust Linear Discriminant Analysis Using Ratio Minimization of L1,2-Norms

As one of the most popular linear subspace learning methods, the Linear ...
research
07/07/2018

A Supervised Geometry-Aware Mapping Approach for Classification of Hyperspectral Images

The lack of proper class discrimination among the Hyperspectral (HS) dat...

Please sign up or login with your details

Forgot password? Click here to reset