Signal representation,uncertainty principles and localization measures |
| |
Authors: | Peter Maass Chen Sagiv Hans-Georg Stark Bruno Torresani |
| |
Institution: | 1. Fachbereich 3, Universit?t Bremen, 28334, Bremen, Germany 2. SagivTech, Hasadna st. 8, P.O.Box 2622, Ra’anana, 4365104, Israel 3. Fachhochschule Aschaffenburg, Mathematik/Informatik/Technomathematik, 63743, Aschaffenburg, Germany 4. I2M, Centre de Mathématique et Informatique, Aix-Marseille Université, 13453, Marseille, France
|
| |
Abstract: | The following collection of articles addresses one of the most basic problems in signal and image processing, namly the search for function systems (basis, frames, dictionaries) which allow efficient representations of certain classes of signals/images. Such representations are essential for decomposition and synthesis of signals, hence they are at the core of almost any application (coding, compression, pattern matching, feature extraction, classification, etc.) in this field. Accordingly, this is one of the best-studied topics in data analysis and a multitude of different concepts also addressing discretization/algorithmic issues has been investigated in this context. The starting point for reviving activities in this field was a recently rediscovered inconsistency in the concept of constructing optimally localized basis functions by minimizing uncertainty principles. In this short introductory note, we shortly sketch the basic dilemma, which was the starting point for this research approximately three years ago. However, the subsequent investigations presented in this collection of papers cover a much wider range of more general localization measures, discretization concepts as well as discussing algorithmic efficiency and stability. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|