#### Filter Results:

- Full text PDF available (91)

#### Publication Year

1983

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Cell Type

#### Key Phrases

#### Method

Learn More

- Christopher J. Rozell, Don H. Johnson, Richard G. Baraniuk, Bruno A. Olshausen
- Neural Computation
- 2008

While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We describe a locally competitive algorithm (LCA) that solves a collection of sparse coding principles minimizing a weighted combination of mean-squared error and a coefficient cost… (More)

- Douglas L. Jones, Richard Baraniuk, +9 authors Melissa Selik
- 2008

- Don H. Johnson
- Journal of Computational Neuroscience
- 1996

In most neural systems, neurons communicate via sequences of action potentials. Contemporary models assume that the action potentials' times of occurrence rather than their waveforms convey information. The mathematical tool for describing sequences of events occurring in time and/or space is the theory of point processes. Using this theory, we show that… (More)

We define a new distance measure the resistor-average distance between two probability distributions that is closely related to the Kullback-Leibler distance. While the Kullback-Leibler distance is asymmetric in the two distributions, the resistor-average distance is not. It arises from geometric considerations similar to those used to derive the Chernoff… (More)

- Don H. Johnson, Charlotte M. Gruner
- Journal of Computational Neuroscience
- 1998

We describe an approach to analyzing single- and multiunit (ensemble) discharge patterns based on information-theoretic distance measures and on empirical theories derived from work in universal signal processing. In this approach, we quantify the difference between response patterns, whether time-varying or not, using information-theoretic distance… (More)

Introduction The fast FOURIER transform (FFT) has become well known as a very efficient algorithm for calculating the discrete FOURIER transform (D F T)-a formula for evaluating the N FOURIER coefficients from a sequence of N numbers. The DFT is used in many disciplines to obtain the spectrum or frequency content of a signal and to facilitate the… (More)

- Christopher J. Rozell, Don H. Johnson
- Neurocomputing
- 2005

Mutual information enjoys wide use in the computational neuroscience community for analyzing spiking neural systems. Its direct calculation is difficult because estimating the joint stimulus-response distribution requires a prohibitive amount of data. Consequently, several techniques have appeared for bounding mutual information that rely on less data. We… (More)

- Clayton D. Scott, David W. Scott, +4 authors Mike Orchard
- 2004

Dyadic Decision Trees This thesis introduces a new family of classifiers called dyadic decision trees (DDTs) and develops their theoretical properties within the framework of statistical learning theory. First, we show that DDTs achieve optimal rates of convergence for a broad range of classification problems and are adaptive in three important respects:… (More)

- Douglas B. Williams, Don H. Johnson
- IEEE Trans. Signal Processing
- 1993

- Douglas B. Williams, Don H. Johnson
- IEEE Trans. Acoustics, Speech, and Signal…
- 1990