MRF Optimization by Graph Approximation
Computer Vision and Pattern Recognition(2015)
摘要
Graph cuts-based algorithms have achieved great success in energy minimization for many computer vision applications. These algorithms provide approximated solutions for multi-label energy functions via move-making approach. This approach fuses the current solution with a proposal to generate a lower-energy solution. Thus, generating the appropriate proposals is necessary for the success of the move-making approach. However, not much research efforts has been done on the generation of “good” proposals, especially for non-metric energy functions. In this paper, we propose an application-independent and energy-based approach to generate “good” proposals. With these proposals, we present a graph cuts-based move-making algorithm called GA-fusion (fusion with graph approximation-based proposals). Extensive experiments support that our proposal generation is effective across different classes of energy functions. The proposed algorithm outperforms others both on real and synthetic problems.
更多查看译文
关键词
MRF optimization,Markov random field,graph approximation,graph cuts-based algorithms,energy minimization,computer vision application,multilabel energy functions,move-making approach,application-independent approach,energy-based approach,GA-fusion algorithm,graph approximation-based proposal
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要