Skip to main content
Log in

Minimal Simple Pairs in the 3-D Cubic Grid

  • Published:
Journal of Mathematical Imaging and Vision Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Preserving topological properties of objects during thinning procedures is an important issue in the field of image analysis. This paper constitutes an introduction to the study of non-trivial simple sets in the framework of cubical 3-D complexes. A simple set has the property that the homotopy type of the object in which it lies is not changed when the set is removed. The main contribution of this paper is a characterisation of the non-trivial simple sets composed of exactly two voxels, such sets being called minimal simple pairs.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bertrand, G.: On P-simple points. C. R. Acad. Sci. Sér. Math. I(321), 1077–1084 (1995)

    MathSciNet  Google Scholar 

  2. Bertrand, G.: On critical kernels. C. R. Acad. Sci. Sér. Math. I(345), 363–367 (2007)

    MathSciNet  Google Scholar 

  3. Bertrand, G., Couprie, M.: New 2D parallel thinning algorithms based on critical kernels. In: IWCIA. LNCS, vol. 4040, pp. 45–59. Springer, Berlin (2006)

    Google Scholar 

  4. Bertrand, G., Couprie, M.: A new 3D parallel thinning scheme based on critical kernels. In: DGCI. LNCS, vol. 4245, pp. 580–591. Springer, Berlin (2006)

    Google Scholar 

  5. Bertrand, G., Couprie, M.: Two-dimensional thinning algorithms based on critical kernels. J. Math. Imaging Vis. 31(1), 35–56 (2008)

    Article  MathSciNet  Google Scholar 

  6. Bing, R.H.: Some aspects of the topology of 3-manifolds related to the Poincaré conjecture. In: Lectures on Modern Mathematics, vol. II, pp. 93–128. Wiley, New York (1964)

    Google Scholar 

  7. Chaussard, J.: Personal communication (2007)

  8. Chillingworth, D.R.J.: Collapsing three-dimensional convex polyhedra. Proc. Camb. Philos. Soc. 63, 353–357 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  9. Couprie, M., Bertrand, G.: New characterizations of simple points in 2D, 3D and 4D discrete spaces. Technical Report IGM2007-07, Université de Marne-la-Vallée (2007)

  10. Couprie, M., Coeurjolly, D., Zrour, R.: Discrete bisector function and Euclidean skeleton in 2D and 3D. Image Vis. Comput. 25(10), 1543–1556 (2007)

    Article  Google Scholar 

  11. Davies, E.R., Plummer, A.P.N.: Thinning algorithms: a critique and a new methodology. Pattern Recogn. 14(1–6), 53–63 (1981)

    Article  MathSciNet  Google Scholar 

  12. Dokládal, P., Lohou, C., Perroton, L., Bertrand, G.: Liver blood vessels extraction by a 3-D topological approach. In: MICCAI. LNCS, vol. 1679, pp. 98–105. Springer, Berlin (1999)

    Google Scholar 

  13. Fourey, S., Malgouyres, R.: A concise characterization of 3D simple points. Discrete Appl. Math. 125(1), 59–80 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. Gau, C.-J., Kong, T.Y.: Minimal non-simple sets in 4D binary pictures. Graph. Models 65(1–3), 112–130 (2003)

    Article  MATH  Google Scholar 

  15. Giblin, P.: Graphs, Surfaces and Homology. Chapman and Hall, London (1981)

    MATH  Google Scholar 

  16. Yung Kong, T.: On topology preservation in 2-D and 3-D thinning. Int. J. Pattern Recogn. Artif. Intell. 9(5), 813–844 (1995)

    Article  Google Scholar 

  17. Yung Kong, T.: Topology-preserving deletion of 1’s from 2-, 3- and 4-dimensional binary images. In: DGCI. LNCS, vol. 1347, pp. 3–18. Springer, Berlin (1997)

    Google Scholar 

  18. Yung Kong, T., Rosenfeld, A.: Digital topology: introduction and survey. Comput. Vis. Graph. Image Process. 48(3), 357–393 (1989)

    Article  Google Scholar 

  19. Kovalevsky, V.A.: Finite topology as applied to image analysis. Comput. Vis. Graph. Image Process. 46(2), 141–161 (1989)

    Article  Google Scholar 

  20. Ma, C.M.: On topology preservation in 3D thinning. Comput. Vis. Graph. Image Process. 59(3), 328–339 (1994)

    Google Scholar 

  21. Morgenthaler, D.G.: Three-dimensional simple points: serial erosion, parallel thinning, and skeletonization. Technical Report TR-1005, University of Maryland (1981)

  22. Passat, N., Ronse, C., Baruthio, J., Armspach, J.-P., Bosc, M., Foucher, J.: Using multimodal MR data for segmentation and topology recovery of the cerebral superficial venous tree. In: ISVC. LNCS, vol. 3804, pp. 60–67. Springer, Berlin (2005)

    Google Scholar 

  23. Ronse, C.: Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images. Discrete Appl. Math. 21(1), 67–79 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  24. Rosenfeld, A.: Connectivity in digital pictures. J. Assoc. Comput. Mach. 17(1), 146–160 (1970)

    MATH  MathSciNet  Google Scholar 

  25. Ségonne, F.: Segmentation of medical images under topological constraints. Ph.D. thesis, MIT (2005)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. Couprie.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Passat, N., Couprie, M. & Bertrand, G. Minimal Simple Pairs in the 3-D Cubic Grid. J Math Imaging Vis 32, 239–249 (2008). https://doi.org/10.1007/s10851-008-0099-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10851-008-0099-9

Keywords

Navigation

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy