Maximum weight digital regions decomposable into digital star-shaped regions

Authors:
Matt Gibson;Dongfeng Han;Milan Sonka;Xiaodong Wu
Affiliations:
Dept. of Electrical and Computer Engineering, University of Iowa, Iowa City, IA;Dept. of Electrical and Computer Engineering, University of Iowa, Iowa City, IA;Dept. of Electrical and Computer Engineering, University of Iowa, Iowa City, IA;Dept. of Electrical and Computer Engineering, University of Iowa, Iowa City, IA
Venue:
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Year:
2011

Citing 8
Cited 2

Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Data Mining with optimized two-dimensional association rules

ACM Transactions on Database Systems (TODS)
Fast Approximate Energy Minimization via Graph Cuts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Efficient Algorithms for Constructing a Pyramid from a Terrain*This paper was presented at Japan Conference on Discrete and Computation Geometry 2002 (JCDCG 2002).

IEICE - Transactions on Information and Systems
Consistent Digital Rays

Discrete & Computational Geometry - Special Issue: 24th Annual Symposium on Computational Geometry
Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Consistent digital line segments

Proceedings of the twenty-sixth annual symposium on Computational geometry

Algorithms for computing the maximum weight region decomposable into elementary shapes

Computer Vision and Image Understanding
On maximum weight objects decomposable into based rectilinear convex objects

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider an optimization version of the image segmentation problem, in which we are given a grid graph with weights on the grid cells. We are interested in finding the maximum weight subgraph such that the subgraph can be decomposed into two "star-shaped" images. We show that this problem can be reduced to the problem of finding a maximum-weight closed set in an appropriately defined directed graph which is well known to have efficient algorithms which run very fast in practice. We also show that finding a maximum-weight subgraph that is decomposable into m star-shaped objects is NP-hard for some m 2.