An occluding contour of a sphere is projected to a conic in the perspective image, and such a conic is called a sphere image. Recently, it has been discovered that each sphere image is tangent to the image of the absolute conic at two double-contact image points. The double-contact theorem describes the properties of three conics which all have double contact with another conic. This theorem pr...

Traditionally, Multi-task Learning (MTL) models optimize the average of task-related objective functions, which is an intuitive approach and which we will be referring to as Average MTL. However, a more general framework, referred to as Conic MTL, can be formulated by considering conic combinations of the objective functions instead; in this framework, Average MTL arises as a special case, when...

We consider the problem of fitting a conic to a set of 2D points. It is commonly agreed that minimizing geometrical error, i.e. the sum of squared distances between the points and the conic, is better than using an algebraic error measure. However, most existing methods rely on algebraic error measures. This is usually motivated by the fact that pointto-conic distances are difficult to compute ...

In this work, we use the notion of Approximate Hessian introduced by Jeyakumar and Luc [19], and a special scalarization to establish sufficient optimality conditions for constrained multiobjective optimization problems. Throughout this paper, the data are assumed to be of class C, but not necessarily of class C.

We present new necessary optimality conditions for εe–Pareto optimal solutions of constrained vector optimization problems with empty interior ordering cones. We use the dual-space approach based on advanced tools of variational analysis and generalized differentiation. It allows us not implement any scalarization technique while be able to establish necessary results for nonconvex and nonsolid...

Abstract. Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, näıve compilation of such specifications leads to creation of many temporary arrays at runtime and, consequently, to poor performance characteristics. This paper elaborates on a new compiler optimization, named withloop-scalarization, ...

The paracatadioptric camera is one of the most popular panoramic systems currently available in the market. It provides a wide field of view by combining a parabolic shaped mirror with a camera inducing an orthographic projection. Previous work proved that the paracatadioptric projection of a line is a conic curve, and that the sensor can be fully calibrated from the image of three or more line...

This paper studies several classes of nonconvex optimization problems defined over convex cones, establishing connections between them and demonstrating that they can be equivalently formulated as convex completely positive programs. The problems being studied include: a conic quadratically constrained quadratic program (QCQP), a conic quadratic program with complementarity constraints (QPCC), ...

A decade ago, it was shown that a wide class of scalar-tensor theories can pass very restrictive weak field tests of gravity and yet exhibit non-perturbative strong field deviations away from General Relativity. This phenomenon was called ‘Spontaneous Scalarization’ and causes the (Einstein frame) scalar field inside a neutron star to rapidly become inhomogeneous once the star’s mass increases ...

Konstantinos Daniilidis and J org Ernst Computer Science Institute, Kiel University Abstract During a camera motion with arbitrary translation and xed axis rotation a vanishing point traverses a conic section on the image plane. The intrinsic parameters of the camera can be obtained from the coe cients of the conic. Special care is given to the propagation of the error covariances and the elim...