Abstract
In this work, we study the topic of high-resolution adaptive sampling of a given deterministic and differentiable signal and establish a connection with classic approaches to high-rate quantization. Specifically, we formulate solutions for the task of optimal high-resolution sampling, counterparts of well-known results for high-rate quantization. Our results reveal that the optimal high-resolution sampling structure is determined by the density of the signal-gradient energy, just as the probability density function defines the optimal high-rate quantization form. This paper has three main contributions: The first is establishing a fundamental paradigm bridging the topics of sampling and quantization. The second is a theoretical analysis of nonuniform sampling, for arbitrary signal dimension, relevant to the emerging field of high-resolution signal processing. The third is a new practical approach to nonuniform sampling of one-dimensional signals that enables reconstruction based only on the sampling time points and the signal extrema locations and values. Experiments for signal sampling and coding showed that our method outperforms an optimized tree-structured sampling technique.
Original language | English |
---|---|
Pages (from-to) | 944-966 |
Number of pages | 23 |
Journal | Journal of Mathematical Imaging and Vision |
Volume | 61 |
Issue number | 7 |
DOIs | |
State | Published - 15 Sep 2019 |
Externally published | Yes |
Keywords
- Adaptive sampling
- High-rate quantization
- High-resolution sampling
- Segmentation
ASJC Scopus subject areas
- Statistics and Probability
- Modeling and Simulation
- Condensed Matter Physics
- Computer Vision and Pattern Recognition
- Geometry and Topology
- Applied Mathematics