117 lines
No EOL
7.8 KiB
Markdown
117 lines
No EOL
7.8 KiB
Markdown
# Findings: sampling patterns, reconstruction methods, and what the ground truth is made of
|
|
|
|
Written 2026-09-12. Refer to [ergodic_sampling_test.py](ergodic_sampling_test.py) for analysis and figures.
|
|
|
|
## What was tested
|
|
|
|
We work on a 64 by 64 grid and keep only 11.8% of the cells (484 samples), placed either on a
|
|
regular grid (every third cell) or in the "ergodic" irregular pattern from the Zhang and Li paper
|
|
(found by minimizing equation 4). From those samples we rebuild the full grid with several methods
|
|
and measure how much the reconstruction differs from the ground truth. The value of merit chosen is
|
|
root-mean-squared error: the typical size of the difference between the reconstruction and the true
|
|
field at a cell, normalized such that 1.0 is 1 standard deviation (lower is better). Each RMS error
|
|
value shown is the average over 25 iterations with a freshly generated ground truth.
|
|
|
|
The reconstruction methods:
|
|
|
|
- **Spline interpolation**: fits a smooth surface through the sample points. This is the
|
|
conventional baseline the paper also compares against.
|
|
- **Compressive sensing**: the paper's method, iterative thresholding that assumes the signal is
|
|
built from a small number of components in some transform. It is run two ways: with a Fourier
|
|
transform (components are sinusoidal waves) and with the symlet wavelet from the paper.
|
|
- **Kriging**: an interpolation method from geostatistics that the paper does not use; it was added
|
|
as a strong reference. It estimates each empty cell as a weighted average of the samples, where
|
|
the weights come from a model of how similar the field tends to be at each separation distance.
|
|
That similarity model is itself estimated from the samples, so kriging adapts to the data: for a
|
|
smooth field it interpolates broadly, and for structureless data it learns that the samples say
|
|
nothing about their neighbors and backs off.
|
|
|
|
The three kinds of ground truth:
|
|
|
|
- **White noise (control)**: every cell is an independent random number. There is no structure at
|
|
all, so nothing between the samples can actually be predicted. This serves as a good control
|
|
because it emphasizes any tendancy of the reconstruction to hallucinate structure based on it's
|
|
assumptions about the data.
|
|
- **Fourier-sparse**: a sum of 12 sinusoidal waves, half of them varying too quickly for the
|
|
regular grid to follow. This is exactly the kind of signal compressive sensing is designed for,
|
|
and matches the paper's own demonstration signal.
|
|
- **Potential-field**: a smooth random map that mimics the paper's gravity survey data.
|
|
|
|
## The numbers
|
|
|
|
Root-mean-square error, mean plus or minus spread over 25 trials (best per column in bold):
|
|
|
|
| method | white noise (control) | Fourier-sparse | potential-field |
|
|
|---|---|---|---|
|
|
| regular + spline | 1.220 ± 0.014 | 0.503 ± 0.074 | 0.067 ± 0.011 |
|
|
| regular + compressive sensing (Fourier) | 1.077 ± 0.010 | 0.117 ± 0.134 | 0.848 ± 0.140 |
|
|
| regular + kriging | 1.014 ± 0.006 | 0.475 ± 0.072 | **0.058 ± 0.010** |
|
|
| ergodic + spline | 1.417 ± 0.035 | 0.689 ± 0.107 | 0.150 ± 0.023 |
|
|
| ergodic + compressive sensing (Fourier) | 1.059 ± 0.008 | **0.000 ± 0.000** | 0.242 ± 0.046 |
|
|
| ergodic + compressive sensing (symlet) | 1.286 ± 0.031 | 0.725 ± 0.124 | 0.136 ± 0.024 |
|
|
| ergodic + kriging | **1.000 ± 0.007** | 0.563 ± 0.086 | 0.092 ± 0.016 |
|
|
|
|
## What was found
|
|
|
|
**1. On truly random ground truth, ergodic + kriging came out best of everything we tested.**
|
|
When the field has no structure, the smartest possible move is to admit it: output zero at every
|
|
unsampled cell, which scores 0.94 on our scale. Ergodic + kriging lands essentially on that mark
|
|
(1.000) because its similarity model, estimated from the samples, correctly concludes the samples
|
|
carry no information about their neighbors, so it barely interpolates at all. Every method with a
|
|
built-in belief about structure does worse than the "give up" answer: spline draws smooth hills
|
|
that do not exist (1.22 on the regular grid, 1.42 on the ergodic pattern) and the symlet version
|
|
paints in wavelet texture (1.29). That gap, up to 50% worse than guessing zero, is the cost of
|
|
hallucinated structure made concrete.
|
|
|
|
**2. On the potential-field ground truth, the plain regular grid is the best pattern.** This
|
|
field is smooth enough that every third cell is dense enough sampling, the situation classical
|
|
sampling theory covers. There the regular grid wins simply on coverage: its farthest cell from
|
|
any sample is 1.41 cells away, while the ergodic pattern, being irregular, leaves gaps up to 3
|
|
cells. The ergodic pattern costs about 1.5 times the error here. That cost is the
|
|
premium for insurance that pays out on the Fourier-sparse truth, where half the signal varies too
|
|
fast for the regular grid: there the regular grid garbles the fast waves into false slow ones
|
|
(this is aliasing, and no processing can undo it). THIS CASE IS MOSTLY THEORETICAL: If we knew
|
|
that there were no small-scale variation to capture with our sparse sampling method
|
|
|
|
**3. Matching the reconstruction method to how the ground truth was generated wins, as expected.**
|
|
Each column of the table is won by the method whose built-in assumption mirrors the generator:
|
|
kriging on the smooth random fields (its fitted similarity model actually recovers the
|
|
generator's parameters exactly), Fourier compressive sensing on the sum-of-waves signal, and
|
|
kriging again on noise because it alone can gracefully back off to predicting zero. Mismatches
|
|
fail hard: Fourier compressive sensing assumes a few dominant waves and scores 0.848 on the
|
|
smooth field, and the symlet version, which assumes the wrong kind of building block for a
|
|
sum-of-waves signal, reaches only 0.725 where the Fourier version is exact.
|
|
|
|
## The bigger picture
|
|
|
|
Choosing how to reconstruct in essence is a choice about how much you trust what you know about
|
|
the underlying signall. A correct guess about signal structure rewards all the way up to perfect
|
|
recovery with minimal samples when the assumption is exactly right. The same choices punish wrong
|
|
assumptions: a method that expects structure will manufacture it out of nothing, and on our
|
|
structureless control every such method lost to simply predicting zero, with kriging only slightly
|
|
worse than predicting zero. The paper's ergodic pattern is best understood in this light: it is
|
|
deliberately designed without any knowledge of the signal, as insurance that keeps every option open.
|
|
Alongside it, our error-prediction experiment (plt3a and plt3b) shows that a map of the expected
|
|
error at every cell can be computed from nothing but the sample values and their locations, and
|
|
it tracks the actual error pattern closely (correlation 0.85 to 0.88 against the error measured
|
|
over 128 independent trials).
|
|
|
|
## Potential future work
|
|
|
|
Since we have shown that for cases were no small scale variation exists to capture, sparse sampling
|
|
wins due to optimal coverage; we know that in such a case Ergodic sampling would still be superior
|
|
if we knew at what distance scale local variation existed and further reduced our sample count.
|
|
|
|
I propose the following:
|
|
|
|
Develop a sampling procedure which optimizes for collection cost for several collection strategies
|
|
- Where travel is the dominant cost
|
|
- This applies to survey type collection where a vehicle carrying a sensor is used
|
|
- Compute an optimal survey path which leverages Ergodic sensing methods but reframed as a
|
|
densely sampled path; chosing the path dynamically as sensed signal spatial scales are discovered.
|
|
|
|
- Where number of sample locations are the dominant cost
|
|
- This applies to sattelite-pointing type collection or ground-station collection
|
|
- Compute an optimal survey path which leverages Ergodic sensing methods, but is scale-adaptive.
|
|
Rather than having coverage sparsity as a prior, this would discover the required coverage
|
|
dynamically to attain a certain reconstruction confidence metric. |