Results 81 to 90 of about 206,616 (184)
Probabilistic matching pursuit with Gabor dictionaries
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ferrando, Sebastian Esteban +3 more
openaire +3 more sources
Hybrid Video Coding Based on Bidimensional Matching Pursuit
Hybrid video coding combines together two stages: first, motion estimation and compensation predict each frame from the neighboring frames, then the prediction error is coded, reducing the correlation in the spatial domain.
Lorenzo Granai +3 more
doaj +1 more source
Chebushev Greedy Algorithm in convex optimization [PDF]
Chebyshev Greedy Algorithm is a generalization of the well known Orthogonal Matching Pursuit defined in a Hilbert space to the case of Banach spaces.
Temlyakov, Vladimir
core
A Sharp RIP Condition for Orthogonal Matching Pursuit
A restricted isometry property (RIP) condition δK+KθK ...
Wei Dan
doaj +1 more source
Random Matching Pursuit for Image Watermarking
The classical solution to an underdetermined system of linear equations mainly has two opposite directions, which lead to either a large $\ell _{2}$ -norm sparse solution or a non-sparse minimum $\ell _{2}$ -norm solution. In this paper, we systematically show that by modifying the well-known basic matching pursuit algorithm originally ...
Guang Hua +4 more
openaire +2 more sources
Peak Colocalized Orthogonal Matching Pursuit for Seismic Trace Decomposition
Orthogonal matching pursuit (OMP) is an efficient method for decomposing a seismic trace with regard to an atom dictionary. The original OMP optimizes one unique single objective in terms of successively maximizing the inner product between an atom and ...
Yongqing Li, Jun Wang, Hui Li, Peng Ren
doaj +1 more source
Bayesian approach with extended support estimation for sparse linear regression
A greedy algorithm called Bayesian multiple matching pursuit (BMMP) is proposed to estimate a sparse signal vector and its support given m linear measurements. Unlike the maximum a posteriori (MAP) support detection, which was proposed by Lee to estimate
Kyung-Su Kim, Sae-Young Chung
doaj +1 more source
On Recovery of Block Sparse Signals via Block Compressive Sampling Matching Pursuit
Compressive sampling matching pursuit (CoSaMP) is an efficient reconstruction algorithm for sparse signal. When the signal is block sparse, i.e., the non-zero elements are presented in clusters, some block sparse reconstruction algorithms have been ...
Xiaobo Zhang +4 more
doaj +1 more source
Classification of Acoustic Emissions Using Modified Matching Pursuit
We propose methodologies to automatically classify time-varying warning signals from an acoustic monitoring system that indicate the potential catastrophic structural failures of reinforced concrete structures. Since missing even a single warning signal
Papandreou-Suppappola Antonia +2 more
doaj +1 more source
In order to extract fault impulse feature of large-scale rotating machinery from strong background noise, a sparse feature extraction method based on sparse decomposition combined multiresolution generalized S transform is proposed in this paper. In this
Baokang Yan +4 more
doaj +1 more source

