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 |
---|---|
格式: | Conference item |
语言: | English |
出版: |
Springer Verlag
2006
|
相似书籍
-
Efficiently solving convex relaxations for MAP estimation
由: Kumar, MP, et al.
出版: (2008) -
Efficient discriminative learning of parts-based models
由: Kumar, MP, et al.
出版: (2010) -
Revealing decurve flows for generalized graph propagation
由: Lin, C, et al.
出版: (2024) -
OBJCUT: efficient segmentation using top-down and bottom-up cues
由: Kumar, MP, et al.
出版: (2009) -
Improved moves for truncated convex models
由: Kumar, MP, et al.
出版: (2009)