paper-with-me

Papers

AttentionLut: Attention Fusion-based Canonical Polyadic LUT for Real-time Image Enhancement

2024-01-03 · Kang Fu, Yicong Peng, ZiCheng Zhang, Qihang Xu, Xiaohong Liu, Jia Wang, Guangtao Zhai

Recently, many algorithms have employed image-adaptive lookup tables (LUTs) to achieve real-time image enhancement. Nonetheless, a prevailing trend among existing methods has been the employment of linear combinations of basic LUTs to formulate image-adaptive LUTs, which limits the generalization ability of these methods. To address this limitation, we propose a novel framework named AttentionLut for real-time image enhancement, which utilizes the attention mechanism to generate image-adaptive LUTs. Our proposed framework consists of three lightweight modules. We begin by employing the global image context feature module to extract image-adaptive features. Subsequently, the attention fusion module integrates the image feature with the priori attention feature obtained during training to generate image-adaptive canonical polyadic tensors. Finally, the canonical polyadic reconstruction module is deployed to reconstruct image-adaptive residual 3DLUT, which is subsequently utilized for enhancing input images. Experiments on the benchmark MIT-Adobe FiveK dataset demonstrate that the proposed method achieves better enhancement performance quantitatively and qualitatively than the state-of-the-art methods.

📄 PDF Abstract BibTeX arXiv:2401.01569

Code (0)

등록된 구현이 없습니다.

Tasks

Image Enhancement

Similar Papers 제목 키워드 기반

Dictionary-based Tensor Canonical Polyadic Decomposition

2017-04-03 · Jérémy E. Cohen, Nicolas Gillis

To ensure interpretability of extracted sources in tensor decomposition, we introduce in this paper a dictionary-based tensor canonical polyadic decomposition which enforces one factor to belong exactly to a known dictio…

Tensor Decomposition

An Accelerated Stochastic Gradient for Canonical Polyadic Decomposition

2021-09-28 · Ioanna Siaminou, Athanasios P. Liavas

We consider the problem of structured canonical polyadic decomposition. If the size of the problem is very big, then stochastic gradient approaches are viable alternatives to classical methods, such as Alternating Optimi…

Learning Fair Canonical Polyadical Decompositions using a Kernel Independence Criterion

2021-04-27 · Kevin Kim, Alex Gittens

This work proposes to learn fair low-rank tensor decompositions by regularizing the Canonical Polyadic Decomposition factorization with the kernel Hilbert-Schmidt independence criterion (KHSIC). It is shown, theoreticall…

Fairness

Streaming Generalized Canonical Polyadic Tensor Decompositions

2021-10-27 · Eric Phipps, Nick Johnson, Tamara G. Kolda

In this paper, we develop a method which we call OnlineGCP for computing the Generalized Canonical Polyadic (GCP) tensor decomposition of streaming data. GCP differs from traditional canonical polyadic (CP) tensor decomp…

CPUGPUTensor Decomposition

Noisy Tensor Completion for Tensors with a Sparse Canonical Polyadic Factor

2017-04-08 · Swayambhoo Jain, Alexander Gutierrez, Jarvis Haupt

In this paper we study the problem of noisy tensor completion for tensors that admit a canonical polyadic or CANDECOMP/PARAFAC (CP) decomposition with one of the factors being sparse. We present general theoretical error…