A stochastic sparse representation: \(n\)-best approximation to random signals and computation
DOI10.1016/j.acha.2021.05.003zbMath1471.94012OpenAlexW3161805984MaRDI QIDQ1979920
Wei Qu, Tao Qian, Guan Tie Deng
Publication date: 3 September 2021
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2021.05.003
image processingreproducing kernelsignal analysisrandom signalstochastic Hardy spacestochastic Hilbert space
Stationary stochastic processes (60G10) Signal detection and filtering (aspects of stochastic processes) (60G35) Best approximation, Chebyshev systems (41A50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) General theory of stochastic processes (60G07) Approximation by other special function classes (41A30) Series expansions of functions of one complex variable (30B99)
Related Items (3)
Cites Work
- Unnamed Item
- Frequency-domain identification: An algorithm based on an adaptive rational orthogonal system
- On backward shift algorithm for estimating poles of systems
- Identification and rational \(L^ 2\) approximation: A gradient algorithm
- An enhancement algorithm for cyclic adaptive Fourier decomposition
- Adaptive Fourier series---a variation of greedy algorithm
- Existence and Generic Properties of L2 Approximants for Linear Systems
- Optimal approximation by Blaschke forms
- REMARKS ON ADAPTIVE FOURIER DECOMPOSITION
- Two-Dimensional Frequency-Domain System Identification
- 2D Partial Unwinding—A Novel Non-Linear Phase Decomposition of Images
- Cyclic AFD algorithm for the best rational approximation
- Two‐dimensional adaptive Fourier decomposition
This page was built for publication: A stochastic sparse representation: \(n\)-best approximation to random signals and computation