Advertisement

A Pursuit Architecture for Signal Analysis

  • Adelino R. da Ferreira Silva
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2037)

Abstract

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.

Keywords

Wavelet Packet Signal Representation Signal Approximation Atomic Decomposition Synthetic Signal 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Stéphane Mallat. A Wavelet Tour of Signal Processing. Academic Press, San Diego, 1998.zbMATHGoogle Scholar
  2. 2.
    S.S. Chen. Basis Pursuit. PhD thesis, Stanford University, November 1995.Google Scholar
  3. 3.
    G.M. Davis, S. Mallat, and M. Avelanedo. Greedy adaptive approximations. J. Constr. Approx., 13:57–98, 1997.CrossRefzbMATHGoogle Scholar
  4. 4.
    Thomas Bäck. Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press, New York, 1996.zbMATHGoogle Scholar
  5. 5.
    H.-G. Beyer. Towards a theory of evolution strategies: Self-adaptation. Evolutionary Computation, 3(3):311–347, 1996.CrossRefGoogle Scholar
  6. 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. 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. 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. 9.
    M. Wall. GAlib: A C++ Library of Genetic Algorithm Components. Mechanical Engineering Department, Massachusetts Institute of Technology, August 1996.Google Scholar
  10. 10.
    K. Chellapilla. Combining mutation operators in evolutionary programming. IEEE Trans. on Evolutionary Computation, 2(3):91–96, September 1998.CrossRefGoogle Scholar
  11. 11.
    A.F. da Silva. Evolutionary wavelet bases in signal spaces. In S. Cagnoni et al., editor, Real-World Applications of Evolutionary Computing, volume 1803 of Lecture Notes in Computer Science, pages 44–53. Springer-Verlag, 2000.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Adelino R. da Ferreira Silva
    • 1
  1. 1.Dept. de Eng. ElectrotécnicaUniversidade Nova de LisboaMonte de CaparicaPortugal

Personalised recommendations