Fast memory-efficient generalized belief propagation
Generalized Belief Propagation (GBP) has proven to be a promising technique for performing inference on Markov random fields (MRFS). However, its heavy computational cost and large memory requirements have restricted its application to problems with small state spaces. We present methods for reducin...
Main Authors: | Kumar, MP, Torr, PHS |
---|---|
Format: | Conference item |
Language: | English |
Published: |
Springer Verlag
2006
|
Similar Items
-
Efficiently solving convex relaxations for MAP estimation
by: Kumar, MP, et al.
Published: (2008) -
Efficient discriminative learning of parts-based models
by: Kumar, MP, et al.
Published: (2010) -
Revealing decurve flows for generalized graph propagation
by: Lin, C, et al.
Published: (2024) -
OBJCUT: efficient segmentation using top-down and bottom-up cues
by: Kumar, MP, et al.
Published: (2009) -
Improved moves for truncated convex models
by: Kumar, MP, et al.
Published: (2009)