License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-18851
URL: http://drops.dagstuhl.de/opus/volltexte/2009/1885/
Go to the corresponding Portal


Dahlke, Stephan ; Daubechies, Ingrid ; Elad, Michael ; Kutyniok, Gitta ; Teschke, Gerd

08492 Executive Summary -- Structured Decompositions and Efficient Algorithms

pdf-format:
Document 1.pdf (99 KB)


Abstract

New emerging technologies such as high-precision sensors or new MRI machines drive us towards a challenging quest for new, more effective, and more daring mathematical models and algorithms. Therefore, in the last few years researchers have started to investigate different methods to efficiently represent or extract relevant information from complex, high dimensional and/or multimodal data. Efficiently in this context means a representation that is linked to the features or characteristics of interest, thereby typically providing a sparse expansion of such. Besides the construction of new and advanced ansatz systems the central question is how to design algorithms that are able to treat complex and high dimensional data and that efficiently perform a suitable approximation of the signal. One of the main challenges is to design new sparse approximation algorithms that would ideally combine, with an adjustable tradeoff, two properties: a provably good `quality' of the resulting decomposition under mild assumptions on the analyzed sparse signal, and numerically efficient design.

BibTeX - Entry

@InProceedings{dahlke_et_al:DSP:2009:1885,
  author =	{Stephan Dahlke and Ingrid Daubechies and Michael Elad and Gitta Kutyniok and Gerd Teschke},
  title =	{08492 Executive Summary -- Structured Decompositions and Efficient Algorithms },
  booktitle =	{Structured Decompositions and Efficient Algorithms},
  year =	{2009},
  editor =	{Stephan Dahlke and Ingrid Daubechies and Michal Elad and Gitta Kutyniok and Gerd Teschke},
  number =	{08492},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/1885},
  annote =	{Keywords: Sparse signal representation, optimal signal reconstruction, approximation, compression}
}

Keywords: Sparse signal representation, optimal signal reconstruction, approximation, compression
Seminar: 08492 - Structured Decompositions and Efficient Algorithms
Issue Date: 2009
Date of publication: 24.02.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI