首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到2条相似文献,搜索用时 0 毫秒
1.
The belief propagation (BP) algorithm is an efficient way to minimize the MRF energy for image segmentation. This paper proposes a hierarchical BP algorithm with variable weighting parameters (HBP-VW) to improve the segmentation accuracy of the BP-based algorithms. In the HBP-VW, two variable weighting parameters are introduced, the global parameter and the local parameter. The global parameter is used to overall adjust the influence of each part in the message update rule. The local parameter is designed to describe the local texture pattern for each site. Texture, remote sensing, and nature images are employed to test the proposed algorithm. Experimental results illustrate a better segmentation accuracy compared with other BP-based algorithms.  相似文献   

2.
In the context of inference with expectation constraints, we propose an approach based on the “loopy belief propagation” algorithm (lpb), as a surrogate to an exact Markov Random Field (mrf) modelling. A prior information composed of correlations among a large set of N variables, is encoded into a graphical model; this encoding is optimized with respect to an approximate decoding procedure (lbp), which is used to infer hidden variables from an observed subset. We focus on the situation where the underlying data have many different statistical components, representing a variety of independent patterns. Considering a single parameter family of models we show how lpb may be used to encode and decode efficiently such information, without solving the NP-hard inverse problem yielding the optimal mrf. Contrary to usual practice, we work in the non-convex Bethe free energy minimization framework, and manage to associate a belief propagation fixed point to each component of the underlying probabilistic mixture. The mean field limit is considered and yields an exact connection with the Hopfield model at finite temperature and steady state, when the number of mixture components is proportional to the number of variables. In addition, we provide an enhanced learning procedure, based on a straightforward multi-parameter extension of the model in conjunction with an effective continuous optimization procedure. This is performed using the stochastic search heuristic cmaes and yields a significant improvement with respect to the single parameter basic model.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号