Publication

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

Related publications (260)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

How Experience Shapes the Subjective Evaluation of Opportunities

Marc Gruber, Sun Hee Kim

The purpose of this paper is to build on a set of recent theoretical studies investigating the role of subjective insights and judgments in the resource-based view and to extend this important line of inquiry by offering a detailed assessment of how agents ...

2010

On Source Transmission over Deterministic Relay Networks

Suhas Diggavi

Lossless transmission of a set of correlated sources over a deterministic relay network is considered for two traffic requirements. In distributed multicast, the set of sources are to be delivered to a set of destinations. The source exchange requires all ...

2010

On the unification of thermal perception and adaptive actions

Darren Robinson, Frédéric Haldi

Occupants exercise adaptive actions in response to discomforting environmental stimuli in an attempt to restore their comfort. These responses to adaptive actions are either ignored (conventional PMV models) or handled in an aggregated way (adaptive therma ...

Elsevier2010

Propagation of geotags based on object duplicate detection

Touradj Ebrahimi, Jong Seok Lee, Lutz Goldmann, Ivan Ivanov, Péter Vajda

In this paper, we consider the use of object duplicate detection for the propagation of geotags from a small set of images with location names (IPTC) to a large set of non-tagged images. The motivation behind this idea is that images of individual location ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2010

Daylight illuminant retrieval using redundant image elements

Sabine Süsstrunk, Joanna Marguier

We present a method for retrieving illuminant spectra from a set of images taken with a fixed location camera, such as a surveillance or panoramic one. In these images, there will be significant changes in lighting conditions and scene content, but there w ...

2010

Maximizing the net present value of a project under uncertainty

Daniel Kuhn, Wolfram Wiesemann

We address the maximization of a project’s expected net present value when the activity durations and cash flows are described by a discrete set of alternative scenarios with associated occurrence probabilities. In this setting, the choice of scenario-inde ...

Elsevier2010

The Stationary Behaviour of Fluid Limits of Reversible Processes is Concentrated on Stationary Points

Jean-Yves Le Boudec

Assume that a stochastic processes can be approximated, when some scale parameter gets large, by a fluid limit (also called mean field limit", or hydrodynamic limit"). A common practice, often called the ``fixed point approximation" consists in approxi ...

arxiv.org2010

Generalizing State Machine Replication

Rachid Guerraoui

We show that, with k-set consensus, any number of processes can emulate k state machines of which at least one progresses. This generalizes the celebrated universality of consensus which enables to build a state machine that always progresses. Besides some ...

2010

Order-adjoint monads and injective objects

Gavin Jay Seal

Given a monad T on Set whose functor factors through the category of ordered sets with left adjoint maps, the category of Kleisli monoids is defined as the category of monoids in the hom-sets of the Kleisli category of T. The Eilenberg-Moore category of T ...

Elsevier2010

"Compressed" Compressed Sensing

Michael Christoph Gastpar

The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an even smaller num ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010