PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 25, 20240 citationsOpen Access

Latent Modulated Function for Computational Optimal Continuous Image Representation

View Full Paper
ZHZongyao HeZJZhi Jin

Key Points

  • The latent modulated function reduces computational costs for continuous image representation by shifting from high-dimensional to lower-dimensional decoding.
  • Up to 99.9% reduction in computational costs and 57 times accelerated inference were achieved with the new method.
  • Analysis employed multi-layer perceptron techniques in both low-resolution and high-resolution spaces for improved rendering efficacy and flexibility in decoding efficiency across varying input complexities and resolutions, ensuring competitive performance throughout the process and results achieved from extensive experiments with existing models in arbitrary-scale super-resolution methodologies support this claim. This model emphasizes practical applications that address prior limitations regarding high computational costs in image rendering systems and may enable further advancements in related fields of image processing and computer vision.

Abstract

The recent work Local Implicit Image Function (LIIF) and subsequent Implicit Neural Representation (INR) based works have achieved remarkable success in Arbitrary-Scale Super-Resolution (ASSR) by using MLP to decode Low-Resolution (LR) features. However, these continuous image representations typically implement decoding in High-Resolution (HR) High-Dimensional (HD) space, leading to a quadratic increase in computational cost and seriously hindering the practical applications of ASSR. To tackle this problem, we propose a novel Latent Modulated Function (LMF), which decouples the HR-HD decoding process into shared latent decoding in LR-HD space and independent rendering in HR Low-Dimensional (LD) space, thereby realizing the first computational optimal paradigm of continuous image representation. Specifically, LMF utilizes an HD MLP in latent space to generate latent modulations of each LR feature vector. This enables a modulated LD MLP in render space to quickly adapt to any input feature vector and perform rendering at arbitrary resolution. Furthermore, we leverage the positive correlation between modulation intensity and input image complexity to design a Controllable Multi-Scale Rendering (CMSR) algorithm, offering the flexibility to adjust the decoding efficiency based on the rendering precision. Extensive experiments demonstrate that converting existing INR-based ASSR methods to LMF can reduce the computational cost by up to 99.9%, accelerate inference by up to 57 times, and save up to 76% of parameters, while maintaining competitive performance. The code is available at https://github.com/HeZongyao/LMF.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

He et al. (2024) studied this question.

synapsesocial.com/papers/68e6dabdb6db64358765755fhttps://doi.org/10.48550/arxiv.2404.16451
Ask AI
Helpful
Bookmark
Share
View Full Paper