University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Convolutive non-negative sparse coding

Wang, W (2008) Convolutive non-negative sparse coding In: IJCNN 2008, 2008-06-01 - 2008-06-08, Hong Kong.

[img] PDF (licence)
SRI_deposit_agreement.pdf
Restricted to Repository staff only

Download (33kB)
[img] PDF
Wang_Convolutive non-negative.pdf
Restricted to Repository staff only
Available under License : See the attached licence file.

Download (237kB)

Abstract

Non-negative sparse coding (NSC) is a powerful technique for low-rank data approximation, and has found several successful applications in signal processing. However, the temporal dependency, which is a vital clue for many realistic signals, has not been taken into account in its conventional model. In this paper, we propose a general framework, i.e., convolutive non-negative sparse coding (CNSC), by considering a convolutive model for the low-rank approximation of the original data. Using this model, we have developed an effective learning algorithm based on the multiplicative adaptation of the reconstruction error function defined by the squared Euclidean distance. The proposed algorithm is applied to the separation of music audio objects in the magnitude spectrum domain. Interesting numerical results are provided to demonstrate its advantages over both the conventional NSC and an existing convolutive coding method.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Authors :
AuthorsEmailORCID
Wang, WUNSPECIFIEDUNSPECIFIED
Date : 2008
Identification Number : https://doi.org/10.1109/IJCNN.2008.4634325
Contributors :
ContributionNameEmailORCID
PublisherIEEE, UNSPECIFIEDUNSPECIFIED
Depositing User : Symplectic Elements
Date Deposited : 28 Mar 2017 14:43
Last Modified : 28 Mar 2017 14:43
URI: http://epubs.surrey.ac.uk/id/eprint/596106

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800