15,463 research outputs found
Fitting a 3D Morphable Model to Edges: A Comparison Between Hard and Soft Correspondences
We propose a fully automatic method for fitting a 3D morphable model to
single face images in arbitrary pose and lighting. Our approach relies on
geometric features (edges and landmarks) and, inspired by the iterated closest
point algorithm, is based on computing hard correspondences between model
vertices and edge pixels. We demonstrate that this is superior to previous work
that uses soft correspondences to form an edge-derived cost surface that is
minimised by nonlinear optimisation.Comment: To appear in ACCV 2016 Workshop on Facial Informatic
Minimum-Cost Coverage of Point Sets by Disks
We consider a class of geometric facility location problems in which the goal
is to determine a set X of disks given by their centers (t_j) and radii (r_j)
that cover a given set of demand points Y in the plane at the smallest possible
cost. We consider cost functions of the form sum_j f(r_j), where f(r)=r^alpha
is the cost of transmission to radius r. Special cases arise for alpha=1 (sum
of radii) and alpha=2 (total area); power consumption models in wireless
network design often use an exponent alpha>2. Different scenarios arise
according to possible restrictions on the transmission centers t_j, which may
be constrained to belong to a given discrete set or to lie on a line, etc. We
obtain several new results, including (a) exact and approximation algorithms
for selecting transmission points t_j on a given line in order to cover demand
points Y in the plane; (b) approximation algorithms (and an algebraic
intractability result) for selecting an optimal line on which to place
transmission points to cover Y; (c) a proof of NP-hardness for a discrete set
of transmission points in the plane and any fixed alpha>1; and (d) a
polynomial-time approximation scheme for the problem of computing a minimum
cost covering tour (MCCT), in which the total cost is a linear combination of
the transmission cost for the set of disks and the length of a tour/path that
connects the centers of the disks.Comment: 10 pages, 4 figures, Latex, to appear in ACM Symposium on
Computational Geometry 200
Convex Hull of Points Lying on Lines in o(n log n) Time after Preprocessing
Motivated by the desire to cope with data imprecision, we study methods for
taking advantage of preliminary information about point sets in order to speed
up the computation of certain structures associated with them.
In particular, we study the following problem: given a set L of n lines in
the plane, we wish to preprocess L such that later, upon receiving a set P of n
points, each of which lies on a distinct line of L, we can construct the convex
hull of P efficiently. We show that in quadratic time and space it is possible
to construct a data structure on L that enables us to compute the convex hull
of any such point set P in O(n alpha(n) log* n) expected time. If we further
assume that the points are "oblivious" with respect to the data structure, the
running time improves to O(n alpha(n)). The analysis applies almost verbatim
when L is a set of line-segments, and yields similar asymptotic bounds. We
present several extensions, including a trade-off between space and query time
and an output-sensitive algorithm. We also study the "dual problem" where we
show how to efficiently compute the (<= k)-level of n lines in the plane, each
of which lies on a distinct point (given in advance).
We complement our results by Omega(n log n) lower bounds under the algebraic
computation tree model for several related problems, including sorting a set of
points (according to, say, their x-order), each of which lies on a given line
known in advance. Therefore, the convex hull problem under our setting is
easier than sorting, contrary to the "standard" convex hull and sorting
problems, in which the two problems require Theta(n log n) steps in the worst
case (under the algebraic computation tree model).Comment: 26 pages, 5 figures, 1 appendix; a preliminary version appeared at
SoCG 201
Non-Abelian Analogs of Lattice Rounding
Lattice rounding in Euclidean space can be viewed as finding the nearest
point in the orbit of an action by a discrete group, relative to the norm
inherited from the ambient space. Using this point of view, we initiate the
study of non-abelian analogs of lattice rounding involving matrix groups. In
one direction, we give an algorithm for solving a normed word problem when the
inputs are random products over a basis set, and give theoretical justification
for its success. In another direction, we prove a general inapproximability
result which essentially rules out strong approximation algorithms (i.e., whose
approximation factors depend only on dimension) analogous to LLL in the general
case.Comment: 30 page
The Triangle Closure is a Polyhedron
Recently, cutting planes derived from maximal lattice-free convex sets have
been studied intensively by the integer programming community. An important
question in this research area has been to decide whether the closures
associated with certain families of lattice-free sets are polyhedra. For a long
time, the only result known was the celebrated theorem of Cook, Kannan and
Schrijver who showed that the split closure is a polyhedron. Although some
fairly general results were obtained by Andersen, Louveaux and Weismantel [ An
analysis of mixed integer linear sets based on lattice point free convex sets,
Math. Oper. Res. 35 (2010), 233--256] and Averkov [On finitely generated
closures in the theory of cutting planes, Discrete Optimization 9 (2012), no.
4, 209--215], some basic questions have remained unresolved. For example,
maximal lattice-free triangles are the natural family to study beyond the
family of splits and it has been a standing open problem to decide whether the
triangle closure is a polyhedron. In this paper, we show that when the number
of integer variables the triangle closure is indeed a polyhedron and its
number of facets can be bounded by a polynomial in the size of the input data.
The techniques of this proof are also used to give a refinement of necessary
conditions for valid inequalities being facet-defining due to Cornu\'ejols and
Margot [On the facets of mixed integer programs with two integer variables and
two constraints, Mathematical Programming 120 (2009), 429--456] and obtain
polynomial complexity results about the mixed integer hull.Comment: 39 pages; made self-contained by merging material from
arXiv:1107.5068v
- …