摘要

The soft additive segmentation model attempts to solve the problem related to the segmentation of overlapping objects with additive intensity value. An issue in optimizing the soft additive segmentation functional is that a high-order nonlinear partial differential equation needs to be solved, which, for most standard algorithms, involves high computational cost. In this paper, we propose a fast and efficient numerical algorithm to optimize the soft additive segmentation model. We reformulate the original minimization problem into a sequence of simpler minimization problems that can be solved efficiently by using the augmented Lagrangian method. Numerical tests on real and synthetic cases are presented to demonstrate the efficiency of our algorithm.

  • 出版日期2012