Biomedical Imaging Group
Logo EPFL
    • Splines Tutorials
    • Splines Art Gallery
    • Wavelets Tutorials
    • Image denoising
    • ERC project: FUN-SP
    • Sparse Processes - Book Preview
    • ERC project: GlobalBioIm
    • The colored revolution of bioimaging
    • Deconvolution
    • SMLM
    • One-World Seminars: Representer theorems
    • A Unifying Representer Theorem
Follow us on Twitter.
Join our Github.
Masquer le formulaire de recherche
Menu
BIOMEDICAL IMAGING GROUP (BIG)
Laboratoire d'imagerie biomédicale (LIB)
  1. School of Engineering STI
  2. Institute IEM
  3.  LIB
  4.  Sampling Analysis
  • Laboratory
    • Laboratory
    • Laboratory
    • People
    • Jobs and Trainees
    • News
    • Events
    • Seminars
    • Resources (intranet)
    • Twitter
  • Research
    • Research
    • Researchs
    • Research Topics
    • Talks, Tutorials, and Reviews
  • Publications
    • Publications
    • Publications
    • Database of Publications
    • Talks, Tutorials, and Reviews
    • EPFL Infoscience
  • Code
    • Code
    • Code
    • Demos
    • Download Algorithms
    • Github
  • Teaching
    • Teaching
    • Teaching
    • Courses
    • Student projects
  • Splines
    • Teaching
    • Teaching
    • Splines Tutorials
    • Splines Art Gallery
    • Wavelets Tutorials
    • Image denoising
  • Sparsity
    • Teaching
    • Teaching
    • ERC project: FUN-SP
    • Sparse Processes - Book Preview
  • Imaging
    • Teaching
    • Teaching
    • ERC project: GlobalBioIm
    • The colored revolution of bioimaging
    • Deconvolution
    • SMLM
  • Machine Learning
    • Teaching
    • Teaching
    • One-World Seminars: Representer theorems
    • A Unifying Representer Theorem

Generalized Sampling: Stability and Performance Analysis

M. Unser, J. Zerubia

IEEE Transactions on Signal Processing, vol. 45, no. 12, pp. 2941-2950, December 1997.


Generalized sampling provides a general mechanism for recovering an unknown input function f(x) ∈ H from the samples of the responses of m linear shift-invariant systems sampled at 1 ⁄ mth the reconstruction rate. The system can be designed to perform a projection of f(x) onto the reconstruction subspace V(φ) = span {φ(x - k)}k ∈ Z; for example, the family of bandlimited signals with φ(x) = sinc(x). This implies that the reconstruction will be perfect when the input signal is included in V(φ): the traditional framework of Papoulis' generalized sampling theory. Otherwise, one recovers a signal approximation f~(x) ∈ V(φ) that is consistent with f(x) in the sense that it produces the same measurements. To characterize the stability of the algorithm, we prove that the dual synthesis functions that appear in the generalized sampling reconstruction formula constitute a Riesz basis of V(φ), and we use the corresponding Riesz bounds to define the condition number of the system. We then use these results to analyze the stability of various instances of interlaced and derivative sampling. Next, we consider the issue of performance, which becomes pertinent once we have extended the applicability of the method to arbitrary input functions, that is, when H is considerably larger than V(φ), and the reconstruction is no longer exact. By deriving general error bounds for projectors, we are able to show that the generalized sampling solution is essentially equivalent to the optimal minimum error approximation (orthogonal projection), which is generally not accessible. We then perform a detailed analysis for the case in which the analysis filters are in L2 and determine all relevant bound constants explicitly. Finally, we use an interlaced sampling example to illustrate these various calculations.

@ARTICLE(http://bigwww.epfl.ch/publications/unser9701.html,
AUTHOR="Unser, M. and Zerubia, J.",
TITLE="Generalized Sampling: {S}tability and Performance Analysis",
JOURNAL="{IEEE} Transactions on Signal Processing",
YEAR="1997",
volume="45",
number="12",
pages="2941--2950",
month="December",
note="")

© 1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
  • Laboratory
  • Research
  • Publications
    • Database of Publications
    • Talks, Tutorials, and Reviews
    • EPFL Infoscience
  • Code
  • Teaching
Logo EPFL, Ecole polytechnique fédérale de Lausanne
Emergencies: +41 21 693 3000 Services and resources Contact Map Webmaster email

Follow EPFL on social media

Follow us on Facebook. Follow us on Twitter. Follow us on Instagram. Follow us on Youtube. Follow us on LinkedIn.
Accessibility Disclaimer Privacy policy

© 2023 EPFL, all rights reserved