Probabilistic pursuit
type: Item
instance of: scholarly article
zbMATH Open document ID: 0984.93075
author: Upendra V. Chaudhari
publication date: 2002-05-05T00:00:00Z
Mathematics Subject Classification ID: 93E03
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 94A12
zbMATH DE Number: 1617860
zbMATH Keywords: greedy pursuit algorithms
zbMATH Keywords: signal decomposition
zbMATH Keywords: waiting time
zbMATH Keywords: minimum time decomposition
zbMATH Keywords: classification of speech sounds
zbMATH Keywords: parallelizable classifier
MaRDI profile type: Publication
title: Probabilistic pursuit
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.NEWLINENEWLINEFor the entire collection see [Zbl 0961.00036].
reviewed by: Neculai Curteanu
description: scientific article; zbMATH DE number 1617860