English
Related papers

Related papers: Tighter Bounds for Reconstruction from $\epsilon$-…

200 papers

We present a Machine Learning-based method for tomographic reconstruction of dense layered objects, with range of projection angles limited to $\pm $10$^\circ$. Whereas previous approaches to phase tomography generally require two steps,…

Image and Video Processing · Electrical Eng. & Systems 2020-01-08 Alexandre Goy , Girish Rughoobur , Shuai Li , Kwabena Arthur , Akintunde I. Akinwande , George Barbastathis

Assume you encounter an inverse problem that shall be solved for a large number of data, but no ground-truth data is available. To emulate this encounter, in this study, we assume it is unknown how to solve the imaging problem of Computed…

Deep implicit field regression methods are effective for 3D reconstruction from single-view images. However, the impact of different sampling patterns on the reconstruction quality is not well-understood. In this work, we first study the…

Computer Vision and Pattern Recognition · Computer Science 2020-07-28 Yifan Xu , Tianqi Fan , Yi Yuan , Gurprit Singh

Trace reconstruction is the problem of learning an unknown string $x$ from independent traces of $x$, where traces are generated by independently deleting each bit of $x$ with some deletion probability $q$. In this paper, we initiate the…

Data Structures and Algorithms · Computer Science 2020-12-15 Shyam Narayanan , Michael Ren

Suppose we are given a vector $f$ in $\R^N$. How many linear measurements do we need to make about $f$ to be able to recover $f$ to within precision $\epsilon$ in the Euclidean ($\ell_2$) metric? Or more exactly, suppose we are interested…

Classical Analysis and ODEs · Mathematics 2007-05-23 Emmanuel Candes , Terence Tao

In the Network Inference problem, one seeks to recover the edges of an unknown graph from the observations of cascades propagating over this graph. In this paper, we approach this problem from the sparse recovery perspective. We introduce a…

Social and Information Networks · Computer Science 2024-11-14 Jean Pouget-Abadie , Thibaut Horel

A central challenge in data visualization is to understand which data samples are required to generate an image of a data set in which the relevant information is encoded. In this work, we make a first step towards answering the question of…

Graphics · Computer Science 2021-03-12 Sebastian Weiss , Mustafa Işık , Justus Thies , Rüdiger Westermann

Shape recognition and classification is a problem with a wide variety of applications. Several recent works have demonstrated that topological descriptors can be used as summaries of shapes and utilized to compute distances. In this…

Computational Geometry · Computer Science 2018-11-29 Brittany Terese Fasy , Samuel Micka , David L. Millman , Anna Schenfisch , Lucia Williams

Sample reuse techniques have significantly reduced the numerical complexity of probabilistic robustness analysis. Existing results show that for a nested collection of hyper-spheres the complexity of the problem of performing $N$ equivalent…

Optimization and Control · Mathematics 2008-05-13 Xinjia Chen , Jorge L. Aravena , Kemin Zhou

In this work we analyze a convex-programming method for estimating superpositions of point sources or spikes from nonuniform samples of their convolution with a known kernel. We consider a one-dimensional model where the kernel is either a…

Optimization and Control · Mathematics 2018-06-04 Brett Bernstein , Carlos Fernandez-Granda

This paper explores the challenge of teaching a machine how to reverse-engineer the grid-marked surfaces used to represent data in 3D surface plots of two-variable functions. These are common in scientific and economic publications; and…

Computer Vision and Pattern Recognition · Computer Science 2021-06-15 Laura E. Brandt , William T. Freeman

In this paper, we propose an extremely simple deep model for the unsupervised nonlinear dimensionality reduction -- deep distributed random samplings, which performs like a stack of unsupervised bootstrap aggregating. First, its network…

Machine Learning · Computer Science 2013-12-17 Xiao-Lei Zhang

This paper considers the approximate reconstruction of points, x \in R^D, which are close to a given compact d-dimensional submanifold, M, of R^D using a small number of linear measurements of x. In particular, it is shown that a number of…

Information Theory · Computer Science 2012-04-17 Mark A. Iwen , Mauro Maggioni

We propose a compressive sensing algorithm that exploits geometric properties of images to recover images of high quality from few measurements. The image reconstruction is done by iterating the two following steps: 1) estimation of normal…

Computer Vision and Pattern Recognition · Computer Science 2015-06-11 Virginia Estellers , Jean-Philippe Thiran , Xavier Bresson

We consider the problem of sampling an edge almost uniformly from an unknown graph, $G = (V, E)$. Access to the graph is provided via queries of the following types: (1) uniform vertex queries, (2) degree queries, and (3) neighbor queries.…

Computational Complexity · Computer Science 2017-06-30 Talya Eden , Will Rosenbaum

We study the problem of stable reconstruction of the short-time Fourier transform from samples taken from trajectories in $\R^2$. We first consider the interplay between relative density of the trajectory and the reconstruction property.…

Functional Analysis · Mathematics 2021-12-06 Michael Speckbacher

Recent medical image reconstruction techniques focus on generating high-quality medical images suitable for clinical use at the lowest possible cost and with the fewest possible adverse effects on patients. Recent works have shown…

Image and Video Processing · Electrical Eng. & Systems 2025-01-07 Shijun Liang , Anish Lahiri , Saiprasad Ravishankar

3D scene reconstruction from 2D images has been a long-standing task. Instead of estimating per-frame depth maps and fusing them in 3D, recent research leverages the neural implicit surface as a unified representation for 3D reconstruction.…

Computer Vision and Pattern Recognition · Computer Science 2023-09-19 Xinyi Yu , Liqin Lu , Jintao Rong , Guangkai Xu , Linlin Ou

This paper concerns the reconstruction of possibly complex-valued coefficients in a second-order scalar elliptic equation posed on a bounded domain from knowledge of several solutions of that equation. We show that for a sufficiently large…

Analysis of PDEs · Mathematics 2011-11-23 Guillaume Bal , Gunther Uhlmann

This paper extends previous research in that sense that for orthogonal projections of rigid smooth (true-3D) curves moving totally free it reduces the number of required traceable points to two only (the best results known so far to the…

Computer Vision and Pattern Recognition · Computer Science 2017-04-12 Mieczysław A. Kłopotek