Home

Person

François Fleuret

About
Privacy
Disclaimer

Graph Chatbot

Related publications (315)

First observation of the rare B+ -> D+K+pi(-) decay

Christoph Frei, Peter Clarke, Jean Wicht, Alessandro Mapelli, Aurelio Bay, Minh Tâm Tran, Marc-Olivier Bettler, Cédric Potterat, François Fleuret, Tatsuya Nakada, Guido Haefeli, Niko Neufeld, Olivier Schneider, Hans Dijkstra, Frédéric Teubert, Gerhard Raven, Bastien Luca Muster, Chitsanu Khurewathanakul, Frédéric Blanc, Matthew Needham, Axel Kuonen, Olivier Göran Girard, Liang Sun, Maxime Schubiger, Thibaud Humair, Xiaoxue Han, Luis Alberto Granado Cardoso, Greig Alan Cowan, Paolo Durante, Jessica Prisciandaro, Ilya Komarov, Zhirui Xu, Mark Tobin, Victor Coco, Violaine Bellée, Mirco Dorigo, Sebastiana Gianì, Maurizio Martinelli, Guido Andreassi, Maxim Borisyak, Jian Wang, Liupan An, , , , , , , , , , , , ,

Measurement of the mass and lifetime of the Omega(-)(b) baryon

Christoph Frei, Peter Clarke, Jean Wicht, Alessandro Mapelli, Aurelio Bay, Minh Tâm Tran, Marc-Olivier Bettler, Cédric Potterat, François Fleuret, Tatsuya Nakada, Guido Haefeli, Niko Neufeld, Olivier Schneider, Hans Dijkstra, Frédéric Teubert, Gerhard Raven, Bastien Luca Muster, Chitsanu Khurewathanakul, Frédéric Blanc, Matthew Needham, Axel Kuonen, Olivier Göran Girard, Liang Sun, Maxime Schubiger, Thibaud Humair, Hang Yin, Xiaoxue Han, Greig Alan Cowan, Paolo Durante, Jessica Prisciandaro, Ilya Komarov, Zhirui Xu, Mark Tobin, Victor Coco, Violaine Bellée, Mirco Dorigo, Sebastiana Gianì, Yu Zheng, Maurizio Martinelli, Guido Andreassi, Maxim Borisyak, Jian Wang, , , , , , , , , , , , , ,

Scalable Metric Learning via Weighted Approximate Rank Component Analysis

François Fleuret, Cijo Jose

We are interested in the large-scale learning of Mahalanobis distances, with a particular focus on person re-identification. We propose a metric learning formulation called Weighted Approximate Rank Component Analysis (WARCA). WARCA optimizes the precision ...

Springer Int Publishing Ag2016

Measurement of the ratio of branching fractions B(B-c(+) -> J/psi K+)/B(B-c(+) -> J/psi pi(+))

Christoph Frei, Peter Clarke, Jean Wicht, Aurelio Bay, Minh Tâm Tran, Marc-Olivier Bettler, Cédric Potterat, François Fleuret, Tatsuya Nakada, Guido Haefeli, Niko Neufeld, Olivier Schneider, Hans Dijkstra, Frédéric Teubert, Gerhard Raven, Chitsanu Khurewathanakul, Frédéric Blanc, Matthew Needham, Axel Kuonen, Olivier Göran Girard, Liang Sun, Maxime Schubiger, Thibaud Humair, Hang Yin, Xiaoxue Han, Greig Alan Cowan, Paolo Durante, Jessica Prisciandaro, Ilya Komarov, Zhirui Xu, Mark Tobin, Victor Coco, Violaine Bellée, Mirco Dorigo, Sebastiana Gianì, Yu Zheng, Maurizio Martinelli, Guido Andreassi, Maxim Borisyak, Anton Petrov, Jian Wang, Liupan An, , , , , , , , , , , , , , , , ,

Measurement of the forward Z boson production cross-section in pp collisions at root s=13 TeV

Jointly Informative Feature Selection Made Tractable by Gaussian Modeling

François Fleuret, Leonidas Lefakis

2016

Tracking Interacting Objects Using Intertwined Flows

Pascal Fua, François Fleuret, Engin Türetken, Xinchao Wang

In this paper, we show that tracking different kinds of interacting objects can be formulated as a network-flow Mixed Integer Program. This is made possible by tracking all objects simultaneously using intertwined flow variables and expressing the fact tha ...

Institute of Electrical and Electronics Engineers2016

Principled Parallel Mean-Field Inference for Discrete Random Fields

Pascal Fua, François Fleuret, Timur Bagautdinov, Pierre Bruno Baqué

Mean-field variational inference is one of the most popular approaches to inference in discrete random fields. Standard mean-field optimization is based on coordinate descent and in many situations can be impractical. Thus, in practice, various parallel te ...

2016

Probability Occupancy Maps for Occluded Depth Images

Pascal Fua, François Fleuret, Timur Bagautdinov

2015

Systems and methods for tracking interacting objects

Pascal Fua, François Fleuret, Engin Türetken, Xinchao Wang

Systems and methods for tracking interacting objects may acquire, with a sensor, and two or more images associated with two or more time instances. A processor may generate image data from the two or more images. The processor may apply an extended Probabi ...

2015

Adaptive Sampling for Large Scale Boosting

François Fleuret, Charles Dubout

Classical Boosting algorithms, such as AdaBoost, build a strong classifier without concern for the computational cost. Some applications, in particular in computer vision, may involve millions of training examples and very large feature spaces. In such con ...

2014

Tracking Interacting Objects Optimally Using Integer Programming

Pascal Fua, François Fleuret, Engin Türetken, Xinchao Wang

In this paper, we show that tracking different kinds of interacting objects can be formulated as a network-flow Mixed Integer Program. This is made possible by tracking all objects simultaneously and expressing the fact that one object can appear or disapp ...

Springer Int Publishing Ag2014

Multi-Commodity Network Flow for Tracking Multiple People

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

In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a multi-commodity network flow problem. Our proposed framework is designed to exploit image appearance cues to prevent identity switches. Our method is effe ...

Institute of Electrical and Electronics Engineers2014

treeKL: A distance between high dimension empirical distributions

François Fleuret

This paper offers a methodological contribution for computing the distance between two empirical distributions in an Euclidean space of very large dimension. We propose to use decision trees instead of relying on standard quantification of the feature spac ...

Elsevier Science Bv2013

Tracklet-based Multi-Commodity Network Flow for Tracking Multiple People

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

(EN)A method for continuously tracking multiple people partitioned into groups while preserving identities under global appearance constraints, wherein people's trajectories may intersect, and wherein only sparse appearance information is available is disc ...

WO2013

Method and apparatus for multiple object tracking with k-shortest paths

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

Trajectories of objects are estimated by determining the optimal solution(s) of a tracking model on the basis of an occupancy probability distribution. The occupancy probability distribution is the probability of presence of objects over a set of discrete ...

2013

Tracking Multiple Players using a Single Camera

Pascal Fua, François Fleuret, Horesh Beny Ben Shitrit, Mirko Raca

It has been shown that multi-people tracking could be successfullly formulated as a Linear Program to process the output of multiple fixed and synchronized cameras with overlapping fields of view. In this paper, we extend this approach to the more challeng ...

Springer Verlag2013

Fast Object Detection with Entropy-Driven Evaluation

Pascal Fua, François Fleuret, Raphael Sznitman, Carlos Joaquin Becker

Cascade-style approaches to implementing ensemble classifiers can deliver significant speed-ups at test time. While highly effective, they remain challenging to tune and their overall performance depends on the availability of large validation sets to esti ...

2013

A Real-Time Deformable Detector

David Hasler, Pascal Fua, François Fleuret, Karim Ali

We propose a new learning strategy for object detection. The proposed scheme forgoes the need to train a collection of detectors dedicated to homogeneous families of poses, and instead learns a single classifier that has the inherent ability to deform base ...

Institute of Electrical and Electronics Engineers2012

Comparing machines and humans on a visual categorization test

François Fleuret, Charles Dubout, Ting Li

Automated scene interpretation has benefited from advances in machine learning, and restricted tasks, such as face detection, have been solved with sufficient accuracy for restricted settings. However, the performance of machines in providing rich semantic ...

National Academy of Sciences2011

Page 15 of 16

The B+ -> D+K+pi(-) decay is observed in a data sample corresponding to 3.0 fb(-1) of pp collision data recorded by the LHCb experiment during 2011 and 2012. The signal significance is 8 sigma and the branching fraction is measured to be B(B+ -> D+K+pi(-)) ...

American Physical Society2016

A proton-proton collision data sample, corresponding to an integrated luminosity of 3 fb(-1) collected by LHCb at root s = 7 and 8 TeV, is used to reconstruct 63 +/- 9 Omega(-)(b) -> Omega(0)(c)pi(-), Omega(0)(c) -> pK(-)K(-)pi(+) decays. Using the Xi(-)(b ...

American Physical Society2016

Aravindhan Venkateswaran

Yiming Li

Giovanni Carboni

The ratio of branching fractions R-K/pi = B (B-c(+) -> J/psi K+)/B(B-c(+) -> J/psi pi(+)) is measured with pp collision data collected by the LHCb experiment at centre-of-mass energies of 7TeV and 8TeV, corresponding to an integrated luminosity of 3 fb(-1) ...

Springer Nature2016

Aravindhan Venkateswaran

Yiming Li

Luis Miguel Garcia Martin

Giovanni Carboni

Katharina Müller

A measurement of the production cross-section of Z bosons in pp collisions at root s=13 TeV is presented using dimuon and dielectron final states in LHCb data. The cross-section is measured for leptons with pseudorapidities in the range 2.0 < eta < 4.5, tr ...

Springer Nature2016