5606 search results - page 235 / 1122 » Randomization Techniques for Graphs. |
102
Voted
TIP
2008
15 years 22 days ago
2008
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
108
click to vote
IMAMS
2003
15 years 2 months ago
2003
This paper describes a graph-spectral method for 3D surface integration. The algorithm takes as its input a 2D field of surface normal estimates, delivered, for instance, by a sh...
111
click to vote
IBPRIA
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. This paper presents a general framework to segment curvilinear objects in 2D images. A pre-processing step relies on mathematical morphology to obtain a connected line wh...
121
click to vote
ECCV
2006
Springer
16 years 2 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
152
Voted
CVPR
2009
IEEE
15 years 11 months ago
2009
IEEE
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...