paper-with-me

Papers

Basis Pursuit Denoise with Nonsmooth Constraints

2018-11-28 · Robert Baraldi, Rajiv Kumar, Aleksandr Aravkin

Level-set optimization formulations with data-driven constraints minimize a regularization functional subject to matching observations to a given error level. These formulations are widely used, particularly for matrix completion and sparsity promotion in data interpolation and denoising. The misfit level is typically measured in the l2 norm, or other smooth metrics. In this paper, we present a new flexible algorithmic framework that targets nonsmooth level-set constraints, including L1, Linf, and even L0 norms. These constraints give greater flexibility for modeling deviations in observation and denoising, and have significant impact on the solution. Measuring error in the L1 and L0 norms makes the result more robust to large outliers, while matching many observations exactly. We demonstrate the approach for basis pursuit denoise (BPDN) problems as well as for extensions of BPDN to matrix factorization, with applications to interpolation and denoising of 5D seismic data. The new methods are particularly promising for seismic applications, where the amplitude in the data varies significantly, and measurement noise in low-amplitude regions can wreak havoc for standard Gaussian error models.

📄 PDF Abstract BibTeX arXiv:1811.11633

Code (0)

등록된 구현이 없습니다.

Tasks

DenoisingMatrix Completion

Similar Papers 제목 키워드 기반

Unsupervised Deep Basis Pursuit: Learning inverse problems without ground-truth data

2020-02-14 · NeurIPS Workshop Deep_Invers 2019 12

Basis pursuit is a compressed sensing optimization in which the l1-norm is minimized subject to model error constraints. Here we use a deep neural network prior instead of l1-regularization. Using known noise statistics,…

compressed sensing

Solving Large Scale Quadratic Constrained Basis Pursuit

2021-04-02 · Jirong Yi

Inspired by alternating direction method of multipliers and the idea of operator splitting, we propose a efficient algorithm for solving large-scale quadratically constrained basis pursuit. Experimental results show that…

Balancing Sparsity and Rank Constraints in Quadratic Basis Pursuit

2014-03-17 · Cagdas Bilen, Gilles Puy, Rémi Gribonval, Laurent Daudet

We investigate the methods that simultaneously enforce sparsity and low-rank structure in a matrix as often employed for sparse phase retrieval problems or phase calibration problems in compressive sensing. We propose a …

Compressive SensingRetrieval

Sparse Representation and Non-Negative Matrix Factorization for image denoise

2018-07-05 · R. M. Farouk, M. E. Abd El-aziz, A. M. Adam

Recently, the problem of blind image separation has been widely investigated, especially the medical image denoise which is the main step in medical diag-nosis. Removing the noise without affecting relevant features of t…

DenoisingDictionary LearningImage Denoising

Handling Disjunctions in Signal Temporal Logic Based Control Through Nonsmooth Barrier Functions

2022-08-23 · Adrian Wiltz, Dimos V. Dimarogonas

For a class of spatio-temporal tasks defined by a fragment of Signal Temporal Logic (STL), we construct a nonsmooth time-varying control barrier function (CBF) and develop a controller based on a set of simple optimizati…