English
Related papers

Related papers: Nonlinear frames and sparse reconstructions in Ban…

200 papers

This paper studies several aspects of signal reconstruction of sampled data in spaces of bandlimited functions. In the first part, signal spaces are characterized in which the classical sampling series uniformly converge, and we investigate…

Information Theory · Computer Science 2014-10-23 Holger Boche , Volker Pohl

This paper is concerned with the characterization of $\alpha$-modulation spaces by Banach frames, i.e., stable and redundant non-orthogonal expansions, constituted of functions obtained by a suitable combination of translation, modulation…

Functional Analysis · Mathematics 2007-05-23 Massimo Fornasier

Let E and F be Banach spaces, let A be a subset of E, and let s \ge 0. A map f: A -> F is an s-nearisometry if |x-y|-s \le |fx-fy| \le |x-y|+s for all x,y in A. The article gives a survey on the stability problem: How well can an…

Functional Analysis · Mathematics 2007-05-23 Jussi Vaisala

The problem of 1-bit compressive sampling is addressed in this paper. We introduce an optimization model for reconstruction of sparse signals from 1-bit measurements. The model targets a solution that has the least l0-norm among all signals…

Information Theory · Computer Science 2013-02-07 Lixin Shen , Bruce W. Suter

So far there has not been paid attention to frames that are balanced, i.e. those frames which sum is zero. In this paper we consider balanced frames, and in particular balanced unit norm tight frames, in finite dimensional Hilbert spaces.…

Functional Analysis · Mathematics 2020-09-28 Sigrid B. Heineken , Patricia M. Morillas , Pablo Tarazaga

Famous Naimark-Han-Larson dilation theorem for frames in Hilbert spaces states that every frame for a separable Hilbert space $\mathcal{H}$ is image of a Riesz basis under an orthogonal projection from a separable Hilbert space…

Functional Analysis · Mathematics 2020-11-25 K. Mahesh Krishna , P. Sam Johnson

We propose and analyze an online algorithm for reconstructing a sequence of signals from a limited number of linear measurements. The signals are assumed sparse, with unknown support, and evolve over time according to a generic nonlinear…

Optimization and Control · Mathematics 2015-03-12 Joao F. C. Mota , Nikos Deligiannis , Aswin C. Sankaranarayanan , Volkan Cevher , Miguel R. D. Rodrigues

In the nonlinear geometry of Banach spaces where the objects in the category are Banach spaces as in the linear case, the morphisms in the new setting are taken to comprise of certain nonlinear maps involving say, Lipschitz maps and, in…

Functional Analysis · Mathematics 2023-12-12 M. A. Sofi

Fusion frames are collection of subspaces which provide a redundant representation of signal spaces. They generalize classical frames by replacing frame vectors with frame subspaces. This paper considers the sparse recovery of a signal from…

Information Theory · Computer Science 2018-04-09 Ulaş Ayaz

The notion of best approximation mapping (BAM) with respect to a closed affine subspace in finite-dimensional space was introduced by Behling, Bello Cruz and Santos to show the linear convergence of the block-wise circumcentered-reflection…

Optimization and Control · Mathematics 2020-06-05 Heinz H. Bauschke , Hui Ouyang , Xianfu Wang

This paper proposes a unified framework for the investigation of constrained learning theory in reflexive Banach spaces of features via regularized empirical risk minimization. The focus is placed on Tikhonov-like regularization with…

Statistics Theory · Mathematics 2016-10-20 Patrick L. Combettes , Saverio Salzo , Silvia Villa

We obtain sharp approximation results for into nearisometries between Lp spaces and nearisometries into a Hilbert space. Our main theorem is the optimal approximation result for nearsurjective nearisometries between general Banach spaces.

Functional Analysis · Mathematics 2007-05-23 Peter Semrl , Jussi Vaisala

In this short article we present the theory of sparse representations recovery in convex regularized optimization problems introduced in (Carioni and Del Grande, arXiv:2311.08072, 2023). We focus on the scenario where the unknowns belong to…

Optimization and Control · Mathematics 2024-06-17 Marcello Carioni , Leonardo Del Grande

In this paper, we introduce a sparse approximation property of order $s$ for a measurement matrix ${\bf A}$: $$\|{\bf x}_s\|_2\le D \|{\bf A}{\bf x}\|_2+ \beta \frac{\sigma_s({\bf x})}{\sqrt{s}} \quad {\rm for\ all} \ {\bf x},$$ where ${\bf…

Information Theory · Computer Science 2015-05-28 Qiyu Sun

We propose a non-parametric variant of binary regression, where the hypothesis is regularized to be a Lipschitz function taking a metric space to [0,1] and the loss is logarithmic. This setting presents novel computational and statistical…

Machine Learning · Computer Science 2020-10-21 Ariel Avital , Klim Efremenko , Aryeh Kontorovich , David Toplin , Bo Waggoner

We consider abstract inverse problems between infinite-dimensional Banach spaces. These inverse problems are typically nonlinear and ill-posed, making the inversion with limited and noisy measurements a delicate process. In this work, we…

Functional Analysis · Mathematics 2022-12-20 Giovanni S. Alberti , Ángel Arroyo , Matteo Santacesaria

The Kaczmarz algorithm is an iterative method to reconstruct an unknown vector $f$ from inner products $\langle f , \varphi_{n} \rangle $. We consider the problem of how additive noise affects the reconstruction under the assumption that…

Functional Analysis · Mathematics 2019-06-21 Caleb Camrud , Evan Camrud , Lee Przybylski , Eric S. Weber

In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is nonconvex and it can be written as the difference of two convex…

Machine Learning · Computer Science 2018-10-26 Yang Yang , Marius Pesavento , Symeon Chatzinotas , Björn Ottersten

We introduce a new multi-dimensional nonlinear embedding -- Piecewise Flat Embedding (PFE) -- for image segmentation. Based on the theory of sparse signal recovery, piecewise flat embedding with diverse channels attempts to recover a…

Computer Vision and Pattern Recognition · Computer Science 2018-08-13 Chaowei Fang , Zicheng Liao , Yizhou Yu

Signals sparse in a transformation domain can be recovered from a reduced set of randomly positioned samples by using compressive sensing algorithms. Simple re- construction algorithms are presented in the first part of the paper. The…

Information Theory · Computer Science 2015-12-08 Ljubisa Stankovic , Isidora Stankovic