Sciweavers

8 search results - page 1 / 2
» Efficient belief propagation for higher-order cliques using ...
Sort
View
CVPR
2007
IEEE
14 years 7 months ago
Efficient Belief Propagation for Vision Using Linear Constraint Nodes
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
Brian Potetz
ECCV
2006
Springer
14 years 6 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...
CVPR
2009
IEEE
15 years 21 hour ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
ECCV
2008
Springer
14 years 6 months ago
Deformed Lattice Discovery Via Efficient Mean-Shift Belief Propagation
We introduce a novel framework for automatic detection of repeated patterns in real images. The novelty of our work is to formulate the extraction of an underlying deformed lattice...
Minwoo Park, Robert T. Collins, Yanxi Liu