Sciweavers

1819 search results - page 18 / 364
» Computability and Representations of the Zero Set
Sort
View
ICML
2000
IEEE
14 years 9 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
JSCIC
2008
148views more  JSCIC 2008»
13 years 8 months ago
Finite Element-Based Level Set Methods for Higher Order Flows
In this paper we shall discuss the numerical simulation of higher order geometric flows by level set methods. Main examples under considerations are surface diffusion and the Will...
Martin Burger, Christina Stöcker, Axel Voigt
SCIA
2009
Springer
161views Image Analysis» more  SCIA 2009»
14 years 3 months ago
A Fast Optimization Method for Level Set Segmentation
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
Thord Andersson, Gunnar Läthén, Reiner...
MP
2007
91views more  MP 2007»
13 years 8 months ago
Set Intersection Theorems and Existence of Optimal Solutions
The question of nonemptiness of the intersection of a nested sequence of closed sets is fundamental in a number of important optimization topics, including the existence of optima...
Dimitri P. Bertsekas, Paul Tseng
ECCV
2010
Springer
14 years 2 months ago
Converting Level Set Gradients to Shape Gradients
The level set representation of shapes is useful for shape evolution and is widely used for the minimization of energies with respect to shapes. Many algorithms consider energies d...