Pith. sign in

REVIEW 4 major objections 4 minor 38 references

Multi-View Learning with Context-Guided Receptance for Image Denoising

T0 review · 4 major / 4 minor · reviewed 2026-08-16 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper proposes CRWKV, a linear-complexity denoiser that matches transformer-level quality on real-world noise while using fewer parameters and less memory.

desk verdict A solid RWKV-based denoising architecture paper whose abstract overstates both accuracy and speed; worth reviewing after the claims are scoped to the data. read the letter →

arxiv 2505.02705 v1 pith:ENOTSSGX submitted 2025-05-05 eess.IV cs.CV

Binghong Chen , Tingting Chai , Wei Jiang , Yuanrong Xu , Guanglu Zhou , Xiangqian Wu This is my paper · ORCID
classification eess.IVcs.CV
keywords imagedenoisingreal-worldnoiseRWKVlinearcomplexityfrequency-domainfeaturetokenshiftmulti-viewlearning
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

CRWKV is a new architecture for real-world image denoising built on the RWKV sequence model rather than on transformers or state-space scans. The paper claims that three mechanisms—a context-guided token shift that follows the measured correlation structure of real noise, a frequency-mix branch that separates high-frequency noise from detail, and a bidirectional WKV operator that lets every pixel interact with every other pixel in linear time—let a 20.19M-parameter model match or outperform leading denoisers on ccnoise, PolyU, and Urban100GP, and nearly tie the best transformer on SIDD while using less memory and, the paper claims, reducing inference time by up to 40% relative to several state-of-the-art baselines. This matters because the strongest existing denoisers are transformer-based and computationally heavy; a linear-complexity alternative with comparable quality would make high-resolution and resource-constrained denoising more practical. The model is trained on SIDD with an L1 loss and is shown to generalize to unseen real-noise datasets without retraining.

What carries the argument

The load-bearing mechanism is the Context Receptance Block, which stacks Frequency Mix (FMix) and Context Receptance Module (CRM) branches around Channel Mix layering. Context-guided Token Shift (CTS) allocates channels to shifted versions of neighboring pixels using a fixed offset dictionary drawn from prior Pearson-correlation analysis of real noise, weighting each offset by the reciprocal of its Manhattan distance; this fixes the receptive-field shape to the noise's correlation structure. The Frequency Mix module applies a 2D FFT, weights the frequency response linearly, passes it through Leaky ReLU, and modulates the original feature map with the inverse-FFT result, so noise concentrated in high frequencies is selectively attenuated. The Bidirectional WKV (BiWKV) operator, with relative position bias $b_{t,i}=-(|t-i|-1)/T$ and a learnable current-token bonus $u$, computes a weighted sum over all pixels in linear time while treating forward and backward neighbors symmetrically, overcoming the causal restriction of standard WKV.

What would settle it

Take a noisy dataset whose noise correlation is deliberately different from the CTS offset dictionary—for example, noise with long-range or anisotropic spatial correlation—and compare CRWKV against a variant that learns the offset dictionary from that dataset. If the fixed-offset model loses substantially while the learnable variant does not, the transfer assumption behind CTS is false; the same test can be done by measuring the Pearson correlation neighborhood on ccnoise or PolyU and checking whether it matches the offsets used.

Watch

Extended reading notes

Core claim

The central claim is that CRWKV, a U-shaped encoder-decoder with long-skip connections, outperforms every compared state-of-the-art method on ccnoise, PolyU, and Urban100GP, and reaches 39.87 dB PSNR on SIDD, just 0.14 dB below Restormer's 40.01 dB, while using fewer parameters and one of the smallest FLOP counts among modern denoisers. The paper attributes this to the interaction of its three designed modules: CTS encodes the spatial correlation geometry of real noise directly into token mixing, FMix attenuates noise-dominated frequency bands, and BiWKV provides symmetric, linear-complexity global pixel mixing that avoids the asymmetry of causal scans. Power-spectrum analysis of feature maps shows CRWKV retains high-frequency amplitude more steadily across encoder layers than MambaIR, which the paper takes as evidence that the model preserves detail while suppressing noise throughout the network.

Load-bearing premise

The approach assumes that the spatial pattern of noise correlation measured in one prior study is the same across all real-world noise, because CTS fixes that pattern in advance rather than learning it per dataset.

Editorial extensions

If this is right

  • A linear-complexity sequence backbone can match transformer-based restoration quality, so high-resolution images can be denoised with moderate GPU memory and FLOPs rather than quadratic attention cost.
  • The fixed, correlation-derived shift dictionary shows that noise-specific local geometry can be hard-coded into a denoiser without learned offsets, simplifying training and reducing overfitting risk.
  • Frequency-domain mixing at deep, semantically rich layers preserves high-frequency detail better than at middle layers, giving a practical design rule for similar restoration networks.
  • A single SIDD-trained CRWKV transfers to other real-noise domains such as ccnoise, PolyU, and synthetic Urban100GP, indicating that the learned noise model is not dataset-specific.
  • The L1 loss, combined with these modules, outperforms MSE, Charbonnier, and PSNR losses on the tested benchmarks, so fidelity-focused training is preferred for real noise.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If CTS's fixed offset dictionary is the source of its gains, then re-estimating that dictionary per target domain (or per camera) could improve generality further; the paper's own CTS(+) ablation shows the offset set has a sweet spot, so adaptive offsets are a natural next test.
  • The BiWKV operator's spatial symmetry is a design that likely transfers to other low-level vision tasks such as super-resolution and deblurring, though the paper only evaluates denoising.
  • The paper's power-spectrum comparison suggests that stable amplitude retention across layers is a useful diagnostic for restoration backbones; extending that analysis to test-time noise level or camera type could make the claim more precise.
  • The reported inference-time savings should be checked at high resolutions and on edge hardware, because the paper's memory and FLOP curves imply the advantage grows with input size, making mobile deployment a promising but untested extension.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper proposes CRWKV, a U-shaped RWKV-based architecture for real-world image denoising. The contribution is a combination of three mechanisms: BiWKV, a bidirectional linear-complexity token-mixing operation adapted from Vision-RWKV; CTS, a fixed context-guided token shift whose offset dictionary is taken from an external Pearson-correlation analysis; and FMix, an FFT-based frequency filtering module. The model is trained on SIDD and evaluated on SIDD, ccnoise, PolyU, and a synthetic Urban100GP benchmark, with ablations over module configuration, shift mechanisms, layer depth, and loss functions. The manuscript claims that CRWKV outperforms state-of-the-art methods quantitatively and reduces inference time by up to 40%.

Significance. If the empirical results hold, CRWKV would be a useful linear-complexity denoiser with competitive accuracy and a smaller parameter/FLOP footprint than Restormer and MambaIR on several real-noise benchmarks. The paper's strengths include a public code release, multiple unseen-dataset evaluations, and fairly extensive ablations. The central practical-advantage claim, however, is not fully supported by the reported numbers: CRWKV does not beat Restormer on SIDD PSNR and is not faster than Restormer in the reported inference-time comparison. The fixed CTS offset dictionary also raises a transferability question, though the authors explicitly acknowledge this limitation. Overall the architecture is plausible and the contribution is meaningful, but the advertised claims need to be scoped and the efficiency evidence needs more detail before publication.

major comments (4)
  1. [Abstract; Table 2; Table 3] The abstract's claim that CRWKV "outperforms the state-of-the-art methods quantitatively and reduces inference time up to 40%" is overbroad. On the primary SIDD benchmark, Table 2 shows Restormer at 40.01 dB PSNR versus CRWKV at 39.87 dB, and Table 3 shows CRWKV at 62.74 ms inference time versus Restormer at 47.40 ms. Thus CRWKV is neither the most accurate on SIDD nor faster than Restormer. The claim should be explicitly scoped to the datasets on which CRWKV leads (ccnoise, PolyU, Urban100GP) and to speed comparisons against baselines such as ShuffleFormer and SwinIR, from which the up-to-40% reduction appears to be derived.
  2. [Section 4.2; Table 3; Figure 1(b)] The computational-complexity analysis is not sufficient to support the inference-efficiency claim. Table 3 reports only a single millisecond value per method with no stated input resolution, GPU thermal state, warm-up procedure, or number of repeated runs; without this information the measured ordering (CRWKV slower than Restormer) cannot be attributed to architecture rather than implementation or protocol. The authors should report the measurement setup and ideally provide speed curves over input sizes, which would also make Figure 1(b)'s memory comparison interpretable relative to the time claim.
  3. [Section 3.2; Section 4.3; Table 5] The generality of the CTS mechanism is not tested against the variability of real-world noise statistics. The fixed offset dictionary in Algorithm 1 is taken from the Pearson-correlation analysis in LG-BPN, and the paper does not provide evidence that this specific noise-neighborhood geometry transfers to SIDD, ccnoise, PolyU, or Urban100GP beyond the aggregate scores. A concrete test would be to vary or learn the offset dictionary on each noise regime, or to report CTS performance under synthetic noise with different correlation structures; the current ablation in Table 5 only compares two fixed dictionaries derived from the same external prior.
  4. [Algorithm 1; Section 3.2] Algorithm 1 is not fully reproducible as written. The channel allocation o[c:c+k*w_p] uses the real number k*w_p, where k=C/psum and w_p=1/d_p, but Python slicing requires integer bounds; the paper does not specify how fractional channel counts are rounded or how the final channel segment is handled when C is not exactly divisible by the sum of weights. Since CTS is a central component, the authors should give the exact integer allocation rule or refer to the public code for this detail.
minor comments (4)
  1. [Section 4.2] The sentence "The proposed FRWKV method was evaluated" contains a typo: the model is called CRWKV, not FRWKV.
  2. [Table 4] The row labels in Table 4 are ambiguous because the checkmarks are not mapped to the configurations described in Section 4.3. Please label each row explicitly, e.g., "FMix only," "FMix + CTS(CRM)," "FMix + CTS(CMix)," and "full CRB," so the ablation deltas can be verified.
  3. [Figure 1(a) vs. Table 2] The visual example in Figure 1(a) is labeled Urban100, while the quantitative benchmark in Table 2 is Urban100GP with different PSNR/SSIM values for the same methods; the relationship between these two versions should be clarified.
  4. [Table 5] The number of neighboring pixels used in the base CTS configuration is never stated; the paper only says the CTS(+) variant covers 16 neighbors at Manhattan distance 3. Please give the base shift set and its Manhattan distances.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: CRWKV's empirical claims rest on benchmark measurements and external priors, not on self-referential fitting.

full rationale

The paper's central claims are empirical performance results, not derived quantities. The Context-guided Token Shift offset dictionary is cited from external work (Wang et al., 2023, LG-BPN) as a fixed noise-neighborhood prior; it is not fitted to this paper's own outputs, and adopting it is an architectural choice rather than a self-referential prediction. Equation (7) is the standard symmetric BiWKV weighted average adapted from RWKV-style literature; it defines a mechanism, not a fitted target result. The reported PSNR/SSIM values are direct benchmark measurements against external methods on SIDD, ccnoise, PolyU, and Urban100GP, and no parameter is fitted to the comparison outcomes in a way that makes the claimed superiority true by construction. Hyperparameters tuned on SIDD and ccnoise are standard practice and do not make the benchmark numbers definitionally equal to inputs. The only notable discrepancy, the abstract's 'reducing inference time up to 40%' claim versus Table 3 showing CRWKV at 62.74 ms while Restormer is 47.40 ms, is an evidential or framing issue, not circularity, because the timing numbers are measured rather than forced by construction. No load-bearing self-citation, uniqueness theorem, or renamed-known-result pattern is present, so the appropriate finding is no significant circularity.

Assumptions & free parameters 4 free parameters · 3 assumptions · 0 invented entities

The central claim depends on learned parameters (u, omega, FMix weights) and on transferring a noise-correlation prior from LG-BPN to the training and test datasets. No new physical entities are introduced.

free parameters (4)
  • BiWKV current-token bonus u = learned
    Learnable scalar in Eq. 7 that weights the current token's contribution; tuned during training.
  • CTS blend weight omega = learned
    Learnable scalar in Algorithm 1 that balances shifted and original tokens.
  • Channel depth and module counts (L1..L4, ak, bk) = (L1=3,L2=L3=4,L4=6) and (b1=3,b2=b3=4,a4=6)
    Architectural hyperparameters selected through ablations on SIDD and ccnoise in Table 6.
  • Frequency Mix linear weighting = learned
    Linear layer weights in FMix (Eq. 9-10) are learned during training.
assumptions (3)
  • domain assumption The noise neighborhood geometry from LG-BPN, based on Pearson correlation, transfers to SIDD, ccnoise, PolyU, and Urban100GP.
    Section 3.2 and Algorithm 1 use a fixed offset dictionary D derived from LG-BPN (Wang et al. 2023). If the noise correlation structure differs, the CTS weights may be suboptimal.
  • domain assumption Real-world noise is centrosymmetric, so a bidirectional symmetric position bias in BiWKV is appropriate.
    Section 3.2 justifies BiWKV by spatial symmetry of images. If real noise is strongly anisotropic, the symmetric bias loses information.
  • standard math FFT and iFFT are differentiable and invertible in the deep learning framework.
    FMix in Eq. 9-10 relies on standard differentiable FFT operations, which is common in lossless gradient-based training.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Multi-View Learning with Context-Guided Receptance for Image Denoising." pith.science (2026). https://pith.science/paper/ENOTSSGX

@misc{pith2026250502705,
  author       = {Pith},
  title        = {Pith review of: Multi-View Learning with Context-Guided Receptance for Image Denoising},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ENOTSSGX}},
  note         = {Machine review of arXiv:2505.02705}
}
read the original abstract

Image denoising is essential in low-level vision applications such as photography and automated driving. Existing methods struggle with distinguishing complex noise patterns in real-world scenes and consume significant computational resources due to reliance on Transformer-based models. In this work, the Context-guided Receptance Weighted Key-Value (\M) model is proposed, combining enhanced multi-view feature integration with efficient sequence modeling. Our approach introduces the Context-guided Token Shift (CTS) paradigm, which effectively captures local spatial dependencies and enhance the model's ability to model real-world noise distributions. Additionally, the Frequency Mix (FMix) module extracting frequency-domain features is designed to isolate noise in high-frequency spectra, and is integrated with spatial representations through a multi-view learning process. To improve computational efficiency, the Bidirectional WKV (BiWKV) mechanism is adopted, enabling full pixel-sequence interaction with linear complexity while overcoming the causal selection constraints. The model is validated on multiple real-world image denoising datasets, outperforming the existing state-of-the-art methods quantitatively and reducing inference time up to 40\%. Qualitative results further demonstrate the ability of our model to restore fine details in various scenes.

Figures

Figures reproduced from arXiv: 2505.02705 by the authors.

Figure 1
Figure 1. Comparison of existing image denoising methods. (a) Vi [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Architecture of the proposed CRWKV model, and (a) Frequency Mix Module (FMix), (b) Context Receptance Module (CRM) and [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Illustration of different token shift mechanisms. [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: Selected visual results on ccnoise and PolyU dataset. [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]
Figure 6
Figure 6. Figure 6: Selected visual results on Urban100GP dataset. [PITH_FULL_IMAGE:figures/full_fig_p005_6.png]
Figure 7
Figure 7. Figure 7: Power spectrum of feature maps at different depths of [PITH_FULL_IMAGE:figures/full_fig_p006_7.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

38 extracted references · 26 canonical work pages

  1. [1]

    A high-quality denoising dataset for smartphone cameras

    Abdelrahman Abdelhamed, Stephen Lin, and Michael S Brown. A high-quality denoising dataset for smartphone cameras. In Proceedings of the IEEE conference on computer vision and pattern recognition , pages 1692--1700, 2018

    work page 2018

  2. [2]

    Efficientvit: Lightweight multi-scale attention for high-resolution dense prediction

    Han Cai, Junyan Li, Muyan Hu, Chuang Gan, and Song Han. Efficientvit: Lightweight multi-scale attention for high-resolution dense prediction. In Proceedings of the IEEE/CVF international conference on computer vision , pages 17302--17313, 2023

    work page 2023

  3. [3]

    Pre-trained image processing transformer

    Hanting Chen, Yunhe Wang, Tianyu Guo, Chang Xu, Yiping Deng, Zhenhua Liu, Siwei Ma, Chunjing Xu, Chao Xu, and Wen Gao. Pre-trained image processing transformer. In 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , pages 12294--12305. IEEE Computer Society, 2021

    work page 2021

  4. [4]

    Image denoising by sparse 3-d transform-domain collaborative filtering

    Kostadin Dabov, Alessandro Foi, Vladimir Katkovnik, and Karen Egiazarian. Image denoising by sparse 3-d transform-domain collaborative filtering. IEEE Transactions on image processing , 16(8):2080--2095, 2007

    work page 2007

  5. [5]

    Transformers are ssms: Generalized models and efficient algorithms through structured state space duality

    Tri Dao and Albert Gu. Transformers are ssms: Generalized models and efficient algorithms through structured state space duality. arXiv preprint arXiv:2405.21060 , 2024

    arXiv 2024

  6. [6]

    Scaling up your kernels to 31x31: Revisiting large kernel design in cnns

    Xiaohan Ding, Xiangyu Zhang, Jungong Han, and Guiguang Ding. Scaling up your kernels to 31x31: Revisiting large kernel design in cnns. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages 11963--11975, 2022

    work page 2022

  7. [7]

    An image is worth 16x16 words: Transformers for image recognition at scale

    Alexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weissenborn, Xiaohua Zhai, Thomas Unterthiner, Mostafa Dehghani, Matthias Minderer, Georg Heigold, Sylvain Gelly, et al. An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 , 2020

    arXiv 2010

  8. [8]

    Vision-rwkv: Efficient and scalable visual perception with rwkv-like architectures

    Yuchen Duan, Weiyun Wang, Zhe Chen, Xizhou Zhu, Lewei Lu, Tong Lu, Yu Qiao, Hongsheng Li, Jifeng Dai, and Wenhai Wang. Vision-rwkv: Efficient and scalable visual perception with rwkv-like architectures. arXiv preprint arXiv:2403.02308 , 2024

    arXiv 2024

Show all 38 references
  1. [9]

    Diffusion-rwkv: Scaling rwkv-like architectures for diffusion models

    Zhengcong Fei, Mingyuan Fan, Changqian Yu, Debang Li, and Junshi Huang. Diffusion-rwkv: Scaling rwkv-like architectures for diffusion models. arXiv preprint arXiv:2404.04478 , 2024

    2024 arXiv

  2. [10]

    Toward convolutional blind denoising of real photographs

    Shi Guo, Zifei Yan, Kai Zhang, Wangmeng Zuo, and Lei Zhang. Toward convolutional blind denoising of real photographs. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages 1712--1722, 2019

    2019

  3. [11]

    Mambair: A simple baseline for image restoration with state-space model

    Hang Guo, Jinmin Li, Tao Dai, Zhihao Ouyang, Xudong Ren, and Shu-Tao Xia. Mambair: A simple baseline for image restoration with state-space model. In European conference on computer vision , pages 222--241. Springer, 2025

    2025

  4. [12]

    Single image haze removal using dark channel prior

    Kaiming He, Jian Sun, and Xiaoou Tang. Single image haze removal using dark channel prior. IEEE transactions on pattern analysis and machine intelligence , 33(12):2341--2353, 2010

    2010

  5. [13]

    Single image super-resolution from transformed self-exemplars

    Jia-Bin Huang, Abhishek Singh, and Narendra Ahuja. Single image super-resolution from transformed self-exemplars. In Proceedings of the IEEE conference on computer vision and pattern recognition , pages 5197--5206, 2015

    2015

  6. [14]

    Linformer: A linear-based lightweight transformer architecture for time-aware mimo channel prediction

    Yanliang Jin, Yifan Wu, Yuan Gao, Shunqing Zhang, Shugong Xu, and Cheng-Xiang Wang. Linformer: A linear-based lightweight transformer architecture for time-aware mimo channel prediction. arXiv preprint arXiv:2410.21351 , 2024

    arXiv

  7. [15]

    Noise2void-learning denoising from single noisy images

    Alexander Krull, Tim-Oliver Buchholz, and Florian Jug. Noise2void-learning denoising from single noisy images. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages 2129--2137, 2019

    2019

  8. [16]

    Image denoising based on a variable spatially exponent pde

    Amine Laghrib and Lekbir Afraites. Image denoising based on a variable spatially exponent pde. Applied and Computational Harmonic Analysis , 68:101608, 2024

    2024

  9. [17]

    Ap-bsn: Self-supervised denoising for real-world images via asymmetric pd and blind-spot network

    Wooseok Lee, Sanghyun Son, and Kyoung Mu Lee. Ap-bsn: Self-supervised denoising for real-world images via asymmetric pd and blind-spot network. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages 17725--17734, 2022

    2022

  10. [18]

    Swinir: Image restoration using swin transformer

    Jingyun Liang, Jiezhang Cao, Guolei Sun, Kai Zhang, Luc Van Gool, and Radu Timofte. Swinir: Image restoration using swin transformer. In Proceedings of the IEEE/CVF international conference on computer vision , pages 1833--1844, 2021

    2021

  11. [19]

    Vmamba: Visual state space model

    Yue Liu, Yunjie Tian, Yuzhong Zhao, Hongtian Yu, Lingxi Xie, Yaowei Wang, Qixiang Ye, and Yunfan Liu. Vmamba: Visual state space model. arXiv preprint arXiv:2401.10166 , 2024

    2024 arXiv

  12. [20]

    A holistic approach to cross-channel image noise modeling and its application to image denoising

    Seonghyeon Nam, Youngbae Hwang, Yasuyuki Matsushita, and Seon Joo Kim. A holistic approach to cross-channel image noise modeling and its application to image denoising. In Proceedings of the IEEE conference on computer vision and pattern recognition , pages 1683--1691, 2016

    2016

  13. [21]

    Rwkv: Reinventing rnns for the transformer era

    Bo Peng, Eric Alcaide, Quentin Anthony, Alon Albalak, Samuel Arcadinho, Stella Biderman, Huanqi Cao, Xin Cheng, Michael Chung, Matteo Grella, et al. Rwkv: Reinventing rnns for the transformer era. arXiv preprint arXiv:2305.13048 , 2023

    2023 arXiv

  14. [22]

    U-net: Convolutional networks for biomedical image segmentation

    Olaf Ronneberger, Philipp Fischer, and Thomas Brox. U-net: Convolutional networks for biomedical image segmentation. In Medical Image Computing and Computer-Assisted Intervention--MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part...

    2015

  15. [23]

    Non-local neural networks

    Xiaolong Wang, Ross Girshick, Abhinav Gupta, and Kaiming He. Non-local neural networks. In Proceedings of the IEEE conference on computer vision and pattern recognition , pages 7794--7803, 2018

    2018

  16. [24]

    Blind2unblind: Self-supervised image denoising with visible blind spots

    Zejin Wang, Jiazheng Liu, Guoqing Li, and Hua Han. Blind2unblind: Self-supervised image denoising with visible blind spots. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages 2027--2036, 2022

    2027

  17. [25]

    Uformer: A general u-shaped transformer for image restoration

    Zhendong Wang, Xiaodong Cun, Jianmin Bao, Wengang Zhou, Jianzhuang Liu, and Houqiang Li. Uformer: A general u-shaped transformer for image restoration. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages 17683--17693, 2022

    2022

  18. [26]

    Lg-bpn: Local and global blind-patch network for self-supervised real-world denoising

    Zichun Wang, Ying Fu, Ji Liu, and Yulun Zhang. Lg-bpn: Local and global blind-patch network for self-supervised real-world denoising. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages 18156--18165, 2023

    2023

  19. [27]

    Random shuffle transformer for image restoration

    Jie Xiao, Xueyang Fu, Man Zhou, Hongjian Liu, and Zheng-Jun Zha. Random shuffle transformer for image restoration. In International Conference on Machine Learning , pages 38039--38058. PMLR, 2023

    2023

  20. [28]

    Real-world noisy image denoising: A new benchmark

    Jun Xu, Hui Li, Zhetong Liang, David Zhang, and Lei Zhang. Real-world noisy image denoising: A new benchmark. arXiv preprint arXiv:1804.02603 , 2018

    2018 arXiv

  21. [29]

    Restore-rwkv: Efficient and effective medical image restoration with rwkv

    Zhiwen Yang, Hui Zhang, Dan Zhao, Bingzheng Wei, and Yan Xu. Restore-rwkv: Efficient and effective medical image restoration with rwkv. arXiv preprint arXiv:2407.11087 , 2024

    2024 arXiv

  22. [30]

    Restormer: Efficient transformer for high-resolution image restoration

    Syed Waqas Zamir, Aditya Arora, Salman Khan, Munawar Hayat, Fahad Shahbaz Khan, and Ming-Hsuan Yang. Restormer: Efficient transformer for high-resolution image restoration. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages 5728--5739, 2022

    2022

  23. [31]

    An attention free transformer

    Shuangfei Zhai, Walter Talbott, Nitish Srivastava, Chen Huang, Hanlin Goh, Ruixiang Zhang, and Josh Susskind. An attention free transformer. arXiv preprint arXiv:2105.14103 , 2021

    2021 arXiv

  24. [32]

    Beyond a gaussian denoiser: Residual learning of deep cnn for image denoising

    Kai Zhang, Wangmeng Zuo, Yunjin Chen, Deyu Meng, and Lei Zhang. Beyond a gaussian denoiser: Residual learning of deep cnn for image denoising. IEEE transactions on image processing , 26(7):3142--3155, 2017

    2017

  25. [33]

    Practical blind image denoising via swin-conv-unet and data synthesis

    Kai Zhang, Yawei Li, Jingyun Liang, Jiezhang Cao, Yulun Zhang, Hao Tang, Deng-Ping Fan, Radu Timofte, and Luc Van Gool. Practical blind image denoising via swin-conv-unet and data synthesis. Machine Intelligence Research , 20(6):822--836, 2023

    2023

  26. [34]

    Mixed noise removal in hyperspectral image via low-fibered-rank regularization

    Yu-Bang Zheng, Ting-Zhu Huang, Xi-Le Zhao, Tai-Xiang Jiang, Tian-Hui Ma, and Teng-Yu Ji. Mixed noise removal in hyperspectral image via low-fibered-rank regularization. IEEE Transactions on Geoscience and Remote Sensing , 58(1):734--749, 2019

    2019

  27. [35]

    Bsbp-rwkv: Background suppression with boundary preservation for efficient medical image segmentation

    Xudong Zhou and Tianxiang Chen. Bsbp-rwkv: Background suppression with boundary preservation for efficient medical image segmentation. In Proceedings of the 32nd ACM International Conference on Multimedia , pages 4938--4946, 2024

    2024

  28. [36]

    When awgn-based denoiser meets real noises

    Yuqian Zhou, Jianbo Jiao, Haibin Huang, Yang Wang, Jue Wang, Honghui Shi, and Thomas Huang. When awgn-based denoiser meets real noises. In Proceedings of the AAAI Conference on Artificial Intelligence , volume 34, pages 13074--13081, 2020

    2020

  29. [37]

    Vision mamba: Efficient visual representation learning with bidirectional state space model

    Lianghui Zhu, Bencheng Liao, Qian Zhang, Xinlong Wang, Wenyu Liu, and Xinggang Wang. Vision mamba: Efficient visual representation learning with bidirectional state space model. arXiv preprint arXiv:2401.09417 , 2024

    2024 arXiv

  30. [38]

    write newline

    " write newline "" before.all 'output.state := FUNCTION fin.entry add.period write newline FUNCTION new.block output.state before.all = 'skip after.block 'output.state := if FUNCTION new.sentence output.state after.block = 'skip output.state before.all = 'skip after.sentence '...

Pith tools

Reviewed August 16, 2026 · model on record in the stance chip above.