Local sampling set conditions in weighted shift-invariant signal spaces

How to represent a continuous signal in terms of a discrete sequence is a fundamental problem in sampling theory. Most of the known results concern global sampling in shift-invariant signal spaces. But in fact, the local reconstruction from local samples is one of the most desirable properties for many applications in signal processing, e.g. for implementing real-time reconstruction numerically. However, the local reconstruction problem has not been given much attention. In this article, we find conditions on a finite sampling set X such that at least in principle a continuous signal on a finite interval is uniquely and stably determined by their sampling value on the finite sampling set X in shift-invariant signal spaces.     

Weighted sampling and reconstruction in weighted reproducing kernel spaces

In this paper, we discuss sampling and reconstruction of signals in the weighted reproducing kernel space associated with an idempotent integral operator. We show that any signal in that space can be stably reconstructed from its weighted samples taken on a relatively-separated set with sufficiently small gap. We also develop an iterative reconstruction algorithm for the reconstruction of a signal from its weighted samples taken on a relatively-separated set with sufficiently small gap.     

Local Sampling and Reconstruction in Shift-Invariant Spaces and Their Applications in Spline Subspaces

The local reconstruction from samples is one of the most desirable properties for many applications in signal processing. Local sampling is practically useful since we need only to consider a signal on a bounded interval and computer can only process finite samples. However, the local sampling and reconstruction problem has not been given as much attention. Most of known results concern global sampling and reconstruction. There are only a few results about local sampling and reconstruction in spline subspaces. In this article, we study local sampling and reconstruction in general shift-invariant spaces and multiple generated shift-invariant spaces with compactly supported generators. Then we give several applications in spline subspaces and multiple generated spline subspaces.     

A linearly convergent algorithm for sparse signal reconstruction

For the sparse signal reconstruction problem in compressive sensing, we propose a projection-type algorithm without any backtracking line search based on a new formulation of the problem. Under suitable conditions, global convergence and its linear convergence of the designed algorithm are established. The efficiency of the algorithm is illustrated through some numerical experiments on some sparse signal reconstruction problem.     

基于截断加权基追踪模型的迭代支撑探测算法

迭代支撑探测算法是基于截断的基追踪(Basis Pursuit,BP)模型的一种l_1最小化信号重构算法,它可以实现信号的快速重构并且所需要的观测值比经典的L1算法以及迭代加权L1算法更少.本文针对非零元具有快速退化分布性质的稀疏信号,提出了一种改进算法一一基于截断的加权BP模型的迭代支撑探测算法.在迭代的过程中,改进的算法探测原信号支撑集中元素的同时调整重构模型的权值,使得重构模型更有利于实现信号的精确重构.根据所考虑的信号的非零元具有快速退化分布性质这样的先验信息,利用阈值法则探测原信号支撑集中的元素.最后通过Matlab数值实验实现了算法,验证了基于截断的加权BP模型的迭代支撑探测算法比迭代加权L1算法需要的观测值更少,并且比迭代加权L1算法以及传统的迭代支撑探测算法需要更少的重构时间就可以实现信号的精确重构.     

Painless Reconstruction from Magnitudes of Frame Coefficients

The goal of this paper is to develop fast algorithms for signal reconstruction from magnitudes of frame coefficients. This problem is important to several areas of research in signal processing, especially speech recognition technology, as well as state tomography in quantum theory. We present linear reconstruction algorithms for tight frames associated with projective 2-designs in finite-dimensional real or complex Hilbert spaces. Examples of such frames are two-uniform frames and mutually unbiased bases, which include discrete chirps. The number of operations required for reconstruction with these frames grows at most as the cubic power of the dimension of the Hilbert space. Moreover, we present a very efficient algorithm which gives reconstruction on the order of d operations for a d-dimensional Hilbert space.     

Reconstruction of signals from multiscale edges

We present a method for signal reconstruction based upon the location of its singularities which are identified by a wavelet transform technique. The reconstructed signal is an infconvolution spline approximant. The data for the interpolation problem which we solve comes from a compact signal coding procedure. Error bounds and convergence results for the calculated signal are given.     

Numerically erasure-robust frames

Given a channel with additive noise and adversarial erasures, the task is to design a frame that allows for stable signal reconstruction from transmitted frame coefficients. To meet these specifications, we introduce numerically erasure-robust frames. We first consider a variety of constructions, including random frames, equiangular tight frames and group frames. Later, we show that arbitrarily large erasure rates necessarily induce numerical instability in signal reconstruction. We conclude with a few observations, including some implications for maximal equiangular tight frames and sparse frames.     

Approximate reconstruction of bandlimited functions for the integrate and fire sampler

In this paper we study the reconstruction of a bandlimited signal from samples generated by the integrate and fire model. This sampler allows us to trade complexity in the reconstruction algorithms for simple hardware implementations, and is specially convenient in situations where the sampling device is limited in terms of power, area and bandwidth. Although perfect reconstruction for this sampler is impossible, we give a general approximate reconstruction procedure and bound the corresponding error. We also show the performance of the proposed algorithm through numerical simulations.     

固定时间梯度流在l1-l2范数中的稀疏重构

压缩感知（compressed sensing,CS）是一种全新的信号采样技术,对于稀疏信号,它能够以远小于传统的Nyquist采样定理的采样点来重构信号。在压缩感知中, 采用动态连续系统,对l₁-l₂范数的稀疏信号重构问题进行了研究。提出了一种基于固定时间梯度流的稀疏信号重构算法,证明了该算法在Lyapunov意义上的稳定性并且收敛于问题的最优解。最后通过与现有的投影神经网络算法的对比,体现了该算法的可行性以及在收敛速度上的优势.     

连续信号和离散信号小波多分辨率分析的实现

本文首先以信号分析为背景阐述多分辨率分析的基本思想,然后从多分辨率分析的角度,研究连续信号小波变换的特点及实现方法,并对离散信号的多分辨率分解和重构进行讨论。文中还就相应的一些概念和问题展开了讨论,并提出了一些看法。     

Quantization of compressive samples with stable and robust recovery

In this paper we study the quantization stage that is implicit in any compressed sensing signal acquisition paradigm. We propose using Sigma–Delta (ΣΔ) quantization and a subsequent reconstruction scheme based on convex optimization. We prove that the reconstruction error due to quantization decays polynomially in the number of measurements. Our results apply to arbitrary signals, including compressible ones, and account for measurement noise. Additionally, they hold for sub-Gaussian (including Gaussian and Bernoulli) random compressed sensing measurements, as well as for both high bit-depth and coarse quantizers, and they extend to 1-bit quantization. In the noise-free case, when the signal is strictly sparse we prove that by optimizing the order of the quantization scheme one can obtain root-exponential decay in the reconstruction error due to quantization.     

Frame Fundamental Sensor Modeling and Stability of One-Sided Frame Perturbation

We demonstrate that for all linear devices and/or sensors, signal requisition and reconstruction is naturally a mathematical frame expansion and reconstruction issue, whereas the measurement is carried out via a sequence generated by the exact physical response function (PRF) of the device, termed sensory frame {h _n }. The signal reconstruction, on the other hand, will be carried out using the dual frame $\{\tilde{h}^{a}_{n}\}$ of an estimated sensory frame {h _n ^a }. This consequently results in a one-sided perturbation to a frame expansion, which resides in each and every signal and image reconstruction problem. We show that the stability of such a one-sided frame perturbation exits. Examples of image reconstructions in de-blurring are demonstrated.     

部分支集已知的信号恢复

稀疏信号恢复是压缩感知的主要研究问题, 目前已经取得了非常丰富的成果. 而在实际应用中,往往有一些先验信息可以利用, 以提高恢复的效率, 减少测量次数. 本文主要讨论部分支集已知的稀疏或可压缩信号恢复问题, 提出了一个松弛零空间条件并且改进了保证信号稳定恢复的限制等距常数界.     

A new class of conformable spectral observers for signal reconstruction

In this work, the design of spectral observers for signal reconstruction based on Kalman filters is performed and evaluated. The conformable derivative and the beta‐derivative were used to design the Kalman filters. Both derivatives satisfy the same formulas of the classical derivation, eg, the chain rule. The derivative order, the Ricatti equation parameters, and the observers tuning parameters were optimized using an optimization algorithm based on the bat's echolocation behavior (Bat algorithm). The simulation results showed the advantages of using the proposed observers for the signal reconstruction.     

Reconstruction of Wideband Reflectivity Densities by Wavelet Transforms

This paper is concerned with reconstruction problems arising in the context of radar signal analysis. The goal in radar is to obtain information about objects by emitting certain signals and analyzing the reflected echoes. In this paper, we shall focus on the general wideband model for radar echoes and on the case of continuously distributed objects D (reflectivity density). In this case, the echo is given by an inverse wavelet transform of the density D where the role of the analyzing wavelet is played by the transmitted signal. However, the null space of an inverse wavelet transform is nontrivial, it is described by the corresponding reproducing kernel. Following the approach of Naparst [14] and Rebolla-Neira et al. [16], we suggest to treat this problem by transmitting not just one signal but a family of signals. Indeed, a reconstruction formula for one- and 2-dimensional reflectivity densities can be derived, provided that the set of outgoing signals forms an orthogonal basis or – more general – a frame. We also present some rigorous error estimates for these reconstruction formulas. The theoretical results are confirmed by some numerical examples.     

A Unifying Representer Theorem for Inverse Problems and Machine Learning

Foundations of Computational Mathematics - Regularization addresses the ill-posedness of the training problem in machine learning or the reconstruction of a signal from a limited number of...     

Unique Reconstruction of Band-limited Signals by a Mallat-Zhong Wavelet Transform Algorithm

We show that uniqueness and existence for signal reconstruction from multiscale edges in the Mallat and Zhong algorithm become possible if we restrict our signals to Paley-Wiener space, band-limit our wavelets, and irregularly sample at the wavelet transform (absolute) maxima—the edges—while possibly including (enough) extra points at each level. We do this in a setting that closely resembles the numerical analysis setting of Mallat and Zhong and that seems to capture something of the essence of their (practical) reconstruction method. Our work builds on a uniqueness result for reconstructing an L² signal from irregular sampling of its wavelet transform of Gröchenig and the related work of Benedetto, Heller, Mallat, and Zhong. We show that the rate of convergence for this reconstruction algorithm is geometric and computable in advance. Finally, we consider the effect on the rate of convergence of not sampling enough local maxima.     

Unique reconstruction of band-limited signals by a Mallat-Zhong wavelet transform algorithm

We show that uniqueness and existence for signal reconstruction from multiscale edges in the Mallat and Zhong algorithm become possible if we restrict our signals to Paley-Wiener space, band-limit our wavelets, and irregularly sample at the wavelet transform (absolute) maxima—the edges—while possibly including (enough) extra points at each level. We do this in a setting that closely resembles the numerical analysis setting of Mallat and Zhong and that seems to capture something of the essence of their (practical) reconstruction method. Our work builds on a uniqueness result for reconstructing an L² signal from irregular sampling of its wavelet transform of Grochenig and the related work of Benedetto, Heller, Mallat, and Zhong. We show that the rate of convergence for this reconstruction algorithm is geometric and computable in advance. Finally, we consider the effect on the rate of convergence of not sampling enough local maxima.     

On the stable sampling rate for binary measurements and wavelet reconstruction

This paper is concerned with the problem of reconstructing an infinite-dimensional signal from a limited number of linear measurements. In particular, we show that for binary measurements (modelled with Walsh functions and Hadamard matrices) and wavelet reconstruction the stable sampling rate is linear. This implies that binary measurements are as efficient as Fourier samples when using wavelets as the reconstruction space. Powerful techniques for reconstructions include generalized sampling and its compressed versions, as well as recent methods based on data assimilation. Common to these methods is that the reconstruction quality depends highly on the subspace angle between the sampling and the reconstruction space, which is dictated by the stable sampling rate. As a result of the theory provided in this paper, these methods can now easily use binary measurements and wavelet reconstruction bases.