Answers are grounded in this paper and cite their sources.
Higher order equations, when applied to image inpainting, have certain advantages over second order equations, such as continuation of both edge and intensity information over larger distances. Discretizing a fourth order evolution equation with a brute force method may restrict the time steps to a size up to order x 4 where x denotes the step size of the spatial grid. In this work we present efficient semi-implicit schemes that are guaranteed to be unconditionally stable. We explain the main idea of these schemes and present applications in image processing for inpainting with the Cahn-Hilliard equation, TV-H -1 inpainting, and inpainting with LCIS (low curvature image simplifiers).
No takes yet. Share an insight, caveat, or question.
Bertozzi et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: