A Pursuit Architecture for Signal Analysis
One of the main goals of signal analysis has been the development of signal representations in terms of elementary waveforms or atoms. Dictionaries are collections of atoms with common parameterized features. We present a pursuit methodology to optimize redundant atomic representations from several dictionaries. The architecture exploits notions of modularity and coadaptation between atoms, in order to evolve an optimized signal representation. Modularity is modeled by dictionaries. Coadaptation is promoted by introducing self-adaptive, gene expression weights associated with the genetic representation of a signal in a proper dictionary space. The proposed model is tested on atomic pattern recognition problems.
KeywordsWavelet Packet Signal Representation Signal Approximation Atomic Decomposition Synthetic Signal
Unable to display preview. Download preview PDF.
- 2.S.S. Chen. Basis Pursuit. PhD thesis, Stanford University, November 1995.Google Scholar
- 6.A.F. da Silva. Genetic algorithms for component analysis. In D. Whitley et. al., editor, Proceedings of the 2000 Genetic and Evolutionary Computation Conference, GECCO-2000, Las Vegas, Nevada, pages 243–250. Morgan Kaufmann Publishers, San Francisco, 2000.Google Scholar
- 7.A.F. da Silva. Evolutionary time-frequency analysis. In A. Zalzala et. al., editor, Proceedings of the 2000 Congress on Evolutionary Computation, CEC 2000, La Jolla, California, pages 1102–1109. IEEE Press, 2000.Google Scholar
- 8.H. Kargupta. The genetic code and the genome representation. In Annie S. Wu, editor, Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, pages 179–184, 2000.Google Scholar
- 9.M. Wall. GAlib: A C++ Library of Genetic Algorithm Components. Mechanical Engineering Department, Massachusetts Institute of Technology, August 1996.Google Scholar