Papers
Topics
Authors
Recent
Search
2000 character limit reached

Plug-and-play superiorization

Published 30 Oct 2024 in math.OC and physics.med-ph | (2410.23401v2)

Abstract: The superiorization methodology (SM) is an optimization heuristic in which an iterative algorithm, which aims to solve a particular problem, is ``superiorized'' to promote solutions that are improved with respect to some secondary criterion. This superiorization is achieved by perturbing iterates of the algorithm in nonascending directions of a prescribed function that penalizes undesirable characteristics in the solution; the solution produced by the superiorized algorithm should therefore be improved with respect to the value of this function. In this paper, we broaden the SM to allow for the perturbations to be introduced by an arbitrary procedure instead, using a plug-and-play approach. This allows for operations such as image denoisers or deep neural networks, which have applications to a broad class of problems, to be incorporated within the superiorization methodology. As proof of concept, we perform numerical simulations involving low-dose and sparse-view computed tomography image reconstruction, comparing the plug-and-play approach to two conventionally superiorized algorithms, as well as a post-processing approach. The plug-and-play approach provides comparable or better image quality in most cases, while also providing advantages in terms of computing time, and data fidelity of the solutions.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. Solving ill-posed inverse problems using iterative deep neural networks, Inverse Problems 33(12): 124007.
  2. Simultaneous algebraic reconstruction technique (sart): a superior implementation of the art algorithm, Ultrasonic imaging 6(1): 81–94.
  3. The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning, Applied Mathematics and Computation 440: 127627. \harvardurlhttps://www.sciencedirect.com/science/article/pii/S0096300322007007
  4. Iterative reconstruction methods in x-ray ct, Physica medica 28(2): 94–108.
  5. \harvarditemCensor2017c17 Censor, Y. \harvardyearleft2017\harvardyearright. Can linear superiorization be useful for linear optimization problems?, Inverse Probl. 33: 1.
  6. \harvarditemCensor2024CensorSupPage Censor, Y. \harvardyearleft2024\harvardyearright. Superiorization and perturbation resilience of algorithms: A bibliography compiled and continuously updated. \harvardurlhttp://math.haifa.ac.il/YAIR/bib-superiorization-censor.html
  7. Perturbation resilience and superiorization of iterative algorithms, Inverse Problems 26(6): 065008. \harvardurlhttps://doi.org/10.1088/0266-5611/26/6/065008
  8. Projected subgradient minimization versus superiorization, J Optim. Theory Appl. 160(646): 730–747.
  9. Block-iterative algorithms with diagonally scaled oblique projections for the linear feasibility problem, SIAM Journal on Matrix Analysis and Applications 24(1): 40–58.
  10. Superiorization: theory and applications, Inverse Problems 33(4): 040301. \harvardurlhttps://doi.org/10.1088/1361-6420/aa5deb
  11. Strict fejér monotonicity by superiorization of feasibility-seeking projection methods, Journal of Optimization Theory and Applications 165: 172–187.
  12. Plug-and-play admm for image restoration: Fixed-point convergence and applications, IEEE Transactions on Computational Imaging 3: 84–98.
  13. One network to solve them all – solving linear inverse problems using deep projection models., ICCV, pp. 5889–5898.
  14. Learn: Learned experts’ assessment-based reconstruction network for sparse-data ct, IEEE transactions on medical imaging 37(6): 1333–1347.
  15. \harvarditemClark et al.2013TCIA Clark, K. et al. \harvardyearleft2013\harvardyearright. The cancer imaging archive (TCIA): maintaining and operating a public information repository, Journal of digital imaging 26(6): 1045–1057.
  16. Image denoising by sparse 3-d transform-domain collaborative filtering, IEEE Transactions on image processing 16(8): 2080–2095.
  17. Feasibility-seeking 652 and superiorization algorithms applied to inverse treatment planning in radiation therapy, Contemp Math. 636: 83–92.
  18. Semiconvergence and relaxation parameters for projected sirt algorithms, SIAM Journal on Scientific Computing 34(4): A2000–A2017.
  19. Editorial: A special issue focused on superiorization versus constrained optimization: analysis and applications, Journal of Applied and Numerical Optimization 2(1): 1–2. \harvardurlhttps://doi.org/10.23952/jano.2.2020.1.01
  20. Data from QIN_LUNG_CT. The Cancer Imaging Archive. \harvardurlhttp://doi.org/10.7937/K9/TCIA.2015.NPGZYZBZ
  21. Superiorization versus regularization: A comparison of algorithms for solving image reconstruction problems with applications in computed tomography, Med Phys. 49: 1065–1082.
  22. Cnn-based projected gradient descent for consistent ct image reconstruction, IEEE transactions on medical imaging 37(6): 1440–1453.
  23. Framing u-net via deep convolutional framelets: Application to sparse-view CT, IEEE Trans. Med. Imag. 37(6): 1418–1429.
  24. Optimizing a parameterized plug-and-play admm for iterative low-dose ct reconstruction, IEEE transactions on medical imaging 38(2): 371–382.
  25. Superiorization: An optimization heuristic for medical physics, Medical Physics 39: 5532–5546.
  26. Comparison of regularized and superiorized methods for tomographic image reconstruction, J. Appl. Numer. Optim 2(1): 77–99.
  27. Comparison of deep learning approaches to low dose ct using low intensity and sparse view data, Medical Imaging 2019: Physics of Medical Imaging, Vol. 10948, International Society for Optics and Photonics, p. 109484A.
  28. Superiorized algorithm for reconstruction of ct images from sparse-view and limited-angle polyenergetic data, Physics in Medicine & Biology 62(16): 6762. \harvardurlhttps://dx.doi.org/10.1088/1361-6560/aa7c2d
  29. Superiorization-inspired unrolled SART algorithm with u-net generated perturbations for sparse-view and limited-angle CT reconstruction, Physics in Medicine & Biology 67(24): 245004. \harvardurlhttps://dx.doi.org/10.1088/1361-6560/aca513
  30. A heuristic superiorization-like approach to bioluminescence, International Federation for Medical and Biological Engineering (IFMBE) Proceedings 39: 1026–1029.
  31. Learning to reconstruct computed tomography images directly from sinogram data under a variety of data acquisition conditions, IEEE transactions on medical imaging 38(10): 2469–2481.
  32. Collaborative filtering of correlated noise: Exact transform-domain variance for improved shrinkage and patch matching, IEEE Transactions on Image Processing 29: 8339–8354.
  33. Performance improvements for iterative electron tomography reconstruction using graphics processing units (GPUs), Journal of structural biology 176(2): 250–253.
  34. Fast and flexible x-ray tomography using the ASTRA toolbox, Optics express 24(22): 25129–25147.
  35. Plug-and-play priors for model based reconstruction, 2013 IEEE Global Conference on Signal and Information Processing, IEEE, pp. 945–948.
  36. Image quality assessment: from error visibility to structural similarity, IEEE transactions on image processing 13(4): 600–612.
  37. Beyond a gaussian denoiser: Residual learning of deep cnn for image denoising, IEEE Transactions on Image Processing 26(7): 3142–3155.
  38. A sparse-view CT reconstruction method based on combination of DenseNet and deconvolution, IEEE transactions on medical imaging 37(6): 1407–1417.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.