Unmixing problems in many areas such as hyperspectral imaging and differential optical absorption spectroscopy (DOAS) often require finding sparse nonnegative linear combinations of dictionary elements that match observed data. We show how aspects of these problems, such as misalignment of DOAS references and uncertainty in hyperspectral endmembers, can be modeled by expanding the dictionary wi...

Three traditional ASR parameterizations matched with Hidden Markov Models (HMMs) are compared to humans for speaker-dependent consonant recognition using nonsense syllables degraded by highpass filtering, lowpass filtering, or additive noise. Confusion matrices were determined by recognizing the syllables using different ASR front ends, including Mel-Filter Bank (MFB) energies, Mel-Filtered Cep...

As the number of spectral bands of high spectral resolution data increases, the capability to detect more detailed classes should also increase, and the classification accuracy should increase as well. Often the number of labeled samples used for supervised classification techniques is limited, thus limiting the precision with which class characteristics can be estimated. As the number of spect...

A primary goal of computer experiments is to reconstruct the function given by code via scattered evaluations. Traditional isotropic Gaussian process models suffer from curse dimensionality, when input dimension relatively high limited data points. with additive correlation functions are scalable but they more restrictive as only work for functions. In this work, we consider a projection pursui...

In spatio-temporal wavelet video coding with motion compensation (MC), motion-compensated temporal filtering (MCTF) using wavelet filters is combined with spatial wavelet decomposition, allowing for efficient spatio-temporal decorrelation and full scalability. As an extension to conventional MCTF, we introduce spatial lowpass transition filtering (SLTF) leading to an improved lower frame rate q...

I provide a historic review of the forward and backward projection pursuit algorithms, previously thought to be equivalent, and point out an important difference between the two. In doing so, I correct a small error in the original exploratory projection pursuit paper (Friedman 1987). The implication of the difference is briefly discussed in the context of an application in which projection pur...