Abstract: We propose an algorithm that exactly solves the cardinality-constrained sparse spectral unmixing problem. Based on recent works on $\ell_{0}$-norm exact optimization, a branch-and-bound ...
Abstract: The branch - and - bound strategy has been used successfully in solving certain categories of combinatorial optimization problems. It has also been viewed as a tool for solving Travelling ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results