Spatial interpolation before or after data processing

Click For Summary
SUMMARY

The discussion centers on the optimal timing for spatial interpolation in relation to data processing. Two primary options are presented: performing interpolation on original values before processing or on processed values afterward. The consensus indicates that if original values are known exactly and can be accurately interpolated, the first option is preferable. Conversely, if the original values are approximate and the processing function introduces smoothing, the second option is more effective.

PREREQUISITES
  • Understanding of spatial interpolation techniques
  • Familiarity with 2D and 3D coordinate systems
  • Knowledge of function approximation methods
  • Experience with data processing algorithms
NEXT STEPS
  • Research spatial interpolation methods such as Kriging and Inverse Distance Weighting
  • Explore the implications of data smoothing in algorithms
  • Learn about function approximation techniques in numerical analysis
  • Investigate the impact of measurement accuracy on interpolation outcomes
USEFUL FOR

Data scientists, geospatial analysts, and researchers involved in numerical modeling and data processing who require insights into the timing of spatial interpolation in their workflows.

Oliver-BfS
Messages
6
Reaction score
0
TL;DR
Shall spatial interpolation better be performed on original values or on processed values?
Let a set of values at several discrete points in 2D or 3D space be given. These values will be processed by an algorithm. At the end, processed values need not be known at the original locations but at grid points. Therefore, spatial interpolation needs to be applied.

Is there a general recommendation if spatial interpolation should better be performed on the original values before processing the values or on the processed values?
 
Physics news on Phys.org
Can I restate the question to check understanding?

You have a set of coordinates ## x_i ## in a domain ## X ## and corresponding values ## f(x_i) ## in a codomain ## F ##. You have an operation ## g ## that acts over ## F ##. You want to approximate the values ## g(f(x)) ## over a different set of coordinates ## x_j ##. You are considering 2 options:
  1. approximate ## f(x_j) ## with an interpolation function ## q(f(x_i)) ## and calculate ## g(q(f(x_i))) ##;
  2. calculate ## g(f(x_i)) ## and approximate ## g(f(x_j)) ## with an interpolation function ## q'(g(f(x_i)))##.
I don't think there is a general preference: if ## f(x_i) ## are known exactly and can be accurately interpolated - in the extreme, let's say they are linear - then ## f(x_j) = q(f(x_i)) ## so you can't do better than option 1. If on the other hand ## f(x_i) ## are only known approximately and ## g ## applies some smoothing by acting over a subset of points then option 2 is probably better.
 
Your understanding of the question is correct.

The values cannot be interpolated accurately because ##f(x_i)## is only known at the coordinates ##x_i##. There is no knowledge of the underlying function ##f##. ##f(x_i)## are measured values.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
11K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 7 ·
Replies
7
Views
4K