Small Work Space Algorithms for Some Basic Problems on Binary Images

  • Tetsuo Asano
  • Sergey Bereg
  • Lilian Buzer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7655)

Abstract

This paper presents space-efficient algorithms for some basic tasks (or problems) on a binary image of n pixels, assuming that an input binary image is stored in a read-only array with random-access. Although efficient algorithms are available for those tasks if O(n) work space (of O(n logn) bits) is available, we aim to propose efficient algorithms using only limited work space, i.e., O(1) or \(O(\sqrt{n})\) space. Tasks to be considered are (1) CCC to count the number of connected components, (2) MERR to report the minimum enclosing rectangle of every connected component, and (3) LCCR to report a largest connected component. We show that we can solve each of CCC, MERR, and LCCR in O(n logn) time using only O(1) space. If we can use \(O(\sqrt{n})\) work space, we can solve them in O(n), O(n), and O(n + m logm) time, respectively, where m is the number of pixels in the largest connected component.

Keywords

Connected component Minimum enclosing rectangle Largest connected component Space-efficient algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Asano, T.: Do we need a stack to erase a component in a binary image? In: Fifth International Conference on Fun with Algorithms, pp. 16–27 (2010)Google Scholar
  2. 2.
    Asano, T., Bereg, S., Kirkpatrick, D.: Finding Nearest Larger Neighbors. In: Albers, S., Alt, H., Näher, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 249–260. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  3. 3.
    de Berg, M., van Kreveld, M., van Oostrum, R., Overmars, M.: Simple traversal of a subdivision without extra storage. International Journal of Geographic Information Systems 11, 359–373 (1997)CrossRefGoogle Scholar
  4. 4.
    Bose, P., Morin, P.: An improved algorithm for subdivision traversal without extra storage. Int. J. Comput. Geometry Appl. 12(4), 297–308 (2002)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Elsevier (2004)Google Scholar
  6. 6.
    Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Elsevier (2004)Google Scholar
  7. 7.
    Rosenfeld, A., Pfalts, J.L.: Sequential operations in digital picture processing. J. ACM 13(4), 471–494 (1966)MATHCrossRefGoogle Scholar
  8. 8.
    Rosenfeld, A., Kak, A.C.: Digital Picture Processing, 2nd edn., vol. 2. Academic, San Diego (1982)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Tetsuo Asano
    • 1
  • Sergey Bereg
    • 2
  • Lilian Buzer
    • 3
    • 4
  1. 1.School of Information ScienceJAISTJapan
  2. 2.Department of Computer ScienceUniversity of Texas at DallasUSA
  3. 3.LABINFO-IGM, UMR CNRS 8049Université Paris-EstFrance
  4. 4.Department of Computer ScienceESIEEFrance

Personalised recommendations