DC Field | Value | Language |
---|---|---|
dc.contributor.author | 천철우 | en_US |
dc.date.accessioned | 2014-12-01T11:47:09Z | - |
dc.date.available | 2014-12-01T11:47:09Z | - |
dc.date.issued | 2011 | en_US |
dc.identifier.other | OAK-2014-00528 | en_US |
dc.identifier.uri | http://postech.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000000897650 | en_US |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/1030 | - |
dc.description | Master | en_US |
dc.description.abstract | Based on the sparse characteristics in representation space, we propose and efficient method for separating speech signals. This paper focuses on the sparse distribution in the time-frequency domain. To get mixing matrix used to obtain original signals, we applied STFT to mixtures for making signals sparser. The scatter plot contains information on the sources with their directions. Angles from base line which are represented in scatter plot are used to determine boundaries of segments. We show how to separate the signals by the matching pursuit method and how to identify the moving sources, eliminating the permutation problem. It is concluded that the proposed method is very simple compared to other methods, so this method has great potential for source separation. | en_US |
dc.language | kor | en_US |
dc.publisher | 포항공과대학교 | en_US |
dc.rights | BY_NC_ND | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/2.0/kr | en_US |
dc.title | Underdetermined Blind Source Separation using Matching Pursuit Method | en_US |
dc.type | Thesis | en_US |
dc.contributor.college | 일반대학원 전자컴퓨터공학부 | en_US |
dc.date.degree | 2011- 2 | en_US |
dc.type.docType | Thesis | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.