Fast Solvers for Cahn-Hilliard Inpainting
We consider the efficient solution of the modified Cahn-Hilliard equation for binary image inpainting using convexity splitting, which allows an unconditionally gradient stable time-discretization scheme. We look at a double-well as well as a double obstacle potential. For the latter we get a nonlin...
| Hauptverfasser: | , , , |
|---|---|
| Format: | Report |
| Veröffentlicht: |
SIAM
2013
|