.png){kind=icon}
返回
Submodular Function Optimization for Motion Clustering and Image Segmentation
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2018.2885591.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a framework of maximizing quadratic submodular energy with a knapsack constraint approximately, to solve certain computer vision problems. The proposed submodular maximization problem can be viewed as a generalization of the classic 0/1 knapsack problem. Importantly, maximization of our knapsack constrained submodular energy function can be solved via dynamic programing. We further introduce a range-reduction step prior to dynamic programing as a two-stage procedure for more efficient maximization. In order to demonstrate the effectiveness of the proposed energy function and its maximization algorithm, we apply it to two representative computer vision tasks: image segmentation and motion trajectory clustering. Experimental results of image segmentation demonstrate that our method outperforms the classic segmentation algorithms of graph cuts and random walks. Moreover, our framework achieves better performance than state-of-the-art methods on the motion trajectory clustering task.
Keyword:
Knapsack constraint
segmentation
submodular maximization
trajectory clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
.png){kind=icon}
Objective Extraction for Many-Objective Optimization Problems: Algorithm and Test Problems多目标优化问题的目标提取: 算法和测试问题
PREAI
分享收藏Constrained Monotone k-Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee使用具有理论保证的多目标进化算法的约束单调k-子模函数最大化
PREAI
分享收藏Health Literacy – a review of research using the European Health Literacy Questionnaire (HLS-EU-Q16) in 2010-2018健康素养-2010-2018使用欧洲健康素养问卷 (HLS-EU-Q16) 进行的研究综述
OAAI
OAAI分享收藏
查看更多内容