#### Filter Results:

#### Publication Year

2004

2008

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Paul D. O'Grady, Barak A. Pearlmutter, Scott T. Rickard
- Int. J. Imaging Systems and Technology
- 2005

Source separation arises in a variety of signal processing applications, ranging from speech processing to medical image analysis. The separation of a superposition of multiple signals is accomplished by taking into account the structure of the mixing process and by making assumptions about the sources. When the information about the mixing process and… (More)

- Paul D. O'Grady, Barak A. Pearlmutter
- ICA
- 2004

Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind source separation, where the subspaces correspond directly to columns of a mixing matrix. We present an algorithm that identifies these subspaces using an EM procedure , where the… (More)

- Paul D. O'Grady, Barak A. Pearlmutter
- Neurocomputing
- 2008

Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can be constructed by Non-negative Matrix Factorisation (NMF), a method for finding parts-based representations of non-negative data. Here, we present an extension to convolutive NMF… (More)

- Paul D. O'Grady, Barak A. Pearlmutter
- ICA
- 2007

Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can be constructed by Non-negative Matrix Factorisation (NMF). Here, we present a convolutive NMF algorithm that includes a sparseness constraint on the activations and has… (More)

- Paul D. O'Grady, Barak A. Pearlmutter
- EURASIP J. Adv. Sig. Proc.
- 2008

Robust clustering of data into linear subspaces is a frequently encountered problem. Here, we treat clustering of one-dimensional subspaces that cross the origin. This problem arises in blind source separation, where the subspaces correspond directly to columns of a mixing matrix. We propose the LOST algorithm, which identifies such subspaces using a… (More)

- ‹
- 1
- ›