73 search results - page 11 / 15 » Thin Junction Trees |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
TC
2010
13 years 8 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
DDEP
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. Our component-based parametrisable font system is a newly developed font description and reproduction technology. It incorporates for each basic character shape a softwar...
TIP
2008
13 years 9 months ago
2008
This paper presents a connected coherence tree algorithm (CCTA) for image segmentation with no prior knowledge. It aims to find regions of semantic coherence based on the proposed ...