Results 51 to 60 of about 19,816 (300)
Group polytope faces pursuit for recovery of block-sparse signals [PDF]
, 2012 This is the accepted version of the article. The final publication is available at link.springer.com.
Gretsistas, A +3 more
core +1 more source
A New Generalized Orthogonal Matching Pursuit Method
Journal of Electrical and Computer Engineering, 2017 To improve the reconstruction performance of the generalized orthogonal matching pursuit, an improved method is proposed. Columns are selected from the sensing matrix by generalized orthogonal matching pursuit, and indices of the columns are added to the
Liquan Zhao, Yulong Liu
doaj +1 more source
A Low-complexity Sparse Channel Estimation Algorithm [PDF]
Jisuanji gongcheng, 2016 Traditional Compressed Sensing(CS)based channel estimation methods are difficult to implement due to their high computational complexity.To solve this problem,Generalized Orthogonal Matching Pursuit(GOMP)algorithm is used for channel estimation,which ...
FAN Xinyue,SU Yantao,ZHOU Fei
doaj +1 more source
Structured Bayesian Orthogonal Matching Pursuit [PDF]
, 2012 International audienceTaking advantage of the structures inherent in many sparse decompositions constitutes a promising research axis. In this paper, we address this problem from a Bayesian point of view.
Daudet, Laurent +2 more
core +6 more sources
On the number of iterations for the matching pursuit algorithm [PDF]
2017 25th European Signal Processing Conference (EUSIPCO), 2017 Publication in the conference proceedings of EUSIPCO, Kos island, Greece ...
Fangyao Li +3 more
openaire +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background An earlier study on children diagnosed with acute lymphoblastic leukemia (ALL) at Moi Teaching and Referral Hospital (MTRH) in Kenya reported a low event‐free survival (EFS), excess treatment abandonment, and high induction mortality.
Gilbert Olbara +7 more
wiley +1 more source
On the difference between orthogonal matching pursuit and orthogonal least squares [PDF]
, 2007 — Greedy algorithms are often used to solve underdetermined inverse problems when the solution is constrained to be sparse, i.e. the solution is only expected to have a relatively small number of non-zero elements.
Blumensath, T. +3 more
core
Reduced Look Ahead Orthogonal Matching Pursuit [PDF]
, 2014 Compressed Sensing (CS) is an elegant technique to acquire signals and reconstruct them efficiently by solving a system of under-determined linear equations.
Swamy, Prateek Basavapur +7 more
core +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background General pediatricians often evaluate hematologic and oncologic presentations before subspecialty consultation, yet the 2025 Accreditation Council for Graduate Medical Education (ACGME) pediatric requirements reduce inpatient pediatric hematology/oncology (PHO) time, raising questions about resident readiness.
Colburn Yu, Rohini Jain
wiley +1 more source
A Dictionary-Based Pursuit Algorithm for Magnetotelluric Signal-Noise Separation
IEEE AccessA critical challenge in magnetotelluric (MT) studies is the effective suppression of noise in collected data prior to investigating deep geological structures and detecting deep-seated blind ore bodies.
Jin Cai, Jianhua Cai
doaj +1 more source