نتایج جستجو برای: matching pursuit

تعداد نتایج: 117320  

Journal: :Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing 2013
Surojit Biswas Vladimir Jojic

Metagenomics, the study of the total genetic material isolated from a biological host, promises to reveal host-microbe or microbe-microbe interactions that may help to personalize medicine or improve agronomic practice. We introduce a method that discovers metagenomic units (MGUs) relevant for phenotype prediction through sequence-based dictionary learning. The method aggregates patient-specifi...

2008
Zakria Hussain John Shawe-Taylor

We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound is tighter than the KPCA bound of Shawe-Taylor et al [7] and highly predictive of the size of the subspace needed to capture most of the variance in the data. We analyse a second matching pursuit algorithm called kern...

Journal: :J. Symb. Comput. 2003
Pei Yu Yuan Yuan

This paper presents a matching pursuit technique for computing the simplest normal forms of vector fields. First a simple, explicit recursive formula is derived for general differential equations, which reduces computation to the minimum. Then a matching pursuit technique is introduced and applied to the Takens–Bogdanov dynamical singularity. It is shown that unlike other methods for computing ...

Journal: :Journal of the Optical Society of America. A, Optics, image science, and vision 2013
Laura Rebollo-Neira James Bowley

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. Experiments are conducted to confirm (i) the effectiveness at producing sparse representations and (ii) competitiveness, with respect to the time required to pr...

Journal: :Journal of Electrical and Computer Engineering 2021

2009
Tom Diethe Zakria Hussain

Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Orthogonal) Matching Pursuit (OMP) [16]. The algorithm is based on the geometry of the polar polytope where at each step a basis function is chosen by finding the maximal vertex using a path-following method. The algorithmic comp...

1999
Tony S. Verma Teresa H. Y. Meng

We propose a method for sinusoidal modeling that takes into account the psychoacoustics of human hearing using a frame-based perceptually weighted matching pursuit. Working on blocks of the input signal, a set of sinusoidal components for each block is iteratively extracted taking into consideration perceptual significance by using extensions to the well known matching pursuits algorithm. These...

Journal: :Journal of Electrical and Computer Engineering 2017

Journal: :Frontiers in Neuroinformatics 2014

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید