Coverage segmentation based on linear unmixing and minimization of perimeter and boundary thickness

► Coverage segmentation methods are information preserving and highly desired. ► We perform coverage segmentation by convex constrained linear unmixing. ► The segmentation task is formulated as an energy minimization problem. ► Optimization is performed by a graduated spectral projected gradient algorithm. ► Terms controlling shape smoothness and border thickness are incorporated.