Concept

Nash embedding theorems

Related publications (32)

Embeddings Of Maximal Tori In Orthogonal Groups

Eva Bayer Fluckiger

We give necessary and sufficient conditions for an orthogonal group defined over a global field of characteristic not equal 2 to contain a maximal torus of a given type. ...
Annales Inst Fourier2014

Tangent space estimation for smooth embeddings of Riemannian manifolds

Pascal Frossard, Elif Vural, Hemant Tyagi

Numerous dimensionality reduction problems in data analysis involve the recovery of low-dimensional models or the learning of manifolds underlying sets of data. Many manifold learning methods require the estimation of the tangent space of the manifold at a ...
2013

Calibration by Correlation Using Metric Embedding from Nonmetric Similarities

Davide Scaramuzza

This paper presents a new intrinsic calibration method that allows us to calibrate a generic single-view point camera just by waving it around. From the video sequence obtained while the camera undergoes random motion, we compute the pairwise time correlat ...
2013

Grassmannian Regularized Structured Multi-View Embedding for Image Classification

Xinchao Wang

Images are usually represented by features from multiple views, e.g., color and texture. In image classification, the goal is to fuse all the multi-view features in a reasonable manner and achieve satisfactory classification performance. However, the featu ...
Institute of Electrical and Electronics Engineers2013

Local Sampling Analysis for Quadratic Embeddings of Riemannian Manifolds

Hemant Tyagi

In this work we do a theoretical analysis of the local sampling conditions for points lying on a quadratic embedding of a Riemannian manifold in a Euclidean space. The embedding is assumed to be quadratic at a reference point PP. Our analysis is based on ...
2011

Ambient space formulations and statistical mechanics of holonomically constrained Langevin systems

John Maddocks

The most classic approach to the dynamics of an n-dimensional mechanical system constrained by d independent holonomic constraints is to pick explicitly a new set of (n - d) curvilinear coordinatesparametrizingthe manifold of configurations satisfying the ...
Springer-Verlag2011

On the n-dimensional Dirichlet problem for isometric maps

Bernard Dacorogna

We exhibit explicit Lipschitz maps from R '' to R '' which have almost everywhere orthogonal gradient and are equal to zero on the boundary of a cube. We solve the problem by induction on the dimension n. (C) 2008 Elsevier Inc. All rights reserved. ...
2008

Dysconnection Topography in Schizophrenia Revealed with State-Space Analysis of EEG

Martin Hasler, Reto Meuli, Kim Do, Oscar De Feo, Mahdi Jalili

Background The dysconnection hypothesis has been proposed to account for pathophysiological mechanisms underlying schizophrenia. Widespread structural changes suggesting abnormal connectivity in schizophrenia have been imaged. A functional counterpart of t ...
2007

A Pyramid Approach to Subpixel Registration Based on Intensity

Michaël Unser, Philippe Thévenaz

We present an automatic sub-pixel registration algorithm that minimizes the mean square difference of intensities between a reference and a test data set, which can be either tri-dimensional (3-D) volumes or bi-dimensional (2-D) images. It uses spline proc ...
IEEE1998

The Schwarz lemma for nonpositively curved Riemannian surfaces

Marc Troyanov

In this paper, we prove that if f is a conformal map between two Riemannian surfaces, and if the curvature of the target is nonpositive and less than or equal to the curvature of the source, then the map is contracting. ...
1991

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.