Deletion Rules for Equivalent Sequential and Parallel Reductions

  • Kálmán Palágyi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8258)


A reduction operator transforms a binary picture only by changing some black points to white ones, which is referred to as deletion. Sequential reductions may delete just one point at a time, while parallel reductions can alter a set of points simultaneously. Two reductions are called equivalent if they produce the same result for each input picture. This work lays a bridge between the parallel and the sequential strategies. A class of deletion rules are proposed that provide 2D parallel reductions being equivalent to sequential reductions. Some new sufficient conditions for topology-preserving parallel reductions are also reported.


Discrete Geometry Digital Topology Topology-Preserving Reductions 


  1. 1.
    Bertrand, G., Couprie, M.: Transformations topologiques discrètes. In: Coeurjolly, D., Montanvert, A., Chassery, J. (eds.) Géométrie Discrète et Images Numériques, pp. 187–209. Hermès Science Publications (2007)Google Scholar
  2. 2.
    Hall, R.W.: Parallel connectivity-preserving thinning algorithms. In: Kong, T.Y., Rosenfeld, A. (eds.) Topological Algorithms for Digital Image Processing, pp. 145–179. Elsevier Science B.V (1996)Google Scholar
  3. 3.
    Hall, R.W., Kong, T.Y., Rosenfeld, A.: Shrinking binary images. In: Kong, T.Y., Rosenfeld, A. (eds.) Topological Algorithms for Digital Image Processing, pp. 31–98. Elsevier Science B.V (1996)Google Scholar
  4. 4.
    Kardos, P., Palágyi, K.: Order-independent sequential thinning in arbitrary dimensions. In: Proc. Int. Conf. Signal and Image Processing and Applications, SIPA 2011, pp. 129–134 (2011)Google Scholar
  5. 5.
    Kong, T.Y.: On topology preservation in 2-d and 3-d thinning. Int. Journal of Pattern Recognition and Artificial Intelligence 9, 813–844 (1995)CrossRefGoogle Scholar
  6. 6.
    Kong, T.Y., Rosenfeld, A.: Digital topology: Introduction and survey. Computer Vision, Graphics, and Image Processing 48, 357–393 (1989)CrossRefGoogle Scholar
  7. 7.
    Lam, L., Lee, S.-W., Suen, S.-W.: Thinning methodologies — A comprehensive survey. IEEE Trans. Pattern Analysis and Machine Intelligence 14, 869–885 (1992)CrossRefGoogle Scholar
  8. 8.
    Németh, G., Palágyi, K.: Topology preserving parallel thinning algorithms. International Journal of Imaging Systems and Technology 23, 37–44 (2011)CrossRefGoogle Scholar
  9. 9.
    Ranwez, V., Soille, P.: Order independent homotopic thinning for binary and grey tone anchored skeletons. Pattern Recognition Letters 23, 687–702 (2002)CrossRefzbMATHGoogle Scholar
  10. 10.
    Ronse, C.: Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images. Discrete Applied Mathematics 21, 67–79 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Suen, C.Y., Wang, P.S.P. (eds.): Thinning methodologies for pattern recognition. Series in Machine Perception and Artificial Intelligence, vol. 8. World Scientific (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Kálmán Palágyi
    • 1
  1. 1.Department of Image Processing and Computer GraphicsUniversity of SzegedHungary

Personalised recommendations