Joint Graph-based Depth Refinement and Normal Estimation
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.
Navigation of a group of autonomous agents that are required to maintain a formation is a challenging task which has not been studied much especially in 3-D terrains. This paper presents a novel approach to collision free path finding of multiple agents pr ...
The goal of transductive learning is to find a way to recover the labels of lots of data with only a few known samples. In this work, we will work on graphs for two reasons. First, it’s possible to construct a graph from a given dataset with features. The ...
Reconstructing complex curvilinear structures such as neural circuits, road networks, and blood vessels is a key challenge in many scientific and engineering fields. It has a broad range of applications, from the delineation of micrometer-sized neurons in ...
The Virtual Reference Feedback Tuning (VRFT) approach is a design method that allow optimal feedback control laws to be derived from input-output (I/O) data only, without need of a model of the process. A drawback of this methods is that, in its standard f ...
Due to the appearance of data on networks such as internet or Facebook, the number of applications of signal on weighted graph is increasing. Unfortunately, because of the irregular structure of this data, classical signal processing techniques are not app ...
We consider the minimum variance distortionless response (MVDR) beamforming problems where the array covariance matrix is rank deficient. The conventional approach handles such rank-deficiencies via diagonal loading on the covariance matrix. In this settin ...
We present a general formula for the Wess-Zumino action associated with the Weyl anomaly, given in a curved background for any even number of dimensions. The result is obtained by considering a finite Weyl transformation of counterterms in dimensional regu ...
The prevalence of signals on weighted graphs is increasing; however, because of the irregular structure of weighted graphs, classical signal processing techniques cannot be directly applied to signals on graphs. In this paper, we define generalized transla ...
We consider the minimum variance distortionless response (MVDR) beamforming problems where the array covariance matrix is rank deficient. The conventional approach handles such rank-deficiencies via diagonal loading on the covariance matrix. In this settin ...
The prevalence of signals on weighted graphs is increasing; however, because of the irregular structure of weighted graphs, classical signal processing techniques cannot be directly applied to signals on graphs. In this paper, we define generalized transla ...
