paper-with-me

Papers

Solve Mismatch Problem in Compressed Sensing

2024-10-15 · Le Yang

This article proposes a novel algorithm for solving mismatch problem in compressed sensing. Its core is to transform mismatch problem into matched by constructing a new measurement matrix to match measurement value under unknown measurement matrix. Therefore, we propose mismatch equation and establish two types of algorithm based on it, which are matched solution of unknown measurement matrix and calibration of unknown measurement matrix. Experiments have shown that when under low gaussian noise levels, the constructed measurement matrix can transform the mismatch problem into matched and recover original images. The code is available: https://github.com/yanglebupt/mismatch-solution

📄 PDF Abstract BibTeX arXiv:2410.22354

Code (1)

yanglebupt/mismatch-solution 공식 구현 pytorch

Tasks

compressed sensing

Similar Papers 제목 키워드 기반

Active Learning for Conditional Generative Compressed Sensing

2026-05-06 · Alexander DeLise, Nick Dexter arxiv

Generative compressed sensing uses the range of a pretrained generator as a nonlinear model for recovering structured signals from limited measurements. We study a conditional version of this problem for image recovery f…

Active Learning

Info-Greedy sequential adaptive compressed sensing

2014-07-02 · Gabor Braun, Sebastian Pokutta, Yao Xie

We present an information-theoretic framework for sequential adaptive compressed sensing, Info-Greedy Sensing, where measurements are chosen to maximize the extracted information conditioned on the previous measurements.…

compressed sensing

Optimization for Compressed Sensing: the Simplex Method and Kronecker Sparsification

2013-12-16 · Robert Vanderbei, Han Liu, Lie Wang, Kevin Lin

In this paper we present two new approaches to efficiently solve large-scale compressed sensing problems. These two ideas are independent of each other and can therefore be used either separately or together. We consider…

compressed sensing

A sparse Kaczmarz solver and a linearized Bregman method for online compressed sensing

2014-03-28 · Dirk A. Lorenz, Stephan Wenger, Frank Schöpfer, Marcus Magnor

An algorithmic framework to compute sparse or minimal-TV solutions of linear systems is proposed. The framework includes both the Kaczmarz method and the linearized Bregman method as special cases and also several new me…

compressed sensingRadio Interferometry

Verified Neural Compressed Sensing

2024-05-07 · Rudy Bunel, Krishnamurthy Dvijotham, M. Pawan Kumar, Alessandro De Palma 외

We develop the first (to the best of our knowledge) provably correct neural networks for a precise computational task, with the proof of correctness generated by an automated verification algorithm without any human inpu…

compressed sensing