研究了一类向量值极小化问题的凸松弛方法,给出了适用于splitBregman快速算法的一般性等价模型。Use-chan多相分割方法和基于分片常数水平集函数的Mumford-shah方法是新模型的特例。数值实验表明,在Use-chan方法和Murnford-shah方法中应用split-Bregman算法,具有较快的运算速度和较好的分割效果,且对初始条件是鲁棒的。
A general equivalent model is introduced based on the convex relaxation model of a class of vector-valued minimization problems. The presented model can be solved by split-Bregman algorithm. The computational efficiency is greatly improved. The method is applied to the Vese-Chan multi-phase segmentation model and Mumford-Shah model. Numerical experiments show our method has fast computing speed and good segmentation results, and is robust to the initial condition.