English
Related papers

Related papers: Multi-Dimensional Unlimited Sampling and Robust Re…

200 papers

Photographing scenes with high dynamic range (HDR) poses great challenges to consumer cameras with their limited sensor bit depth. To address this, Zhao et al. recently proposed a novel sensor concept - the modulo camera - which captures…

Computer Vision and Pattern Recognition · Computer Science 2017-07-06 Florian Lang , Tobias Plötz , Stefan Roth

Periodic nonuniform sampling is a known method to sample spectrally sparse signals below the Nyquist rate. This strategy relies on the implicit assumption that the individual samplers are exposed to the entire frequency range. This…

Information Theory · Computer Science 2009-01-27 Moshe Mishali , Yonina C. Eldar , Joel A. Tropp

High resolution images can be acquired using a non-regular sampling sensor which consists of an underlying low resolution sensor that is covered with a non-regular sampling mask. The reconstructed high resolution image is then obtained…

Image and Video Processing · Electrical Eng. & Systems 2022-04-08 Markus Jonscher , Karina Jaskolka , Jürgen Seiler , André Kaup

Conventional sampling and interpolation commonly rely on discrete measurements. In this paper, we develop a theoretical framework for extrapolation of signals in higher dimensions from knowledge of the continuous waveform on bounded…

Signal Processing · Electrical Eng. & Systems 2020-08-04 Cornelius Frankenbach , Pablo Martínez-Nuevo , Martin Møller , Walter Kellermann

Dynamic mode decomposition has emerged as a leading technique to identify spatiotemporal coherent structures from high-dimensional data, benefiting from a strong connection to nonlinear dynamical systems via the Koopman operator. In this…

Systems and Control · Computer Science 2017-12-01 Zhe Bai , Eurika Kaiser , Joshua L. Proctor , J. Nathan Kutz , Steven L. Brunton

Dynamic mode decomposition (DMD) is an efficient tool for decomposing spatio-temporal data into a set of low-dimensional modes, yielding the oscillation frequencies and the growth rates of physically significant modes. In this paper, we…

Dynamical Systems · Mathematics 2023-02-21 Minwoo Lee , Jongho Park

Many modern applications involve the acquisition of noisy modulo samples of a function $f$, with the goal being to recover estimates of the original samples of $f$. For a Lipschitz function $f:[0,1]^d \to \mathbb{R}$, suppose we are given…

Statistics Theory · Mathematics 2021-05-04 Michaël Fanuel , Hemant Tyagi

Most compressed sensing algorithms do not account for the effect of saturation in noisy compressed measurements, though saturation is an important consequence of the limited dynamic range of existing sensors. The few algorithms that handle…

Machine Learning · Computer Science 2021-02-09 Shuvayan Banerjee , Radhe Srivastava , Ajit Rajwade

Two important attributes of analog to digital converters (ADCs) are its sampling rate and dynamic range. The sampling rate should be greater than or equal to the Nyquist rate for bandlimited signals with bounded energy. It is also desired…

Signal Processing · Electrical Eng. & Systems 2021-10-08 Eyar Azar , Satish Mulleti , Yonina C. Eldar

We focus on a multidimensional field with uncorrelated spectrum, and study the quality of the reconstructed signal when the field samples are irregularly spaced and affected by independent and identically distributed noise. More…

Information Theory · Computer Science 2009-11-13 A. Nordio , C-F. Chiasserini , E. Viterbo

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

We propose a new method for reconstruction of sparse signals with and without noisy perturbations, termed the subspace pursuit algorithm. The algorithm has two important characteristics: low computational complexity, comparable to that of…

Numerical Analysis · Computer Science 2009-01-08 Wei Dai , Olgica Milenkovic

We study compressed sensing (CS) signal reconstruction problems where an input signal is measured via matrix multiplication under additive white Gaussian noise. Our signals are assumed to be stationary and ergodic, but the input statistics…

Information Theory · Computer Science 2014-10-22 Yanting Ma , Junan Zhu , Dror Baron

Optimizing multimodal waveguide performance depends on modal analysis; however, existing methods focus predominantly on modal power distribution (MPD) and, limited by experimental hardware and conditions, exhibit low accuracy, poor…

Computational Physics · Physics 2025-11-06 Jingtong Li , Dongting Huang , Minhui Xiong , Mingzhi Li

In a multiple measurement vector problem (MMV), where multiple signals share a common sparse support and are sampled by a common sensing matrix, we can expect joint sparsity to enable a further reduction in the number of required…

Information Theory · Computer Science 2015-06-03 Jong Min Kim , Ok Kyun Lee , Jong Chul Ye

Contrary to the traditional pursuit of research on nonuniform sampling of bandlimited signals, the objective of the present paper is not to find sampling conditions that permit perfect reconstruction, but to perform the best possible signal…

Signal Processing · Electrical Eng. & Systems 2024-04-05 Nguyen T. Thao , Dominik Rzepka , Marek Miskowicz

We study reconstruction operators on a Hilbert space that are exact on a given reconstruction subspace. Among those the reconstruction operator obtained by the least squares fit has the smallest operator norm, and therefore is most stable…

Numerical Analysis · Mathematics 2019-09-18 Peter Berger , Karlheinz Gröchenig , Gerald Matz

It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained L1 minimization. In this paper, we…

Methodology · Statistics 2007-11-13 Emmanuel J. Candes , Michael B. Wakin , Stephen P. Boyd

A new gradient-based adaptive sampling method is proposed for design of experiments applications which balances space filling, local refinement, and error minimization objectives while reducing reliance on delicate tuning parameters. High…

Methodology · Statistics 2024-05-09 Lucas Caparini , Gwynn J. Elfring , Mauricio Ponga

Traditional fault diagnosis methods struggle to handle fault data, with complex data characteristics such as high dimensions and large noise. Deep learning is a promising solution, which typically works well only when labeled fault data are…

Machine Learning · Computer Science 2025-03-13 Dandan Zhao , Hongpeng Yin , Jintang Bian , Han Zhou
‹ Prev 1 4 5 6 7 8 10 Next ›