English
Related papers

Related papers: A Fixed Point Framework for Recovering Signals fro…

200 papers

We discuss an approach to signal recovery in Generalized Linear Models (GLM) in which the signal estimation problem is reduced to the problem of solving a stochastic monotone variational inequality (VI). The solution to the stochastic VI…

Statistics Theory · Mathematics 2019-03-19 Anatoli Juditsky , Arkadi Nemirovski

Constrained quasiconvex optimization problems appear in many fields, such as economics, engineering, and management science. In particular, fractional programming, which models ratio indicators such as the profit/cost ratio as fractional…

Optimization and Control · Mathematics 2019-09-02 Kazuhiro Hishinuma , Hideaki Iiduka

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 only a few pixels…

Computer Vision and Pattern Recognition · Computer Science 2016-05-09 Sohil Shah , Tom Goldstein , Christoph Studer

Many problems in nonlinear analysis and optimization, among them variational inequalities and minimization of convex functions, can be reduced to finding zeros (namely, roots) of set-valued operators. Hence numerous algorithms have been…

Optimization and Control · Mathematics 2018-10-23 Daniel Reem , Simeon Reich

We address the problem of simultaneously recovering a sequence of point source signals from observations limited to the low-frequency end of the spectrum of their summed convolution, where the point spread functions (PSFs) are unknown. By…

Information Theory · Computer Science 2024-07-16 Jinchi Chen

The goal of compressed sensing is to reconstruct a sparse signal under a few linear measurements far less than the dimension of the ambient space of the signal. However, many real-life applications in physics and biomedical sciences carry…

Optimization and Control · Mathematics 2017-08-29 Angang Cui , Jigen Peng , Haiyang Li

This paper considers the fixed point problem for a nonexpansive mapping on a real Hilbert space and proposes novel line search fixed point algorithms to accelerate the search. The termination conditions for the line search are based on the…

Optimization and Control · Mathematics 2015-09-21 Hideaki Iiduka

This paper develops a novel framework for phase retrieval, a problem which arises in X-ray crystallography, diffraction imaging, astronomical imaging and many other applications. Our approach combines multiple structured illuminations…

Information Theory · Computer Science 2011-09-21 Emmanuel J. Candes , Yonina Eldar , Thomas Strohmer , Vlad Voroninski

We study unconstrained optimization problems with nonsmooth and convex objective function in the form of a mathematical expectation. The proposed method approximates the expected objective function with a sample average function using…

Optimization and Control · Mathematics 2022-11-03 Natasa Krejic , Natasa Krklec Jerinkic , Tijana Ostojic

Constrained non-convex optimization problems frequently arise in control applications. Solving such problems is inherently challenging, as existing methods often converge to suboptimal local minima or incur prohibitive computational costs.…

Optimization and Control · Mathematics 2026-01-27 Anran Li , John P. Swensen , Mehdi Hosseinzadeh

We study the problem of reconstructing a signal from its projection on a subspace. The proposed signal reconstruction algorithms utilize a guiding subspace that represents desired properties of reconstructed signals. We show that optimal…

Information Theory · Computer Science 2016-06-13 Akshay Gadde , Andrew Knyazev , Dong Tian , Hassan Mansour

We address the problem of recovering a sparse signal from clipped or quantized measurements. We show how these two problems can be formulated as minimizing the distance to a convex feasibility set, which provides a convex and differentiable…

Signal Processing · Electrical Eng. & Systems 2018-12-05 Lucas Rencker , Francis Bach , Wenwu Wang , Mark D. Plumbley

Subsampled blind deconvolution is the recovery of two unknown signals from samples of their convolution. To overcome the ill-posedness of this problem, solutions based on priors tailored to specific application have been developed in…

Information Theory · Computer Science 2015-11-23 Kiryung Lee , Yanjun Li , Marius Junge , Yoram Bresler

Neural networks allow solving many ill-posed inverse problems with unprecedented performance. Physics informed approaches already progressively replace carefully hand-crafted reconstruction algorithms in real applications. However, these…

Machine Learning · Computer Science 2023-12-19 Alban Gossard , Pierre Weiss

We discuss the possibility to learn a data-driven explicit model correction for inverse problems and whether such a model correction can be used within a variational framework to obtain regularised reconstructions. This paper discusses the…

Numerical Analysis · Mathematics 2020-10-22 Sebastian Lunz , Andreas Hauptmann , Tanja Tarvainen , Carola-Bibiane Schönlieb , Simon Arridge

Non-stationary blind super-resolution is an extension of the traditional super-resolution problem, which deals with the problem of recovering fine details from coarse measurements. The non-stationary blind super-resolution problem appears…

Information Theory · Computer Science 2019-10-09 Shuang Li , Michael B. Wakin , Gongguo Tang

In many applications sampled data are collected in irregular fashion or are partly lost or unavailable. In these cases it is required to convert irregularly sampled signals to regularly sampled ones or to restore missing data. In this…

This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible. Computational imaging, especially non-line-of-sight (NLOS) imaging, the…

Computer Vision and Pattern Recognition · Computer Science 2026-04-01 Lianfang Wang , Kuilin Qin , Xueying Liu , Huibin Chang , Yong Wang , Yuping Duan

This paper proposes and analyzes a communication-efficient distributed optimization framework for general nonconvex nonsmooth signal processing and machine learning problems under an asynchronous protocol. At each iteration, worker machines…

Optimization and Control · Mathematics 2020-07-15 Jineng Ren , Jarvis Haupt

Sign information is the key to overcoming the inevitable saturation error in compressive sensing systems, which causes information loss and results in bias. For sparse signal recovery from saturation, we propose to use a linear loss to…

Information Theory · Computer Science 2021-02-02 Fan He , Xiaolin Huang , Yipeng Liu , Ming Yan
‹ Prev 1 4 5 6 7 8 10 Next ›