Results 1 to 10 of about 209,947 (320)
Xibei Gongye Daxue Xuebao, 2020 Efficient localization of multiple targets is one of the basic technical problems in wireless sensor networks (WSN). The traditional sparse representation method based on greedy class is not efficient in multi-target positioning.
doaj +1 more source
A deconvolution sound source identification method based on twice weak selection orthogonal matching pursuit [PDF]
, 2022 Weipeng Zhao, Jin Mao, Kai Liu
openalex +1 more source
Noisy Subspace Clustering via Matching Pursuits [PDF]
IEEE Transactions on Information Theory, 2018 24 pages, 5 ...
Michael Tschannen, Helmut Bolcskei
openaire +2 more sources
Optimization of Matching Pursuit Encoder Based on Analytical Approximation of Matching Pursuit Distortion [PDF]
2006 IEEE International Conference on Multimedia and Expo, 2006 Distortion of matching pursuit is calculated in terms of matching pursuit encoder parameters for uniformly distributed signals and dictionaries. Then, the MP encoder is optimized using the analytically derived approximation for MP distortion. Our simulation results show that this optimized MP encoder exhibits optimum performance for nonuniform signal ...
Alireza Shoa, Shahram Shirani
openaire +1 more source
IET Networks, 2019 This study proposes a construction method of deterministic measurement matrix based on a correlation criterion. On this basis, the authors investigated the massive multiple‐input and multiple‐output (MIMO) channel estimation algorithm using the ...
Ruijin Ma, Huisheng Zhang
doaj +1 more source
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019 Time-frequency signal transform is considered. Advantages of joint time-frequency analysis over traditional separate analysis in time or frequency domains are shown.
Al. A. Petrovsky, V. Y. Herasimovich
doaj
Sparse Signal Recovery via Rescaled Matching Pursuit
AxiomsWe propose the Rescaled Matching Pursuit (RMP) algorithm to recover sparse signals in high-dimensional Euclidean spaces. The RMP algorithm has less computational complexity than other greedy-type algorithms, such as Orthogonal Matching Pursuit (OMP).
Wan Li, Peixin Ye
doaj +1 more source
MATCHING PURSUIT ALGORITHM IN ASSESSING THE STATE OF ROLLING BEARINGS [PDF]
Applied Computer Science, 2017 In this paper the results of Matching Pursuit (MP) Octave algorithm applied to noise, vibration and harness (NVH) diagnosis of rolling bearings are presented. For this purpose two bearings in different condition state were examined.
Kamil JONAK, Paweł KRUKOW
doaj +1 more source
New Coherence and RIP Analysis for Weak Orthogonal Matching Pursuit
, 2014 In this paper we define a new coherence index, named the global 2-coherence, of a given dictionary and study its relationship with the traditional mutual coherence and the restricted isometry constant.
de Hoog, Frank, Yang, Mingrui
core +1 more source
Greedy sparse decompositions: a comparative study
EURASIP Journal on Advances in Signal Processing, 2011 The purpose of this article is to present a comparative study of sparse greedy algorithms that were separately introduced in speech and audio research communities. It is particularly shown that the Matching Pursuit (MP) family of algorithms (MP, OMP, and
Moreau Nicolas +2 more
doaj