158 research outputs found

    Embedding Riemannian Manifolds by the Heat Kernel of the Connection Laplacian

    Full text link
    Given a class of closed Riemannian manifolds with prescribed geometric conditions, we introduce an embedding of the manifolds into â„“2\ell^2 based on the heat kernel of the Connection Laplacian associated with the Levi-Civita connection on the tangent bundle. As a result, we can construct a distance in this class which leads to a pre-compactness theorem on the class under consideration

    Spectral Convergence of the connection Laplacian from random samples

    Full text link
    Spectral methods that are based on eigenvectors and eigenvalues of discrete graph Laplacians, such as Diffusion Maps and Laplacian Eigenmaps are often used for manifold learning and non-linear dimensionality reduction. It was previously shown by Belkin and Niyogi \cite{belkin_niyogi:2007} that the eigenvectors and eigenvalues of the graph Laplacian converge to the eigenfunctions and eigenvalues of the Laplace-Beltrami operator of the manifold in the limit of infinitely many data points sampled independently from the uniform distribution over the manifold. Recently, we introduced Vector Diffusion Maps and showed that the connection Laplacian of the tangent bundle of the manifold can be approximated from random samples. In this paper, we present a unified framework for approximating other connection Laplacians over the manifold by considering its principle bundle structure. We prove that the eigenvectors and eigenvalues of these Laplacians converge in the limit of infinitely many independent random samples. We generalize the spectral convergence results to the case where the data points are sampled from a non-uniform distribution, and for manifolds with and without boundary

    Phenotype-based and Self-learning Inter-individual Sleep Apnea Screening with a Level IV Monitoring System

    Get PDF
    Purpose: We propose a phenotype-based artificial intelligence system that can self-learn and is accurate for screening purposes, and test it on a Level IV monitoring system. Methods: Based on the physiological knowledge, we hypothesize that the phenotype information will allow us to find subjects from a well-annotated database that share similar sleep apnea patterns. Therefore, for a new-arriving subject, we can establish a prediction model from the existing database that is adaptive to the subject. We test the proposed algorithm on a database consisting of 62 subjects with the signals recorded from a Level IV wearable device measuring the thoracic and abdominal movements and the SpO2. Results: With the leave-one cross validation, the accuracy of the proposed algorithm to screen subjects with an apnea-hypopnea index greater or equal to 15 is 93.6%, the positive likelihood ratio is 6.8, and the negative likelihood ratio is 0.03. Conclusion: The results confirm the hypothesis and show that the proposed algorithm has great potential to screen patients with SAS
    • …
    corecore