Skip to main content
SpringerLink
Log in

Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes

  • Conference paper
Algorithms and Computation (ISAAC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5878))

Included in the following conference series:

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 to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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. 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)

    Article  MATH  Google Scholar 

  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. 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)

    Article  MATH  MathSciNet  Google Scholar 

  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. 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. 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. Hochbaum, D.: A New-Old Algorithm for Minimum-cut and Maximum-flow in Closure Graphs. Network 37(4), 171–193 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Sciences, Tohoku University, Japan

    Jinhee Chun, Ryosei Kasai, Matias Korman & Takeshi Tokuyama

Authors
  1. Jinhee Chun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ryosei Kasai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Matias Korman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Takeshi Tokuyama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electrical and Computer Engineering, University of Hawaii, Holmes Hall 483, 2540 Dole Street, 96822, Honolulu, HI, USA

    Yingfei Dong

  2. Department of Computer Science, University of Texas at Dallas, 75083, Dallas, TX, USA

    Ding-Zhu Du

  3. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar Ibarra

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation