arXiv:1709.03979
A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization
원문 초록
Sparse coding has achieved a great success in various image processing tasks. However, a benchmark to measure the sparsity of image patch/group is missing since sparse coding is essentially an NP-hard problem. This work attempts to fill the gap from the perspective of rank minimization. More details please see the manuscript....
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
MatIR: A Hybrid Mamba-Transformer Image Restoration Model
Unified Image Restoration and Enhancement: Degradation Calibrated Cycle Reconstruction Diffusion Model
Binary Diffusion Probabilistic Model
LD-RPS: Zero-Shot Unified Image Restoration via Latent Diffusion Recurrent Posterior Sampling
EAMamba: Efficient All-Around Vision State Space Model for Image Restoration
Visual-Instructed Degradation Diffusion for All-in-One Image Restoration
토론
이 논문과 연결된 포럼 글이 아직 없습니다.