Related papers: A Computer Vision Problem in Flatland
Image segmentation is a central topic in image processing and computer vision and a key issue in many applications, e.g., in medical imaging, microscopy, document analysis and remote sensing. According to the human perception, image…
Research interest in rapid structured-light imaging has grown increasingly for the modeling of moving objects, and a number of methods have been suggested for the range capture in a single video frame. The imaging area of a 3D object using…
The split common fixed-point problem is an inverse problem that consists in finding an element in a fixed-point set such that its image under a bounded linear operator belongs to another fixed-point set. Recently Censor and Segal proposed…
Face recognition is a popular application of pat- tern recognition methods, and it faces challenging problems including illumination, expression, and pose. The most popular way is to learn the subspaces of the face images so that it could…
The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…
Predicting the pose of objects from a single image is an important but difficult computer vision problem. Methods that predict a single point estimate do not predict the pose of objects with symmetries well and cannot represent uncertainty.…
Many image-to-image translation problems are ambiguous, as a single input image may correspond to multiple possible outputs. In this work, we aim to model a \emph{distribution} of possible outputs in a conditional generative modeling…
We address the problem of localisation of objects as bounding boxes in images with weak labels. This weakly supervised object localisation problem has been tackled in the past using discriminative models where each object class is localised…
We derive a closed-form expression for the projection onto a capped rotated second-order cone -- a convex set that arises in perspective relaxations of nonlinear programs with binary indicator variables. The closed-form solution involves…
The task of unsupervised image-to-image translation has seen substantial advancements in recent years through the use of deep neural networks. Typically, the proposed solutions learn the characterizing distribution of two large, unpaired…
The skewer of a pair of skew lines in space is their common perpendicular. To configuration theorems of plane projective geometry involving points and lines (such as Pappus or Desargues) there correspond configuration theorems in space:…
We take points and planes as fundamental, lines as derived, in an axiomatic formulation of three-dimensional projective space, the self-dual nature of which formulation renders automatic the principle of duality.
The linear code equivalence (LCE) problem is shown to be equivalent to the point set equivalence (PSE) problem, i.e., the problem to check whether two sets of points in a projective space over a finite field differ by a linear change of…
We study the formation of images in a reflective sphere in three configurations using caustics of the field of light rays. The optical wavefront emerging from a source point reaching a subject following passage through the optical system…
We describe the most general homogenous, planar, light-ray-direction-changing sheet that performs one-to-one imaging between object space and image space. This is a non-trivial special case (of the sheet being homogenous) of an earlier…
Linear subspace representations of appearance variation are pervasive in computer vision. This paper addresses the problem of robustly matching such subspaces (computing the similarity between them) when they are used to describe the scope…
This paper deals with a modifed iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under…
We provide formulas for projectors onto a polyhedral set, i.e. the intersection of a finite number of halfspaces. To this aim we formulate the problem of finding the projection as a convex optimization problem and we solve explicitly…
If X is a finite set of points in a multiprojective space P^n1 x ... x P^nr with r >= 2, then X may or may not be arithmetically Cohen-Macaulay (ACM). For sets of points in P^1 x P^1 there are several classifications of the ACM sets of…
We consider the problem of reconstructing binary images from their horizontal and vertical projections. It is known that the projections do not necessarily determine the image uniquely. In a previous paper it was shown that the symmetric…