Probabilistic pursuit

MaRDI QIDQ2722580zbMATH OpenFDO

Authors Upendra V. Chaudhari

Publication date 5 May 2002

zbMATH Keywords

classification of speech soundsgreedy pursuit algorithmsminimum time decompositionparallelizable classifiersignal decompositionwaiting time

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Stochastic systems in control theory (general) (93E03) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Review text

The aim of the present paper is to propose a probabilistic extension for the paradigm of greedy pursuit algorithms used in signal decomposition analysis. For the new pursuit algorithms, the search characteristics incorporate prior knowledge of the signal model. The concept of waiting time for finding a matching dictionary element is introduced, and the idea of minimum time decomposition is developed for the classification of speech sounds. A classification scheme based on this novel approach to pursuit algorithms may be used for the design of an efficient and highly parallelizable classifier with a large spectrum of applications. For the entire collection see [Zbl 0961.00036].

Recommendations

• Probabilistic matching pursuit with Gabor dictionaries.
• Matching pursuits with time-frequency dictionaries
• Matching pursuit: Adaptive representations of images and sounds
• scientific article; zbMATH DE number 884923
• A pursuit architecture for signal analysis

Cited in

(5)

• Successive positional pursuit
• Successive pursuit with a bounded detection domain
• A pursuit architecture for signal analysis
• scientific article; zbMATH DE number 4164599 (Why is no real title available?)
• Probabilistic Amplitude Demodulation

This page was built for publication: Probabilistic pursuit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2722580)