Skip to main content

Rectangular Decomposition of Binary Images

  • Conference paper
Advanced Concepts for Intelligent Vision Systems (ACIVS 2012)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 7517))

Abstract

The contribution deals with the most important methods for decomposition of binary images into union of rectangles. The overview includes run-length encoding and its generalization, decompositions based on quadtrees, on the distance transformation, and a theoretically optimal decomposition based on maximal matching in bipartite graphs. We experimentally test their performance in binary image compression and in convolution calculation and compare their computation times and success rates.

This work has been supported by the grant No. P103/11/1552 of the Czech Science Foundation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Borgefors, G.: Distance transformations in digital images. Computer Vision, Graphics, and Image Processing 34(3), 344–371 (1986)

    Article  Google Scholar 

  2. Department of Image Processing: Tree leaf database, http://zoi.utia.cas.cz/tree_leaves

  3. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the Association for Computing Machinery 19(2), 248–264 (1972)

    Article  MATH  Google Scholar 

  4. Eppstein, D.: Graph-Theoretic Solutions to Computational Geometry Problems. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 1–16. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Fernandes, A.: FFTPACK translated to pure iso c/c++, http://www.fernandes.org/txp/article/4fftpack-translated-to-pure-iso-cc

  6. Ferrari, L., Sankar, P.V., Sklansky, J.: Minimal rectangular partitions of digitized blobs. Computer Vision, Graphics, and Image Processing 28(1), 58–71 (1984)

    Article  MATH  Google Scholar 

  7. Flusser, J., Suk, T., Zitová, B.: Moments and Moment Invariants in Pattern Recognition. Wiley, Chichester (2009)

    Book  MATH  Google Scholar 

  8. Imai, H., Asano, T.: Efficient algorithms for geometric graph search problems. SIAM Journal on Computing 15(2), 478–494 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kawaguchi, E., Endo, T.: On a method of binary-picture representation and its application to data compression. IEEE Transactions on Pattern Analysis and Machine Intelligence 2(1), 27–35 (1980)

    Article  MATH  Google Scholar 

  10. Keil, J.M.: Polygon decomposition. In: Handbook of Computational Geometry, pp. 491–518. Elsevier (2000)

    Google Scholar 

  11. Levin, A., Fergus, R., Durand, F., Freeman, W.T.: Image and depth from a conventional camera with a coded aperture. In: Special Interest Group on Computer Graphics and Interactive Techniques Conference, SIGGRAPH 2007. ACM, New York (2007)

    Google Scholar 

  12. Lipski Jr., W., Lodi, E., Luccio, F., Mugnai, C., Pagli, L.: On two-dimensional data organization II. In: Fundamenta Informaticae. Series IV, vol. II, pp. 245–260 (1979)

    Google Scholar 

  13. Ohtsuki, T.: Minimum dissection of rectilinear regions. In: Proceedings of the IEEE International Conference on Circuits and Systems, ISCAS 1982, pp. 1210–1213. IEEE (1982)

    Google Scholar 

  14. Schouten, T.E., van den Broek, E.L.: Incremental distance transforms (IDT). In: 20th International Conference on Pattern Recognition, ICPR 2010, pp. 237–240. IEEE Computer Society (August 2010)

    Google Scholar 

  15. Seaidoun, M.: A Fast Exact Euclidean Distance Transform with Application to Computer Vision and Digital Image Processing. Ph.D. thesis, Northeastern University, Boston, USA (September 1993) advisor John Gauch

    Google Scholar 

  16. Sossa-Azuela, J.H., Yáñez-Márquez, C., Díaz de León Santiago, J.L.: Computing geometric moments using morphological erosions. Pattern Recognition 34(2), 271–276 (2001)

    Article  MATH  Google Scholar 

  17. Spiliotis, I.M., Mertzios, B.G.: Real-time computation of two-dimensional moments on binary images using image block representation. IEEE Transactions on Image Processing 7(11), 1609–1615 (1998)

    Article  Google Scholar 

  18. Zakaria, M.F., Vroomen, L.J., Zsombor-Murray, P., van Kessel, J.M.: Fast algorithm for the computation of moment invariants. Pattern Recognition 20(6), 639–643 (1987)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suk, T., Höschl, C., Flusser, J. (2012). Rectangular Decomposition of Binary Images. In: Blanc-Talon, J., Philips, W., Popescu, D., Scheunders, P., Zemčík, P. (eds) Advanced Concepts for Intelligent Vision Systems. ACIVS 2012. Lecture Notes in Computer Science, vol 7517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33140-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33140-4_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33139-8

  • Online ISBN: 978-3-642-33140-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics