JKJulien Kritter

Julien Kritter

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Julien Kritter has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • On the optimal placement of cameras for the surveillance of urban events : a real-world, human-assisted combinatorial approach for decision support systems

    by Julien Kritter

    Du placement optimal de caméras pour la surveillance d'évènements urbains : une approche combinatoire assistée par l’utilisateur pour l’aide à la décision dans le monde réel: Cette thèse, contribution à un projet de recherche franco-allemand, s'intéresse aux réseaux de vidéo-protection, plus particulièrement au problème de placement optimal de cameras et à l'intégration de cette problématique au sein de systèmes d'aide à la décision. Nous commençons avec une revue approfondie de deux corpus, l'un portant sur notre application et l'autre sur un populaire problème théorique lié à cette dernière. Cette étude couvre à la fois modélisation et résolution, et met en avant diverses pistes de recherche. En terme de modélisation, nous nous intéressons particulièrement à la mise au point d'un compromis entre les deux extrêmes typiques de la littérature : trop simpliste ou trop coûteux. Nous implémentons ainsi un système de génération et de pré-traitement d'instances basé sur des données réelles et capable d'extraire une représentation fidèle de la zone à couvrir. Ces instances nous permettent ensuite de mettre en place une étude comparative de l'état de l'art, jusqu'ici resté sans point de référence en raison du large panorama de variantes et de contraintes autour de notre problème. Nos résultats posent plusieurs hypothèses au sujet de la complexité de ce dernier. Nos conclusions associées nous permettent de construire un nouveau modèle, que nous utilisons afin de définir un algorithme de résolution efficace, et directement intégrable à un système d'aide à la décision. Un prototype est d'ailleurs implémenté afin de permettre à un utilisateur de négocier avec l'algorithme jusqu'à obtenir une solution jugée satisfaisante.

  • Open Access

    On the computational cost of the set cover approach for the optimal camera placement problem and possible set-cover-inspired trade-offs for surveillance infrastructure design

    by Julien Kritter, Mathieu Brévilliers, Julien Lepagnot, Lhassane Idoumghar

    The 𝒩𝒫-hard minimum set cover problem (SCP) is a very typical model to use when attempting to formalise optimal camera placement (OCP) applications. In a generic form, the OCP problem relates to the positioning of individual cameras such that the overall network is able to cover a given area while meeting a set of application-specific requirements (image quality, redundancy, ...) and optimising an objective, typically minimum cost or maximum coverage. In this paper, we focus on an application called global or persistent surveillance: camera networks which ensure full coverage of a given area. As preliminary work, an instance generation pipeline is proposed to create OCP instances from real-world data and solve them using existing literature. The computational cost of both the instance generation process and the solving algorithms however highlights a need for more efficient methods for decision makers to use in real-world settings. In this paper, we therefore propose to review the suitability of the approach, and more specifically to question two key elements: the impact of sampling frequencies and the importance of rigid full-coverage constraints. The results allow us to quickly provide decision makers with an overview of available solutions and trade-offs.


  • On the real-world applicability of state-of-the-art algorithms for the optimal camera placement problem

    by Julien Kritter, Mathieu Brevilliers, Julien Lepagnot, Lhassane Idoumghar

    Optimal camera placement (OCP) is one of many practical applications of a core $\mathcal{NP}$ -complete problem in the field of combinatorial optimisation: set cover (SCP). In a generic form, the OCP problem relates to the positioning and setting up of individual cameras such that the overall network is able to cover a given area while meeting a set of application-specific constraints (such as image quality or redundancy) and optimising an objective, typically minimum cost or maximum coverage, depending on the application's focus. In this paper, we consider the problem of positioning and orienting a minimal number of cameras such that the network is able to reach full coverage. More specifically, we introduce a framework for OCP instance generation which leaves the common realm of academic study cases and models the problem in real-world settings, using 8 West-European cities for numerical tests. A baseline is established by running several basic algorithms, which serve as a starting point for a more focused benchmark involving various state-of-the-art algorithms from both OCP and SCP literature. The results are then discussed and several elements highlighted for future research.


  • On the optimal placement of cameras for surveillance and the underlying set cover problem

    by Julien Kritter, Mathieu Brévilliers, Julien Lepagnot, Lhassane Idoumghar


  • Hybrid differential evolution algorithms for the optimal camera placement problem

    by Mathieu Brévilliers, Julien Lepagnot, Lhassane Idoumghar, Maher Rebai, Julien Kritter

    Purpose: This paper aims to investigate to what extent hybrid differential evolution (DE) algorithms can be successful in solving the optimal camera placement problem.Design/methodology/approach: This problem is stated as a unicost set covering problem (USCP) and 18 problem instances are defined according to practical operational needs. Three methods are selected from the literature to solve these instances: a CPLEX solver, greedy algorithm and row weighting local search (RWLS). Then, it is proposed to hybridize these algorithms with two hybrid DE approaches designed for combinatorial optimization problems. The first one is a set-based approach (DEset) from the literature. The second one is a new similarity-based approach (DEsim) that takes advantage of the geometric characteristics of a camera to find better solutions.Findings: The experimental study highlights that RWLS and DEsim-CPLEX are the best proposed algorithms. Both easily outperform CPLEX, and it turns out that RWLS performs better on one class of problem instances, whereas DEsim-CPLEX performs better on another class, depending on the minimal resolution needed in practice.Originality/value: Up to now, the efficiency of RWLS and the DEset approach has been investigated only for a few problems. Thus, the first contribution is to apply these methods for the first time in the context of camera placement. Moreover, new hybrid DE algorithms are proposed to solve the optimal camera placement problem when stated as a USCP. The second main contribution is the design of the DEsim approach that uses the distance between camera locations to fully benefit from the DE mutation scheme.


  • Parallel Preprocessing for the Optimal Camera Placement Problem

    by Mathieu Brévilliers, Julien Lepagnot, Julien Kritter, Lhassane Idoumghar