993 search results - page 139 / 199 » A Fast Optimization Method for Level Set Segmentation |
130
click to vote
ECCV
2000
Springer
15 years 6 months ago
2000
Springer
This paper presents a new method to find minimal paths in 3D images, giving as initial data one or two endpoints. This is based on previous work [1] for extracting paths in 2D ima...
107
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
133
Voted
AAAI
2006
15 years 3 months ago
2006
We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a co...
101
Voted
SIAMJO
2010
14 years 9 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
124
click to vote
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...