Lecture

Automatic Vectorization

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 introduces automatic vectorization in the context of geographic information systems, covering topics such as the detection of structures from images, polygonization, and the use of existing elements as guides for automatic tracing. Practical examples include projects involving editing layers, preferences, vector extensions, raster databases, and internet databases.

In MOOC

Geographical Information Systems 1

In this first part of the course, we will focus on the digitization and the storage of geodata. In particular, you will learn:

To characterize spatial objects and/or phenomena (territory modeling) with respect to their position in space (through coordinate systems, projections, and spatial relationships) and according to their intrinsic nature (object/vector mode vs. Image/raster mode);
About the different means used to acquire spatial data; including direct measurement, georeferencing images, digitiza

Official source

Quiz

Related concepts (32)

Polygon

In geometry, a polygon (ˈpɒlɪɡɒn) is a plane figure made up of line segments connected to form a closed polygonal chain. The segments of a closed polygonal chain are called its edges or sides. The points where two edges meet are the polygon's vertices or corners. An n-gon is a polygon with n sides; for example, a triangle is a 3-gon. A simple polygon is one which does not intersect itself. More precisely, the only allowed intersections among the line segments that make up the polygon are the shared endpoints of consecutive segments in the polygonal chain.

Geographic data and information

Geographic data and information is defined in the ISO/TC 211 series of standards as data and information having an implicit or explicit association with a location relative to Earth (a geographic location or geographic position). It is also called geospatial data and information, georeferenced data and information, as well as geodata and geoinformation. Approximately 90% of government sourced data has a location component. Location information (known by the many names mentioned here) is stored in a geographic information system (GIS).

Regular polygon

In Euclidean geometry, a regular polygon is a polygon that is direct equiangular (all angles are equal in measure) and equilateral (all sides have the same length). Regular polygons may be either convex, star or skew. In the limit, a sequence of regular polygons with an increasing number of sides approximates a circle, if the perimeter or area is fixed, or a regular apeirogon (effectively a straight line), if the edge length is fixed. These properties apply to all regular polygons, whether convex or star.

Star polygon

In geometry, a star polygon is a type of non-convex polygon. Regular star polygons have been studied in depth; while star polygons in general appear not to have been formally defined, certain notable ones can arise through truncation operations on regular simple and star polygons. Branko Grünbaum identified two primary definitions used by Johannes Kepler, one being the regular star polygons with intersecting edges that don't generate new vertices, and the second being simple isotoxal concave polygons.

Polygonal chain

In geometry, a polygonal chain is a connected series of line segments. More formally, a polygonal chain P is a curve specified by a sequence of points called its vertices. The curve itself consists of the line segments connecting the consecutive vertices. A simple polygonal chain is one in which only consecutive segments intersect and only at their endpoints. A closed polygonal chain is one in which the first vertex coincides with the last one, or, alternatively, the first and the last vertices are also connected by a line segment.

Related lectures (64)

Discrete variables: Geometric properties MOOC: Geographical Information Systems 2

Covers geometric properties of discrete variables in GIS, including location, size, and shape.

Automatic Vectorization: Principles and Applications MOOC: Geographical Information Systems 1

Covers the potential and limits of automatic vectorization techniques for digitizing objects from scanned documents or images.

Digital Urban History: QGIS Practical Session

Covers the practical use of QGIS for spatial data analysis and visualization, including georeferencing historical maps and manipulating vector data.

Vector-Vector Data Layer Interactions MOOC: Geographical Information Systems 2

Covers interactions between vector layers in GIS, including geometric properties, spatial arrangement, autocorrelation, altitude models, and SQL equivalents.

Automatic Vectorization Techniques MOOC: Geographical Information Systems 1