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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Asano, T., Chen, D.Z., Katoh, N., Tokuyama, T.: Efficient Algorithms for Optimization-Based Image Segmentation. Int. J. Comput. Geometry Appl. 11(2), 145–166 (2001)
Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data Mining Using Two-Dimensional Optimized Association Rules: Scheme, Algorithms, and Visualization. In: SIGMOD Conference 1996, pp. 13–23 (1996)
Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data Mining with optimized two-dimensional association rules. ACM Trans. Database Syst. 26(2), 179–213 (2001)
Chen, D.Z., Chun, J., Katoh, N., Tokuyama, T.: Efficient algorithms for approximating a multi-dimensional voxel terrain by a unimodal terrain. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 238–248. Springer, Heidelberg (2004)
Chen, D.Z., Hu, X.S., Luan, S., Wu, X., Yu, C.X.: Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy. Algorithmica 42(3-4), 265–288 (2005)
Chun, J., Korman, M., Nöllenburg, M., Tokuyama, T.: Consistent Digital Rays. In: Proc. 24th ACM SOCG, pp. 355–364 (2008)
Chun, J., Sadakane, K., Tokuyama, T.: Efficient Algorithms for Constructing a Pyramid from a Terrain. In: Akiyama, J., Kano, M. (eds.) JCDCG 2002. LNCS, vol. 2866, pp. 108–117. Springer, Heidelberg (2003)
Chun, J., Korman, M., Nöllenburg, M., Tokuyama, T.: Hardness of the Maximum Union-of-Closures Problem, Preprint (preliminarlily reported in WAAC2008)., http://www.dais.is.tohoku.ac.jp/~mati/2peakNP.pdf
Hochbaum, D.: A New-Old Algorithm for Minimum-cut and Maximum-flow in Closure Graphs. Network 37(4), 171–193 (2001)
Yoda, K., Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Computing Optimized Rectilinear Regions for Association Rules. In: Proc. KDD 1997, pp. 96–103 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chun, J., Kasai, R., Korman, M., Tokuyama, T. (2009). Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_117
Download citation
DOI: https://doi.org/10.1007/978-3-642-10631-6_117
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10630-9
Online ISBN: 978-3-642-10631-6
eBook Packages: Computer ScienceComputer Science (R0)