发明名称 Maximum simplex volume criterion-based endmember extraction algorithms
摘要 Provided herein are algorithms and processes to extract endmembers from hyperspectral image data in real time. A Simplex Growing Algorithm is effective to estimate a p number of endmembers to be generated, to select one or more initial endmembers as a simplex of k members and to add a k+1 endmember to the simplex that yields a maximum simplex volume until k=p, thereby extracting one or more endmembers from the data. Alternatively, N-FINDR algorithms form an initial simplex set of p endmembers obtained from the hyperspectral image data, find a maximum volume of one or more initial p endmembers therewithin, replace one or more of the p endmembers within the simplex with one or more of the found p endmembers of maximum volume, and refind a maximum volume of p endmember(s) and replace p endmember(s) until no increase in p endmember(s) volume is found.
申请公布号 US8417748(B2) 申请公布日期 2013.04.09
申请号 US20080286443 申请日期 2008.09.29
申请人 CHANG CHEIN-I;UNIVERSITY OF MARYLAND AT BALTIMORE COUNTY 发明人 CHANG CHEIN-I
分类号 G06F7/00 主分类号 G06F7/00
代理机构 代理人
主权项
地址