Sciweavers

155 search results - page 10 / 31
» An Algorithm for Minimizing the Piecewise Smooth Mumford-Sha...
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Efficient Minimization of Decomposable Submodular Functions
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
Peter Stobbe, Andreas Krause
SCALESPACE
2009
Springer
14 years 2 months ago
Geodesically Linked Active Contours: Evolution Strategy Based on Minimal Paths
The proposed method is related to parametric and geodesic active contours as well as minimal paths, in the context of image segmentation 1 . Our geodesically linked active contour ...
Julien Mille, Laurent D. Cohen
WEA
2009
Springer
126views Algorithms» more  WEA 2009»
14 years 2 months ago
Computing Elevation Maxima by Searching the Gauss Sphere
The elevation function on a smoothly embedded 2-manifold in R3 reflects the multiscale topography of cavities and protrusions as local maxima. The function has been useful in iden...
Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov
VISUALIZATION
2003
IEEE
14 years 23 days ago
Fairing scalar fields by variational modeling of contours
Volume rendering and isosurface extraction from three-dimensional scalar fields are mostly based on piecewise trilinear representations. In regions of high geometric complexity s...
Martin Bertram
ORL
2011
13 years 1 months ago
Convex approximations to sparse PCA via Lagrangian duality
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
Ronny Luss, Marc Teboulle