On maximum weight objects decomposable into based rectilinear convex objects

Mahmuda Ahmed,Iffat Chowdhury,Matt Gibson,Mohammad Shahedul Islam,Jessica Sherrette

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures（2013）

引用 3|浏览0

暂无评分

摘要

Our main concern is the following variant of the image segmentation problem: given a weighted grid graph and a set of vertical and/or horizontal base lines crossing through the grid, compute a maximum-weight object which can be decomposed into based rectilinear convex objects with respect to the base lines. Our polynomial-time algorithm reduces the problem to solving a polynomial number of instances of the maximum flow problem.

查看译文

关键词

following variant,main concern,maximum flow problem,rectilinear convex object,maximum-weight object,base line,maximum weight objects decomposable,image segmentation problem,horizontal base line,polynomial-time algorithm,polynomial number,weighted grid graph

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要