Pith. sign in

REVIEW 3 major objections 3 minor 81 references

Tackling Ill-posedness of Reversible Image Conversion with Well-posed Invertible Network

T0 review · 3 major / 3 minor · reviewed 2026-08-06 · deepseek-v4-flash

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

Pith's one-line read A well-posed invertible convolution removes the random-sampling crutch from reversible image conversion, yielding stable left inverses for image hiding, rescaling, and decolorization.

desk verdict Clever fix for ill-posedness in invertible nets, but the abstract skips the stability proof; the Gram determinant alone doesn't make an inverse well-posed. read the letter →

arxiv 2508.02111 v1 pith:ON3XN2BB submitted 2025-08-04 eess.IV cs.CV

Yuanfei Huang , Hua Huang This is my paper · ORCID
classification eess.IVcs.CV
keywords reversibleimageconversionill-posednessinvertibleneuralnetworkswell-posednessGramdeterminant1x1convolutionhidingrescaling
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

The paper takes on a persistent problem in reversible image conversion: the forward step maps a high-dimensional image to a lower-dimensional output, so reversing it is an underdetermined inverse problem. Existing invertible-network solutions inject randomly sampled latent variables to fill the missing degrees of freedom, which the authors argue leaves the result intrinsically uncertain and ill-posed. The paper's central proposal is to construct an overdetermined system whose Gram determinant is non-zero, yielding a well-posed approximate left inverse, and to instantiate this idea as a well-posed invertible $1\times1$ convolution (WIC) that needs no random sampling. On reversible image hiding, image rescaling, and image decolorization, the resulting networks report state-of-the-art results. The reason to care is that the approach removes the random-variable crutch and offers a concrete criterion for what makes the inversion well-posed.

What carries the argument

The load-bearing object is the overdetermined system with a non-zero Gram determinant: instead of solving the underdetermined forward equation directly, the method composes forward operators so that the number of constraints exceeds the number of unknowns, and requires the Gram matrix of those operators to have full rank. The second piece is the well-posed invertible $1\times1$ convolution (WIC), a convolution layer whose weight matrix is constructed to be invertible without any stochastic auxiliary input; using WIC as the invertible building block turns the network into a deterministic approximation of the left inverse. The WIN architecture additionally adds skip connections that carry long-range information across layers, which the paper says improves memory during the conversion.

What would settle it

One concrete observation: feed a set of natural images through a trained WIN model and compute the Gram determinant of the associated forward operators; if any input yields a zero or near-zero determinant, the well-posedness claim fails. A simpler operational check is to measure the condition number of the Gram matrix across a standard test set; divergence on some images would refute the stability guarantee.

Watch

Extended reading notes

Core claim

The paper claims that ill-posedness in reversible image conversion is caused by treating the forward process as an underdetermined system, and that the standard cure of attaching randomly sampled variables inside an invertible network merely masks the problem by adding irreducible uncertainty. The authors establish that a well-posed solution can be obtained by constructing an overdetermined system with a non-zero Gram determinant, which ensures the approximate left inverse is unique and stable. They implement this principle in a well-posed invertible $1\times1$ convolution (WIC), a layer that is invertible by construction and requires no random variables, and they build two networks, WIN-Naïve and WIN, on top of it. The reported experiments on reversible image hiding, image rescaling, and image decolorization show consistent state-of-the-art accuracy, which the authors take as evidence that the well-posedness principle resolves the bottleneck of existing reversible conversion methods.

Load-bearing premise

The argument rests on the assumption that the overdetermined system actually has a non-zero Gram determinant for the forward operators and the image data encountered in practice, and the paper does not supply a proof or a data-dependent condition that guarantees it.

Editorial extensions

If this is right

  • Reversible image conversion methods no longer need to sample random variables inside the invertible network, which removes the sampling-induced uncertainty the paper identifies as the source of ill-posedness.
  • The non-zero Gram determinant condition gives a concrete, checkable criterion for when a reversible conversion is well-posed, rather than relying on network capacity alone.
  • The WIC layer can serve as a drop-in invertible building block for other tasks that currently use random-variable-based invertible networks.
  • Reported results on image hiding, rescaling, and decolorization suggest the method sets a new performance baseline on all three tasks.

Reading between the lines

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

  • The Gram-determinant criterion is likely to transfer to other underdetermined inverse problems in imaging, such as super-resolution or lensless reconstruction, where a deterministic well-posed left inverse could replace stochastic sampling.
  • A natural testable extension is to monitor the smallest eigenvalue of the Gram matrix during training; a stability guarantee would require it to stay bounded away from zero, and this quantity could be reported as a diagnostic on benchmark datasets.
  • A useful next step would be to compare against classical regularization approaches that also aim for well-posedness without random variables; measuring that gap would clarify whether the advantage comes from the well-posedness principle or from learned network capacity.
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

3 major / 3 minor

Summary. The paper addresses ill-posedness in reversible image conversion (RIC). It argues that existing invertible-neural-network methods are intrinsically ill-posed because they introduce uncertainty through random variable sampling, and it proposes instead to construct an overdetermined system whose Gram determinant is non-zero, which the authors claim ensures a well-posed approximate left inverse. Based on this principle, the paper introduces a well-posed invertible 1x1 convolution (WIC) and two network architectures, WIN-Naive and WIN, and reports state-of-the-art results on reversible image hiding, image rescaling, and image decolorization. The abstract promises code availability. The full text was not provided in the review packet, so this report is necessarily based on the abstract alone.

Significance. If the well-posedness guarantee can be established with a quantitative stability bound, the contribution is significant: it would remove the random variable sampling that complicates existing RIC methods, provide a deterministic invertible architecture, and potentially set a new benchmark across several image tasks. The promise of released code is a strength that will facilitate reproducibility and direct comparison. However, the core mathematical claim in the abstract is under-specified: a non-zero Gram determinant by itself does not ensure Hadamard well-posedness without a uniform lower bound on the smallest singular value. The significance of the work therefore hinges on whether the full manuscript provides such a bound or an architectural mechanism that enforces it.

major comments (3)
  1. [Abstract (Gram determinant claim)] The abstract states that constructing an overdetermined system with a non-zero Gram determinant 'ensures a well-posed solution.' For a linear least-squares problem Ax=b with A in R^{m x n}, m>n, non-zero det(A^T A) guarantees a unique solution, but Hadamard well-posedness also requires stability: if the smallest singular value of A is arbitrarily close to zero, then the pseudo-inverse (A^T A)^{-1}A^T amplifies noise without bound. The abstract provides no proof or architectural mechanism ensuring a uniform lower bound on the singular values (or on the Gram determinant) across the data distribution. Since WIC is a 1x1 convolution applied inside a nonlinear network, the resulting Gram determinant depends on input activations; non-zero on training examples does not preclude near-singular behavior on test or adversarial inputs. This is a load-bearing gap in the central claim and must be addressed, e.g., by proving a spectral bound or by explicit regularization that keeps the condition number bounded.
  2. [Abstract (overdetermined construction)] The paper says it builds an overdetermined system from an underdetermined forward conversion, but the abstract does not specify how the forward operator is augmented or how WIC enforces the non-zero Gram determinant in practice. Without this description, the reader cannot judge whether the construction is general or task-specific, nor whether the determinant condition is checked or guaranteed at inference time. The full paper must provide the concrete form of the overdetermined system and a verification that the Gram determinant is non-zero and bounded away from zero for all inputs used in the reported experiments.
  3. [Abstract (unverifiable experimental claims)] The abstract reports state-of-the-art performance on three RIC tasks but provides no numerical results, baselines, or experimental details. While abstracts routinely omit such details, the combination of an untested theoretical condition and unverifiable SOTA claims makes it impossible to assess the central contribution from the abstract alone. The full paper needs to report quantitative comparisons with existing RIC methods and, importantly, a direct measurement of the conditioning of the Gram matrix (e.g., condition numbers or singular values) on test data to support the well-posedness claim empirically.
minor comments (3)
  1. [Abstract] The term 'well-posed invertible 1x1 convolution' is used without defining the mathematical operation; a brief description of how invertibility and well-posedness are encoded in the convolution weights would help readers understand the architecture.
  2. [Abstract] The phrase 'well-posed invertible networks' could be misleading: if the network is guaranteed invertible for all inputs, the term 'well-posed' adds little; if invertibility is only approximate or conditional, that distinction should be stated explicitly.
  3. [General] The abbreviation 'RIC' is defined, but the tasks 'reversible image hiding, image rescaling, and image decolorization' would benefit from a one-sentence description in the introduction of the full paper to set the context for readers outside the immediate area.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the central claim is a constructive design principle; no step reduces to its own input.

full rationale

Based on the provided abstract, the paper's derivation chain is: (1) reversible image conversion is ill-posed because the forward process is underdetermined; (2) the paper proposes to construct an overdetermined system with a non-zero Gram determinant to obtain a well-posed approximate left inverse; (3) it implements this principle via a well-posed invertible 1x1 convolution (WIC) that avoids random variable sampling; (4) the resulting networks are evaluated across three tasks. None of these steps is shown to be equivalent to its own input. WIC is not described as fitted to the target results; it is presented as a general architectural mechanism applied across tasks, and the experiments are empirical validation rather than a piecewise reconstruction of the same data used to define the method. The abstract contains no visible self-citations whose authority carries the argument, and no equation is provided that could be exposed as a tautology. The concern that a non-zero Gram determinant may not guarantee uniform stability is a legitimate correctness or robustness issue, but it is not a circularity issue: it concerns whether an assumption is sufficient, not whether the conclusion is presupposed by the premise. Similarly, the absence of full derivations in the abstract does not itself indicate circularity. Therefore the appropriate finding is no significant circularity, with score 0.

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

Abstract-only review. Without the full text, it is not possible to audit free parameters, axioms, or invented entities. The Gram determinant condition and the WIC layer would need to be examined for hidden assumptions.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Tackling Ill-posedness of Reversible Image Conversion with Well-posed Invertible Network." pith.science (2026). https://pith.science/paper/ON3XN2BB

@misc{pith2026250802111,
  author       = {Pith},
  title        = {Pith review of: Tackling Ill-posedness of Reversible Image Conversion with Well-posed Invertible Network},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ON3XN2BB}},
  note         = {Machine review of arXiv:2508.02111}
}
abstract

Reversible image conversion (RIC) suffers from ill-posedness issues due to its forward conversion process being considered an underdetermined system. Despite employing invertible neural networks (INN), existing RIC methods intrinsically remain ill-posed as inevitably introducing uncertainty by incorporating randomly sampled variables. To tackle the ill-posedness dilemma, we focus on developing a reliable approximate left inverse for the underdetermined system by constructing an overdetermined system with a non-zero Gram determinant, thus ensuring a well-posed solution. Based on this principle, we propose a well-posed invertible $1\times1$ convolution (WIC), which eliminates the reliance on random variable sampling and enables the development of well-posed invertible networks. Furthermore, we design two innovative networks, WIN-Na\"ive and WIN, with the latter incorporating advanced skip-connections to enhance long-term memory. Our methods are evaluated across diverse RIC tasks, including reversible image hiding, image rescaling, and image decolorization, consistently achieving state-of-the-art performance. Extensive experiments validate the effectiveness of our approach, demonstrating its ability to overcome the bottlenecks of existing RIC solutions and setting a new benchmark in the field. Codes are available in https://github.com/BNU-ERC-ITEA/WIN.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

81 extracted references · 80 canonical work pages

  1. [1]

    K. L. Cheng, Y. Xie, and Q. Chen, ``Iicnet: A generic framework for reversible image conversion,'' in IEEE/CVF Int. Conf. Comput. Vis. (ICCV), 2021, pp. 1991--2000

    2021

  2. [2]

    Baluja, ``Hiding images within images,'' IEEE Trans

    S. Baluja, ``Hiding images within images,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 42, no. 7, pp. 1685--1697, 2020

    work page 2020

  3. [3]

    J. Jing, X. Deng, M. Xu, J. Wang, and Z. Guan, ``Hinet: Deep image hiding by invertible network,'' in IEEE/CVF Int. Conf. Comput. Vis. (ICCV), 2021, pp. 4733--4742

    work page 2021

  4. [4]

    Z. Guan, J. Jing, X. Deng, M. Xu, L. Jiang, Z. Zhang, and Y. Li, ``Deepmih: Deep invertible network for multiple image hiding,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 45, no. 1, pp. 372--390, 2023

    work page 2023

  5. [5]

    M. Xiao, S. Zheng, C. Liu, Z. Lin, and T.-Y. Liu, ``Invertible rescaling network and its extensions,'' Int. J. Comput. Vis. (IJCV), vol. 131, no. 1, pp. 134--159, 2023

    work page 2023

  6. [6]

    J. Bao, J. Hao, P. Xu, M. Sun, C. Zhou, and S. Zhu, ``Plug-and-play tri-branch invertible block for image rescaling,'' in AAAI Conf. Artif. Intell. (AAAI), 2025

    work page 2025

  7. [7]

    M. Xia, X. Liu, and T.-T. Wong, ``Invertible grayscale,'' ACM Trans. Graph. (TOG), vol. 37, no. 6, pp. 1--10, 2018

    work page 2018

  8. [8]

    R. Zhao, T. Liu, J. Xiao, D. P. Lun, and K.-M. Lam, ``Invertible image decolorization,'' IEEE Trans. Image Process. (TIP), vol. 30, pp. 6081--6095, 2021

    work page 2021

Show all 81 references
  1. [9]

    Qayyum, I

    A. Qayyum, I. Ilahi, F. Shamshad, F. Boussaid, M. Bennamoun, and J. Qadir, ``Untrained neural network priors for inverse imaging problems: A survey,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 45, no. 5, pp. 6511--6536, 2023

    2023

  2. [10]

    Genzel, J

    M. Genzel, J. Macdonald, and M. März, ``Solving inverse problems with deep neural networks – robustness included?'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 45, no. 1, pp. 1119--1134, 2023

    2023

  3. [11]

    Hohage and F

    T. Hohage and F. Werner, ``Inverse problems with poisson data: statistical regularization theory, applications and algorithms,'' Inverse Problems, vol. 32, no. 9, p. 093001, 2016

    2016

  4. [12]

    Kobler, A

    E. Kobler, A. Effland, K. Kunisch, and T. Pock, ``Total deep variation: A stable regularization method for inverse problems,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 44, no. 12, pp. 9163--9180, 2022

    2022

  5. [13]

    Krizhevsky, I

    A. Krizhevsky, I. Sutskever, and G. E. Hinton, ``Imagenet classification with deep convolutional neural networks,'' in Adv. Neural Inform. Process. Syst. (NeurIPS), vol. 25, 2012

    2012

  6. [14]

    K. He, X. Zhang, S. Ren, and J. Sun, ``Deep residual learning for image recognition,'' in IEEE/CVF Conf. Comput. Vis. Pattern Recog. (CVPR), 2016, pp. 770--778

    2016

  7. [15]

    Baluja, ``Hiding images in plain sight: Deep steganography,'' in Adv

    S. Baluja, ``Hiding images in plain sight: Deep steganography,'' in Adv. Neural Inform. Process. Syst. (NeurIPS), 2018

    2018

  8. [16]

    X. Ke, H. Wu, and W. Guo, ``Stegformer: Rebuilding the glory of autoencoder-based steganography,'' in AAAI Conf. Artif. Intell. (AAAI), vol. 38, no. 3, 2024, pp. 2723--2731

    2024

  9. [17]

    Zhang, Y

    L. Zhang, Y. Li, X. Zhou, X. Zhao, and S. Gu, ``Transcending the limit of local window: Advanced super-resolution transformer with adaptive token dictionary,'' in IEEE/CVF Conf. Comput. Vis. Pattern Recog. (CVPR), June 2024, pp. 2856--2865

    2024

  10. [18]

    L. Dinh, D. Krueger, and Y. Bengio, ``Nice: Non-linear independent components estimation,'' in Int. Conf. Learn. Represent. (ICLR) Workshops, 2015

    2015

  11. [19]

    L. Dinh, J. Sohl-Dickstein, and S. Bengio, ``Density estimation using real nvp,'' in Int. Conf. Learn. Represent. (ICLR), 2017

    2017

  12. [20]

    D. P. Kingma and P. Dhariwal, ``Glow: Generative flow with invertible 1 1 convolutions,'' in Adv. Neural Inform. Process. Syst. (NeurIPS), 2018

    2018

  13. [21]

    Behrmann, W

    J. Behrmann, W. Grathwohl, R. T. Q. Chen, D. Duvenaud, and J.-H. Jacobsen, ``Invertible residual networks,'' in Int. Conf. Mach. Learn. (ICML), 2019

    2019

  14. [22]

    Papamakarios, E

    G. Papamakarios, E. Nalisnick, D. J. Rezende, S. Mohamed, and B. Lakshminarayanan, ``Normalizing flows for probabilistic modeling and inference,'' J. Mach. Learn. Res. (JMLR), vol. 22, no. 1, pp. 2617--2680, 2021

    2021

  15. [23]

    M. S. Albergo and E. Vanden-Eijnden, ``Building normalizing flows with stochastic interpolants,'' in Int. Conf. Learn. Represent. (ICLR), 2023

    2023

  16. [24]

    Bond-Taylor, A

    S. Bond-Taylor, A. Leach, Y. Long, and C. G. Willcocks, ``Deep generative modelling: A comparative review of vaes, gans, normalizing flows, energy-based and autoregressive models,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 44, no. 11, pp. 7327--7347, 2022

    2022

  17. [25]

    D. P. Kingma and M. Welling, ``Auto-encoding variational bayes,'' in Int. Conf. Learn. Represent. (ICLR), 2014

    2014

  18. [26]

    Zhang, J

    C. Zhang, J. Bütepage, H. Kjellström, and S. Mandt, ``Advances in variational inference,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 41, no. 8, pp. 2008--2026, 2019

    2008

  19. [27]

    Goodfellow, J

    I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, ``Generative adversarial nets,'' Adv. Neural Inform. Process. Syst. (NeurIPS), vol. 27, 2014

    2014

  20. [28]

    W. Xia, Y. Zhang, Y. Yang, J.-H. Xue, B. Zhou, and M.-H. Yang, ``Gan inversion: A survey,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 45, no. 3, pp. 3121--3138, 2023

    2023

  21. [29]

    J. Ho, A. Jain, and P. Abbeel, ``Denoising diffusion probabilistic models,'' Adv. Neural Inform. Process. Syst. (NeurIPS), vol. 33, pp. 6840--6851, 2020

    2020

  22. [30]

    Croitoru, V

    F.-A. Croitoru, V. Hondru, R. T. Ionescu, and M. Shah, ``Diffusion models in vision: A survey,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 45, no. 9, pp. 10\,850--10\,869, 2023

    2023

  23. [31]

    A. A. Tamimi, A. M. Abdalla, and O. Al-Allaf, ``Hiding an image inside another image using variable-rate steganography,'' International Journal of Advanced Computer Science and Applications, vol. 4, no. 10, 2013

    2013

  24. [32]

    Zhang, P

    C. Zhang, P. Benz, A. Karjauv, G. Sun, and I. S. Kweon, ``Udh: Universal deep hiding for steganography, watermarking, and light field messaging,'' Adv. Neural Inform. Process. Syst. (NeurIPS), vol. 33, pp. 10\,223--10\,234, 2020

    2020

  25. [33]

    J. Yu, X. Zhang, Y. Xu, and J. Zhang, ``Cross: Diffusion model makes controllable, robust and secure image steganography,'' Adv. Neural Inform. Process. Syst. (NeurIPS), vol. 36, 2023

    2023

  26. [34]

    Y. Xu, X. Zhang, J. Yu, C. Mou, X. Meng, and J. Zhang, ``Diffusion-based hierarchical image steganography,'' arXiv preprint arXiv:2405.11523, 2024

    2024 arXiv

  27. [35]

    Kishore, X

    V. Kishore, X. Chen, Y. Wang, B. Li, and K. Q. Weinberger, ``Fixed neural network steganography: Train the images, not the network,'' in Int. Conf. Learn. Represent. (ICLR), 2021

    2021

  28. [36]

    G. Li, S. Li, Z. Luo, Z. Qian, and X. Zhang, ``Purified and unified steganographic network,'' in IEEE/CVF Conf. Comput. Vis. Pattern Recog. (CVPR), 2024, pp. 27\,569--27\,578

    2024

  29. [37]

    G. Li, S. Li, Z. Qian, and X. Zhang, ``Cover-separable fixed neural network steganography via deep generative models,'' in ACM Int. Conf. Multimedia (ACMMM), 2024, p. 10238–10247

    2024

  30. [38]

    F. Li, Y. Sheng, X. Zhang, and C. Qin, ``iscmis:spatial-channel attention based deep invertible network for multi-image steganography,'' IEEE Trans. Multimedia (TMM), vol. 26, pp. 3137--3152, 2024

    2024

  31. [39]

    C. Mou, Y. Xu, J. Song, C. Zhao, B. Ghanem, and J. Zhang, ``Large-capacity and flexible video steganography via invertible neural network,'' in IEEE/CVF Conf. Comput. Vis. Pattern Recog. (CVPR), 2023, pp. 22\,606--22\,615

    2023

  32. [40]

    Y. Xu, C. Mou, Y. Hu, J. Xie, and J. Zhang, ``Robust invertible image steganography,'' in IEEE/CVF Conf. Comput. Vis. Pattern Recog. (CVPR), 2022, pp. 7875--7884

    2022

  33. [41]

    Zheng, Y

    Z. Zheng, Y. Hu, Y. Bin, X. Xu, Y. Yang, and H. T. Shen, ``Composition-aware image steganography through adversarial self-generated supervision,'' IEEE Trans. Neural Netw. Learn. Syst. (TNNLS), vol. 34, no. 11, pp. 9451--9465, 2023

    2023

  34. [42]

    C. Dong, C. C. Loy, K. He, and X. Tang, ``Image super-resolution using deep convolutional networks,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 38, no. 2, pp. 295--307, 2016

    2016

  35. [43]

    B. Lim, S. Son, H. Kim, S. Nah, and K. Mu Lee, ``Enhanced deep residual networks for single image super-resolution,'' in IEEE/CVF Conf. Comput. Vis. Pattern Recog. (CVPR) Workshops, 2017, pp. 136--144

    2017

  36. [44]

    Huang, J

    Y. Huang, J. Li, X. Gao, Y. Hu, and W. Lu, ``Interpretable detail-fidelity attention network for single image super-resolution,'' IEEE Trans. Image Process. (TIP), vol. 30, pp. 2325--2339, 2021

    2021

  37. [45]

    J.-N. Su, M. Gan, G.-Y. Chen, J.-L. Yin, and C. P. Chen, ``Global learnable attention for single image super-resolution,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 45, no. 7, pp. 8453--8465, 2022

    2022

  38. [46]

    Y. Xiao, Q. Yuan, K. Jiang, J. He, C.-W. Lin, and L. Zhang, ``Ttst: A top-k token selective transformer for remote sensing image super-resolution,'' IEEE Trans. Image Process. (TIP), vol. 33, pp. 738--752, 2024

    2024

  39. [47]

    Z. Chen, Y. Zhang, J. Gu, L. Kong, and X. Yang, ``Recursive generalization transformer for image super-resolution,'' in Int. Conf. Learn. Represent. (ICLR), 2024

    2024

  40. [48]

    J. Gu, H. Lu, W. Zuo, and C. Dong, ``Blind super-resolution with iterative kernel correction,'' in IEEE/CVF Conf. Comput. Vis. Pattern Recog. (CVPR), 2019, pp. 1604--1613

    2019

  41. [49]

    Huang, J

    Y. Huang, J. Li, Y. Hu, X. Gao, and H. Huang, ``Transitional learning: Exploring the transition states of degradation for blind super-resolution,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 45, no. 5, pp. 6495--6510, 2023

    2023

  42. [50]

    L. Wang, Y. Guo, Y. Wang, X. Dong, Q. Xu, J. Yang, and W. An, ``Unsupervised degradation representation learning for unpaired restoration of images and point clouds,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 47, no. 1, pp. 1--18, 2025

    2025

  43. [51]

    S. Son, J. Kim, W.-S. Lai, M.-H. Yang, and K. M. Lee, ``Toward real-world super-resolution via adaptive downsampling models,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 44, no. 11, pp. 8657--8670, 2022

    2022

  44. [52]

    Sun and Z

    W. Sun and Z. Chen, ``Learning many-to-many mapping for unpaired real-world image super-resolution and downscaling,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 46, no. 12, pp. 9874--9889, 2024

    2024

  45. [53]

    L. Fang, O. C. Au, K. Tang, and A. K. Katsaggelos, ``Antialiasing filter design for subpixel downsampling via frequency-domain analysis,'' IEEE Trans. Image Process. (TIP), vol. 21, no. 3, pp. 1391--1405, 2012

    2012

  46. [54]

    J. Kopf, A. Shamir, and P. Peers, ``Content-adaptive image downscaling,'' ACM Trans. Graph. (TOG), vol. 32, no. 6, pp. 1--8, 2013

    2013

  47. [55]

    E. S. Gastal and M. M. Oliveira, ``Spectral remapping for image downscaling,'' ACM Trans. Graph. (TOG), vol. 36, no. 4, pp. 1--16, 2017

    2017

  48. [56]

    S. Song, F. Zhong, T. Wang, X. Qin, and C. Tu, ``Guided linear upsampling,'' ACM Trans. Graph. (TOG), vol. 42, no. 4, pp. 1--12, 2023

    2023

  49. [57]

    H. Kim, M. Choi, B. Lim, and K. M. Lee, ``Task-aware image downscaling,'' in Eur. Conf. Comput. Vis. (ECCV), 2018, pp. 399--414

    2018

  50. [58]

    Sun and Z

    W. Sun and Z. Chen, ``Learned image downscaling for upscaling using content adaptive resampler,'' IEEE Trans. Image Process. (TIP), vol. 29, pp. 4027--4040, 2020

    2020

  51. [59]

    Z. Pan, B. Li, D. He, M. Yao, W. Wu, T. Lin, X. Li, and E. Ding, ``Towards bidirectional arbitrary image rescaling: Joint optimization and cycle idempotence,'' in IEEE/CVF Conf. Comput. Vis. Pattern Recog. (CVPR), 2022, pp. 17\,389--17\,398

    2022

  52. [60]

    J. Xing, W. Hu, M. Xia, and T.-T. Wong, ``Scale-arbitrary invertible image downscaling,'' IEEE Trans. Image Process. (TIP), vol. 32, pp. 4259--4274, 2023

    2023

  53. [61]

    J. Yang, M. Guo, S. Zhao, J. Li, and L. Zhang, ``Self-asymmetric invertible network for compression-aware image rescaling,'' in AAAI Conf. Artif. Intell. (AAAI), vol. 37, no. 3, 2023, pp. 3155--3163

    2023

  54. [62]

    C. Qi, X. Yang, K. L. Cheng, Y.-C. Chen, and Q. Chen, ``Real-time 6k image rescaling with rate-distortion optimization,'' in IEEE/CVF Conf. Comput. Vis. Pattern Recog. (CVPR), 2023, pp. 14\,092--14\,101

    2023

  55. [63]

    Y. Xing, Z. Qian, and Q. Chen, ``Invertible image signal processing,'' in IEEE/CVF Conf. Comput. Vis. Pattern Recog. (CVPR), 2021, pp. 6287--6296

    2021

  56. [64]

    D. A. Socolinsky and L. B. Wolff, ``Multispectral image visualization through first-order fusion,'' IEEE Trans. Image Process. (TIP), vol. 11, no. 8, pp. 923--931, 2002

    2002

  57. [65]

    M. Song, D. Tao, C. Chen, X. Li, and C. W. Chen, ``Color to gray: Visual cue preservation,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 32, no. 9, pp. 1537--1552, 2010

    2010

  58. [66]

    W. Wang, Z. Li, and S. Wu, ``Color contrast-preserving decolorization,'' IEEE Trans. Image Process. (TIP), vol. 27, no. 11, pp. 5464--5474, 2018

    2018

  59. [67]

    R. Y. Zhang, J. Y. Zhu, P. Isola, X. Geng, A. S. Lin, T. Yu, and A. A. Efros, ``Real-time user-guided image colorization with learned deep priors,'' ACM Trans. Graph. (TOG), vol. 36, no. 4, p. 119, 2017

    2017

  60. [68]

    Y. Yang, J. Pan, Z. Peng, X. Du, Z. Tao, and J. Tang, ``Bistnet: Semantic image prior guided bidirectional temporal feature fusion for deep exemplar-based video colorization,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 46, no. 8, pp. 5612--5624, 2024

    2024

  61. [69]

    Ouyang, T

    H. Ouyang, T. Wang, and Q. Chen, ``Restorable image operators with quasi-invertible networks,'' in AAAI Conf. Artif. Intell. (AAAI), vol. 36, no. 2, 2022, pp. 2008--2016

    2022

  62. [70]

    Z. Wang, K. Xu, K. Ding, Q. Jiang, Y. Zuo, Z. Ni, and Y. Fang, ``Cd-inet: Deep invertible network for perceptual image color difference measurement,'' Int. J. Comput. Vis. (IJCV), vol. 132, pp. 5983--–6003, 2024

    2024

  63. [71]

    Huang, Z

    G. Huang, Z. Liu, L. Van Der Maaten, and K. Q. Weinberger, ``Densely connected convolutional networks,'' in IEEE/CVF Conf. Comput. Vis. Pattern Recog. (CVPR), 2017, pp. 4700--4708

    2017

  64. [72]

    Agustsson and R

    E. Agustsson and R. Timofte, ``Ntire 2017 challenge on single image super-resolution: Dataset and study,'' in IEEE/CVF Conf. Comput. Vis. Pattern Recog. Worksh., 2017, pp. 126--135

    2017

  65. [73]

    T.-Y. Lin, M. Maire, S. Belongie, J. Hays, P. Perona, D. Ramanan, P. Doll \'a r, and C. L. Zitnick, ``Microsoft coco: Common objects in context,'' in Eur. Conf. Comput. Vis. (ECCV), 2014, pp. 740--755

    2014

  66. [74]

    Russakovsky, J

    O. Russakovsky, J. Deng, H. Su, J. Krause, S. Satheesh, S. Ma, Z. Huang, A. Karpathy, A. Khosla, M. Bernstein, A. C. Berg, and L. Fei-Fei, `` ImageNet Large Scale Visual Recognition Challenge ,'' Int. J. Comput. Vis. (IJCV), vol. 115, no. 3, pp. 211--252, 2015

    2015

  67. [75]

    Bevilacqua, A

    M. Bevilacqua, A. Roumy, C. Guillemot, and M.-L. A. Morel, ``Low-complexity single-image super-resolution based on nonnegative neighbor embedding,'' in Brit. Mach. Vis. Conf. (BMVC), 2012

    2012

  68. [76]

    Zeyde, M

    R. Zeyde, M. Elad, and M. Protter, ``On single image scale-up using sparse-representations,'' in Curves and Surfaces, 2010, pp. 711--730

    2010

  69. [77]

    Arbel \' a ez, M

    P. Arbel \' a ez, M. Maire, C. C. Fowlkes, and J. Malik, ``Contour detection and hierarchical image segmentation,'' IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI), vol. 33, no. 5, pp. 898--916, 2011

    2011

  70. [78]

    Huang, A

    J.-B. Huang, A. Singh, and N. Ahuja, ``Single image super-resolution from transformed self-exemplars,'' in IEEE/CVF Conf. Comput. Vis. Pattern Recog. (CVPR), 2015, pp. 5197--5206

    2015

  71. [79]

    Franzen, ``Kodak lossless true color image suite,'' 1999

    R. Franzen, ``Kodak lossless true color image suite,'' 1999. [Online]. Available: https://r0k.us/graphics/kodak

    1999

  72. [80]

    Loshchilov and F

    I. Loshchilov and F. Hutter, ``Decoupled weight decay regularization,'' in Int. Conf. Learn. Represent. (ICLR), 2019

    2019

  73. [81]

    Loshchilov and F

    I. Loshchilov and F. Hutter, ``Sgdr: Stochastic gradient descent with warm restarts,'' in Int. Conf. Learn. Represent. (ICLR), 2017

    2017

Pith tools

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