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

Lecture

Image Processing I: Segmentation and Thresholding

In course

MICRO-511: Image processing I

Introduction to the basic techniques of image processing. Introduction to the development of image-processing software and to prototyping using Jupyter notebooks. Application to real-world examples in industrial vision and biomedical imaging. ...

Description

This lecture covers the concepts of image segmentation and thresholding in image processing. It starts with an overview of filterbank analysis and DCT filters, leading to the discussion of segmentation techniques such as amplitude thresholding, variational thresholding, and statistical thresholding. The lecture delves into the challenges of image segmentation, emphasizing the importance of homogeneity and connectivity criteria. It explores the principles behind variational thresholding and statistical thresholding, highlighting the process of finding the most likely segmentation model. Additionally, the lecture addresses texture segmentation by vector quantization and binary-segmentation techniques, including distance measures and connectivity considerations. The session concludes with a detailed explanation of connected-component labeling and blob coloring algorithms for image analysis.

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

Instructors (2)

Michaël Unser

Dimitri Nestor Alice Van De Ville

Official source

Related concepts (28)

Image segmentation

In and computer vision, image segmentation is the process of partitioning a into multiple image segments, also known as image regions or image objects (sets of pixels). The goal of segmentation is to simplify and/or change the representation of an image into something that is more meaningful and easier to analyze. Image segmentation is typically used to locate objects and boundaries (lines, curves, etc.) in images. More precisely, image segmentation is the process of assigning a label to every pixel in an image such that pixels with the same label share certain characteristics.

Image analysis

Image analysis or imagery analysis is the extraction of meaningful information from s; mainly from s by means of techniques. Image analysis tasks can be as simple as reading bar coded tags or as sophisticated as identifying a person from their face. Computers are indispensable for the analysis of large amounts of data, for tasks that require complex computation, or for the extraction of quantitative information.

K-means clustering

k-means clustering is a method of vector quantization, originally from signal processing, that aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean (cluster centers or cluster centroid), serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells. k-means clustering minimizes within-cluster variances (squared Euclidean distances), but not regular Euclidean distances, which would be the more difficult Weber problem: the mean optimizes squared errors, whereas only the geometric median minimizes Euclidean distances.

Digital image processing

Digital image processing is the use of a digital computer to process s through an algorithm. As a subcategory or field of digital signal processing, digital image processing has many advantages over . It allows a much wider range of algorithms to be applied to the input data and can avoid problems such as the build-up of noise and distortion during processing. Since images are defined over two dimensions (perhaps more) digital image processing may be modeled in the form of multidimensional systems.

Graph cuts in computer vision

As applied in the field of computer vision, graph cut optimization can be employed to efficiently solve a wide variety of low-level computer vision problems (early vision), such as , the stereo correspondence problem, , object co-segmentation, and many other computer vision problems that can be formulated in terms of energy minimization. Many of these energy minimization problems can be approximated by solving a maximum flow problem in a graph (and thus, by the max-flow min-cut theorem, define a minimal cut of the graph).

Related lectures (32)

K-Means Clustering: Basics and Applications

Introduces K-Means Clustering, a simple yet effective algorithm for grouping data points into clusters.

Segmentation Techniques MOOC: Image Processing and Analysis for Life Scientists

Explores segmentation techniques in image analysis, including thresholding, clustering, region growing, and machine learning.

JPEG 2000: Image Compression

Explores image compression principles, focusing on JPEG 2000, covering transform-based coding, quantization, entropy coding, region of interest, error resilience, and software implementations.

Morphological Operations MOOC: Image Processing and Analysis for Life Scientists

Covers basic to advanced morphological operations for image analysis workflows.

Machine Learning: Fundamentals and Applications