matching pursuit
Structured Bayesian Orthogonal Matching Pursuit
... Orthogonal Matching Pursuit (SBOMP), is a structured extension of the Bayesian Orthogonal Match- ing Pursuit algorithm (BOMP) introduced in our previous work ...
10
Analysis-synthesis of the phonocardiogram based on the matching pursuit method.
... the matching pursuit method developed by Mallat and Zhang ...the matching pursuit method had promising potential for time- frequency scaling of heart sounds and ...the matching ...
10
Time-frequency scaling transformation of the phonocardiogram based of the matching pursuit method.
... difficult to distinguish two close components because the time interval between them is too small. This difficulty increases when the heart rate increases. As an example, it is often difficult to recognize an opening ...
9
Joint k-step analysis of Orthogonal Matching Pursuit and Orthogonal Least Squares
... Recursive Matching Pursuit (ORMP) [8] and Optimized Orthogonal Matching Pursuit (OOMP) [9] in the signal processing literature, all these algorithms being actually the ...
21
An analysis of psychoacoustically-inspired matching pursuit decompositions of speech signals
... 5. Conclusion In this paper, we first presented an experimental comparison of two psychoacoustically-based matching pursuit algorithms (PMP and PAMP) as well as the classical MP algorithm. The results ...
5
Exact recovery analysis of non-negative orthogonal matching pursuit
... Orthogonal Matching Pursuit (OMP) recovers the exact support of K-sparse signals under the condition µ < 1/(2K − 1) where µ denotes the mutual coherence of the ...
3
Matching Pursuit With Stochastic Selection
... For the MP-S procedure, we denote by µ (resp. κ) the ratio m/M (resp. k/K). We ran experiments with a large set of configu- rations ( µ, κ ∈ [0.2, 1.0]). Large values of these parameters imply a decrease per iteration ...
6
Orthogonal Matching Pursuit under the Restricted Isometry Property *
... The main contribution of the present paper is to give a structurally simpler proof of Zhang’s theorem, formulated in the general context of n-term approximation from a dictionary in arbi[r] ...
15
Transformation Pursuit for Image Classification
... of pursuit algorithms such as matching pursuit or basis pursuit [19], which compute a sig- nal approximation from a dictionary by iteratively selecting one atomic element at a time from the ...
9
Bayesian Pursuit Algorithms
... Basis Pursuit (BP) [10] and FOCUSS [11] which approximate the ` 0 -norm by the ` 1 - and ` p - (p < 1) norms, ...of pursuit algorithms encompasses all the procedures looking for a solution of the sparse ...
35
Soft Bayesian Pursuit Algorithm for Sparse Representations
... dictionary; matching pursuit (MP) [2] or subspace pur- suit (SP) [3] which build up the sparse vector x by making a succession of greedy decisions; and basis pursuit (BP) [4] which solves a relaxed ...
5
Unrecoverable subsets by OMP and Basis Pursuit
... [2] R. Gribonval and M. Nielsen, “Sparse representations in unions of bases”, IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320–3325, Dec. 2003. [3] C. Soussen, R. Gribonval, J. Idier, and C. Herzet, “Joint k-step ...
2
Generalized Subspace Pursuit and an application to sparse Poisson denoising
... The structure of this paper is the following. In Section 2, we present Generalized Subspace Pursuit and introduce the Restricted Diagonal Property which ensures its convergence for a wide class of cost function ...
6
Global Conceptualism? Cartographies of Conceptual Art in Pursuit of Decentring
... According to Siegelaub, geographic decentralization was the result of a new independence of conceptual practices toward artistic structures: “My gallery is the world now,” he explained[r] ...
14
Pursuit-Evasion Games and Zero-sum Two-person Differential Games
... according to necessity, defining a final time as t1 = inf{t | (t, x(t)) ∈ T }. If T = {T } × R n , final time is fixed and equal to T . The question of whether there is a finite t1 is one of central interest in ...
9
On Ontology Matching Problems
... GLUE (Doan et al. 2002) is the evolved version of LSD (Doan et al. 2001) whose goal is to semi- automatically find schema mappings for data integra- tion. Like LSD, GLUE use machine learning techni- ques to find ...
9
A Linear Program For Holistic Matching : Assessment on Schema Matching Benchmarks
... The comparison of the different strategies of our approach shows that the non re- laxed versions LP4HM A and LP4HM B give a better compromise for all the quality measures. Using a pre-defined threshold for LP4HM B ...
16
Instance-level matching
... ontology matching which takes advantage of common instances expressed with respect to the two ...ontology matching may be expressed to take advantage of linked instances instead of common ...
21
Assortative matching through signals
... which matching is not only positively assortative but perfectly positively assortative whenever the match production function is sufficiently supermodular (and explicit search costs are not prohibitively ...
44
The aggregate matching function
... Using the aggregate matching function, we build a simple model of the labor market.. which focuses on the flows in Sections 2 and 3.[r] ...
78