Related papers: Convergence of algorithms for reconstructing conve…
We propose strongly consistent algorithms for reconstructing the characteristic function 1_K of an unknown convex body K in R^n from possibly noisy measurements of the modulus of its Fourier transform \hat{1_K}. This represents a complete…
In this paper we consider the problem of constructing numerical algorithms for approximating of convex compact bodies in d-dimensional Euclidean space by polytopes with any given accuracy. It is well known that optimal with respect to the…
A popular class of problem in statistics deals with estimating the support of a density from $n$ observations drawn at random from a $d$-dimensional distribution. The one-dimensional case reduces to estimating the end points of a univariate…
In this paper, we derive uniqueness and stability results for surface tensors. Further, we develop two algorithms that reconstruct shape of $n$-dimensional convex bodies. One algorithm requires knowledge of a finite number of surface…
Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…
Prediction-correction algorithms are a highly effective class of methods for solving pseudo-convex optimization problems. The descent direction of these algorithms can be viewed as an adjustment to the gradient direction based on the…
This paper is devoted to a new modification of a recently proposed adaptive stochastic mirror descent algorithm for constrained convex optimization problems in the case of several convex functional constraints. Algorithms, standard and its…
Vertex direction algorithms have been around for a few decades in the experimental design and mixture models literature. We briefly review this type of algorithm and describe a new member of the family: the support reduction algorithm. The…
We propose a novel method to accurately reconstruct a set of images representing a single scene from few linear multi-view measurements. Each observed image is modeled as the sum of a background image and a foreground one. The background…
A polyhedral approximation of a convex body can be calculated by solving approximately an associated multiobjective convex program (MOCP). An MOCP can be solved approximately by Benson type algorithms, which compute outer and inner…
In this paper, we analyze the mirror descent algorithm for non-smooth optimization problems in which the objective function is relatively strongly convex, without relying on the standard Lipschitz continuity assumption commonly used in the…
In this paper some adaptive mirror descent algorithms for problems of minimization convex objective functional with several convex Lipschitz (generally, non-smooth) functional constraints are considered. It is shown that the methods are…
We develop mask iterative hard thresholding algorithms (mask IHT and mask DORE) for sparse image reconstruction of objects with known contour. The measurements follow a noisy underdetermined linear model common in the compressive sampling…
We explore the application of volumetric reconstruction from structured-light sensors in cognitive neuroscience, specifically in the quantification of the size-weight illusion, whereby humans tend to systematically perceive smaller objects…
We study the problem of approximating the mixed volume $V(P_1^{(\alpha_1)}, \dots, P_k^{(\alpha_k)})$ of an $k$-tuple of convex polytopes $(P_1, \dots, P_k)$, each of which is defined as the convex hull of at most $m_0$ points in…
A version of the convexification numerical method for a Coefficient Inverse Problem for a 1D hyperbolic PDE is presented. The data for this problem are generated by a single measurement event. This method converges globally. The most…
We consider the problem of estimating convex boundaries from blurred and noisy observations. In our model, the convolution of an intensity function $f$ is observed with additive Gaussian white noise. The function $f$ is assumed to have…
Fourier ptychography is a new computational microscopy technique that provides gigapixel-scale intensity and phase images with both wide field-of-view and high resolution. By capturing a stack of low-resolution images under different…
Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…
The objective of this paper is to develop methods for solving image recovery problems subject to constraints on the solution. More precisely, we will be interested in problems which can be formulated as the minimization over a closed convex…