Efficient Data Optimisation for Harmonic Inpainting with Finite Elements

Harmonic inpainting with optimised data is very popular for inpainting-based image compression. We improve this approach in three important aspects. Firstly, we replace the standard finite differences discretisation by a element method triangle elements. This does not only speed up and selection, but even improves reconstruction quality. Secondly, propose highly efficient algorithms spatial tonal optimisation that are several orders of magnitude faster than state-of-the-art methods. Last least, show our also allow working large images. has previously been impractical due to memory runtime requirements prior algorithms.