104 search results - page 8 / 21 » An Improved Random Neighborhood Graph Approach |
GBRPR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
109
click to vote
PAMI
2010
14 years 4 months ago
2010
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
129
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
157
Voted
PAMI
2010
14 years 8 months ago
2010
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...