46 search results - page 4 / 10 » Exact Loopy Belief Propagation on Euler Graphs |
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
We deal with an image jigsaw puzzle problem, which is defined as reconstructing an image from a set of square and non-overlapping image patches. It is known that a general instan...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
CISS
2010
IEEE
12 years 11 months ago
2010
IEEE
—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by h...
BCB
2010
13 years 2 months ago
2010
A major bottleneck in high-throughput protein crystallography is producing protein-structure models from an electrondensity map. In previous work, we developed Acmi, a probabilist...
NIPS
2008
13 years 9 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...