MAV Urban Localization from Google Street View Data
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
For the analysis of flows in compliant vessels, we propose an approach to couple the original 3D equations with a convenient 1D model. This multi-scale strategy allows for a dramatic reduction of the computational complexity and is suitable for "absorbing" ...
Approximation of Toeplitz matrices with circulant matrices is a well-known approach to reduce the computational complexity of linear equalizers. This paper presents a novel technique to compute linear equalizer coefficients in the frequency domain. It is s ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007
Medical image processing is a demanding domain, both in terms of CPU and memory requirements. The volume of data to be processed is often large (a typical MRI dataset requires 10 MBytes) and many processing tools are only useful to the physician if they ar ...
Certain aspects of the present disclosure relate to a method for speeding up the Cadzow iterative denoising algorithm as a part of the Finite Rate of Innovation (FRI) processing and for decreasing its computational complexity. ...
In this paper, we consider the challenging problem of object duplicate detection and localization. Several applications require efficient object duplicate detection methods, such as automatic video and image tagging, video surveillance, and high level imag ...
We present in this paper an approximative method for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation method and requires a linear number of messages. The largest message is in the worst c ...
In this paper we address the combination of multiple feature streams in a fast speaker diarization system for meeting recordings. Whenever Multiple Distant Microphones (MDM) are used, it is possible to estimate the Time Delay of Arrival (TDOA) for differen ...
We propose an approach to incorporating dynamic models into the human body tracking process that yields full 3--D reconstructions from monocular sequences. We formulate the tracking problem is terms of minimizing a differentiable criterion whose differenti ...
This paper presents three novel Moving Horizon Estimation (MHE) methods for discrete-time partitioned linear systems, i.e. systems decomposed into coupled subsystems with non-overlapping states. The MHE approach is used due to its capability of exploiting ...
In this paper we address the problem of multi-object tracking in video sequences, with application to pedestrian tracking in a crowd. In this con- text, particle ¯lters provide a robust tracking framework under ambiguity conditions. The particle ¯lter tech ...
