paper-with-me

Papers

Convex Latent-Optimized Adversarial Regularizers for Imaging Inverse Problems

2023-09-17 · Huayu Wang, Chen Luo, Taofeng Xie, Qiyu Jin, Guoqing Chen, Zhuo-Xu Cui, Dong Liang

Recently, data-driven techniques have demonstrated remarkable effectiveness in addressing challenges related to MR imaging inverse problems. However, these methods still exhibit certain limitations in terms of interpretability and robustness. In response, we introduce Convex Latent-Optimized Adversarial Regularizers (CLEAR), a novel and interpretable data-driven paradigm. CLEAR represents a fusion of deep learning (DL) and variational regularization. Specifically, we employ a latent optimization technique to adversarially train an input convex neural network, and its set of minima can fully represent the real data manifold. We utilize it as a convex regularizer to formulate a CLEAR-informed variational regularization model that guides the solution of the imaging inverse problem on the real data manifold. Leveraging its inherent convexity, we have established the convergence of the projected subgradient descent algorithm for the CLEAR-informed regularization model. This convergence guarantees the attainment of a unique solution to the imaging inverse problem, subject to certain assumptions. Furthermore, we have demonstrated the robustness of our CLEAR-informed model, explicitly showcasing its capacity to achieve stable reconstruction even in the presence of measurement interference. Finally, we illustrate the superiority of our approach using MRI reconstruction as an example. Our method consistently outperforms conventional data-driven techniques and traditional regularization approaches, excelling in both reconstruction quality and robustness.

📄 PDF Abstract BibTeX arXiv:2309.09250

Code (0)

등록된 구현이 없습니다.

Tasks

MRI Reconstruction

Similar Papers 제목 키워드 기반

Learning convex regularizers satisfying the variational source condition for inverse problems

2021-10-24 · NeurIPS Workshop Deep_Invers 2021 12 · Subhadip Mukherjee, Carola-Bibiane Schönlieb, Martin Burger

Variational regularization has remained one of the most successful approaches for reconstruction in imaging inverse problems for several decades. With the emergence and astonishing success of deep learning in recent year…

Improving the Tightness of Convex Relaxation Bounds for Training Certifiably Robust Classifiers

2020-02-22 · Chen Zhu, Renkun Ni, Ping-Yeh Chiang, Hengduo Li 외

Convex relaxations are effective for training and certifying neural networks against norm-bounded adversarial attacks, but they leave a large gap between certifiable and empirical robustness. In principle, convex relaxat…

Implicit Convex Regularizers of CNN Architectures: Convex Optimization of Two- and Three-Layer Networks in Polynomial Time

2020-06-26 · ICLR 2021 1 · Tolga Ergen, Mert Pilanci

We study training of Convolutional Neural Networks (CNNs) with ReLU activations and introduce exact convex optimization formulations with a polynomial complexity with respect to the number of data samples, the number of …

Robust Optimization over Multiple Domains

2018-05-19 · Qi Qian, Shenghuo Zhu, Jiasheng Tang, Rong Jin 외

In this work, we study the problem of learning a single model for multiple domains. Unlike the conventional machine learning scenario where each domain can have the corresponding model, multiple domains (i.e., applicatio…

BIG-bench Machine LearningCloud ComputingFine-Grained Visual Categorization

Estimating Sparse Signals with Smooth Support via Convex Programming and Block Sparsity

2016-05-06 · CVPR 2016 6 · Sohil Shah, Tom Goldstein, Christoph Studer

Conventional algorithms for sparse signal recovery and sparse representation rely on $l_1$-norm regularized variational methods. However, when applied to the reconstruction of $\textit{sparse images}$, i.e., images where…

Image Restoration