• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
搜索

Author:

Zhao, Weijie (Zhao, Weijie.) | Ren, Mingrong (Ren, Mingrong.) | Zhang, Yating (Zhang, Yating.)

Indexed by:

CPCI-S

Abstract:

Sparse component analysis is a signal processing method based on sparse representation. It is widely used in underdetermined blind signal separation. When estimating the mixing matrix, the aliasing level of the mixed-signal scatter at the origin center is too high, and it will affect the accuracy of estimating the mixing matrix. In this paper, in order to overcome the shortcoming, a new "Vanish Circle K-means" clustering algorithm that can estimate the mixing matrix more effectively is proposed, combined with time-frequency analysis to achieve the instantaneous linear aliasing blind separation signals and obtain a good separation effect.

Keyword:

Underdetermined Time-frequency analysis blind separation Vanish circle K-means Sparse component analysis

Author Community:

  • [ 1 ] [Zhao, Weijie]Beijing Univ Technol, Coll Elect Informat & Control Engn, Beijing, Peoples R China
  • [ 2 ] [Ren, Mingrong]Beijing Univ Technol, Coll Elect Informat & Control Engn, Beijing, Peoples R China
  • [ 3 ] [Zhang, Yating]Beijing Univ Technol, Coll Elect Informat & Control Engn, Beijing, Peoples R China

Reprint Author's Address:

  • [Zhao, Weijie]Beijing Univ Technol, Coll Elect Informat & Control Engn, Beijing, Peoples R China

Show more details

Related Keywords:

Source :

PROCEEDINGS OF 2010 INTERNATIONAL SYMPOSIUM ON IMAGE ANALYSIS AND SIGNAL PROCESSING

Year: 2010

Page: 430-433

Language: English

Cited Count:

WoS CC Cited Count: 0

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 1

Affiliated Colleges:

Online/Total:742/5291505
Address:BJUT Library(100 Pingleyuan,Chaoyang District,Beijing 100124, China Post Code:100124) Contact Us:010-67392185
Copyright:BJUT Library Technical Support:Beijing Aegean Software Co., Ltd.