Sciweavers

19 search results - page 4 / 4
» Probabilistic Subgraph Matching Based on Convex Relaxation
Sort
View
PAMI
2011
12 years 12 months ago
Rigid and Articulated Point Registration with Expectation Conditional Maximization
—This paper addresses the issue of matching rigid and articulated shapes through probabilistic point registration. The problem is recast into a missing data framework where unkno...
Radu Horaud, Florence Forbes, Manuel Yguel, Guilla...
PAMI
2012
11 years 7 months ago
Fast Joint Estimation of Silhouettes and Dense 3D Geometry from Multiple Images
—We propose a probabilistic formulation of joint silhouette extraction and 3D reconstruction given a series of calibrated 2D images. Instead of segmenting each image separately i...
Kalin Kolev, Thomas Brox, Daniel Cremers
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 18 days ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
SIAMSC
2010
120views more  SIAMSC 2010»
13 years 3 months ago
Simultaneously Sparse Solutions to Linear Inverse Problems with Multiple System Matrices and a Single Observation Vector
Abstract. A problem that arises in slice-selective magnetic resonance imaging (MRI) radiofrequency (RF) excitation pulse design is abstracted as a novel linear inverse problem with...
Adam C. Zelinski, Vivek K. Goyal, Elfar Adalsteins...