Related papers: Reconstruction of Convex Bodies from Projection Cu…
We investigate the problem of estimating the 3D shape of an object defined by a set of 3D landmarks, given their 2D correspondences in a single image. A successful approach to alleviating the reconstruction ambiguity is the 3D deformable…
This paper proposes the use of an end-to-end Convolutional Neural Network for direct reconstruction of the 3D geometry of humans via volumetric regression. The proposed method does not require the fitting of a shape model and can be trained…
We consider minimization of functions that are compositions of convex or prox-regular functions (possibly extended-valued) with smooth vector functions. A wide variety of important optimization problems fall into this framework. We describe…
In this paper, we address the problem of reconstructing a curve from the lengths of its projections onto lines. We first note that the curve itself is not uniquely determined from these measurements. However, we find that a curve determines…
We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…
We define a generalization of convex functions, which we call $\delta$-convex functions, and show they must satisfy interior H\"older and $W^{1,p}$ estimates. As an application, we consider solutions of a certain class of fully nonlinear…
Consider a polyhedral convex cone which is given by a finite number of linear inequalities. We investigate the problem to project this cone into a subspace and show that this problem is closely related to linear vector optimization: We…
We consider compact convex hypersurfaces contracting by functions of their curvature. Under the mean curvature flow, uniformly convex smooth initial hypersurfaces evolve to remain smooth and uniformly convex, and contract to points after…
We present a computational framework that transforms single images into 3D physical objects. The visual geometry of a physical object in an image is determined by three orthogonal attributes: mechanical properties, external forces, and…
In this paper we present a new algorithmic realization of a projection-based scheme for general convex constrained optimization problem. The general idea is to transform the original optimization problem to a sequence of feasibility…
A general recipe is developed for the study of rigid body dynamics in terms of Poincar\'e surfaces of section. A section condition is chosen which captures every trajectory on a given energy surface. The possible topological types of the…
We introduce and study a new class of $\eps$-convex bodies (extending the class of convex bodies) in metric and normed linear spaces. We analyze relations between characteristic properties of convex bodies, demonstrate how $\eps$-convex…
In the process of projecting the surface of a three-dimensional object onto a two-dimensional surface, due to the perspective distortion, the image on the surface of the object will have different degrees of distortion according to the…
In this paper, we studied the equilibrium problem where the bi-function may be quasiconvex with respect to the second variable and the feasible set is the intersection of a finite number of convex sets. We propose a projection-algorithm,…
Attenuated Radon projections with respect to the weight function $W_\mu(x,y) = (1-x^2-y^2)^{\mu-1/2}$ are shown to be closely related to the orthogonal expansion in two variables with respect to $W_\mu$. This leads to an algorithm for…
Solving a long-standing open question in convex geometry, we will show that typical convex surfaces contain points of infinite curvature in all tangent directions. To prove this, we use an easy curvature definition imitating the idea of…
Writing an uncomplicated, robust, and scalable three-dimensional convex hull algorithm is challenging and problematic. This includes, coplanar and collinear issues, numerical accuracy, performance, and complexity trade-offs. While there are…
Here is an English summary of the abstract: This research investigates a geometric dynamical mechanism within a specific class of domains that contain a fixed convex core. By using a radial structure that links the boundaries of the core…
For a fixed root of a quiver, it is a very hard problem to construct all or even only one indecomposable representation with this root as dimension vector. We investigate two methods which can be used for this purpose. In both cases we get…
The Nontrivial Projection Problem asks whether every finite-dimensional normed space of dimension greater than one admits a well-bounded projection of non-trivial rank and corank or, equivalently, whether every centrally symmetric convex…