Gaussians on Riemannian Manifolds for Robot Learning and Adaptive Control
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.
We present the design of an object oriented general purpose library for isogeometric analysis, where the mathematical concepts of the isogeometric method and their relationships are directly mapped into classes and their interactions. The encapsulation of ...
A classical theorem of Frankel for compact Kahler manifolds states that a Kahler S-1-action is Hamiltonian if and only if it has fixed points. We prove a metatheorem which says that when the Hodge theory holds on non-compact manifolds, Frankel's theorem st ...
Feature descriptors play a crucial role in a wide range of geometry analysis and processing applications, including shape correspondence, retrieval, and segmentation. In this paper, we propose ShapeNet, a generalization of the popular convolutional neural ...
Fluid bridges are ubiquitous soft structures of finite size that conform to and link the surfaces of neighboring objects. Fluid joints, the specific type of fluid bridge with at least one extremity constrained laterally, display even more pronounced reacti ...
The purpose of this paper is to give a self-contained proof that a complete manifold with more than one end never supports an L-q,L-p-Sobolev inequality (2
We revisit the problem of extending the notion of principal component analysis (PCA) to multivariate datasets that satisfy nonlinear constraints, therefore lying on Riemannian manifolds. Our aim is to determine curves on the manifold that retain their cano ...
We propose a segmentation method based on the geometric representation of images as two-dimensional manifolds embedded in a higher dimensional space. The segmentation is formulated as a minimization problem, where the contours are described by a level set ...
Institute of Electrical and Electronics Engineers2014
This paper presents a new framework for manifold learning based on a sequence of principal polynomials that capture the possibly nonlinear nature of the data. The proposed Principal Polynomial Analysis (PPA) generalizes PCA by modeling the directions of ma ...
We consider total variation (TV) minimization for manifold-valued data. We propose a cyclic proximal point algorithm and a parallel proximal point algorithm to minimize TV functionals with l(p) -type data terms in the manifold case. These algorithms are ba ...
