CVJun 21, 2023

Dynamic Implicit Image Function for Efficient Arbitrary-Scale Image Representation

arXiv:2306.12321v28 citationsh-index: 16Has Code
Originality Incremental advance
AI Analysis

This work addresses efficiency bottlenecks in image super-resolution for applications requiring real-time processing, representing an incremental improvement over existing implicit neural representation methods.

The paper tackles the high computational cost of implicit arbitrary-scale super-resolution methods by proposing Dynamic Implicit Image Function (DIIF), which uses coordinate grouping and slicing with a coarse-to-fine MLP to achieve state-of-the-art performance with significantly improved efficiency, reducing inference time by up to 10x compared to prior methods.

Recent years have witnessed the remarkable success of implicit neural representation methods. The recent work Local Implicit Image Function (LIIF) has achieved satisfactory performance for continuous image representation, where pixel values are inferred from a neural network in a continuous spatial domain. However, the computational cost of such implicit arbitrary-scale super-resolution (SR) methods increases rapidly as the scale factor increases, which makes arbitrary-scale SR time-consuming. In this paper, we propose Dynamic Implicit Image Function (DIIF), which is a fast and efficient method to represent images with arbitrary resolution. Instead of taking an image coordinate and the nearest 2D deep features as inputs to predict its pixel value, we propose a coordinate grouping and slicing strategy, which enables the neural network to perform decoding from coordinate slices to pixel value slices. We further propose a Coarse-to-Fine Multilayer Perceptron (C2F-MLP) to perform decoding with dynamic coordinate slicing, where the number of coordinates in each slice varies as the scale factor varies. With dynamic coordinate slicing, DIIF significantly reduces the computational cost when encountering arbitrary-scale SR. Experimental results demonstrate that DIIF can be integrated with implicit arbitrary-scale SR methods and achieves SOTA SR performance with significantly superior computational efficiency, thereby opening a path for real-time arbitrary-scale image representation. Our code can be found at https://github.com/HeZongyao/DIIF.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes