TOP
Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminars
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Publishing
Within this website:
External resources:
dblp
Within this website:
External resources:
  • the dblp Computer Science Bibliography


Dagstuhl Seminar 08492

Structured Decompositions and Efficient Algorithms

( Nov 30 – Dec 05, 2008 )

(Click in the middle of the image to enlarge)

Permalink
Please use the following short url to reference this page: https://www.dagstuhl.de/08492

Organizers



Summary

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.

The topic is driven by applications as well as by theoretical questions. Therefore, the aim of this seminar was to bring together a good mixture of scientists with different backgrounds in order to discuss recent progress as well as new challenging perspectives. In particular, it was intended to strengthen the interaction of mathematicians and computer scientists.

The goals of the seminar can be summarized as follows::

  • Initiate communications between different focuses of research.
  • Comparison of methods.
  • Open new areas of applications.
  • Manifest the future direction of the field.

This seminar was regarded by the participants as a very productive and inspiring meeting. Many intense discussions took place throughout the week, and several new cooperations were initiated. Especially, the interactions between computer scientists and applied mathematicians has been extremely fruitful and will certainly be continued in the future. Also, the major future directions of this research area were manifested and initial steps towards solutions undertaken. Concluding, this seminar can be regarded as a milestone in the development of the new, rapidly evolving research area of Structured Decompositions and Efficient Algorithms.

Last, but not least, the success of this seminar is in main parts due to the great scientific atmosphere offered by Schloss Dagstuhl, for which we would like to thank the scientific as well as administrative staff at Schloss Dagstuhl.


Participants
  • Kai Bittner (Qimonda AG - Neubiberg, DE)
  • Alfred M. Bruckstein (Technion - Haifa, IL) [dblp]
  • Stephan Dahlke (Universität Marburg, DE) [dblp]
  • Wolfgang Dahmen (RWTH Aachen, DE)
  • Monika Dörfler (Universität Wien, AT)
  • Martin Ehler (National Institutes of Health - Bethesda, US) [dblp]
  • Michael Elad (Technion - Haifa, IL) [dblp]
  • Yonina C. Eldar (Technion - Haifa, IL)
  • Hans Georg Feichtinger (Universität Wien, AT)
  • Massimo Fornasier (RICAM - Linz, AT)
  • Karlheinz Gröchenig (Universität Wien, AT) [dblp]
  • Onur G. Guleryuz (DoCoMo USA Labs - Palo Alto, US)
  • Bin Han (University of Alberta, CA)
  • Rong-Qing Jia (University of Alberta, CA)
  • Gitta Kutyniok (Universität Osnabrück, DE) [dblp]
  • Peter Maaß (Universität Bremen, DE)
  • Stephane Mallat (Ecole Polytechnique - Palaiseau, FR) [dblp]
  • Erich Novak (Universität Jena, DE) [dblp]
  • Götz E. Pfander (Jacobs University - Bremen, DE)
  • Gerlind Plonka-Hoch (Universität Duisburg-Essen, DE) [dblp]
  • Thorsten Raasch (Universität Marburg, DE)
  • Holger Rauhut (Universität Bonn, DE) [dblp]
  • Zuowei Shen (National University of Singapore, SG)
  • Winfried Sickel (Universität Jena, DE) [dblp]
  • Nir Sochen (Tel Aviv University, IL) [dblp]
  • Gabriele Steidl (Universität Mannheim, DE)
  • Rob Stevenson (University of Amsterdam, NL)
  • Joachim Stöckler (TU Dortmund, DE)
  • Martin J. Strauss (University of Michigan - Ann Arbor, US)
  • Thomas Strohmer (University of California - Davis, US)
  • Anita Tabacco (Polytechnic University of Torino, IT)
  • Vladimir N. Temlyakov (University of South Carolina, US) [dblp]
  • Gerd Teschke (Hochschule Neubrandenburg, DE)
  • Bruno Torresani (University of Marseille, FR)
  • Przemyslaw Wojtaszczyk (University of Warsaw, PL)
  • Michael Zibulevsky (Technion - Haifa, IL)

Related Seminars
  • Dagstuhl Seminar 11051: Sparse Representations and Efficient Sensing of Data (2011-01-30 - 2011-02-04) (Details)

Classification
  • data bases
  • information retrieval
  • data structures
  • algorithms
  • complexity
  • sparse signal representation
  • signal reconstruction
  • signal compression

Keywords
  • sparse signal representation
  • optimal signal reconstruction
  • approximation
  • compression