$$ \def\NN{{\mathbb N}} $$
$$ \def\RR{{\mathbb R}} $$
$$ \def\CC{{\mathbb C}} $$
$$ \def\ZZ{{\mathbb Z}} $$
$$ \DeclareMathOperator*{\dom}{dom} $$
$$ \DeclareMathOperator*{\TV}{TV} $$
$$ \def\STV{\mathrm{STV}} $$
$$ \DeclareMathOperator*{\argmin}{argmin} $$
$$ \DeclareMathOperator*{\TVani}{{TV}^\text{ani}} $$
$$ \DeclareMathOperator*{\HTValpha}{{HTV}_\alpha} $$
$$ \DeclareMathOperator*{\divergence}{div} $$
$$ \newcommand\RRRR[1]{\RR^{#1} \times \RR^{#1}} $$

Homepage of Rémy Abergel

Paris Descartes University (Department of Mathematics and Informatics)

  • 2019–… : M1 students project supervision (sub-pixel image processing)
  • 2018–… : Inverse Problems and their applications to Image Processing (full Master 2 course, 30 hours).

Master of Mathematics, Computer Vision, and Machine Learning (MVA Master)

  • 2019–… : MVA M2 students project supervision (SAR image processing)
  • 2019–… : MVA M2 course (one lecture in the course Sub-pixel image processing of Pr. Lionel Moisan)

I.U.T. Paris Descartes (Department of Informatics)

First year students (equivalent L1)

  • 2019–… : Numerical Analysis (supervised practical work sessions, 7.5 hours)
  • 2018–… : Languages and Grammar (supervised practical work sessions, 13.5 hours)
  • 2018–2019: Numerical Analysis (supervised practical work sessions, 21 hours)
  • 2018–2019: Graphs (supervised practical work sessions, 10.5 hours)
  • 2013–2016: Linear algebra (courses in small class including Scilab seances)
  • 2013–2014: Numerical analysis (courses in small class including Scilab seances)
  • 2013–2016: Formal logic (supervised practical work sessions, 21 hours)

Second year students (equivalent L2)

  • 2014–2016: Student project supervision (example of treated subjects: image edge detection, random number generators, automatons and languages)
  • 2014–2015: Markov chains based Page Rank algorithm (Scilab seance)
  • 2014–2016: Numerical modelisation (course in small class about Lotka Volterra equations)

L3 MIAGE

  • 2019–..: Introduction to Game Theory (full course, 25 hours, main topics: games modelling, finding Nash equilibria for zero-sum games, simplex algorithm)