Lecture

Level Control: Adjustment and Error Elimination

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-140: Fundamentals of geomatics

Bases de la géomatique pour les ingénieur·e·s civil et en environnement. Présentation des méthodes d'acquisition, de gestion et de représentation des géodonnées. Apprentissage pratique avec des méthodes topométriques et d'imagerie du territoire. ...

Description

This lecture covers the concept of level control, focusing on the adjustment process to eliminate errors. The instructor explains the importance of equal spans and the sighting axis in achieving accurate measurements. Geomatics elements are introduced to detect and correct faults in level adjustment, ensuring the necessary precision before any measurement operation.

In MOOC

Elements of Geomatics

This basic geomatics course introduces the concepts and methods of geodata acquisition, management and representation. It includes the basics of topometry, geodesy and cartography, with an emphasis on computation.

Instructors (2)

Pierre-Yves Gilliéron

He graduated in Surveying Engineering at the Swiss Federal Institute of Technology Lausanne in 1988. He started his professional career in photogrammetry and digital mapping. He joined the Geodetic Eng. Laboratory in 1997 where he worked as research scientist on various navigation and satellite positioning projects. Since 2018 he is deputy head of the section in environmental sciences and engineering at EPFL. -- He was member of the board of the swiss institute of navigation (ION-CH), member of the swiss geodetic committee (SGK) and expert in different committees of the swiss road association (VSS).

Devis Tuia

I come from Ticino and studied in Lausanne, between UNIL and EPFL. After my PhD at UNIL in remote sensing, I was postdoc in Valencia (Spain), Boulder (CO) and EPFL, working on model adaptation and prior knowledge integration in machine learning. In 2014 I became Research Assistant Professor at University of Zurich, where I started the 'multimodal remote sensing' group. In 2017, I joined Wageningen University (NL), where I was professor of the GeoInformation Science and Remote Sensing Laboratory. Since 2020, I joined EPFL Valais, to start the ECEO lab, working at the interface between Earth observation, machine learning and environmental sciences.

Official source

Related concepts (8)

Iron sights

Iron sights are a system of physical alignment markers (usually made of metallic material) used as a sighting device to assist the accurate aiming of ranged weapons (such as a firearm, airgun, crossbow and compound bow), or less commonly as a primitive finder sight for optical telescopes. The earliest sighting device, it relies completely on the viewer's naked eye (mostly under ambient lighting), and is distinctly different to optical sights such as telescopic sights, reflector (reflex) sights, holographic sights and laser sights, which make use of optical manipulation and/or active illumination.

Minimum spanning tree

A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible. More generally, any edge-weighted undirected graph (not necessarily connected) has a minimum spanning forest, which is a union of the minimum spanning trees for its connected components.

Spanning tree

In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G. In general, a graph may have several spanning trees, but a graph that is not connected will not contain a spanning tree (see about spanning forests below). If all of the edges of G are also edges of a spanning tree T of G, then G is a tree and is identical to T (that is, a tree has a unique spanning tree and it is itself).

Reflector sight

A reflector sight or reflex sight is an optical sight that allows the user to look through a partially reflecting glass element and see an illuminated projection of an aiming point or some other image superimposed on the field of view. These sights work on the simple optical principle that anything at the focus of a lens or curved mirror (such as an illuminated reticle) will appear to be sitting in front of the viewer at infinity.

Telescopic sight

A telescopic sight, commonly called a scope informally, is an optical sighting device based on a refracting telescope. It is equipped with some form of a referencing pattern – known as a reticle – mounted in a focally appropriate position in its optical system to provide an accurate point of aim. Telescopic sights are used with all types of systems that require magnification in addition to reliable visual aiming, as opposed to non-magnifying iron sights, reflector (reflex) sights, holographic sights or laser sights, and are most commonly found on long-barrel firearms, particularly rifles, usually via a scope mount.

Related concepts (8)

Iron sights

Minimum spanning tree

Spanning tree

Reflector sight

Telescopic sight