|
|
|
Filtering noisy chaotic signal via sparse representation based on random frame dictionary |
| Xie Zong-Bo(谢宗伯) and Feng Jiu-Chao(冯久超)† |
| School of Electronic and Information Engineering, South China University of Technology, Guangzhou 510641, China |
|
|
|
|
Abstract The denoising problem of impure chaotic signals is addressed in this paper. A method based on sparse representation is proposed, in which the random frame dictionary is generated by a chaotic random search algorithm. The numerical simulation shows the proposed algorithm outperforms those recently reported alternative denoising methods.
|
Received: 05 September 2009
Revised: 27 September 2009
Accepted manuscript online:
|
|
PACS:
|
05.45.Xt
|
(Synchronization; coupled oscillators)
|
| |
05.45.Vx
|
(Communication using chaos)
|
| |
02.10.Yn
|
(Matrix theory)
|
|
| Fund: Project supported by the National
Natural Science Foundation of China (Grant No.~60872123), the Joint
Fund of the National Natural Science Foundation and the Guangdong
Provincial Natural Science Foundation (Grant No.~U0835001), and by
the Doctorate Foundation of South China University of Technology,
China. |
Cite this article:
Xie Zong-Bo(谢宗伯) and Feng Jiu-Chao(冯久超) Filtering noisy chaotic signal via sparse representation based on random frame dictionary 2010 Chin. Phys. B 19 050510
|
| [1] |
Ambika G and Amritkar R E 2009 Phys. Rev. E 79 056206
|
| [2] |
Han C Z, Liu D and Ren H P 2008 Chin. Phys. B 17 1202
|
| [3] |
Fu J, Ma T D and Zhang H G 2008 Chin. Phys. B 17 4407
|
| [4] |
Tian Y C 1997 Acta Phys. Sin. 46 442 (in Chinese)
|
| [5] |
Chen J R, Jiao L C, Wu J S and Wang X H 2009 Chin. Phys. Lett. 26 060505
|
| [6] |
Wang J, Tan Z Y, Ma X K and Gao J F 2009 Chin. Phys. Lett. 26 050503
|
| [7] |
Tar A, Gandhi G and Cserey G 2009 Int. J. Circuit Theory and Appl. 37 529
|
| [8] |
Farmer J D and Sidorowich J J 1991 Physica D 47 373
|
| [9] |
Feng J C and Xie S L 2006 Proc. 2006 IEEE Int. Symp. on Circuits and Systems, Island of Kos Greece, 21--24 May, 2006 p4
|
| [10] |
Hammel K M 1990 Phys. Lett. A 148 421
|
| [11] |
Gan J C and Xiao X C 2004 Chin. Phys. 13 312
|
| [12] |
Xie Z B and Feng J C 2009 Chin. Phys. Lett. 26 030501
|
| [13] |
Schreiber T and Kaplan D T 1996 Phys. Rev. E 53 4326
|
| [14] |
Candes E J and Donoho D L 2006 Comm. Pure Appl. Math. 57 219
|
| [15] |
Chen S S, Donoho D L and Saunders M A 2001 SIAM Review 43 129
|
| [16] |
Mallat S and Le Pennec E 2005 IEEE Trans. Image Process. 14 423
|
| [17] |
Akcakaya M and Tarokh V 2007 IEEE Signal Process. Lett. 14 777
|
| [18] |
Omlor L and Giese M A 2007 Neurocomputing 70 1938
|
| [19] |
Tropp J A 2004 IEEE Trans. Inf. Theory 50 2231
|
| No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|
