Results 141 to 150 of about 206,616 (184)
Eye movement benchmark data for smooth-pursuit classification. [PDF]
Sci DataKorthals L, Visser I, Kucharský Š.
europepmc +1 more source
DP-MDLA Net: Detection of smooth pursuit abnormalities in Parkinson's disease. [PDF]
Digit HealthTan Z +7 more
europepmc +1 more source
Sparse Transform and Compressed Sensing Methods to Improve Efficiency and Quality in Magnetic Resonance Medical Imaging. [PDF]
Sensors (Basel)Villota S, Inga E.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of IEEE-SP International Symposium on Time- Frequency and Time-Scale Analysis, 1998
A crucial problem in image analysis is to construct efficient low-level representations of an image, providing precise characterization of features which compose it, such as edges and texture components. An image usually contains very different types of features, which have been successfully modelled by the very redundant family of 2D Gabor oriented ...
F. Bergeaud, S. Mallat
openaire +1 more source
A crucial problem in image analysis is to construct efficient low-level representations of an image, providing precise characterization of features which compose it, such as edges and texture components. An image usually contains very different types of features, which have been successfully modelled by the very redundant family of 2D Gabor oriented ...
F. Bergeaud, S. Mallat
openaire +1 more source
Multiplivative matching pursuit
2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100), 2002This paper introduces a novel nonlinear low-level representation of an image with signal-dependent noise. For multiplicative noisy image, we introduce an algorithm called multiplicative matching pursuit decomposition (MMPD), that decomposes the signal containing the intrinsic variation into a nonlinear expansion of waveforms that are selected from a ...
A. Serir, J.-C. Pesquet
openaire +1 more source
Subspace pursuit embedded in Orthogonal Matching Pursuit
TENCON 2012 IEEE Region 10 Conference, 2012Orthogonal Matching Pursuit (OMP) is a popular greedy pursuit algorithm widely used for sparse signal recovery from an undersampled measurement system. However, one of the main shortcomings of OMP is its irreversible selection procedure of columns of measurement matrix.
Sooraj K. Ambat +2 more
openaire +1 more source
Ordered Orthogonal Matching Pursuit
2012 National Conference on Communications (NCC), 2012Compressed Sensing deals with recovering sparse signals from a relatively small number of linear measurements. Several algorithms exists for data recovery from the compressed measurements, particularly appealing among these is the greedy approach known as Orthogonal Matching Pursuit (OMP). In this paper, we propose a modified OMP based algorithm called
Deepak Baby, Sibi Raj B Pillai
openaire +1 more source
Fast bayesian matching pursuit
2008 Information Theory and Applications Workshop, 2008A low-complexity recursive procedure is presented for minimum mean squared error (MMSE) estimation in linear regression models. A Gaussian mixture is chosen as the prior on the unknown parameter vector. The algorithm returns both an approximate MMSE estimate of the parameter vector and a set of high posterior probability mixing parameters.
Philip Schniter +2 more
openaire +1 more source
Cyclic adaptive matching pursuit
2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2012We present an improved Adaptive Matching Pursuit algorithm for computing approximate sparse solutions for overdetermined systems of equations. The algorithms use a greedy approach, based on a neighbor permutation, to select the ordered support positions followed by a cyclical optimization of the selected coefficients. The sparsity level of the solution
Onose Alexandru, Dumitrescu Bogdan
openaire +1 more source
Knowledge-enhanced Matching Pursuit
2013 IEEE International Conference on Acoustics, Speech and Signal Processing, 2013Compressive Sensing is possible when the sensing matrix acts as a near isometry on signals of interest that can be sparsely or compressively represented. The attraction of greedy algorithms such as Orthogonal Matching Pursuit is their simplicity. However they fail to take advantage of both the structure of the sensing matrix and any prior information ...
Yuejie Chi, Robert Calderbank
openaire +1 more source