Large Hole Image Inpainting With Compress-Decompression Network
This addresses image restoration for applications like photo editing, but it is incremental as it builds on prior encoder-decoder and residual network approaches.
The paper tackles the problem of image inpainting for large missing regions, where existing methods cause blur and artifacts, by proposing a compression-decompression network that improves performance on datasets like Places2 and CelebA, achieving a higher similarity ratio in conflicting scenarios.
Image inpainting technology can patch images with missing pixels. Existing methods propose convolutional neural networks to repair corrupted images. The networks focus on the valid pixels around the missing pixels, use the encoder-decoder structure to extract valuable information, and use the information to fix the vacancy. However, if the missing part is too large to provide useful information, the result will exist blur, color mixing, and object confusion. In order to patch the large hole image, we study the existing approaches and propose a new network, the compression-decompression network. The compression network takes responsibility for inpainting and generating a down-sample image. The decompression network takes responsibility for extending the down-sample image into the original resolution. We construct the compression network with the residual network and propose a similar texture selection algorithm to extend the image that is better than using the super-resolution network. We evaluate our model over Places2 and CelebA data set and use the similarity ratio as the metric. The result shows that our model has better performance when the inpainting task has many conflicts.