An extension of the iterated constrained endmember (ICE) algorithm that incorporates sparsity-promoting priors to find the correct number of endmembers is presented. In addition to solving for endmembers and endmember fractional maps, this algorithm attempts to autonomously determine the number of endmembers that are required for a particular scene. The number of endmembers is found by adding a sparsity-promoting term to ICE's objective function.
No takes yet. Share an insight, caveat, or question.
Zare et al. (2007) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: