Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IEEE Signal Processi...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IEEE Signal Processing Letters
Article . 2012 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
DBLP
Article . 2012
Data sources: DBLP
versions View all 2 versions
addClaim

Integrating Binary Mask Estimation With MRF Priors of Cochleagram for Speech Separation

Authors: Shan Liang; Wenju Liu; Wei Jiang 0030;

Integrating Binary Mask Estimation With MRF Priors of Cochleagram for Speech Separation

Abstract

In present binary masking based speech separation systems, it is almost impossible to obtain the ideal binary mask (IBM). The error in IBM estimation usually results in energy absence in many speech-dominated time-frequency (T-F) units. It violates smooth evolution nature of the speech signal and creates great artefacts. Markov random field (MRF) is one of the promising approaches to model smooth evolution nature which has been extensively applied to image smoothing applications. In this letter, an MRF prior for modeling the spatial dependencies in audio cochleagram is introduced. With this prior model, we further smooth the binary mask based cochleagram and generalize binary mask to ratio mask via a Bayesian framework. Our algorithm is systematically evaluated and compared with other counterpart methods, and it yields substantially better performance, especially on suppressing artefacts.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    7
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
7
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!