Primal dual interior point optimization for penalized least squares estimation of abundance maps in hyperspectral imaging

The estimation of abundance maps in hyperspectral imaging (HSI) requires the resolution of an optimization problem subject to non-negativity and sum-to-one constraints. Assuming that the spectral signatures of the image components have been previously determined by an endmember extraction algorithm, we propose here a primal-dual interior point algorithm for the estimation of their fractional abundances using a penalized least squares approach. In comparison with the reference method FCLS, our algorithm has the advantage of a reduced computational cost, especially in the context of large scale images and allows to deal with a penalized criterion favoring the spatial smoothness of abundance maps. The performances of the proposed approach are discussed with the help of a synthetic HSI example.

[1]  John R. Schott,et al.  Remote Sensing: The Image Chain Approach , 1996 .

[2]  Margaret H. Wright,et al.  Interior methods for constrained optimization , 1992, Acta Numerica.

[3]  José M. Bioucas-Dias,et al.  Vertex component analysis: a fast algorithm to unmix hyperspectral data , 2005, IEEE Transactions on Geoscience and Remote Sensing.

[4]  Charles L. Lawson,et al.  Solving least squares problems , 1976, Classics in applied mathematics.

[5]  T. Tsuchiya,et al.  On the formulation and theory of the Newton interior-point method for nonlinear programming , 1996 .

[6]  J. Settle,et al.  Linear mixing and the estimation of ground cover proportions , 1993 .

[7]  Henk A. van der Vorst,et al.  Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems , 1992, SIAM J. Sci. Comput..

[8]  Chein-I Chang,et al.  Fully constrained least squares linear spectral mixture analysis method for material quantification in hyperspectral imagery , 2001, IEEE Trans. Geosci. Remote. Sens..

[9]  Antonio J. Plaza,et al.  Survey of geometric and statistical unmixing algorithms for hyperspectral images , 2010, 2010 2nd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing.

[10]  Paul Armand,et al.  A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems , 2000, SIAM J. Optim..

[11]  Charles L. Lawson,et al.  Solving least squares problems , 1976, Classics in applied mathematics.

[12]  P. Armand,et al.  A Feasible BFGS Interior Point Algorithm for Solving Strongly Convex Minimization Problems , 1999 .

[13]  Jérôme Idier,et al.  Convex half-quadratic criteria and interacting auxiliary variables for image restoration , 2001, IEEE Trans. Image Process..

[14]  Chein-I Chang,et al.  Semi-Supervised Linear Spectral Unmixing Using a Hierarchical Bayesian Model for Hyperspectral Imagery , 2008, IEEE Transactions on Signal Processing.

[15]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.