Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes

  • Jinhee Chun
  • Ryosei Kasai
  • Matias Korman
  • Takeshi Tokuyama
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5878)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)MATHCrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Chun, J., Korman, M., Nöllenburg, M., Tokuyama, T.: Consistent Digital Rays. In: Proc. 24th ACM SOCG, pp. 355–364 (2008)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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
  9. 9.
    Hochbaum, D.: A New-Old Algorithm for Minimum-cut and Maximum-flow in Closure Graphs. Network 37(4), 171–193 (2001)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Jinhee Chun
    • 1
  • Ryosei Kasai
    • 1
  • Matias Korman
    • 1
  • Takeshi Tokuyama
    • 1
  1. 1.Graduate School of Information SciencesTohoku UniversityJapan

Personalised recommendations