Lecture

Spatial Continuous Phenomena, Interpolation 1

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture explores deterministic interpolation methods, categorizing them into global approaches, which consider all measurement points in a domain, and local approaches, which only consider a limited number of neighboring points. While global methods are often too simplistic, local methods, such as nearest neighbor and weighted moving average, are preferred despite their subjective nature and tendency to produce arbitrary results with high uncertainty.

In MOOC

Geographical Information Systems 2

The second part of the course deals with spatial analysis methods and georeferenced information representation techniques. In particular, you will learn how to:

Analyze the spatial properties of discrete variables, for example by quantifying spatial autocorrelation;
Work with continuous variables (sampling, interpolation and construction of isolines)
Use digital elevation models (DEMs) and their derivatives (slope, orientation, etc.);
Use geodata superposition techniques;
Produce cartographic docu

Official source

Related concepts (11)

Interpolation

In the mathematical field of numerical analysis, interpolation is a type of estimation, a method of constructing (finding) new data points based on the range of a discrete set of known data points. In engineering and science, one often has a number of data points, obtained by sampling or experimentation, which represent the values of a function for a limited number of values of the independent variable. It is often required to interpolate; that is, estimate the value of that function for an intermediate value of the independent variable.

Multivariate interpolation

In numerical analysis, multivariate interpolation is interpolation on functions of more than one variable (multivariate functions); when the variates are spatial coordinates, it is also known as spatial interpolation. The function to be interpolated is known at given points and the interpolation problem consists of yielding values at arbitrary points . Multivariate interpolation is particularly important in geostatistics, where it is used to create a digital elevation model from a set of points on the Earth's surface (for example, spot heights in a topographic survey or depths in a hydrographic survey).

Polynomial interpolation

In numerical analysis, polynomial interpolation is the interpolation of a given bivariate data set by the polynomial of lowest possible degree that passes through the points of the dataset. Given a set of n + 1 data points , with no two the same, a polynomial function is said to interpolate the data if for each . There is always a unique such polynomial, commonly given by two explicit formulas, the Lagrange polynomials and Newton polynomials.

Bilinear interpolation

In mathematics, bilinear interpolation is a method for interpolating functions of two variables (e.g., x and y) using repeated linear interpolation. It is usually applied to functions sampled on a 2D rectilinear grid, though it can be generalized to functions defined on the vertices of (a mesh of) arbitrary convex quadrilaterals. Bilinear interpolation is performed using linear interpolation first in one direction, and then again in another direction.

Nearest-neighbor interpolation

Nearest-neighbor interpolation (also known as proximal interpolation or, in some contexts, point sampling) is a simple method of multivariate interpolation in one or more dimensions. Interpolation is the problem of approximating the value of a function for a non-given point in some space when given the value of that function in points around (neighboring) that point. The nearest neighbor algorithm selects the value of the nearest point and does not consider the values of neighboring points at all, yielding a piecewise-constant interpolant.

Related lectures (64)

Spatial Continuous Phenomena, Sampling MOOC: Geographical Information Systems 2

Explores sampling procedures for analyzing continuous geographical phenomena and their importance in reducing prediction uncertainty.

Deep Learning Modus Operandi

Explores the benefits of deeper networks in deep learning and the importance of over-parameterization and generalization.

Error Analysis and Interpolation

Explores error analysis and limitations in interpolation on evenly distributed nodes.

Interpolation Methods MOOC: Geographical Information Systems 2

Discusses deterministic interpolation methods, comparing global and local approaches for predicting spatial distributions.

Interpolation de fonction