Lecture

Pseudo Observations: Update and Error Analysis

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.

In course

ENV-548: Sensor orientation

Determination of spatial orientation (i.e. position, velocity, attitude) via integration of inertial sensors with satellite positioning. Prerequisite for applications related to remote sensing, environmental monitoring, mobile mapping, robotics, space expl ...

Description

This lecture covers the concept of pseudo observations, their use in updating measurements, and the analysis of errors in the process. The instructor explains the calculation of pseudo observations, their application in updating measurements, and the evaluation of errors in the updated values.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Jan Skaloud

Expertise Satellite positioning, inertial and integrated navigation Sensor orientation and calibration, attitude determination Mobile mapping, airborne laser scanning Adjustment methods, Kalman Filtering Mission Teaching in 3 EPFL sections and 2 faculties, director of ESO lab. Books / Monographs J. Skaloud and M. Cramer, «Data Capture,» in GIS Handbook, W. Kresse and D. Danko, Eds. Springer, 2011. D. Lichti and J. Skaloud, «Registration and Calibration,» in Airborne and terrestrial laser scanning, H.-G. Ma

Official source

Related concepts (18)

Evaluation strategy

In a programming language, an evaluation strategy is a set of rules for evaluating expressions. The term is often used to refer to the more specific notion of a parameter-passing strategy that defines the kind of value that is passed to the function for each parameter (the binding strategy) and whether to evaluate the parameters of a function call, and if so in what order (the evaluation order). The notion of reduction strategy is distinct, although some authors conflate the two terms and the definition of each term is not widely agreed upon.

Socialist calculation debate

The socialist calculation debate, sometimes known as the economic calculation debate, was a discourse on the subject of how a socialist economy would perform economic calculation given the absence of the law of value, money, financial prices for capital goods and private ownership of the means of production. More specifically, the debate was centered on the application of economic planning for the allocation of the means of production as a substitute for capital markets and whether or not such an arrangement would be superior to capitalism in terms of efficiency and productivity.

Calculation in kind

NOTOC Calculation in kind or calculation in-natura is a way of valuating resources and a system of accounting that uses disaggregated physical magnitudes as opposed to a common unit of calculation. As the basis for a socialist economy, it was proposed to replace money and financial calculation. In an in-kind economy products are produced for their use values (their utility) and accounted in physical terms. By contrast, in money-based economies, commodities are produced for their exchange value and accounted in monetary terms.

Short-circuit evaluation

Short-circuit evaluation, minimal evaluation, or McCarthy evaluation (after John McCarthy) is the semantics of some Boolean operators in some programming languages in which the second argument is executed or evaluated only if the first argument does not suffice to determine the value of the expression: when the first argument of the AND function evaluates to false, the overall value must be false; and when the first argument of the OR function evaluates to true, the overall value must be true.

Lazy evaluation

In programming language theory, lazy evaluation, or call-by-need, is an evaluation strategy which delays the evaluation of an expression until its value is needed (non-strict evaluation) and which also avoids repeated evaluations (by the use of sharing). The benefits of lazy evaluation include: The ability to define control flow (structures) as abstractions instead of primitives. The ability to define potentially infinite data structures. This allows for more straightforward implementation of some algorithms.

Related lectures (37)

Propagation of Uncertainty: Estimation and Distribution

Discusses estimation and propagation of uncertainty in random variables and the importance of managing uncertainty in statistical analysis.

Polarisation Qubit: Thought Experiments

Explores thought experiments with polarisation qubits of photons and the concept of superposition in Hilbert space.

Atomic Structure: Charge Density and Electric Field

Explains charge density and electric field distribution within an atom.

Fourier Series: Understanding Coefficients and Periodicity

Explores Fourier series coefficients, periodicity, and series relations.

Force-extension relation of a polymer