English
Related papers

Related papers: Convex Optimization Approaches for Blind Sensor Ca…

200 papers

We consider the problem of calibrating a compressed sensing measurement system under the assumption that the decalibration consists in unknown gains on each measure. We focus on {\em blind} calibration, using measures performed on a few…

Statistics Theory · Mathematics 2011-12-01 Rémi Gribonval , Gilles Chardon , Laurent Daudet

The implementation of computational sensing strategies often faces calibration problems typically solved by means of multiple, accurately chosen training signals, an approach that can be resource-consuming and cumbersome. Conversely, blind…

Information Theory · Computer Science 2017-02-17 Valerio Cambareri , Laurent Jacques

Computational sensing strategies often suffer from calibration errors in the physical implementation of their ideal sensing models. Such uncertainties are typically addressed by using multiple, accurately chosen training signals to recover…

Information Theory · Computer Science 2022-05-26 Valerio Cambareri , Laurent Jacques

We address the problem of blind gain and phase calibration of a sensor array from ambient noise. The key motivation is to ease the calibration process by avoiding a complex procedure setup. We show that computing the sample covariance…

Instrumentation and Detectors · Physics 2023-03-22 Charles Vanwynsberghe , Simon Bouley , Jérôme Antoni

In this work we address the problem of blindly reconstructing compressively sensed signals by exploiting the co-sparse analysis model. In the analysis model it is assumed that a signal multiplied by an analysis operator results in a sparse…

Information Theory · Computer Science 2013-03-27 Julian Wörmann , Simon Hawe , Martin Kleinsteuber

Compressed sensing (CS) is a concept that allows to acquire compressible signals with a small number of measurements. As such it is very attractive for hardware implementations. Therefore, correct calibration of the hardware is a central…

Information Theory · Computer Science 2015-04-30 Christophe Schülke , Francesco Caltagirone , Florent Krzakala , Lenka Zdeborová

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

The realisation of sensing modalities based on the principles of compressed sensing is often hindered by discrepancies between the mathematical model of its sensing operator, which is necessary during signal recovery, and its actual…

Information Theory · Computer Science 2018-02-21 Valerio Cambareri , Amirafshar Moshtaghpour , Laurent Jacques

The fundamental principle underlying compressed sensing is that a signal, which is sparse under some basis representation, can be recovered from a small number of linear measurements. However, prior knowledge of the sparsity basis is…

Information Theory · Computer Science 2010-04-29 Sivan Gleichman , Yonina C. Eldar

Blind gain and phase calibration (BGPC) is a bilinear inverse problem involving the determination of unknown gains and phases of the sensing system, and the unknown signal, jointly. BGPC arises in numerous applications, e.g., blind albedo…

Information Theory · Computer Science 2017-12-04 Yanjun Li , Kiryung Lee , Yoram Bresler

The design of high-precision sensing devises becomes ever more difficult and expensive. At the same time, the need for precise calibration of these devices (ranging from tiny sensors to space telescopes) manifests itself as a major…

Information Theory · Computer Science 2015-10-28 Shuyang Ling , Thomas Strohmer

We study an auto-calibration problem in which a transform-sparse signal is acquired via compressive sensing by multiple sensors in parallel, but with unknown calibration parameters of the sensors. This inverse problem has an important…

Optimization and Control · Mathematics 2025-10-29 Yuan Ni , Thomas Strohmer

In this manuscript, we analyze the sparse signal recovery (compressive sensing) problem from the perspective of convex optimization by stochastic proximal gradient descent. This view allows us to significantly simplify the recovery analysis…

Data Structures and Algorithms · Computer Science 2013-04-19 Rong Jin , Tianbao Yang , Shenghuo Zhu

Non-convex constraints have recently proven a valuable tool in many optimisation problems. In particular sparsity constraints have had a significant impact on sampling theory, where they are used in Compressed Sensing and allow structured…

Information Theory · Computer Science 2012-05-09 Thomas Blumensath

Natural signals and images are well-known to be approximately sparse in transform domains such as Wavelets and DCT. This property has been heavily exploited in various applications in image processing and medical imaging. Compressed sensing…

Machine Learning · Computer Science 2015-10-26 Saiprasad Ravishankar , Yoram Bresler

The success of the compressed sensing paradigm has shown that a substantial reduction in sampling and storage complexity can be achieved in certain linear and non-adaptive estimation problems. It is therefore an advisable strategy for…

Information Theory · Computer Science 2014-08-27 Peter Jung , Philipp Walk

Compressed sensing (CS) shows that a signal having a sparse or compressible representation can be recovered from a small set of linear measurements. In classical CS theory, the sampling matrix and representation matrix are assumed to be…

Information Theory · Computer Science 2015-07-03 Yipeng Liu

Blind gain and phase calibration (BGPC) is a structured bilinear inverse problem, which arises in many applications, including inverse rendering in computational relighting (albedo estimation with unknown lighting), blind phase and gain…

Information Theory · Computer Science 2016-11-03 Yanjun Li , Kiryung Lee , Yoram Bresler

In the theory of compressed sensing (CS), the sparsity $\|x\|_0$ of the unknown signal $\mathbf{x} \in \mathcal{R}^n$ is of prime importance and the focus of reconstruction algorithms has mainly been either $\|x\|_0$ or its convex…

Information Theory · Computer Science 2016-05-17 Mithun Das Gupta

Phase retrieval aims at reconstructing unknown signals from magnitude measurements of linear mixtures. In this paper, we consider the phase retrieval with dictionary learning problem, which includes an additional prior information that the…

Signal Processing · Electrical Eng. & Systems 2023-01-24 Tianyi Liu , Andreas M. Tillmann , Yang Yang , Yonina C. Eldar , Marius Pesavento
‹ Prev 1 2 3 10 Next ›