Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Mark A. Iwen"'
Publikováno v:
Applied and Computational Harmonic Analysis. 66:161-192
Publikováno v:
Linear Algebra and its Applications. 626:79-151
Let ‖ A ‖ max : = max i , j | A i , j | denote the maximum magnitude of entries of a given matrix A. In this paper we show that max { ‖ U r ‖ max , ‖ V r ‖ max } ≤ ( C r ) 6 r N , where U r and V r are the matrices whose columns
On Fast Johnson–Lindenstrauss Embeddings of Compact Submanifolds of $$\mathbbm {R}^N$$ with Boundary
Publikováno v:
Discrete & Computational Geometry.
Publikováno v:
Information and Inference: A Journal of the IMA. 10:1491-1531
We propose a two-step approach for reconstructing a signal $\textbf x\in \mathbb{C}^d$ from subsampled discrete short-time Fourier transform magnitude (spectogram) measurements: first, we use an aliased Wigner distribution deconvolution approach to s
Autor:
Rayan Saab, Nada Sissouno, Frank Filbir, Wolfgang zu Castell, Mark A. Iwen, Florian Boßmann, Maik Kahnt, Christian G. Schroer
Publikováno v:
Math. Comput. Simul. 176, 292-300 (2020)
Measurements achieved with ptychographic imaging are a special case of diffraction measurements. They are generated by illuminating small parts of a sample with, e.g., a focused X-ray beam. By shifting the sample, a set of far-field diffraction patte
Publikováno v:
Applied and Computational Harmonic Analysis. 48:415-444
We improve a phase retrieval approach that uses correlation-based measurements with compactly supported measurement masks [30] . Our approach admits deterministic measurement constructions together with a robust, fast recovery algorithm that consists
Publikováno v:
EUSIPCO
We present an algorithm which is closely related to direct phase retrieval methods that have been shown to work well empirically [1], [2] and prove that it is guaranteed to recover (up to a global phase) a large class of compactly supported smooth fu
In this paper we present the first known deterministic algorithm for the construction of multiple rank-1 lattices for the approximation of periodic functions of many variables. The algorithm works by converting a potentially large reconstructing sing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43dec98c7687911e1659276162997349
Publikováno v:
Advances in Computational Mathematics. 45:519-561
In this paper a deterministic sparse Fourier transform algorithm is presented which breaks the quadratic-in-sparsity runtime bottleneck for a large class of periodic functions exhibiting structured frequency support. These functions include, e.g., th
Publikováno v:
Proceedings of the IEEE. 106:1341-1358
The widespread use of multisensor technology and the emergence of big data sets have brought the necessity to develop more versatile tools to represent higher order data with multiple aspects and high dimensionality. Data in the form of multidimensio