Results 41 to 50 of about 209,947 (320)
Multiple Candidate Matching Pursuit [PDF]
Journal of Broadcast Engineering, 2012 As a greedy algorithm reconstructing the sparse signal from underdetermined system, orthogonal matching pursuit (OMP) algorithm has received much attention. In this paper, we multiple candidate matching pursuit (MuCaMP), which builds up candidate support set in every iteration and uses the minimum residual at last iteration.
Seokbeop Kwon, Byonghyo Shim
openaire +1 more source
Journal of Low Frequency Noise, Vibration and Active Control, 2021 This paper proposes a direction of arrival estimation based on sparse signal reconstruction in the presence of alpha noise by the off-grid orthogonal matching pursuit algorithm.
LongKai Liang +3 more
doaj +1 more source
Orthogonal Matching Pursuit: A Brownian Motion Analysis [PDF]
, 2011 A well-known analysis of Tropp and Gilbert shows that orthogonal matching pursuit (OMP) can recover a k-sparse n-dimensional real vector from 4 k log(n) noise-free linear measurements obtained through a random Gaussian measurement matrix with a ...
Fletcher, Alyson K., Rangan, Sundeep
core +1 more source
Audio Matching Pursuit Algorithm Based on Atomic Preselection [PDF]
Jisuanji gongcheng, 2016 The Matching Pursuit(MP) is a sparse expression greedy algorithm which is applied to signal processing.Its computation complexity is high due to traversalmatching in atom selection,and the matching process has to know the complete signal needed to be ...
HU Xia,YANG Yuhong,JIANG Lin
doaj +1 more source
Simultaneously Sparse Solutions to Linear Inverse Problems with Multiple System Matrices and a Single Observation Vector [PDF]
, 2009 A linear inverse problem is proposed that requires the determination of multiple unknown signal vectors. Each unknown vector passes through a different system matrix and the results are added to yield a single observation vector.
Adam C. Zelinski +4 more
core +1 more source
Sequential Sparse Matching Pursuit [PDF]
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2009 We propose a new algorithm, called Sequential Sparse Matching Pursuit (SSMP), for solving sparse recovery problems. The algorithm provably recovers a k-sparse approximation to an arbitrary n-dimensional signal vector x from only O(k log(n/k)) linear measurements of x. The recovery process takes time that is only near-linear in n.
Berinde, Radu, Indyk, Piotr
openaire +2 more sources
Modernization of adaptive matching pursuit method to analyze geophysical signals of pulse nature
E3S Web of Conferences, 2018 The paper is devoted to the development and comparison of different numerical methods which increase the adaptive property and improve the accuracy of matching pursuit algorithm in connection to geoacoustic and electromagnetic signals.
Lukovenkova Ol’ga +3 more
doaj +1 more source
A Novel Tempogram Generating Algorithm Based on Matching Pursuit
Applied Sciences, 2018 Tempogram is one of the most useful representations for tempo, which has many applications, such as music tempo estimation, music structure analysis, music classification, and beat tracking.
Wenming Gui +5 more
doaj +1 more source
Sparse Representation of Astronomical Images [PDF]
, 2012 Sparse representation of astronomical images is discussed. It is shown that a significant gain in sparsity is achieved when particular mixed dictionaries are used for approximating these types of images with greedy selection strategies.
Andrle +22 more
core +3 more sources
A reduced-complexity compressed sensing channel estimation for underwater acoustic channel
Dianxin kexue, 2021 Aiming at the sparse characteristics of underwater acoustic channels for shallow seas, a reduced-complexity look-ahead backtracking orthogonal matching pursuit (RC-LABOMP) channel estimation algorithm was proposed.Firstly, two types of support sets of ...
Xuan YU, Xuan GENG
doaj +2 more sources