Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Jérôme Berclaz is active.

Publication


Featured researches published by Jérôme Berclaz.


IEEE Transactions on Pattern Analysis and Machine Intelligence | 2008

Multicamera People Tracking with a Probabilistic Occupancy Map

François Fleuret; Jérôme Berclaz; Richard Lengagne; Pascal Fua

Given two to four synchronized video streams taken at eye level and from different angles, we show that we can effectively combine a generative model with dynamic programming to accurately follow up to six individuals across thousands of frames in spite of significant occlusions and lighting changes. In addition, we also derive metrically accurate trajectories for each of them. Our contribution is twofold. First, we demonstrate that our generative model can effectively handle occlusions in each time frame independently, even when the only data available comes from the output of a simple background subtraction algorithm and when the number of individuals is unknown a priori. Second, we show that multiperson tracking can be reliably achieved by processing individual trajectories separately over long sequences, provided that a reasonable heuristic is used to rank these individuals and that we avoid confusing them with one another.


IEEE Transactions on Pattern Analysis and Machine Intelligence | 2011

Multiple Object Tracking Using K-Shortest Paths Optimization

Jérôme Berclaz; François Fleuret; Engin Türetken; Pascal Fua

Multi-object tracking can be achieved by detecting objects in individual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in previous and following ones, a correct trajectory will nevertheless be produced. By contrast, a false-positive detection in a few frames will be ignored. However, when dealing with a multiple target problem, the linking step results in a difficult optimization problem in the space of all possible families of trajectories. This is usually dealt with by sampling or greedy search based on variants of Dynamic Programming which can easily miss the global optimum. In this paper, we show that reformulating that step as a constrained flow optimization results in a convex problem. We take advantage of its particular structure to solve it using the k-shortest paths algorithm, which is very fast. This new approach is far simpler formally and algorithmically than existing techniques and lets us demonstrate excellent performance in two very different contexts.


international conference on computer vision | 2011

Tracking multiple people under global appearance constraints

Horesh Ben Shitrit; Jérôme Berclaz; François Fleuret; Pascal Fua

In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a convex global optimization problem. Our proposed framework is designed to exploit image appearance cues to prevent identity switches. Our method is effective even when such cues are only available at distant time intervals. This is unlike many current approaches that depend on appearance being exploitable from frame to frame. We validate our approach on three multi-camera sport and pedestrian datasets that contain long and complex sequences. Our algorithm perseveres identities better than state-of-the-art algorithms while keeping similar MOTA scores.


computer vision and pattern recognition | 2006

Robust People Tracking with Global Trajectory Optimization

Jérôme Berclaz; François Fleuret; Pascal Fua

Given three or four synchronized videos taken at eye level and from different angles, we show that we can effectively use dynamic programming to accurately follow up to six individuals across thousands of frames in spite of significant occlusions. In addition, we also derive metrically accurate trajectories for each one of them. Our main contribution is to show that multi-person tracking can be reliably achieved by processing individual trajectories separately over long sequences, provided that a reasonable heuristic is used to rank these individuals and avoid confusing them with one another. In this way, we achieve robustness by finding optimal trajectories over many frames while avoiding the combinatorial explosion that would result from simultaneously dealing with all the individuals.


2009 Twelfth IEEE International Workshop on Performance Evaluation of Tracking and Surveillance | 2009

Multiple object tracking using flow linear programming

Jérôme Berclaz; François Fleuret; Pascal Fua

Multi-object tracking can be achieved by detecting objects in individual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: if an object is not detected in a frame but is in previous and following ones, a correct trajectory will nevertheless be produced. By contrast, a false-positive detection in a few frames will be ignored. However, when dealing with a multiple target problem, the linking step results in a difficult optimization problem in the space of all possible families of trajectories. This is usually dealt with by sampling or greedy search based on variants of dynamic programming, which can easily miss the global optimum. In this paper, we show that reformulating that step as a constrained flow optimization problem results in a convex problem that can be solved using standard linear programming techniques. In addition, this new approach is far simpler formally and algorithmically than existing techniques and yields excellent results on the PETS 2009 data set.


european conference on computer vision | 2008

Multi-camera Tracking and Atypical Motion Detection with Behavioral Maps

Jérôme Berclaz; François Fleuret; Pascal Fua

We introduce a novel behavioral model to describe pedestrians motions, which is able to capture sophisticated motion patterns resulting from the mixture of different categories of random trajectories. Due to its simplicity, this model can be learned from video sequences in a totally unsupervised manner through an Expectation-Maximization procedure. When integrated into a complete multi-camera tracking system, it improves the tracking performance in ambiguous situations, compared to a standard ad-hoc isotropic Markovian motion model. Moreover, it can be used to compute a score which characterizes atypical individual motions. Experiments on outdoor video sequences demonstrate both the improvement of tracking performance when compared to a state-of-the-art tracking system and the reliability of the atypical motion detection.


british machine vision conference | 2007

Robust Multi-View Change Detection

Alessandro Lanza; Luigi Di Stefano; Jérôme Berclaz; François Fleuret; Pascal Fua

We present a multi-view change detection approach aimed at being robust with respect to common “disturbance factors” yielding image changes in realworld applications. Disturbance factors causing “slow” or “fast-and-global” image variations, such as light changes and dynamic adjustments of camera parameters (e.g. auto-exposure and auto-gain control), are dealt with by a proper single-view change detector run independently on each view. The computed change masks are then fused into a “synergy mask” defined into a common virtual top-view, so as to detect and filter-out “fast-and-local” image changes due to physical points lying on the ground surface (e.g. shadows cast by moving objects and light spots hitting the ground surface).


Proceedings of SPIE | 2010

Image-based mobile service: automatic text extraction and translation

Jérôme Berclaz; Nina Bhatti; Steven J. Simske; John C. Schettino

We present a new mobile service for the translation of text from images taken by consumer-grade cell-phone cameras. Such capability represents a new paradigm for users where a simple image provides the basis for a service. The ubiquity and ease of use of cell-phone cameras enables acquisition and transmission of images anywhere and at any time a user wishes, delivering rapid and accurate translation over the phones MMS and SMS facilities. Target text is extracted completely automatically, requiring no bounding box delineation or related user intervention. The service uses localization, binarization, text deskewing, and optical character recognition (OCR) in its analysis. Once the text is translated, an SMS message is sent to the user with the result. Further novelties include that no software installation is required on the handset, any service provider or camera phone can be used, and the entire service is implemented on the server side.


Proceedings of SPIE | 2010

Cell Phones as Imaging Sensors

Nina Bhatti; Harlyn Baker; Joanna Marguier; Jérôme Berclaz; Sabine Süsstrunk

Camera phones are ubiquitous, and consumers have been adopting them faster than any other technology in modern history. When connected to a network, though, they are capable of more than just picture taking: Suddenly, they gain access to the power of the cloud. We exploit this capability by providing a series of image-based personal advisory services. These are designed to work with any handset over any cellular carrier using commonly available Multimedia Messaging Service (MMS) and Short Message Service (SMS) features. Targeted at the unsophisticated consumer, these applications must be quick and easy to use, not requiring download capabilities or preplanning. Thus, all application processing occurs in the back-end system (i.e., as a cloud service) and not on the handset itself. Presenting an image to an advisory service in the cloud, a user receives information that can be acted upon immediately. Two of our examples involve color assessment - selecting cosmetics and home décor paint palettes; the third provides the ability to extract text from a scene. In the case of the color imaging applications, we have shown that our service rivals the advice quality of experts. The result of this capability is a new paradigm for mobile interactions - image-based information services exploiting the ubiquity of camera phones.


IEEE Transactions on Pattern Analysis and Machine Intelligence | 2014

Multi-Commodity Network Flow for Tracking Multiple People

Horesh Ben Shitrit; Jérôme Berclaz; François Fleuret; Pascal Fua

Collaboration


Dive into the Jérôme Berclaz's collaboration.

Top Co-Authors

Avatar

Pascal Fua

École Polytechnique Fédérale de Lausanne

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Horesh Ben Shitrit

École Polytechnique Fédérale de Lausanne

View shared research outputs
Top Co-Authors

Avatar

Engin Türetken

École Polytechnique Fédérale de Lausanne

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Joanna Marguier

École Polytechnique Fédérale de Lausanne

View shared research outputs
Top Co-Authors

Avatar

Richard Lengagne

École Polytechnique Fédérale de Lausanne

View shared research outputs
Top Co-Authors

Avatar

Sabine Süsstrunk

École Polytechnique Fédérale de Lausanne

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge