Pierre Lemaire

Learn More
The TELEMAC project brings new methodologies from the Information and Science Technologies field to the world of water treatment. TELEMAC offers an advanced remote management system which adapts to most of the anaerobic wastewater treatment plants that do not benefit from a local expert in wastewater treatment. The TELEMAC system takes advantage of new(More)
This paper presents a mesh-based approach for 3D face recognition using a novel local shape descriptor and a SIFT-like matching process. Both maximum and minimum curvatures estimated in the 3D Gaussian scale space are employed to detect salient points. To comprehensively characterize 3D facial surfaces and their variations, we calculate weighted statistical(More)
This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we manage a classical employee timetabling problem. At the second level, we aim at supplying a feasible production schedule for a set of interruptible tasks with qualification requirements and time-windows. Instead of hierarchically(More)
— In this paper, we propose an holistic, fully automatic approach to 3D Facial Expression Recognition (FER). A novel facial representation, namely Differential Mean Curvature Maps (DMCMs), is proposed to capture both global and local facial surface deformations which typically occur during facial expressions. These DMCMs are directly extracted from 3D depth(More)
We address a parallel machine scheduling problem for which the objective is to maximize the weighted number of scheduled tasks, and with the special constraint that each task has a mandatory processing instant. This problem arises, in our case, to schedule a set of astronomical observations on a telescope. We prove that the problem is NP-complete, and we(More)
We propose two exact methods to solve an integrated employee-timetable and job-shop-scheduling problem. The problem is to find a minimum cost employee-timetable, where employees have different competences and work during shifts, so that the production, that corresponds to a job-shop with resource availability constraints, can be achieved. We introduce two(More)