Skip to main content
Log in

Repairing 3D Binary Images Using the FCC Grid

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

Abstract

A 3D image I is well-composed if it does not contain critical edges or vertices (where the boundary of I is non-manifold). The process of transforming an image into a well composed one is called repairing. We propose to repair 3D images by associating the face-centered cubic grid (FCC grid) with the cubic grid. We show that the polyhedral complex in the FCC grid, obtained by our repairing algorithm, is well-composed and homotopy equivalent to the complex naturally associated with the given image I with edge-adjacency (18-adjacency). We illustrate an application on two tasks related to the repaired image: boundary reconstruction and computation of its Euler characteristic.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29

Similar content being viewed by others

References

  1. Andres, E., Acharya, R., Sibata, C.H.: Discrete analytical hyperplanes. CVGIP: Graphical Models and Image Processing 59(5), 302–309 (1997)

    Google Scholar 

  2. Artzy, E., Frieder, G., Herman, G.T.: The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm. In: Proceedings of the 7th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1980, Seattle, Washington, USA, July 14–18, 1980, pp. 2–9 (1980)

  3. Boutry, N., Géraud, T., Najman, L.: How to make nD images well-composed without interpolation. In: 2015 IEEE International Conference on Image Processing, ICIP 2015, pp. 2149–2153 (2015)

  4. Boutry, N., Géraud, T., Najman, L.: A tutorial on well-composedness. J. Math. Imaging Vis. 60(3), 443–478 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  5. Boutry, N., González-Díaz, R., Jiménez, M.J.: One more step towards well-composedness of cell complexes over nD pictures. In: 21st IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI, pp. 101–114 (2019)

  6. Boutry, N., González-Díaz, R., Jiménez, M.-J.: Weakly well-composed cell complexes over nD pictures. Inf. Sci. 499, 62–83 (2019)

    Article  MathSciNet  Google Scholar 

  7. Brimkov, V.E.: Formulas for the number of \((n-2)\)-gaps of binary objects in arbitrary dimension. Discret. Appl. Math. 157(3), 452–463 (2009)

    MathSciNet  MATH  Google Scholar 

  8. Brimkov, V.E., Klette, R.: Border and surface tracing–theoretical foundations. IEEE Trans. Pattern Anal. Mach. Intell. 30(4), 577–590 (2008)

    Article  Google Scholar 

  9. Brimkov, V.E., Moroni, D., Barneva, R.P.: Combinatorial relations for digital pictures. In: 13th International Conference on Discrete Geometry for Computer Imagery, DGCI, pp. 189–198 (2006)

    Chapter  MATH  Google Scholar 

  10. Cohen-Or, D., Kaufman, A.E.: 3D line voxelization and connectivity control. IEEE Comput. Gr. Appl. 17(6), 80–87 (1997)

    Article  Google Scholar 

  11. Čomić, L., Magillo, P.: Repairing 3D binary images using the BCC grid with a 4-valued combinatorial coordinate system. Inf. Sci. 499, 47–61 (2019)

    Article  MathSciNet  Google Scholar 

  12. Čomić, L., Nagy, B.: A combinatorial 3-coordinate system for the face centered cubic grid. In: 9th International Symposium on Image and Signal Processing and Analysis, ISPA, pp. 298–303 (2015)

  13. Čomić, L., Nagy, B.: A topological 4-coordinate system for the face centered cubic grid. Pattern Recogn. Lett. 83, 67–74 (2016)

    Article  Google Scholar 

  14. Edelsbrunner, H., Iglesias-Ham, M., Kurlin, V.: Relaxed disk packing. In: Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG, pp. 128–135 (2015)

  15. Françon, J., Schramm, J., Tajine, M.: Recognizing arithmetic straight lines and planes. In: 6th International Workshop Discrete Geometry for Computer Imagery, DCGI, pp. 141–150 (1996)

    Chapter  Google Scholar 

  16. González-Díaz, R., Jiménez, M.-J., Medrano, B.: 3D well-composed polyhedral complexes. Discret. Appl. Math. 183, 59–77 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  17. González-Díaz, R., Jiménez, M.-J., Medrano, B.: Efficiently storing well-composed polyhedral complexes computed over 3D binary images. J. Math. Imag. Vis. 59(1), 106–122 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  18. Hatcher, A.: Algebraic Topology, Chapter 0. Cambridge University Press, Cambridge (2001)

    Google Scholar 

  19. Her, I.: Description of the F.C.C. lattice geometry through a four-dimensional hypercube. Acta Crystallogr. Sect. A 51(5), 659–662 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  20. Herman, G.T.: Geometry of Digital Spaces. Birkhauser, Boston (1998)

    MATH  Google Scholar 

  21. Kenmochi, Y., Imiya, A.: Combinatorial topologies for discrete planes. In: 11th International Conference Discrete Geometry for Computer Imagery, DGCI, pp. 144–153 (2003)

    Chapter  MATH  Google Scholar 

  22. Kim, M.: GPU isosurface raycasting of FCC datasets. Gr. Models 75(2), 90–101 (2013)

    Article  Google Scholar 

  23. Kittel, C.: Introduction to Solid State Physics, Chapter 1. Wiley, New York (2004)

    Google Scholar 

  24. Klette, R., Rosenfeld, A.: Digital Geometry. Geometric Methods for Digital Picture Analysis, Chapter 2. Morgan Kaufmann Publishers, San Francisco (2004)

    MATH  Google Scholar 

  25. Kong, T., Roscoe, A., Rosenfeld, A.: Concepts of digital topology. Topol. Appl. 46(3), 219–262 (1992)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  27. Kovalevsky, V.A.: Geometry of Locally Finite Spaces (Computer Agreeable Topology and Algorithms for Computer Imagery), Chapter 3. Editing House Dr. Bärbel Kovalevski, Berlin (2008)

  28. Lachaud, J.-O., Montanvert, A.: Continuous analogs of digital boundaries: a topological approach to iso-surfaces. Graph. Models 62(3), 129–164 (2000)

    Article  Google Scholar 

  29. Latecki, L.J.: 3D well-composed pictures. CVGIP: Gr. Model Image Process. 59(3), 164–172 (1997)

    Google Scholar 

  30. Latecki, L.J., Eckhardt, U., Rosenfeld, A.: Well-composed sets. Comput. Vis. Image Underst. 61(1), 70–83 (1995)

    Article  Google Scholar 

  31. Linnér, E.S., Morén, M., Smed, K.-O., Nysjö, J., Strand, R.: LatticeLibrary and BccFccRaycaster: software for processing and viewing 3D data on optimal sampling lattices. SoftwareX 5, 16–24 (2016)

    Article  Google Scholar 

  32. Morgenthaler, D.: Three-dimensional digital topology: the genus. Tech. Rep. TR-980, University of Maryland, College Park, MD 20742 (1980)

  33. Nagy, B., Strand, R.: Distances based on neighbourhood sequences in non-standard three-dimensional grids. Discret. Appl. Math. 155(4), 548–557 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  34. Nagy, B., Strand, R.: Non-traditional grids embedded in Z\({}^{\text{ n }}\). Int. J. Shape Model. 14(2), 209–228 (2008)

    MathSciNet  MATH  Google Scholar 

  35. Petkov, K., Qiu, F., Fan, Z., Kaufman, A.E., Mueller, K.: Efficient LBM visual simulation on face-centered cubic lattices. IEEE Trans. Vis. Comput. Graph. 15(5), 802–814 (2009)

    Article  Google Scholar 

  36. Qiu, F., Xu, F., Fan, Z., Neophytou, N., Kaufman, A.E., Mueller, K.: Lattice-based volumetric global illumination. IEEE Trans. Vis. Comput. Graph. 13(6), 1576–1583 (2007)

    Article  Google Scholar 

  37. Rosenfeld, A., Kong, T.Y., Nakamura, A.: Topology-preserving deformations of two-valued digital pictures. Gr. Models Image Process. 60(1), 24–34 (1998)

    Article  Google Scholar 

  38. Sarfaraz, A., Shaban, M.: Real-time volume rendering of FCC datasets using box-splines on the mobile platforms. Br. J. Math. Comput. Sci. 11(1), 1–15 (2015)

    Article  Google Scholar 

  39. Siqueira, M., Latecki, L.J., Tustison, N.J., Gallier, J.H., Gee, J.C.: Topological repairing of 3D digital images. J. Math. Imag. Vis. 30(3), 249–274 (2008)

    Article  MathSciNet  Google Scholar 

  40. Stelldinger, P., Latecki, L.J., Siqueira, M.: Topological equivalence between a 3D object and the reconstruction of its digital image. IEEE Trans. Pattern Anal. Mach. Intell. 29(1), 126–140 (2007)

    Article  Google Scholar 

  41. Stelldinger, P., Strand, R.: Topology preserving digitization with FCC and BCC grids. In: 11th International Workshop Combinatorial Image Analysis, IWCIA, pp. 226–240 (2006)

    Google Scholar 

  42. Strand, R., Nagy, B.: Path-based distance functions in n-dimensional generalizations of the face- and body-centered cubic grids. Discret. Appl. Math. 157(16), 3386–3400 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  43. Strand, R., Nagy, B., Borgefors, G.: Digital distance functions on three-dimensional grids. Theor. Comput. Sci. 412, 1350–1363 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  44. Strand, R., Stelldinger, P.: Topology preserving marching cubes-like algorithms on the face-centered cubic grid. In: 14th International Conference on Image Analysis and Processing (ICIAP), pp. 781–788 (2007)

  45. Yagel, R., Cohen, D., Kaufman, A.E.: Discrete ray tracing. IEEE Comput. Graphics Appl. 12(5), 19–28 (1992)

    Article  Google Scholar 

  46. Zheng, X., Gu, F.: Fast fourier transform on FCC and BCC lattices with outputs on FCC and BCC lattices respectively. J. Math. Imag. Vis. 49(3), 530–550 (2014)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

We thank Andrija Blesić for implementing the coordinate system and topological relations for the FCC grid.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Paola Magillo.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work has been partially supported by the Ministry of Education and Science of the Republic of Serbia within the Project No. 34014.

Appendix: Details of the Proof of Homotopy Equivalence

Appendix: Details of the Proof of Homotopy Equivalence

We prove here the lemmas used in the proof of Propositions 2 and 3 (see Sect. 5.2).

Fig. 30
figure 30

a The only configuration of \(2\times 2\times 2\) cubes containing triangles in cases IV, IX and X (colored). Letterings used b in Lemma 2 for case IV, c in Lemma 3 for case IX and d in Lemma 4 for case X (Color figure online)

1.1 Lemma for Proposition 2

Lemma 1

Each triangle \(V_1V_2V_3\) in the protruding boundary of X is mapped by h onto \(|\varSigma |\).

Proof

The image by h of the triangle \(V_1V_2V_3\) depends on the type of its vertices. If \(V_1V_2V_3\) comes from triangulating a rhombic face through the longer diagonal, then two vertices are open and in \(|\varSigma |\), the third one is closed and protruding (case a. below). If it comes from triangulating a rhombic face through the shorter diagonal, then two vertices are closed and protruding, and the third vertex is open and may be non-protruding (case b. below) or protruding (case c. below).

  1. a.

    For a triangle \(FF'K\), where \(F,F'\) are (non-protruding) open vertices and K is closed (the protruding part of a rhombic face r only halfway outside \(\varSigma \)), if F is a vertex in \(\varSigma \) and \(F'\) is the center of a square face of some cube in I, the closed vertex K is mapped to F, and the triangle \(FF'K\) is mapped onto the line segment \(FF'\) in the boundary of \(|\varSigma |\).

  2. b.

    For a triangle FKL with one non-protruding open vertex F, we distinguish two cases depending on the position of F.

    1. b.1

      If F is also an endpoint of an edge of some cube in I, the protruding closed vertices K and L are mapped to F, and the triangle FKL is mapped on the vertex F in the boundary of \(|\varSigma |\).

    2. b.2

      If F is the center of some black face s, the protruding closed vertices K and L are mapped to the endpoints U and V of an edge of s, and the triangle FKL is mapped on the triangle FUV in the boundary of \(|\varSigma |\).

  3. c.

    For a triangle FKL, where F is a protruding open vertex, we distinguish three cases depending on the number of dodecahedra incident to F.

    1. c.1

      If F is incident to exactly one dodecahedron E, corresponding to an edge e, the open vertex F is mapped to the midpoint M of e and the closed vertices K and L are mapped either to the same or to the two different endpoints of e, and thus the triangle FKL is mapped onto one half of the edge e or onto e (which is in the boundary of \(|\varSigma |\)).

    2. c.2

      If F is incident to two dodecahedra \(E_1\) and \(E_2\), corresponding to edges \(e_1\) and \(e_2\) sharing a vertex V, then the open vertex F is mapped to V and the closed vertices K and L of the triangle FKL on \(E_1\) (and similarly for \(E_2\)) are mapped to one of the endpoints V or \(V_1\) of the edge \(e_1\); thus, the triangle FKL is mapped either onto the edge \(VV_1\) or on the vertex V, which are both in the boundary of \(|\varSigma |\).

    3. c.3

      If F is incident to three dodecahedra E, \(E_1\) and \(E_2\) corresponding to the edges e, \(e_1\) and \(e_2\), respectively, then the introduction of the new vertices on the edges incident only to the dodecahedron \(E_1\) or \(E_2\) and to F ensures that the image of each sub-triangle on \(E_1\) or \(E_2\) is either one of the edges \(e_1\) or \(e_2\), or one half of the edge e, which are both in the boundary of \(|\varSigma |\) (see Fig. 21). If the triangle FKL is on E, it is mapped to the edge e in the boundary of \(|\varSigma |\).

\(\square \)

1.2 Lemmas for Proposition 3

We give here the proof that cases IV, IX and X can only occur in a configuration of \(2\times 2\times 2\) cubes where exactly three of them are black, two of them mutually face-adjacent and the third one strictly edge-adjacent to one of them, like in Fig. 26. This situation is shown in Fig. 30a with the positions of triangles FUB lying in the three cases. Note that there are two triangles in each case, triangles in cases IX and X share their edge FU, and triangles in cases IV and X share their edge UB. All triangles share their vertex U.

Lemma 2

(Case IV) If the vertex U of the triangle FBU on the square face s of a black cube C is filled, the edge e on s incident to U is filled, the edge \(e'\) on the other square face \(s'\) of C incident to the edge UV is not filled and \(s'\) is black, then the only black cubes incident to U are C, the cube adjacent to C through black face \(s'\), and the cube strictly edge-adjacent to C at filled edge e, and no other edge incident to U is filled.

Proof

Referring to Fig. 30b, let \(C'\) be the black cube adjacent to C at \(s'\). Then, the other two cubes incident to \(e'\) must be both white, or \(e'\) would be filled; the other two cubes incident to the edge UV must be both white, or UV would be filled; the cube edge-adjacent to C through the edge e must be black or e would not be filled; the remaining cube incident to U must be white or either e or \(e'\) would be filled (configuration with two collinear critical edges). Therefore, the edges incident to U, with the exception of e, are not filled. \(\square \)

Lemma 3

(Case IX) If the vertex U of the triangle FBU on the square face s of a cube C is filled, no edge of the cube C incident to U is filled, and the other square face \(s'\) of C incident to the edge UV is not black, then the filled edge e is collinear with the edge BU.

Proof

As U is filled, let e be a filled edge (one of the three such edges) incident to U and not on C. There are four cubes incident to e: one (\(C_1\)) is face-adjacent to C, two (\(C_2\) and \(C_3\)) are strictly edge-adjacent to C, and one (\(C_4\)) is strictly vertex-adjacent to C. By Property 1, at least two of the four cubes incident to e must be black. Cubes \(C_2\) and \(C_3\) must be both white, or also the shared edge (on C, incident to U) would be filled. Thus, \(C_1\) and \(C_4\) must be black (see Fig. 30c).

The edge e can be in three different positions with respect to the triangle FBU.

  • If e is orthogonal to the plane of face s, then \(C_1\) cannot be black, or s would be black; a contradiction.

  • If e is orthogonal to BU, in the plane of s, then C and \(C_1\) are adjacent through the square face \(s'\), which is thus black; a contradiction.

  • If e is collinear with the edge BU, then \(C_1\) and \(C_4\), which are strictly edge-adjacent, share the critical edge e, which is filled. It is possible, depending on the conventional directions, that no other edge incident to U is filled.

\(\square \)

Lemma 4

(Case X) If the vertex U of the triangle FBU on the square face s of a cube C is filled, no edge of the cube C incident to U is filled, and the other square face \(s'\) of C incident to the edge UV is black, then the filled edge e is orthogonal to BU and lies in the plane of the square face s.

Proof

Referring to Fig. 30d, let \(C'\) be the cube adjacent to C through \(s'\), and let us consider the other six cubes incident to U. Four of them are face-adjacent to either C or \(C'\). If any of these four cubes were black, that would make one of the two common edges of C and \(C'\) incident to U an L-shape edge, and thus filled; a contradiction. Of the two remaining cubes, the one strictly edge-adjacent to C cannot be black, since that would make their common edge (on C and incident to U) filled. The remaining cube, strictly edge-adjacent to \(C'\), can be black, making the edge e, incident to U, orthogonal to BU and in the plane of the square face s, filled. \(\square \)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Čomić, L., Magillo, P. Repairing 3D Binary Images Using the FCC Grid. J Math Imaging Vis 61, 1301–1321 (2019). https://doi.org/10.1007/s10851-019-00904-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10851-019-00904-0

Keywords

Navigation