Endmember extraction is a key step in the hyperspectral image analysis process. The kernel new simplex growing algorithm （KNSGA）, recently developed as a nonlinear alternative to the simplex growing algorithm （SGA...Endmember extraction is a key step in the hyperspectral image analysis process. The kernel new simplex growing algorithm （KNSGA）, recently developed as a nonlinear alternative to the simplex growing algorithm （SGA）, has proven a promising endmember extraction technique. However, KNSGA still suffers from two issues limiting its application. First, its random initialization leads to inconsistency in final results; second, excessive computation is caused by the iterations of a simplex volume calculation. To solve the first issue, the spatial pixel purity index （SPPI） method is used in this study to extract the first endrnember, eliminating the initialization dependence. A novel approach tackles the second issue by initially using a modified Cholesky fac- torization to decompose the volume matrix into triangular matrices, in order to avoid directly computing the determinant tauto- logically in the simplex volume formula. Theoretical analysis and experiments on both simulated and real spectral data demonstrate that the proposed algorithm significantly reduces computational complexity, and runs faster than the original algorithm.展开更多
基金Project supported by the Zhejiang Provincial Natural Science Foundation of China(Nos.LY13F020044 and LZ14F030004)the National Natural Science Foundation of China(No.61571170)
文摘Endmember extraction is a key step in the hyperspectral image analysis process. The kernel new simplex growing algorithm （KNSGA）, recently developed as a nonlinear alternative to the simplex growing algorithm （SGA）, has proven a promising endmember extraction technique. However, KNSGA still suffers from two issues limiting its application. First, its random initialization leads to inconsistency in final results; second, excessive computation is caused by the iterations of a simplex volume calculation. To solve the first issue, the spatial pixel purity index （SPPI） method is used in this study to extract the first endrnember, eliminating the initialization dependence. A novel approach tackles the second issue by initially using a modified Cholesky fac- torization to decompose the volume matrix into triangular matrices, in order to avoid directly computing the determinant tauto- logically in the simplex volume formula. Theoretical analysis and experiments on both simulated and real spectral data demonstrate that the proposed algorithm significantly reduces computational complexity, and runs faster than the original algorithm.
