On-line nonlinear sparse approximation of functions

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 956-960

  Honeine, Paul ^a   Richard, Cédric ^a   Bermudez, José Carlos ^b  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^b FEDERAL UNIVERSITY OF SANTA CATARINA   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM; SPARSE APPROXIMATIONS;

APPROXIMATION THEORY; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; CYBERNETICS; FINANCIAL DATA PROCESSING; INFORMATION THEORY; POLYNOMIAL APPROXIMATION; TECHNICAL PRESENTATIONS;

PRINCIPAL COMPONENT ANALYSIS;

EID: 51649099764     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557347     Document Type: Conference Paper

References (12)

1. N. Aronszajn, "Theory of reproducing kernels," vol. 68, pp. 337-404, 1950.
2. G. Kimeldorf and G. Wahba, "Some results on tchebycheffian spline functions," Journal of Mathematical Analysis and Applications, vol. 33, pp. 82-95, 1971.
3. T. Dodd and R. Harrison, "Iterative solution to approximation in reproducing kernel hilbert spaces," in Proceedings of the IFAC World Congress on Automatic Control, Barcelona, Spain, 2002.
4. Y. Engel, S. Mannor, and R. Meir, "The kernel recursive least squares algorithm," IEEE Transactions on Signal Processing, vol. 52, no. 8, pp. 2275-2285, 2004.
5. C. Richard, J. C. M. Bermudez, and P. Honeine, "Nonlinear kernel-based adaptive filtering with order controlled by a coherence criterion," submitted to IEEE Transactions on Signal Processing, 2007.
6. A. C. Gilbert, S. Muthukrishnan, and M. J. Strauss, "Approximation of functions over redundant dictionaries using coherence," in Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms {SODA'OS). Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2003, pp. 243-252.
7. J. A. Tropp, "Greed is good: algorithmic results for sparse approximation," IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2231-2242, 2004.
8. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition," IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 2845-2862, March 2001.
9. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Transactions on Information Theory, vol. 49, no. 12, pp. 3320-3325, 2003.
10. L. Hoegaerts, "Eigenspace methods and subset selection in kernel based learning," PhD thesis, Faculty of Engineering, K.ULeuven, Leuven, Belgium, Jun. 2005.
11. B. Schölkopf, A. Smola, and K. MüIIer, "Nonlinear component analysis as a kernel eigenvalue problem," Neural Computation, vol. 10, no. 5, pp. 1299-1319, 1998.
12. A. H. Sayed, Fundamentals of adaptive filtering. NY, USA: Wiley-IEEE Press, June 2003.