Sciweavers

7924 search results - page 1370 / 1585
» Non-Malleable Functions and Their Applications
Sort
View
PAMI
2006
164views more  PAMI 2006»
15 years 6 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero
PAMI
2006
181views more  PAMI 2006»
15 years 6 months ago
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka
PAMI
2006
178views more  PAMI 2006»
15 years 6 months ago
Learning Nonlinear Image Manifolds by Global Alignment of Local Linear Models
Appearance-based methods, based on statistical models of the pixel values in an image (region) rather than geometrical object models, are increasingly popular in computer vision. I...
Jakob J. Verbeek
SIAMDM
2008
119views more  SIAMDM 2008»
15 years 6 months ago
On the Graph Bisection Cut Polytope
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...
SIAMIS
2008
115views more  SIAMIS 2008»
15 years 6 months ago
Geodesic Evolution Laws---A Level-Set Approach
Motion of curves governed by geometric evolution laws, such as mean curvature flow and surface diffusion, is the basis for many algorithms in image processing. If the images to be ...
Christina Stöcker, Axel Voigt
« Prev « First page 1370 / 1585 Last » Next »