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

Lecture

Motion

In course

EE-550: Image and video processing

This course covers fundamental notions in image and video processing, as well as covers most popular tools used, such as edge detection, motion estimation, segmentation, and compression. It is composed of lectures, laboratory sessions, and mini-projects. ...

Description

This lecture covers motion estimation methods in video processing, including the illusion of movement, motion analysis, displacement, motion field, and optical flow. It explains motion models, assumptions in motion estimation, and various techniques such as gradient methods, block matching, pel-recursive methods, and phase correlation. The lecture also delves into the challenges and advantages of each method, such as dense motion field representation, computational complexity, and robustness to noise.

Official source

Related concepts (32)

Motion estimation

Motion estimation is the process of determining motion vectors that describe the transformation from one 2D image to another; usually from adjacent frames in a video sequence. It is an ill-posed problem as the motion is in three dimensions but the images are a projection of the 3D scene onto a 2D plane. The motion vectors may relate to the whole image (global motion estimation) or specific parts, such as rectangular blocks, arbitrary shaped patches or even per pixel.

Motion compensation

Motion compensation in computing, is an algorithmic technique used to predict a frame in a video, given the previous and/or future frames by accounting for motion of the camera and/or objects in the video. It is employed in the encoding of video data for video compression, for example in the generation of MPEG-2 files. Motion compensation describes a picture in terms of the transformation of a reference picture to the current picture. The reference picture may be previous in time or even from the future.

Computational complexity

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.

Computational complexity theory

In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.

Motion

In physics, motion is the phenomenon by which an object changes its position with respect to time. Motion is mathematically described in terms of displacement, distance, velocity, acceleration, speed, and frame of reference to an observer, measuring the change in position of the body relative to that frame with a change in time. The branch of physics describing the motion of objects without reference to their cause is called kinematics, while the branch studying forces and their effect on motion is called dynamics.

Related lectures (31)

Learning from Probabilistic Models

Delves into challenges of learning from probabilistic models, covering computational complexity, data reconstruction, and statistical gaps.

Optimal Power Flow Solvers: Next Generation Advancements

Explores advancements in optimal power flow solvers, focusing on multiperiod and security-constrained optimization.

Complexity of Algorithms

Explores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.

Simulating Molecular Biology: Challenges and Opportunities

Explores simulating molecular biology dynamics, addressing challenges and opportunities in computational research.

Discrete Optimization: The Curse of Dimensionality MOOC: Optimization: principles and algorithms - Network and discrete optimization

Delves into the curse of dimensionality in discrete optimization, highlighting the challenges of exponential computational time growth with problem size.

Related concepts (32)

Motion estimation

Motion compensation

Computational complexity

Computational complexity theory

Motion