Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes

Authors:
Jinhee Chun;Ryosei Kasai;Matias Korman;Takeshi Tokuyama
Affiliations:
Graduate School of Information Sciences, Tohoku University, Japan;Graduate School of Information Sciences, Tohoku University, Japan;Graduate School of Information Sciences, Tohoku University, Japan;Graduate School of Information Sciences, Tohoku University, Japan
Venue:
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Year:
2009

Citing 3
Cited 4

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)
Consistent digital rays

Proceedings of the twenty-fourth annual symposium on Computational geometry

Effect of corner information in simultaneous placement of K rectangles and tableaux

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Maximum weight digital regions decomposable into digital star-shaped regions

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
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

Motivated from the image segmentation problem, we consider the problem of finding the maximum weight region with a shape decomposable into elementary shapes in n 脳n pixel grid where each pixel has a real valued weight. We give efficient algorithms for several interesting cases. This shows string constrast to the NP-hardness results to find the maximum weight union for the corresponding cases.