Single channel source separation using smooth Nonnegative Matrix Factorization with Markov Random Fields

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents a single channel source separation method based on an extension of Nonnegative Matrix Factorization (NMF) algorithm by smoothing the original posterior probabilities with an additional Markov Random Fields (MRF) structure. Our method is based on the alternative interpretation of NMF with β-divergence as latent variable models. By doing so, we can redefine NMF-based separation procedure as a Bayesian labeling problem where each label stands for the mask for a specific source. This understanding leads us to intervene in the calculation of posterior probabilities, so that the priors from MRF's neighboring structure can smooth out isolated masking values that have different labeling results from their neighbors. Experiments on several dictionary-based source separation tasks show sensible performance gains.

Original languageEnglish (US)
Title of host publication2013 IEEE International Workshop on Machine Learning for Signal Processing - Proceedings of MLSP 2013
DOIs
StatePublished - 2013
Event2013 16th IEEE International Workshop on Machine Learning for Signal Processing, MLSP 2013 - Southampton, United Kingdom
Duration: Sep 22 2013Sep 25 2013

Publication series

NameIEEE International Workshop on Machine Learning for Signal Processing, MLSP
ISSN (Print)2161-0363
ISSN (Electronic)2161-0371

Other

Other2013 16th IEEE International Workshop on Machine Learning for Signal Processing, MLSP 2013
Country/TerritoryUnited Kingdom
CitySouthampton
Period9/22/139/25/13

Keywords

  • Informed Source Separation
  • Markov Random Fields
  • Nonnegative Matrix Factorization
  • Probabilistic Latent Component Analysis
  • Probabilistic Latent Semantic Indexing

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Signal Processing

Fingerprint

Dive into the research topics of 'Single channel source separation using smooth Nonnegative Matrix Factorization with Markov Random Fields'. Together they form a unique fingerprint.

Cite this