File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.conferencePlace HK -
dc.citation.conferencePlace Hong Kong -
dc.citation.endPage 48 -
dc.citation.startPage 45 -
dc.citation.title 2003 IEEE International Conference on Accoustics, Speech, and Signal Processing -
dc.contributor.author Jang, Gil-Jin -
dc.contributor.author Lee, TW -
dc.contributor.author Oh, YH -
dc.date.accessioned 2023-12-20T06:07:12Z -
dc.date.available 2023-12-20T06:07:12Z -
dc.date.created 2014-12-23 -
dc.date.issued 2003-04-06 -
dc.description.abstract The goal of this work is to extract multiple source signals when only a single channel observation is available. We propose a new signal separation algorithm based on a subspace decomposition. The observation is transformed into subspaces of interest with different sets of basis functions. A flexible model for density estimation allows an accurate modeling of the distributions of the source signals in the subspaces, and we develop a filtering technique using a maximum likelihood (ML) approach to match the observed single channel data with the decomposition. Our experimental results show good separation performance on simulated mixtures of two music signals as well as two voice signals. -
dc.identifier.bibliographicCitation 2003 IEEE International Conference on Accoustics, Speech, and Signal Processing, pp.45 - 48 -
dc.identifier.issn 1520-6149 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/46939 -
dc.language 영어 -
dc.publisher 2003 IEEE International Conference on Accoustics, Speech, and Signal Processing -
dc.title A Subspace Approach to Single Channel Signal Separation Using Maximum Likelihood Weighting Filters -
dc.type Conference Paper -
dc.date.conferenceDate 2003-04-06 -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.