Effici的ent Belief propagation for Early Vision.pptVIP

3.Multi-Grid BP level 0 level 1 Illustration of two levels in the multi-grid method be the message that node p sends to the right at iteration t. , , be the messages send to left, up and down, respectively Instance: * 3.Multi-Grid BP level i-1 at level i is the block containing node at level i ? 1, level i The cost of assigning label to a block b (block data cost) Block discontinuity costs * 3.Multi-Grid BP Potts model the same truncated linear model Truncated quadratic Model * 3.Multi-Grid BP go go go run BP for a small number of iterations at each level (between 5 and 10) Note that the total number of nodes in the hierarchy is just the number of nodes at the finest level * 3.Multi-Grid BP Experiments .1 stereo results for the Tsukuba image pair * * number of message update iterations for our multi-grid BP method versus the standard algorithm * running BP with all speedup techniques versus running BP with all but one of the techniques. min convolution method provides an important speedup Experiments .2 Restoration results with an input that has missing values. 置信传播算法采用消息传递机制实现能量极小化。 根据能量函数中每个因子的取值设定消息(message)和置信度(belief) 每个像素于每个变量值都有一个置信度 消息反映邻近站点变量取值对该站点变量取值的影响 每个站点从其邻近站点接收消息以调整其每个变量值的置信度 算法迭代传递消息以调整各站点每个变量值的置信度，不断减小能量值。 当所有站点各个变量值的置信度趋于稳定时，算法选择置信度最大的变量值作为每个站点变量的取值 * * Efficient Belief propagation for Early Vision Pedro F. Felzenszwalb University of Chicago Daniel P. Huttenlocher Cornell University International Journal of Computer Vision 2006.10 讲解人：步文斌 perface Early vision problems: problems based on pixels. Such as stereo, and image restoration Early vision problems can be formulated as a maximum a posteriori MRF (MAP-MRF) problem. methods to solve MAP-MRF: simulated annealing , which can often take an unacceptably long time although global optimization is achieved in theory * Markov random field (MRF) models Message passing 3 techniques to reduce the time 1.Computin