Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Automatic Vectorization: Summary

Description

This lecture covers the three main types of automatic vectorization: polygonization for identifying aggregates of pixels, edge and segment detection, and automatic tracing based on existing vectorial objects.

In MOOC

Geographical Information Systems 1

Official source

Related concepts (16)

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.

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.

Point in polygon

In computational geometry, the point-in-polygon (PIP) problem asks whether a given point in the plane lies inside, outside, or on the boundary of a polygon. It is a special case of point location problems and finds applications in areas that deal with processing geometrical data, such as computer graphics, computer vision, geographic information systems (GIS), motion planning, and computer-aided design (CAD). An early description of the problem in computer graphics shows two common approaches (ray casting and angle summation) in use as early as 1974.

Edge detection

Edge detection includes a variety of mathematical methods that aim at identifying edges, curves in a at which the image brightness changes sharply or, more formally, has discontinuities. The same problem of finding discontinuities in one-dimensional signals is known as step detection and the problem of finding signal discontinuities over time is known as change detection. Edge detection is a fundamental tool in , machine vision and computer vision, particularly in the areas of feature detection and feature extraction.

Related lectures (28)

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.

Automatic Vectorization Techniques MOOC: Geographical Information Systems 1

Explores automation techniques for vectorizing objects using polygonization, edge detection, segment detection, and automatic tracing.

Automatic Vectorization MOOC: Geographical Information Systems 1

Covers automatic vectorization in geographic information systems, including structure detection, polygonization, and automatic tracing.

Topology of Riemann Surfaces

Covers the topology of Riemann surfaces and the concept of triangulation using finitely many triangles.

Discrete Variables: Geometric Properties