Name
Title | ||
|---|---|---|
A general framework of piecewise-polynomial Mumford –Shah model for image segmentation |
Abstract | ||
|---|---|---|
AbstractA new general framework of piecewise-polynomial Mumford–Shah model is proposed. In terms of the fidelity term, we use piecewise polynomials to approximate the inner and outer regions of the contour of the objective image. For more accurate approximation of the image, the proposed model has no constraint on the regularization term for polynomials. Moreover, we apply the anisotropic control to drive the initial contour to the desirable position. The proposed model generalizes the well-known Chan–Vese model and improves Vese's model, which is almost the simplest framework to apply piecewise polynomials to approximate the original Mumford–Shah model. Instead of solving the Euler–Lagrange equation by evolution implementation, we utilize the split Bregman iteration, which is shown to be a fast algorithm. Experimental results demonstrate that the proposed model has more desirable performance in terms of segmentation accuracy, efficiency and robustness, compared with several other variational models in addressing some challenging segmentation scenarios. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1080/00207160.2016.1274741 | Periodicals |
Keywords | Field | DocType |
Image segmentation, piecewise-polynomial approximation, anisotropic control, intensity heterogeneity, split Bregman iteration, 11Y11, 11Y16, 11G20, 11G99, 68W20 | Bregman iteration,Fidelity,Mathematical optimization,Polynomial,Mathematical analysis,Segmentation,Image segmentation,Robustness (computer science),Regularization (mathematics),Piecewise,Mathematics | Journal |
Volume | Issue | ISSN |
94 | 10 | 0020-7160 |
Citations | PageRank | References |
4 | 0.45 | 23 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chong Chen | 1 | 6 | 2.18 |
| Juelin Leng | 2 | 4 | 0.79 |
| Guoliang Xu | 3 | 205 | 13.03 |