Sciweavers

302 search results - page 55 / 61
» Reducing graphs in graph cut segmentation
Sort
View
ECCV
2008
Springer
15 years 10 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
MOBIHOC
2005
ACM
15 years 11 months ago
Hybrid sensor networks: a small world
In this paper, we investigate the use of limited infrastructure, in the form of wires, for improving the energy efficiency of a wireless sensor network. We call such a sensor netw...
Gaurav Sharma, Ravi Mazumdar
GIS
2007
ACM
15 years 3 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
ECCV
2006
Springer
16 years 1 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
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...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
PAMI
2008
198views more  PAMI 2008»
14 years 11 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...