Institutions

About Us

Help

Gaeilge
0
1000
Home
Browse
Advanced Search
Search History
Marked List
Statistics
A
A
A
Author(s)
Institution
Publication types
Funder
Year
Limited By:
Author = O'Grady, Paul D.;
8 items found
Sort by
Title
Author
Item type
Date
Institution
Peer review status
Language
Order
Ascending
Descending
25
50
100
per page
Bibtex
CSV
EndNote
RefWorks
RIS
XML
Displaying Results 1  8 of 8 on page 1 of 1
Marked
Mark
Convolutive nonnegative matrix factorisation with a sparseness constraint
(2006)
Pearlmutter, Barak A.; O'Grady, Paul D.
Convolutive nonnegative matrix factorisation with a sparseness constraint
(2006)
Pearlmutter, Barak A.; O'Grady, Paul D.
Abstract:
Discovering a representation which allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can be constructed by nonnegative matrix factorisation (NMF), a method for finding partsbased representations of nonnegative data. We present an extension to NMF that is convolutive and includes a sparseness constraint. In combination with a spectral magnitude transform, this method discovers auditory objects and their associated sparse activation patterns.
http://mural.maynoothuniversity.ie/1375/
Marked
Mark
Discovering Convolutive Speech Phones Using Sparseness and Nonnegativity
(2007)
O'Grady, Paul D.; Pearlmutter, Barak A.
Discovering Convolutive Speech Phones Using Sparseness and Nonnegativity
(2007)
O'Grady, Paul D.; Pearlmutter, Barak A.
Abstract:
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 Nonnegative Matrix Factorisation (NMF), which is a method for finding partsbased representations of nonnegative data. Here, we present a convolutive NMF algorithm that includes a sparseness constraint on the activations and has multiplicative updates. In combination with a spectral magnitude transform of speech, this method extracts speech phones that exhibit sparse activation patterns, which we use in a supervised separation scheme for monophonic mixtures.
http://mural.maynoothuniversity.ie/10244/
Marked
Mark
Discovering Convolutive Speech Phones using Sparseness and NonNegativity Constraints
(2007)
O'Grady, Paul D.; Pearlmutter, Barak A.
Discovering Convolutive Speech Phones using Sparseness and NonNegativity Constraints
(2007)
O'Grady, Paul D.; Pearlmutter, Barak A.
Abstract:
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 Nonnegative Matrix Factorisation (NMF), which is a method for finding partsbased representations of nonnegative data. Here, we present an extension to convolutive NMF that includes a sparseness constraint. In combination with a spectral magnitude transform of speech, this method extracts speech phones (and their associated sparse activation patterns), which we use in a supervised separation scheme for monophonic mixtures.
http://mural.maynoothuniversity.ie/1313/
Marked
Mark
Discovering speech phones using convolutive nonnegative matrix factorisation with a sparseness constraint
(2008)
O'Grady, Paul D.; Pearlmutter, Barak A.
Discovering speech phones using convolutive nonnegative matrix factorisation with a sparseness constraint
(2008)
O'Grady, Paul D.; Pearlmutter, Barak A.
Abstract:
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 Nonnegative Matrix Factorisation (NMF), a method for finding partsbased representations of nonnegative data. Here, we present an extension to convolutive NMF that includes a sparseness constraint, where the resultant algorithm has multiplicative updates and utilises the beta divergence as its reconstruction objective. In combination with a spectral magnitude transform of speech, this method discovers auditory objects that resemble speech phones along with their associated sparse activation patterns. We use these in a supervised separation scheme for monophonic mixtures, finding improved separation performance in comparison to classic convolutive NMF.
http://mural.maynoothuniversity.ie/1697/
Marked
Mark
Discovering speech phones using convolutive nonnegative matrix factorisation with a sparseness constraint
(2008)
O'Grady, Paul D.; Pearlmutter, Barak A.
Discovering speech phones using convolutive nonnegative matrix factorisation with a sparseness constraint
(2008)
O'Grady, Paul D.; Pearlmutter, Barak A.
Abstract:
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 Nonnegative Matrix Factorisation (NMF), a method for finding partsbased representations of nonnegative data. Here, we present an extension to convolutive NMF that includes a sparseness constraint, where the resultant algorithm has multiplicative updates and utilises the beta divergence as its reconstruction objective. In combination with a spectral magnitude transform of speech, this method discovers auditory objects that resemble speech phones along with their associated sparse activation patterns. We use these in a supervised separation scheme for monophonic mixtures, finding improved separation performance in comparison to classic convolutive NMF.
http://mural.maynoothuniversity.ie/1685/
Marked
Mark
HardLOST: Modified kMeans for Oriented Lines
(2004)
O'Grady, Paul D.; Pearlmutter, Barak A.
HardLOST: Modified kMeans for Oriented Lines
(2004)
O'Grady, Paul D.; Pearlmutter, Barak A.
Abstract:
Robust clustering of data into linear subspaces is a common problem. Here we treat clustering into onedimensional 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 a modified kmeans procedure, where line orientations and distances from a line replace the cluster centres and distance from cluster centres of conventional kmeans. This method, combined with a transformation into a sparse domain and an L1norm optimisation, constitutes a blind source separation algorithm for the underdetermined case.
http://mural.maynoothuniversity.ie/2052/
Marked
Mark
Survey of Sparse and NonSparse Methods in Source Separation
(2005)
O'Grady, Paul D.; Pearlmutter, Barak A.; Rickard, Scott T.
Survey of Sparse and NonSparse Methods in Source Separation
(2005)
O'Grady, Paul D.; Pearlmutter, Barak A.; Rickard, Scott T.
Abstract:
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 sources is limited, the problem is called ‘‘blind’. By assuming that the sources can be represented sparsely in a given basis, recent research has demonstrated that solutions to previously problematic blind source separation problems can be obtained. In some cases, solutions are possible to problems intractable by previous nonsparse methods. Indeed, sparse methods provide a powerful approach to the separation of linear mixtures of independent data. This paper surveys the recent arrival of sparse blind source separation methods and the previously existing nonsparse methods, providing insights and appropriate hooks into theliterature a...
http://mural.maynoothuniversity.ie/5502/
Marked
Mark
The LOST Algorithm: finding lines and separating speech mixtures
(2008)
O'Grady, Paul D.; Pearlmutter, Barak A.
The LOST Algorithm: finding lines and separating speech mixtures
(2008)
O'Grady, Paul D.; Pearlmutter, Barak A.
Abstract:
Robust clustering of data into linear subspaces is a frequently encountered problem. Here, we treat clustering of onedimensional 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 procedure similar in spirit to EM. This line finding procedure combined with a transformation into a sparse domain and an L1norm minimisation constitutes a blind source separation algorithm for the separation of instantaneous mixtures with an arbitrary number of mixtures and sources. We perform an extensive investigation on the general separation performance of the LOST algorithm using randomly generated mixtures, and empirically estimate the performance of the algorithm in the presence of noise. Furthermore, we implement a simple scheme whereby the number of sources present in the mixtures can be detected automatically
http://mural.maynoothuniversity.ie/1699/
Displaying Results 1  8 of 8 on page 1 of 1
Bibtex
CSV
EndNote
RefWorks
RIS
XML
Item Type
Book chapter (1)
Conference item (2)
Journal article (5)
Year
2008 (3)
2007 (2)
2006 (1)
2005 (1)
2004 (1)
built by Enovation Solutions