Publications related to Whitney embedding theorem

Linearization and Identification of Multiple-Attractor Dynamical Systems through Laplacian Eigenmaps

Dynamical Systems (DS) are fundamental to the modeling and understanding time evolving phenomena, and have application in physics, biology and control. As determining an analytical description of the dynamics is often difficult, data-driven approaches are ...

Microtome Publishing2022

Riemannian Optimization For High-Dimensional Tensor Completion

Michael Maximilian Steinlechner

Tensor completion aims to reconstruct a high-dimensional data set where the vast majority of entries is missing. The assumption of low-rank structure in the underlying original data allows us to cast the completion problem into an optimization problem rest ...

Siam Publications2016

Dimension embedding for big data in radio interferometry

Yves Wiaux, Rafael Eduardo Carrillo Rangel, Vijay Kartik

As radio telescope data is now increasingly high-dimensional, data reduction has become essential to reduce computational load while preserving accurate signal reconstruction. Gridding the continuous Fourier visibilities represents the standard approach to ...

2015

Harmonic Active Contours

Jean-Philippe Thiran, Xavier Bresson, Dominique Zosso, Virginia Estellers Casas

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

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 ...

Oxford University Press2013

Low-Rank Matrix Completion By Riemannian Optimization

The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over the Riemannian ma ...

Siam Publications2013

Progressive Coding of 3-D Objects Based on Overcomplete Decompositions

Pascal Frossard, Pierre Vandergheynst, Ivana Tosic

This paper presents a progressive coding scheme for 3-D objects, based on overcomplete signal expansions on the 2-D sphere. Due to increased freedom in the basis construction, redundant expansions have shown interesting approximation properties in the deco ...

2006