Sciweavers

113 search results - page 14 / 23
» Rigid Components of Random Graphs
Sort
View
JMLR
2012
11 years 9 months ago
Randomized Optimum Models for Structured Prediction
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
Daniel Tarlow, Ryan Prescott Adams, Richard S. Zem...
MICCAI
2010
Springer
13 years 5 months ago
Joint Registration and Segmentation of Dynamic Cardiac Perfusion Images Using MRFs
In this paper we propose a Markov random field (MRF) based method for joint registration and segmentation of cardiac perfusion images, specifically the left ventricle (LV). MRFs ...
Dwarikanath Mahapatra, Ying Sun
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 1 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
11 years 9 months ago
Global minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
Jeff Erickson, Kyle Fox, Amir Nayyeri
ICCV
2003
IEEE
14 years 8 months ago
Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters
Recent stereo algorithms have achieved impressive results by modelling the disparity image as a Markov Random Field (MRF). An important component of an MRF-based approach is the i...
Marshall F. Tappen, William T. Freeman