Sciweavers

70 search results - page 3 / 14
» Reconciling Distance Functions and Level Sets
Sort
View
SCIA
2009
Springer
161views Image Analysis» more  SCIA 2009»
14 years 9 days 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...
ICCV
2011
IEEE
12 years 4 months ago
Correspondence Free Registration through a Point-to-Model Distance Minimization
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of ...
Mohammad Rouhani and Angel D. Sappa
SCALESPACE
2007
Springer
13 years 12 months ago
Level Set Methods for Watershed Image Segmentation
In this work a marker-controlled and regularized watershed segmentation is proposed. Only a few previous studies address the task of regularizing the obtained watershed lines from ...
Xue-Cheng Tai, Erlend Hodneland, Joachim Weickert,...
BMVC
2010
13 years 3 months ago
Diffusion-based Regularisation Strategies for Variational Level Set Segmentation
Variational level set methods are formulated as energy minimisation problems, which are often solved by gradient-based optimisation methods, such as gradient descent. Unfortunatel...
Maximilian Baust, Darko Zikic, Nassir Navab
ECCV
2010
Springer
13 years 11 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...