62 search results - page 4 / 13 » Global minimum cuts in surface embedded graphs |
ECCV
2008
Springer
14 years 4 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
ACIVS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We ...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
TVCG
2008
13 years 5 months ago
2008
Computing smooth and optimal one-to-one maps between surfaces of same topology is a fundamental problem in graphics and such a method provides us a ubiquitous tool for geometric mo...
COMPGEOM
2009
ACM
14 years 8 days ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...