Online pattern learning for non-negative convolutive sparse coding accepted for publication
INTERSPEECH 2011, 12th Annual Conference of the International Speech Communication, August 28-31, Florence, Italy
The unsupervised learning of spectro-temporal speech patterns is relevant in a broad range of tasks. Convolutive non-negative matrix factorization (CNMF) and its sparse version, convolutive non-negative sparse coding (CNSC), are powerful, related tools. A particular difficulty of CNMF/CNSC, however, is the high demand on computing power and memory, which can prohibit their application to large scale tasks. In this paper, we propose an online algorithm for CNMF and CNSC, which processes input data piece-by-piece and updates the learned patterns after the processing of each piece by using accumulated sufficient statistics. The online CNSC algorithm remarkably increases converge speed of the CNMF/CNSC pattern learning, thereby enabling its application to large scale tasks. The unsupervised learning of spectro-temporal speech patterns is relevant in a broad range of tasks. Convolutive non-negative matrix factorization (CNMF) and its sparse version, convolutive non-negative sparse coding (CNSC), are powerful, related tools. A particular difficulty of CNMF/CNSC, however, is the high demand on computing power and memory, which can prohibit their application to large scale tasks. In this paper, we propose an online algorithm for CNMF and CNSC, which processes input data piece-by-piece and updates the learned patterns after the processing of each piece by using accumulated sufficient statistics. The online CNSC algorithm remarkably increases converge speed of the CNMF/CNSC pattern learning, thereby enabling its application to large scale tasks.
| Title: | Online pattern learning for non-negative convolutive sparse coding accepted for publication |
| Keywords: | non-negative convolutive sparse coding, online pattern learning |
| Type: | Conference |
| Language: | English |
| City: | Florence |
| Country: | ITALY |
| Date: | August 2011 |
| Department: | Digital Security |
| Eurecom ref: | 3409 |
| Copyright: | © ISCA. Personal use of this material is permitted. The definitive version of this paper was published in INTERSPEECH 2011, 12th Annual Conference of the International Speech Communication, August 28-31, Florence, Italy and is available at : |
| Bibtex: | @inproceedings{EURECOM+3409, year = {2011}, title = {{O}nline pattern learning for non-negative convolutive sparse coding accepted for publication}, author = {{W}ang, {D}ong and {V}ipperla, {R}avichander and {E}vans, {N}icholas}, booktitle = {{INTERSPEECH} 2011, 12th {A}nnual {C}onference of the {I}nternational {S}peech {C}ommunication, {A}ugust 28-31, {F}lorence, {I}taly}, address = {{F}lorence, {ITALY}}, month = {08}, url = {http://www.eurecom.fr/publication/3409} } |
| See also: |
|
Permalink: http://www.eurecom.fr/publication/3409
Search
Recherche
