Search Results

Documents authored by Daubechies, Ingrid

Document
DOI: 10.4230/DagSemProc.08492.1
08492 Abstracts Collection – Structured Decompositions and Efficient Algorithms

Authors: Stephan Dahlke, Ingrid Daubechies, Michael Elad, Gitta Kutyniok, and Gerd Teschke

Published in: Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)

Abstract
From 30.11. to 05.12.2008, the Dagstuhl Seminar 08492 ``Structured Decompositions and Efficient Algorithms '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Stephan Dahlke, Ingrid Daubechies, Michael Elad, Gitta Kutyniok, and Gerd Teschke. 08492 Abstracts Collection – Structured Decompositions and Efficient Algorithms. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{dahlke_et_al:DagSemProc.08492.1,
  author =	{Dahlke, Stephan and Daubechies, Ingrid and Elad, Michael and Kutyniok, Gitta and Teschke, Gerd},
  title =	{{08492 Abstracts Collection – Structured Decompositions and Efficient Algorithms}},
  booktitle =	{Structured Decompositions and Efficient Algorithms},
  pages =	{1--18},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{8492},
  editor =	{Stephan Dahlke and Ingrid Daubechies and Michal Elad and Gitta Kutyniok and Gerd Teschke},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.1},
  URN =		{urn:nbn:de:0030-drops-18860},
  doi =		{10.4230/DagSemProc.08492.1},
  annote =	{Keywords: Sparse signal representation, optimal signal reconstruction, approximation, compression}
}
Document
DOI: 10.4230/DagSemProc.08492.2
08492 Executive Summary – Structured Decompositions and Efficient Algorithms

Authors: Stephan Dahlke, Ingrid Daubechies, Michael Elad, Gitta Kutyniok, and Gerd Teschke

Published in: Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)

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.
Cite as

Stephan Dahlke, Ingrid Daubechies, Michael Elad, Gitta Kutyniok, and Gerd Teschke. 08492 Executive Summary – Structured Decompositions and Efficient Algorithms. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{dahlke_et_al:DagSemProc.08492.2,
  author =	{Dahlke, Stephan and Daubechies, Ingrid and Elad, Michael and Kutyniok, Gitta and Teschke, Gerd},
  title =	{{08492 Executive Summary – Structured Decompositions and Efficient Algorithms }},
  booktitle =	{Structured Decompositions and Efficient Algorithms},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{8492},
  editor =	{Stephan Dahlke and Ingrid Daubechies and Michal Elad and Gitta Kutyniok and Gerd Teschke},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.2},
  URN =		{urn:nbn:de:0030-drops-18851},
  doi =		{10.4230/DagSemProc.08492.2},
  annote =	{Keywords: Sparse signal representation, optimal signal reconstruction, approximation, compression}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact