Glossary Library

Technical GlossaryComputer Vision

Hungarian Assignment for Tracking

An optimization step that preserves identity continuity by matching detections with existing tracks at minimum cost.

The Hungarian assignment algorithm is one of the classical yet effective tools for data association in multi-object tracking. The matching problem between new detections and existing tracks is solved through a cost matrix. Motion, appearance, and distance signals can all contribute to that cost. It forms one of the mathematical backbones of the tracking pipeline.

You Might Also Like

Explore these concepts to continue your artificial intelligence journey.

Glossary Cover

yapay-zeka-temelleri

Optimization

The process of systematically improving model parameters according to an objective function in order to increase performance.

Glossary Cover

matematik-istatistik-optimizasyon

Gradient Descent

A fundamental optimization method that updates parameters in the opposite direction of the gradient to minimize a loss function.

Glossary Cover

matematik-istatistik-optimizasyon

Stochastic Gradient Descent

An optimization approach that updates parameters using single examples or small subsets instead of the full dataset at each step.