91 search results - page 12 / 19 » Using PageRank to Locally Partition a Graph |
100
click to vote
ACCV
2009
Springer
15 years 4 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
97
Voted
AUSAI
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
MICCAI
2005
Springer
15 years 10 months ago
2005
Springer
Shape priors attempt to represent biological variations within a population. When variations are global, Principal Component Analysis (PCA) can be used to learn major modes of vari...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
7 Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of pa...
115
click to vote
ECCV
2008
Springer
15 years 7 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 ...