Diverse M-Best Solutions by Dynamic Programming
Diverse M-Best Solutions by Dynamic Programming
复制标题
动态规划的各种 M-Best 解决方案
DOI:
10.1007/978-3-319-66709-6_21
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
Hamprecht
中科院分区:
文献类型:
--
作者:
Haubold;Uhlmann;Hamprecht
Many computer vision pipelines involve dynamic programming primitives such as finding a shortest path or the minimum energy solution in a tree-shaped probabilistic graphical model. In such cases, extracting not merely the best, but the set ofM-best solutions is useful to generate a rich collection of candidate proposals that can be used in downstream processing. In this work, we show howM-best solutions of tree-shaped graphical models can be obtained by dynamic programming on a special graph withMlayers. The proposed multi-layer concept is optimal for searchingM-best solutions, and so flexible that it can also approximateM-best diverse solutions. We illustrate the usefulness with applications to object detection, panorama stitching and centerline extraction.
登录
查看更多内容
DOI:
10.1007/978-3-642-29449-5_4
发表时间:
2011
期刊:
2013 IEEE Conference on Computer Vision and Pattern Recognition
影响因子:
--
作者:
N. Flerova;E. Rollon;R. Dechter
通讯作者:
R. Dechter
DOI:
10.1109/robot.2003.1242109
发表时间:
2003
期刊:
2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)
影响因子:
--
作者:
Y. Fujita;Yoshihiko Nakamura;Z. Shiller
通讯作者:
Z. Shiller
DOI:
10.1016/0888-613x(94)90031-0
发表时间:
1994
期刊:
Int. J. Approx. Reason.
影响因子:
--
作者:
B. Seroussi;J. Golmard
通讯作者:
J. Golmard
DOI:
10.1109/iccv.2011.6126242
发表时间:
2011
期刊:
2011 International Conference on Computer Vision
影响因子:
--
作者:
G. Papandreou;A. Yuille
通讯作者:
A. Yuille
DOI:
--
发表时间:
2011
期刊:
--
影响因子:
--
作者:
E. Rollon;N. Flerova;R. Dechter
通讯作者:
R. Dechter