An Over Complete Deep Learning Method for Inverse Problems

Moshe Eliasof, Eldad Haber, Eran Treister
2/7/2024
cs.LGcs.CV

No confident code implementation found for this paper.

Abstract

Obtaining meaningful solutions for inverse problems has been a major challenge with many applications in science and engineering. Recent machine learning techniques based on proximal and diffusion-based methods have shown promising results. However, as we show in this work, they can also face challenges when applied to some exemplary problems. We show that similar to previous works on over-complete dictionaries, it is possible to overcome these shortcomings by embedding the solution into higher dimensions. The novelty of the work proposed is that we jointly design and learn the embedding and the regularizer for the embedding vector. We demonstrate the merit of this approach on several exemplary and common inverse problems.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{eliasof2024over,
  title  = {An Over Complete Deep Learning Method for Inverse Problems},
  author = {Moshe Eliasof and Eldad Haber and Eran Treister},
  year   = {2024},
  eprint = {2402.04653},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.04653v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.04653.svg)](https://codeofpaper.com/paper/2402.04653)

Discussion