no code implementations • 22 Apr 2022 • Rémi Nahon, Guillaume-Alexandre Bilodeau, Gilles Pesant
In the second phase, we associate the previously constructed tracklets using a Belief Propagation Constraint Programming algorithm, where we propose various constraints that assign scores to each of the tracklets based on multiple characteristics, such as their dynamics or the distance between them in time and space.
no code implementations • 10 Mar 2020 • Alexandre Pineault, Guillaume-Alexandre Bilodeau, Gilles Pesant
Because our focus is on the data association problem, our MOT method only uses simple image features, which are the center position and color of detections for each frame.
no code implementations • 23 Sep 2019 • Behrouz Babaki, Golnoosh Farnadi, Gilles Pesant
In this paper we show how identifying and exploiting these identical subproblems can simplify solving them and leads to a compact representation of the solution.
no code implementations • 18 Jan 2014 • Gilles Pesant, Claude-Guy Quimper, Alessandro Zanarini
Designing a search heuristic for constraint programming that is reliable across problem domains has been an important research topic in recent years.