English
Related papers

Related papers: Blind Deconvolutional Phase Retrieval via Convex P…

200 papers

The task of finding a sparse signal decomposition in an overcomplete dictionary is made more complicated when the signal undergoes an unknown modulation (or convolution in the complementary Fourier domain). Such simultaneous sparse recovery…

Information Theory · Computer Science 2019-10-02 Youye Xie , Michael B. Wakin , Gongguo Tang

We propose an information-theoretic framework for phase retrieval. Specifically, we consider the problem of recovering an unknown n-dimensional vector x up to an overall sign factor from m=Rn phaseless measurements with compression rate R…

Information Theory · Computer Science 2015-04-23 Erwin Riegler , Georg Tauböck

PhaseLift is a noted convex optimization technique for phase retrieval that can recover a signal exactly from amplitude measurements only, with high probability. Conventional PhaseLift requires a relatively large number of samples that…

Signal Processing · Electrical Eng. & Systems 2022-04-27 Zhe Zhang , Zhi Tian

Image blur and image noise are imaging artifacts intrinsically arising in image acquisition. In this paper, we consider multi-frame blind deconvolution (MFBD), where image blur is described by the convolution of an unobservable,…

Computer Vision and Pattern Recognition · Computer Science 2022-10-04 Leonid Kostrykin , Stefan Harmeling

This paper investigates the convergence of the randomized Kaczmarz algorithm for the problem of phase retrieval of complex-valued objects. While this algorithm has been studied for the real-valued case}, its generalization to the…

Information Theory · Computer Science 2020-10-14 Teng Zhang , Feng Yu

Phase retrieval deals with the recovery of complex- or real-valued signals from magnitude measurements. As shown recently, the method PhaseMax enables phase retrieval via convex optimization and without lifting the problem to a higher…

Information Theory · Computer Science 2018-02-02 Ramina Ghods , Andrew S. Lan , Tom Goldstein , Christoph Studer

We study a mixed integer linear program with m integer variables and k non-negative continuous variables in the form of the relaxation of the corner polyhedron that was introduced by Andersen, Louveaux, Weismantel and Wolsey [Inequalities…

Optimization and Control · Mathematics 2011-07-27 Amitabh Basu , Robert Hildebrand , Matthias Köppe

This paper considers the problem of solving systems of quadratic equations, namely, recovering an object of interest $\mathbf{x}^{\natural}\in\mathbb{R}^{n}$ from $m$ quadratic equations/samples…

Machine Learning · Statistics 2019-06-13 Yuxin Chen , Yuejie Chi , Jianqing Fan , Cong Ma

We study information theoretic limits of recovering an unknown $n$ dimensional, complex signal vector $\mathbf{x}_\star$ with unit norm from $m$ magnitude-only measurements of the form $y_i = |(\mathbf{A} \mathbf{x}_\star)_i|^2, \; i = 1,2…

Statistics Theory · Mathematics 2020-08-05 Rishabh Dudeja , Junjie Ma , Arian Maleki

In this paper, we address the problem of recovering point sources from two dimensional low-pass measurements, which is known as super-resolution problem. This is the fundamental concern of many applications such as electronic imaging,…

Information Theory · Computer Science 2019-05-17 Iman Valiulahi , Sajad Daei , Farzan Haddadi , Farzad Parvaresh

Demixing refers to the challenge of identifying two structured signals given only the sum of the two signals and prior information about their structures. Examples include the problem of separating a signal that is sparse with respect to…

Information Theory · Computer Science 2015-03-20 Michael B. McCoy , Joel A. Tropp

This paper addresses the challenging and interesting inverse problem of reconstructing the spatially varying dielectric constant of a medium from phaseless backscattering measurements generated by single-point illumination. The underlying…

Numerical Analysis · Mathematics 2025-06-30 Thuy T. Le , Phuong M. Nguyen , Loc H. Nguyen

We consider the problem of high-dimensional misspecified phase retrieval. This is where we have an $s$-sparse signal vector $\mathbf{x}_*$ in $\mathbb{R}^n$, which we wish to recover using sampling vectors…

Information Theory · Computer Science 2017-12-14 Yan Shuo Tan

In this article, two closed and convex sets for blind deconvolution problem are proposed. Most blurring functions in microscopy are symmetric with respect to the origin. Therefore, they do not modify the phase of the Fourier transform (FT)…

Optimization and Control · Mathematics 2016-04-20 Mohammad Tofighi , Onur Yorulmaz , A. Enis Cetin

A fruitful approach for solving signal deconvolution problems consists of resorting to a frame-based convex variational formulation. In this context, parallel proximal algorithms and related alternating direction methods of multipliers have…

Other Computer Science · Computer Science 2015-05-28 Nelly Pustelnik , Jean-Christophe Pesquet , Caroline Chaux

This note formulates a deterministic recovery result for vectors $x$ from quadratic measurements of the form $(Ax)_i \overline{(Ax)_j}$ for some left-invertible $A$. Recovery is exact, or stable in the noisy case, when the couples $(i,j)$…

Numerical Analysis · Mathematics 2018-01-16 Laurent Demanet , Vincent Jugnon

This paper considers the problem of recovering an unknown sparse p\times p matrix X from an m\times m matrix Y=AXB^T, where A and B are known m \times p matrices with m << p. The main result shows that there exist constructions of the…

Information Theory · Computer Science 2013-03-27 Gautam Dasarathy , Parikshit Shah , Badri Narayan Bhaskar , Robert Nowak

We consider the problem of reconstructing a signal from under-determined modulo observations (or measurements). This observation model is inspired by a (relatively) less well-known imaging mechanism called modulo imaging, which can be used…

Machine Learning · Statistics 2019-07-18 Viraj Shah , Chinmay Hegde

In this paper, we consider compressive/sparse affine phase retrieval proposed in [B. Gao B, Q. Sun, Y. Wang and Z. Xu, Adv. in Appl. Math., 93(2018), 121-141]. By the lift technique, and heuristic nuclear norm for convex relaxation of rank…

Optimization and Control · Mathematics 2018-09-24 Wengu Chen , Peng Li , Qiyu Sun

In compressed sensing the goal is to recover a signal from as few as possible noisy, linear measurements. The general assumption is that the signal has only a few non-zero entries. The recovery can be performed by multiple different…

Information Theory · Computer Science 2020-10-07 Hendrik Bernd Petersen , Bubacarr Bah , Peter Jung