Guided Signal Reconstruction Theory
arXiv:1702.00852
Abstract
An axiomatic approach to signal reconstruction is formulated, involving a sample consistent set and a guiding set, describing desired reconstructions. New frame-less reconstruction methods are proposed, based on a novel concept of a reconstruction set, defined as a shortest pathway between the sample consistent set and the guiding set. Existence and uniqueness of the reconstruction set are investigated in a Hilbert space, where the guiding set is a closed subspace and the sample consistent set is a closed plane, formed by a sampling subspace. Connections to earlier known consistent, generalized, and regularized reconstructions are clarified. New stability and reconstruction error bounds are derived, using the largest nontrivial angle between the sampling and guiding subspaces. Conjugate gradient iterative reconstruction algorithms are proposed and illustrated numerically for image magnification.
20 pages, 11 figures
References in corpus (6)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Discrete Signal Processing on Graphs: Sampling Theory
- Signals on Graphs: Uncertainty Principle and Sampling
- Active Semi-Supervised Learning Using Sampling Theory for Graph Signals
- Localized Iterative Methods for Interpolation in Graph Structured Data
- Guided Signal Reconstruction with Application to Image Magnification