3 accepted papers
The performance of iterative algorithms aimed at solving a regularized least squares problem typically depends on the value of some regularization parameter. Tuning the regularization parameter value is a fundamental step necessary to control the strength of the regularization and hence ensure a goo…
This communication proposes an unsupervised neighbor dependent nonlinear unmixing algorithm for hyperspectral data. The proposed mixing scheme models the reflectance vector of a pixel as the sum of a linear combination of the endmem-bers plus a nonlinear function acting on neighboring spectra. The n…
This paper introduces a graph Laplacian regularization in the hyperspectral unmixing formulation. The proposed regularization relies upon the construction of a graph representation of the hyperspectral image. Each node in the graph represents a pixel's spectrum, and edges connect similar pixels. The…