Gaussian process

About: Gaussian process is a research topic. Over the lifetime, 18944 publications have been published within this topic receiving 486645 citations. The topic is also known as: Gaussian stochastic process.

Accurate evaluation of multiple-access performance in TH-PPM and TH-BPSK UWB systems

Abstract: A characteristic function method is proposed for precisely calculating the bit-error probability of time-hopping (TH) ultra-wideband (UWB) systems with multiple-access interference in an additive white Gaussian noise environment. The analytical expressions are validated by simulation and used to assess the accuracy of the Gaussian approximation. The Gaussian approximation is shown to be inaccurate for predicting bit-error rates (BERs) for medium and large signal-to-noise ratio (SNR) values. The performances of TH pulse position modulation (PPM) and binary phase-shift keying (BPSK) modulation schemes are accurately compared in terms of the BER. It is shown that the BPSK system outperforms the binary PPM system for all values of SNR. The sensitivity of the performance of the modulation schemes to the system parameters is also addressed through numerical examples.

Gaussian process regression flow for analysis of motion trajectories

Abstract: Recognition of motions and activities of objects in videos requires effective representations for analysis and matching of motion trajectories. In this paper, we introduce a new representation specifically aimed at matching motion trajectories. We model a trajectory as a continuous dense flow field from a sparse set of vector sequences using Gaussian Process Regression. Furthermore, we introduce a random sampling strategy for learning stable classes of motions from limited data. Our representation allows for incrementally predicting possible paths and detecting anomalous events from online trajectories. This representation also supports matching of complex motions with acceleration changes and pauses or stops within a trajectory. We use the proposed approach for classifying and predicting motion trajectories in traffic monitoring domains and test on several data sets. We show that our approach works well on various types of complete and incomplete trajectories from a variety of video data sets with different frame rates.

Multilingual acoustic modeling for speech recognition based on subspace Gaussian Mixture Models

Abstract: Although research has previously been done on multilingual speech recognition, it has been found to be very difficult to improve over separately trained systems. The usual approach has been to use some kind of “universal phone set” that covers multiple languages. We report experiments on a different approach to multilingual speech recognition, in which the phone sets are entirely distinct but the model has parameters not tied to specific states that are shared across languages. We use a model called a “Subspace Gaussian Mixture Model” where states' distributions are Gaussian Mixture Models with a common structure, constrained to lie in a subspace of the total parameter space. The parameters that define this subspace can be shared across languages. We obtain substantial WER improvements with this approach, especially with very small amounts of in-language training data.

The first-passage density of a continuous gaussian process to a general boundary

Abstract: Under mild conditions an explicit expression is obtained for the first-passage density of sample paths of a continuous Gaussian process to a general boundary. Since this expression will usually be hard to compute, an approximation is given which is computationally simple and which is exact in the limit as the boundary becomes increasingly remote. The integral of this approximating density is itself approximated by a simple formula and this also is exact in the limit. A new integral equation is derived for the first-passage density of a continuous Gaussian Markov process. This is used to obtain further approximations.

Vector quantization for the efficient computation of continuous density likelihoods

Abstract: In speech recognition systems based on continuous observation density hidden Markov models, the computation of the state likelihoods is an intensive task. The author presents an efficient method for the computation of the likelihoods defined by weighted sums (mixtures) of Gaussians. This method uses vector quantization of the input feature vector to identify a subset of Gaussian neighbors. It is shown that, under certain conditions, instead of computing the likelihoods of all the Gaussians, one needs to compute the likelihoods of only the Gaussian neighbours. Significant (up to a factor of nine) likelihood computation reductions have been obtained on various data bases, with only a small loss of recognition accuracy. >