arXiv research

SaR-SVM-STV improves hyperspectral image classification with shape-adaptive reconstruction and denoising.

Study reconstructs Morse-Bott functions with specific preimage conditions on 3D manifolds.

Algebras of smooth functions help reconstruct bulk topological types.

Researchers reconstruct algebraic maps onto curves based on prescribed Reeb graphs.

In this article we extend the computational geometric curve reconstruction approach to curves in Riemannian manifolds. We prove that the minimal spanning tree, given a sufficiently dense sample, correctly reconstructs the smooth arcs and further closed and simple curves in Riemannian manifolds. The proof is based on th…

A solution of Hilberts fourth problem lead to integral equation of the type generalized cosine transform. The present paper considers the solution that integral equation by integral geometry methods and propose an inversion formula for reconstruction of Crofton measures from projective smooth Finsler metrics in R3.

This paper introduces a novel approach to robust surface reconstruction from photometric stereo normal vector maps that is particularly well-suited for reconstructing surfaces from noisy gradients. Specifically, we propose an adaptive dictionary learning based approach that attempts to simultaneously integrate the grad…

Given a smooth non-trapping compact manifold with strictly con- vex boundary, we consider an inverse problem of reconstructing the manifold from the scattering data initiated from internal sources. This data consist of the exit directions of geodesics that are emaneted from interior points of the manifold. We show that…

New topology defined from spacetime paths, reconstructing spacetime structure.

Optimally estimate distances on surfaces using reconstructed meshes.

Smooth embedding space improves NAS performance.

In unsupervised learning, there is no apparent straightforward cost function that can capture the significant factors of variations and similarities. Since natural systems have smooth dynamics, an opportunity is lost if an unsupervised objective function remains static during the training process. The absence of concre…

Reconstruct trapezoidal surfaces from point clouds.

We present reconstruction algorithms for smooth signals with block sparsity from their compressed measurements. We tackle the issue of varying group size via group-sparse least absolute shrinkage selection operator (LASSO) as well as via latent group LASSO regularizations. We achieve smoothness in the signal via fusion…

Reconstruct spacetime from order and number of points.

It is well-known that a compact Riemannian spin manifold can be reconstructed from its canonical spectral triple which consists of the algebra of smooth functions, the Hilbert space of square integrable spinors and the Dirac operator. It seems to be a folklore fact that the metric can be reconstructed up to conformal e…

Entropy data replaces classical charts for smooth manifolds.

We adopt data structure in the form of cover trees and iteratively apply approximate nearest neighbour (ANN) searches for fast compressed sensing reconstruction of signals living on discrete smooth manifolds. Levering on the recent stability results for the inexact Iterative Projected Gradient (IPG) algorithm and by us…

In this work, we study the problem of reconstructing shapes from simple nonasymptotic densities measured only along shape boundaries. The particular density we study is also known as the integral area invariant and corresponds to the area of a disk centered on the boundary that is also inside the shape. It is easy to s…

Reconstruct Lie structures from functional-analytic data on groupoids.

We generalize Cartan's logarithmic derivative of a smooth map from a manifold into a Lie group $G$ to smooth maps into a homogeneous space $M=G/H$, and determine the global monodromy obstruction to reconstructing such maps from infinitesimal data. The logarithmic derivative of the embedding of a submanifold $Σ\subset M…

The paper analyzes discrete approximations to minimize curve length in Euclidean space.

We introduce a novel generative autoencoder network model that learns to encode and reconstruct images with high quality and resolution, and supports smooth random sampling from the latent space of the encoder. Generative adversarial networks (GANs) are known for their ability to simulate random high-quality images, bu…

The paper studies how to recover smooth Barron functions from $L^p$ samples efficiently.

EnVAE uses energy score for likelihood-free VAEs, improving image reconstructions.

Algorithm reconstructs vertex positions in random geometric graphs with improved accuracy.

New method reconstructs stable sentiment signals from sparse news data.

The paper recovers contact forms from boundary data using vector fields and Lyapunov functions.

A trade-off exists between reconstruction quality and the prior regularisation in the Evidence Lower Bound (ELBO) loss that Variational Autoencoder (VAE) models use for learning. There are few satisfactory approaches to deal with a balance between the prior and reconstruction objective, with most methods dealing with t…

We introduce a model-based reconstruction framework with deep learned (DL) and smoothness regularization on manifolds (STORM) priors to recover free breathing and ungated (FBU) cardiac MRI from highly undersampled measurements. The DL priors enable us to exploit the local correlations, while the STORM prior enables us …

Deep learning models have significantly improved the visual quality and accuracy on compressive sensing recovery. In this paper, we propose an algorithm for signal reconstruction from compressed measurements with image priors captured by a generative model. We search and constrain on latent variable space to make the m…

We introduce a new family of matrix norms, the "local max" norms, generalizing existing methods such as the max norm, the trace norm (nuclear norm), and the weighted or smoothed weighted trace norms, which have been extensively used in the literature as regularizers for matrix reconstruction problems. We show that this…

COSMO learns DAG structure without acyclicity constraints.

The standard approach to compressive sampling considers recovering an unknown deterministic signal with certain known structure, and designing the sub-sampling pattern and recovery algorithm based on the known structure. This approach requires looking for a good representation that reveals the signal structure, and sol…

A new algorithm speeds up EEG source localization using $\ell_1$ regularization.

Incorporating sparsity priors in learning tasks can give rise to simple, and interpretable models for complex high dimensional data. Sparse models have found widespread use in structure discovery, recovering data from corruptions, and a variety of large scale unsupervised and supervised learning problems. Assuming the …

We present a definition of discrete channel surfaces in Lie sphere geometry, which reflects several properties for smooth channel surfaces. Various sets of data, defined at vertices, on edges or on faces, are associated with a discrete channel surface that may be used to reconstruct the underlying particular discrete L…

A new algorithm reconstructs population dynamics from coarse samples.

In this paper we construct a new family of simply connected minimal complex surfaces of general type with $p_g=1$, $q=0$, and $K^2=3, 4, 5, 6, 8$ using a $\mathbb{Q}$-Gorenstein smoothing theory. We also reconstruct minimal complex surfaces of general type with $p_g=1$, $q=0$, and $K^2=1, 2$ using the same method.

Inference of space-time varying signals on graphs emerges naturally in a plethora of network science related applications. A frequently encountered challenge pertains to reconstructing such dynamic processes, given their values over a subset of vertices and time instants. The present paper develops a graph-aware kernel…

Reconstructs Riemannian geometry from diffusion properties.

The PC algorithm is a popular method for learning the structure of Gaussian Bayesian networks. It carries out statistical tests to determine absent edges in the network. It is hence governed by two parameters: (i) The type of test, and (ii) its significance level. These parameters are usually set to values recommended …

This paper introduces a new nonlinear dictionary learning method for histograms in the probability simplex. The method leverages optimal transport theory, in the sense that our aim is to reconstruct histograms using so-called displacement interpolations (a.k.a. Wasserstein barycenters) between dictionary atoms; such at…

Many problems on signal processing reduce to nonparametric function estimation. We propose a new methodology, piecewise convex fitting (PCF), and give a two-stage adaptive estimate. In the first stage, the number and location of the change points is estimated using strong smoothing. In the second stage, a constrained s…

Matrix factorisation methods decompose multivariate observations as linear combinations of latent feature vectors. The Indian Buffet Process (IBP) provides a way to model the number of latent features required for a good approximation in terms of regularised reconstruction error. Previous work has focussed on latent fe…

This paper improves signal reconstruction using determinantal sampling from random nodes.

Most of the existing methods for sparse signal recovery assume a static system: the unknown signal is a finite-length vector for which a fixed set of linear measurements and a sparse representation basis are available and an L1-norm minimization program is solved for the reconstruction. However, the same representation…

The curvature regularities are well-known for providing strong priors in the continuity of edges, which have been applied to a wide range of applications in image processing and computer vision. However, these models are usually non-convex, non-smooth and highly non-linear, the first-order optimal condition of which ar…