| Summary: | Sparse unmixing has attracted widespread attention from researchers, and many effective unmixing algorithms have been proposed in recent years. However, most algorithms improve the unmixing accuracy at the cost of large calculations. Higher unmixing accuracy often leads to higher computational complexity. To solve this problem, we propose a novel double regression-based sparse unmixing model (DRSUM), which can obtain better unmixing results with lower computational complexity. DRSUM decomposes the complex objective function into two simple formulas and completes the unmixing process through two sparse regressions. The unmixing result of the first sparse regression is added as a constraint to the second. DRSUM is an open model, and we can add different constraints to improve the unmixing accuracy. In addition, we can perform appropriate preprocessing to further improve the unmixing results. Under this model, a specific algorithm called double regression-based sparse unmixing via K-means (DRSUMK−means) is proposed. The improved K-means clustering algorithm is first used for preprocessing, and then we impose single sparsity and joint sparsity (using l2,0 norm to control the sparsity) constraints on the first and second sparse unmixing, respectively. To meet the sparsity requirement, we introduce the row-hard-threshold function to solve the l2,0 norm directly. Then, DRSUMK−means can be efficiently solved under alternating direction method of multipliers (ADMM) framework. Simulated and real data experiments have proven the effectiveness of DRSUMK−means.
|
|---|
