Advertisement

3D Block-Based Medial Axis Transform and Chessboard Distance Transform on the CREW PRAM

  • Shih-Ying Lin
  • Shi-Jinn Horng
  • Tzong-Wann Kao
  • Chin-Shyurng Fahn
  • Pingzhi Fan
  • Cheng-Ling Lee
  • Anu Bourgeois
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5022)

Abstract

Traditionally, the block-based medial axis transform (BB-MAT) and the chessboard distance transform (CDT) were usually viewed as two completely different image computation problems, especially for three dimensional (3D) space. We achieve the computation of the 3D CDT problem by implementing the 3D BB-MAT algorithm first. For a 3D binary image of size N 3, our parallel algorithm can be run in O(logN) time using N 3 processors on the concurrent read exclusive write (CREW) parallel random access machine (PRAM) model to solve both 3D BB-MAT and 3D CDT problems, respectively. In addition, we have implemented a message passing interface (MPI) program on an AMD Opteron Model 270 cluster system to verify the proposed parallel algorithm, since the PRAM model is not available in the real world. The experimental results show that the speedup is saturated when the number of processors used is more than four, regardless of the problem size.

Keywords

parallel algorithm image processing CREW PRAM model block-based medial axis transform chessboard distance transform Euclidean distance transform 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rosenfeld, A., Pfalz, J.L.: Sequential operations in digital picture processing. Journal of the ACM, 471–494 (1966)Google Scholar
  2. 2.
    Blum, H.: Models for the perception of speech and visual form, vol. 11, pp. 362–380. MIT Press (1967)Google Scholar
  3. 3.
    Schwarzkopf, O.: Parallel computation of distance transforms. Algorithmica, 685–697 (1991)Google Scholar
  4. 4.
    Montanvert, A.: Medial line: graph representation and shape description. In: Proc. of the 8th International Conference on Pattern Recognition, pp. 430–432 (1986)Google Scholar
  5. 5.
    Chandran, S., Kim, S.K., Mount, D.M.: Parallel computational geometry of rectangles. Algorithmica, 25–49 (1992)Google Scholar
  6. 6.
    Jenq, J.F., Sahni, S.: Serial and parallel algorithms for the medial axis transform. IEEE Trans. on Pattern Analysis and Machine Intelligence, 1218–1224 (1992)Google Scholar
  7. 7.
    Ramanathan, M., Gurumoorthy, B.: Constructing medial axis transform of extruded and revolved 3D objects with free-form boundaries. Computer-Aided Design, 1370–1387 (2005)Google Scholar
  8. 8.
    Morrison, P., Zou, J.J.: An effective skeletonization method based on adaptive selection of contour points. In: Proc. of the 3th International Conference on Information Technology and Applications, pp. 644–649 (2005)Google Scholar
  9. 9.
    Remy, E., Thiel, E.: Medial axis for chamfer distances: computing look-up tables and neighbourhoods in 2D or 3D. Pattern Recognition Letters, 649–661 (2002)Google Scholar
  10. 10.
    Remy, E., Thiel, E.: Look-Up tables for medial axis on squared Euclidean distance transform. In: Proc. of the 11th Discrete Geometry for Computer Image, pp. 224–235 (2003)Google Scholar
  11. 11.
    Wang, Y.R., Horng, S.J.: An O(1) time algorithm for the 3D Euclidean distance transform on the CRCW PRAM Model. IEEE Trans. on Parallel and Distributed Systems, 973–982 (2003)Google Scholar
  12. 12.
    Wang, Y.R., Horng, S.J.: Parallel algorithms for arbitrary dimensional Euclidean distance transforms with applications on arrays with reconfigurable optical buses. IEEE Trans. on System, Man, and Cybernetics — Part B: Cybernetics, 517–532 (2004)Google Scholar
  13. 13.
    Wang, Y.R.: Fast algorithms for block-based medial axis transform on the LARPBS. In: Proc. of the IEEE International Conference on Systems, Man, and Cybernetics (2005)Google Scholar
  14. 14.
    Lin, S.Y., Horng, S.J., Kao, T.W., Wang, Y.R.: An O(1) time parallel algorithm for the dominance counting and 3D block-based medial axis transform on AROB. In: Proc. of the 6th International Conference on Parallel and Distributed Computing Applications and Technologies, pp. 603–609 (2005)Google Scholar
  15. 15.
    Lee, Y.H., Horng, S.J.: Chessboard distance transform and the medial axis transform are interchangeable. In: Proc. of the IEEE Symposium on Parallel and Distributed Processing, pp. 424–428 (1996)Google Scholar
  16. 16.
    JáJá, J.: An introduction to parallel algorithms. Addison-Wesley, Reading (1992)zbMATHGoogle Scholar
  17. 17.
    Preparata, F.P., Shamos, M.I.: Computational geometry an introduction. Springer, Heidelberg (1985)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Shih-Ying Lin
    • 2
  • Shi-Jinn Horng
    • 1
    • 3
    • 4
    • 7
  • Tzong-Wann Kao
    • 5
  • Chin-Shyurng Fahn
    • 3
  • Pingzhi Fan
    • 1
  • Cheng-Ling Lee
    • 6
  • Anu Bourgeois
    • 7
  1. 1.Institute of Mobile CommunicationsSouthwest Jiaotong UniversityChengdu 
  2. 2.Department of Electrical EngineeringNational Taiwan University of Science and TechnologyTaipeiTaiwan
  3. 3.Department of Computer Science and Information EngineeringNational Taiwan University of Science and TechnologyTaipeiTaiwan
  4. 4.Department of Electronic EngineeringNational United UniversityMiaoliTaiwan
  5. 5.Department of Electronic EngineeringTechnology and Science Institute of Northern TaiwanTaipeiTaiwan
  6. 6.Department of Electro-Optical EngineeringNational United UniversityMiaoliTaiwan
  7. 7.Department of Computer ScienceGeorgia State UniversityAtlanta 

Personalised recommendations