A fast level set algorithm for shape-based segmentation with multiple selective priors
This paper addresses the shape-based segmentation problem using level sets. In particular, we propose a fast algorithm to solve the piece-wise constant Chan-Vese segmentation model with shape priors and labeling functions. Instead of directly solving the underlying PDE, we calculate the energy and check how it changes when we move image points from inside the region enclosed by the evolving interface to the outside region and vice-vera. This algorithm is then extended to the case of multi-phase Chan-Vese model, with multiple selective shape priors and a corresponding labeling function for each prior. This makes our algorithm different from that in [1] and other similar works in different aspects. On one hand, our algorithm is not restricted to two regions, but allows segmentation into several regions. On the other hand, more than one shape prior can be taken into account in our implementation. In addition, the proposed algorithm improves dramatically the computational speed. Experimental results, on both synthetic and real images, demonstrate the performance of our algorithm and the computational improvements it offers.