Results 1  10
of
3,844
The Offset Filtration of Convex Objects
, 2014
"... We consider offsets of a union of convex objects. We aim for a filtration, a sequence of nested simplicial complexes, that captures the topological evolution of the offsets for increasing radii. We describe methods to compute a filtration based on the Voronoi partition with respect to the given conv ..."
Abstract
 Add to MetaCart
We consider offsets of a union of convex objects. We aim for a filtration, a sequence of nested simplicial complexes, that captures the topological evolution of the offsets for increasing radii. We describe methods to compute a filtration based on the Voronoi partition with respect to the given
SEGMENTATION OF OVERLAPPING CONVEX OBJECTS
, 2014
"... This thesis presents a framework for segmentation of clustered overlapping convex objects. The proposed approach is based on a threestep framework in which the tasks of seed point extraction, contour evidence extraction, and contour estimation are addressed. The stateofart techniques for each ste ..."
Abstract
 Add to MetaCart
This thesis presents a framework for segmentation of clustered overlapping convex objects. The proposed approach is based on a threestep framework in which the tasks of seed point extraction, contour evidence extraction, and contour estimation are addressed. The stateofart techniques for each
The Voronoi Diagram of Convex Objects in the Plane
, 2003
"... This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smooth convex objects forming pseudocircles set. A pseudocircles set is a set of bounded objects such that the boundarie ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smooth convex objects forming pseudocircles set. A pseudocircles set is a set of bounded objects
Tracking of convex objects
 In Int. Symp. on Computer Vision
, 1995
"... In this paper, we present a technique for grouping line segments sinto convex sets, where the line segments are obtained by linking edges obtained from the Canny edge detector. The novelty of the approach istwofold: �rst we de�ne an e�cient approach for testing the global convexity criterion, and se ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
, and second, we develop an optimal search based on dynamic programming or grouping the line segments into convex sets. Furthermore, we use the convexity results as the initial conditions for a deformable contour for object tracking. We show results on real images, and present a speci�c domain where this type
The voronoi diagram of planar convex objects
 Algorithms  ESA 2003
, 2003
"... Abstract This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smooth convex objects forming pseudocircles set. A pseudocircles set is a set of bounded objects such that the bo ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smooth convex objects forming pseudocircles set. A pseudocircles set is a set of bounded objects
Eigenvalue techniques for convex objective, nonconvex
, 2009
"... Consider a minimization problem given by a nonlinear, convex objective function over a nonconvex feasible region. Traditional optimization approaches will frequently encounter a fundamental difficulty when dealing with such problems: even if we can efficiently optimize over the convex hull of the fe ..."
Abstract
 Add to MetaCart
Consider a minimization problem given by a nonlinear, convex objective function over a nonconvex feasible region. Traditional optimization approaches will frequently encounter a fundamental difficulty when dealing with such problems: even if we can efficiently optimize over the convex hull
Intersection of Convex Objects in Two and Three Dimensions
, 1987
"... One of the basic geometric operations involves determining whether a pair of convex objects intersect. This problem is well understood in a model of computation in which the objects are given as input and their intersection is returned as output. For many applications, however, it may be assumed tha ..."
Abstract

Cited by 56 (3 self)
 Add to MetaCart
One of the basic geometric operations involves determining whether a pair of convex objects intersect. This problem is well understood in a model of computation in which the objects are given as input and their intersection is returned as output. For many applications, however, it may be assumed
Imputing a Convex Objective Function
"... Abstract — We consider an optimizing process (or parametric optimization problem), i.e., an optimization problem that depends on some parameters. We present a method for imputing or estimating the objective function, based on observations of optimal or nearly optimal choices of the variable for seve ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Abstract — We consider an optimizing process (or parametric optimization problem), i.e., an optimization problem that depends on some parameters. We present a method for imputing or estimating the objective function, based on observations of optimal or nearly optimal choices of the variable
Grasp Planning for NonConvex Objects
"... Robotics research aims also to develop autonomous systems in dynamically changing environments. One desirable functionality is manipulation that allows the robot to modify its surroundings. Generally, a grasp is the beginning of any manipulation task and robots must be capable to handle most common ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
objects. The shape of these objects is varied and many are nonconvex which make difficult to grasp them. This work presents a grasp planner that deals with this problem using an approximate convex decomposition of the object to plan grasps. 1.
Exact Matrix Completion via Convex Optimization
, 2008
"... We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfe ..."
Abstract

Cited by 873 (26 self)
 Add to MetaCart
by solving a simple convex optimization program. This program finds the matrix with minimum nuclear norm that fits the data. The condition above assumes that the rank is not too large. However, if one replaces the 1.2 exponent with 1.25, then the result holds for all values of the rank. Similar results hold
Results 1  10
of
3,844