A variation pixels identification method was proposed aiming at depressing the effect of variation pixels, which dilates the theoretical hyperspectral data simplex and misguides volume evaluation of the simplex. With ...A variation pixels identification method was proposed aiming at depressing the effect of variation pixels, which dilates the theoretical hyperspectral data simplex and misguides volume evaluation of the simplex. With integration of both spatial and spectral information, this method quantitatively defines a variation index for every pixel. The variation index is proportional to pixels local entropy but inversely proportional to pixels kernel spatial attraction. The number of pixels removed was modulated by an artificial threshold factor α. Two real hyperspectral data sets were employed to examine the endmember extraction results. The reconstruction errors of preprocessing data as opposed to the result of original data were compared. The experimental results show that the number of distinct endmembers extracted has increased and the reconstruction error is greatly reduced. 100% is an optional value for the threshold factor α when dealing with no prior knowledge hyperspectral data.展开更多
This paper considers a problem of unsupervised spectral unmixing of hyperspectral data. Based on the Linear Mixing Model （ LMM）, a new method under the framework of nonnegative matrix fac- torization （NMF） is prop...This paper considers a problem of unsupervised spectral unmixing of hyperspectral data. Based on the Linear Mixing Model （ LMM）, a new method under the framework of nonnegative matrix fac- torization （NMF） is proposed, namely minimum distance constrained nonnegative matrix factoriza- tion （MDC-NMF）. In this paper, firstly, a new regularization term, called endmember distance （ED） is considered, which is defined as the sum of the squared Euclidean distances from each end- member to their geometric center. Compared with the simplex volume, ED has better optimization properties and is conceptually intuitive. Secondly, a projected gradient （PG） scheme is adopted, and by the virtue of ED, in this scheme the optimal step size along the feasible descent direction can be calculated easily at each iteration. Thirdly, a finite step （ no more than the number of endmem- bers） terminated algorithm is used to project a point on the canonical simplex, by which the abun- dance nonnegative constraint and abundance sum-to-one constraint can be accurately satisfied in a light amount of computation. The experimental results, based on a set of synthetic data and real da- ta, demonstrate that, in the same running time, MDC-NMF outperforms several other similar meth- ods proposed recently.展开更多
Generalized morphological operator can generate less statistical bias in the output than classical morphological operator. Comprehensive utilization of spectral and spatial information of pixels, an endmember extracti...Generalized morphological operator can generate less statistical bias in the output than classical morphological operator. Comprehensive utilization of spectral and spatial information of pixels, an endmember extraction algorithm based on generalized morphology is proposed. For the limitations of morphological operator in the pixel arrangement rule and replacement criteria, the reference pixel is introduced. In order to avoid the cross substitution phenomenon at the boundary of different object categories in the image, an endmember is extracted by calculating the generalized opening-closing(GOC) operator which uses the modified energy function as a distance measure. The algorithm is verified by using simulated data and real data. Experimental results show that the proposed algorithm can extract endmember automatically without prior knowledge and achieve relatively high extraction accuracy.展开更多
基金Projects(61571145,61405041)supported by the National Natural Science Foundation of ChinaProject(2014M551221)supported by the China Postdoctoral Science Foundation,China+3 种基金Project(LBH-Z13057)supported by the Heilongjiang Postdoctoral Science Found,ChinaProject(ZD201216)supported by the Key Program of Heilongjiang Natural Science Foundation,ChinaProject(RC2013XK009003)supported by the Program of Excellent Academic Leaders of Harbin,ChinaProject(HEUCF1508)supported by the Fundamental Research Funds for the Central Universities,China
文摘A variation pixels identification method was proposed aiming at depressing the effect of variation pixels, which dilates the theoretical hyperspectral data simplex and misguides volume evaluation of the simplex. With integration of both spatial and spectral information, this method quantitatively defines a variation index for every pixel. The variation index is proportional to pixels local entropy but inversely proportional to pixels kernel spatial attraction. The number of pixels removed was modulated by an artificial threshold factor α. Two real hyperspectral data sets were employed to examine the endmember extraction results. The reconstruction errors of preprocessing data as opposed to the result of original data were compared. The experimental results show that the number of distinct endmembers extracted has increased and the reconstruction error is greatly reduced. 100% is an optional value for the threshold factor α when dealing with no prior knowledge hyperspectral data.
基金Supported by the National Natural Science Foundation of China （ No. 60872083 ） and the National High Technology Research and Development Program of China （No. 2007AA12Z149）.
文摘This paper considers a problem of unsupervised spectral unmixing of hyperspectral data. Based on the Linear Mixing Model （ LMM）, a new method under the framework of nonnegative matrix fac- torization （NMF） is proposed, namely minimum distance constrained nonnegative matrix factoriza- tion （MDC-NMF）. In this paper, firstly, a new regularization term, called endmember distance （ED） is considered, which is defined as the sum of the squared Euclidean distances from each end- member to their geometric center. Compared with the simplex volume, ED has better optimization properties and is conceptually intuitive. Secondly, a projected gradient （PG） scheme is adopted, and by the virtue of ED, in this scheme the optimal step size along the feasible descent direction can be calculated easily at each iteration. Thirdly, a finite step （ no more than the number of endmem- bers） terminated algorithm is used to project a point on the canonical simplex, by which the abun- dance nonnegative constraint and abundance sum-to-one constraint can be accurately satisfied in a light amount of computation. The experimental results, based on a set of synthetic data and real da- ta, demonstrate that, in the same running time, MDC-NMF outperforms several other similar meth- ods proposed recently.
基金supported by the National Natural Science Foundation of China(No.61275010)the PhD Programs Foundation of Ministry of Education of China(No.20132304110007)
文摘Generalized morphological operator can generate less statistical bias in the output than classical morphological operator. Comprehensive utilization of spectral and spatial information of pixels, an endmember extraction algorithm based on generalized morphology is proposed. For the limitations of morphological operator in the pixel arrangement rule and replacement criteria, the reference pixel is introduced. In order to avoid the cross substitution phenomenon at the boundary of different object categories in the image, an endmember is extracted by calculating the generalized opening-closing(GOC) operator which uses the modified energy function as a distance measure. The algorithm is verified by using simulated data and real data. Experimental results show that the proposed algorithm can extract endmember automatically without prior knowledge and achieve relatively high extraction accuracy.
