A Sinusoidal-Hyperbolic Family of Transforms With Potential Applications in Compressive Sensing

  title={A Sinusoidal-Hyperbolic Family of Transforms With Potential Applications in Compressive Sensing},
  author={Maryam Abedi and Bing Sun and Zheng Zheng},
  journal={IEEE Transactions on Image Processing},
Efficient source coding is desired for any data storage and transmission. It could be enabled by adopting a transform inspired by natural phenomena. Based on the mechanical vibration models, a family of bases applicable to data compression is constructed. The eigenvectors of vibrating thin square plates, which are composed of sinusoidal and hyperbolic functions, are used to construct these real-orthonormal bases. Our analyses show that their attributes and performance are comparable to those of… 

Fault diagnosis of bearing vibration signals based on a reconstruction algorithm with multiple side Information and CEEMDAN method

This study proposed a reconstruction algorithm based on the multiple side information signal (RAMSI) with a purpose to effectively obtain important information from recorded bearing signals and showed that the performance of the sparse optimization algorithm from the proposed framework is superior to the BPbased on the ADMM and OMP algorithm.

An Analytic Transform Kernel Derivation Method for Video Codecs

A common sparse unified matrix concept is introduced, where any block size transform kernel matrix can be obtained after some mathematical operations and supports the fast algorithm of DST-7 by implementing the proposed method of the “one group one feature” principle.

Subject Review: Video Compression Algorithms

The characteristic of video coding from the scratch of key frame selection to the evolutions of various standards is discussed and the characteristics of video compression techniques are discussed.

Vibration measurement method based on single-frame coded illumination and compressive sensing

Abstract. A visual vibration measurement method based on single-frame coded illumination and compressive sensing is proposed. The projector projects concentric rectangles with different sizes at



Deterministic constructions of compressed sensing matrices

  • R. DeVore
  • Computer Science, Mathematics
    J. Complex.
  • 2007

State of the art and prospects of structured sensing matrices in compressed sensing

Couples of existing structured sensing matrices are reviewed in this paper which have special structures, high recovery performance, and many advantages such as the simple construction, fast calculation and easy hardware implementation.

Compressed Sensing Performance Bounds Under Poisson Noise

It is shown that, as the overall intensity of the underlying signal increases, an upper bound on the reconstruction error decays at an appropriate rate, but that for a fixed signal intensity, the error bound actually grows with the number of measurements or sensors.

Atomic Decomposition by Basis Pursuit

Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions.

A fast reconstruction algorithm for deterministic compressive sensing using second order reed-muller codes

This paper proposes a deterministic compressed sensing matrix that comes by design with a very fast reconstruction algorithm, in the sense that its complexity depends only on the number of

Deterministic Sensing Matrices in Compressive Sensing: A Survey

This paper introduces a basic problem in compressive sensing and some disadvantage of the random sensing matrices, and some recent results on construction of the deterministic sensingMatrices are discussed.

A Russian Dolls ordering of the Hadamard basis for compressive single-pixel imaging

It is found that this compressive approach performs as well as other compressive sensing techniques with greatly simplified post processing, resulting in significantly faster image reconstruction, and may be useful for single-pixel imaging in the low resolution, high-frame rate regime, or video-rate acquisition.

Sparsity and incoherence in compressive sampling

It is shown that ℓ1 minimization recovers x0 exactly when the number of measurements exceeds S, and μ is the largest entry in U properly normalized: .

This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms—Theory and Practice

The optimization formulation considered in this paper uses a penalized negative Poisson log-likelihood objective function with nonnegativity constraints (since Poisson intensities are naturally nonnegative) for estimation of f* from y in an inverse problem setting.