Skip to main content

2017 | OriginalPaper | Buchkapitel

Gradient and Graph Cuts Based Method for Multi-level Discrete Tomography

verfasst von : Tibor Lukić, Marina Marčeta

Erschienen in: Combinatorial Image Analysis

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, we are proposing a new energy-minimization reconstruction method for the multi gray level discrete tomography. The proposed reconstruction approach combines a gradient based algorithm with the graph cuts optimization. This new technique is able to reconstruct images that consist of an arbitrary number of gray levels. We present the experimental evaluation of the new method, where we compare its performance with performance of the already suggested methods for multi-level discrete tomography. The obtained experimental results give an advantage to the proposed approach, especially regarding the quality of the reconstructed test images.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
2.
Zurück zum Zitat Batenburg, K.J., Sijbers, J.: DART: a fast heuristic algebraic reconstruction algorithm for discrete tomography. In: Proceedings of International Conference on Image Processing (ICIP), pp. 133–136 (2007) Batenburg, K.J., Sijbers, J.: DART: a fast heuristic algebraic reconstruction algorithm for discrete tomography. In: Proceedings of International Conference on Image Processing (ICIP), pp. 133–136 (2007)
3.
Zurück zum Zitat Birchfield, S., Tomasi, C.: Multiway cut for stereo and motion with slanted surfaces. In: Proceedings of International Conference on Computer Vision, pp. 489–495 (1999) Birchfield, S., Tomasi, C.: Multiway cut for stereo and motion with slanted surfaces. In: Proceedings of International Conference on Computer Vision, pp. 489–495 (1999)
4.
Zurück zum Zitat Birgin, E.G., Martínez, J.M., Raydan, M.: Algorithm: 813: SPG - software for convex-constrained optimization. ACM Trans. Math. Softw. 27, 340–349 (2001)CrossRefMATH Birgin, E.G., Martínez, J.M., Raydan, M.: Algorithm: 813: SPG - software for convex-constrained optimization. ACM Trans. Math. Softw. 27, 340–349 (2001)CrossRefMATH
5.
Zurück zum Zitat Birgin, E., Martínez, J.: Spectral conjugate gradient method for unconstrained optimization. Appl. Math. Optim. 43, 117–128 (2001)MathSciNetCrossRefMATH Birgin, E., Martínez, J.: Spectral conjugate gradient method for unconstrained optimization. Appl. Math. Optim. 43, 117–128 (2001)MathSciNetCrossRefMATH
6.
Zurück zum Zitat Boykov, Y., Jolly, M.P.: Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. In: Proceedings of International Conference on Computer Vision, pp. 105–112 (2001) Boykov, Y., Jolly, M.P.: Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. In: Proceedings of International Conference on Computer Vision, pp. 105–112 (2001)
7.
Zurück zum Zitat Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: Proceedings of International Conference on Computer Vision, pp. 26–33 (2003) Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: Proceedings of International Conference on Computer Vision, pp. 26–33 (2003)
8.
Zurück zum Zitat Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. PAMI 26(9), 1124–1137 (2004)CrossRefMATH Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. PAMI 26(9), 1124–1137 (2004)CrossRefMATH
9.
Zurück zum Zitat Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 648–655 (1998) Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 648–655 (1998)
10.
Zurück zum Zitat Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. PAMI 23(11), 1222–1239 (2001)CrossRef Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. PAMI 23(11), 1222–1239 (2001)CrossRef
11.
Zurück zum Zitat Delong, A., Osokin, A., Isack, H.N., Boykov, Y.: Fast approximate energy minimization with label costs. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition vol. 96, no. 1, pp. 1–27 (2010) Delong, A., Osokin, A., Isack, H.N., Boykov, Y.: Fast approximate energy minimization with label costs. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition vol. 96, no. 1, pp. 1–27 (2010)
12.
Zurück zum Zitat Greig, D., Porteous, B., Seheult, A.: Exact maximum a posteriori estimation for binary images. J. R. Stat. Soc. 51(2), 271–279 (1989) Greig, D., Porteous, B., Seheult, A.: Exact maximum a posteriori estimation for binary images. J. R. Stat. Soc. 51(2), 271–279 (1989)
13.
Zurück zum Zitat Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton’s method. SIAM J. Numer. Anal. 23, 707–716 (1986)MathSciNetCrossRefMATH Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton’s method. SIAM J. Numer. Anal. 23, 707–716 (1986)MathSciNetCrossRefMATH
14.
Zurück zum Zitat Herman, G.T.: Fundamentals of Computerized Tomography: Image Reconstruction from Projection. Advances in Computer Vision and Pattern Recognition, 2nd edn. Springer, London (2009)CrossRefMATH Herman, G.T.: Fundamentals of Computerized Tomography: Image Reconstruction from Projection. Advances in Computer Vision and Pattern Recognition, 2nd edn. Springer, London (2009)CrossRefMATH
15.
Zurück zum Zitat Herman, G.T., Kuba, A.: Discrete Tomography: Foundations, Algorithms and Applications. Applied and Numerical Harmonic Analysis. Birkhäuser, Boston (1999)CrossRefMATH Herman, G.T., Kuba, A.: Discrete Tomography: Foundations, Algorithms and Applications. Applied and Numerical Harmonic Analysis. Birkhäuser, Boston (1999)CrossRefMATH
16.
Zurück zum Zitat Herman, G.T., Kuba, A.: Advances in Discrete Tomography and Its Applications. Birkhäuser, Boston (2006) Herman, G.T., Kuba, A.: Advances in Discrete Tomography and Its Applications. Birkhäuser, Boston (2006)
17.
Zurück zum Zitat Kak, A.C., Slaney, M.: Principles of Computerized Tomographic Imaging. SIAM, Philadelphia (2001)CrossRefMATH Kak, A.C., Slaney, M.: Principles of Computerized Tomographic Imaging. SIAM, Philadelphia (2001)CrossRefMATH
18.
Zurück zum Zitat Kim, J., Zabih, R.: Automatic segmentation of contrast-enhanced image sequences. In: Proceedings of International Conference on Computer Vision, pp. 502–509 (2003) Kim, J., Zabih, R.: Automatic segmentation of contrast-enhanced image sequences. In: Proceedings of International Conference on Computer Vision, pp. 502–509 (2003)
19.
Zurück zum Zitat Kolmogorov, V., Zabih, R.: Visual correspondence with occlusions using graph cuts. In: Proceedings of International Conference on Computer Vision, pp. 508–515 (2001) Kolmogorov, V., Zabih, R.: Visual correspondence with occlusions using graph cuts. In: Proceedings of International Conference on Computer Vision, pp. 508–515 (2001)
20.
Zurück zum Zitat Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Trans. PAMI 26(2), 147–159 (2004)CrossRefMATH Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Trans. PAMI 26(2), 147–159 (2004)CrossRefMATH
21.
Zurück zum Zitat Kwatra, V., Schoedl, A., Essa, I., Turk, G., Bobick, A.: Graphcut textures: image and video synthesis using graph cuts. In: Proceedings of SIGGRAPH 2003, pp. 277–286 (2003). ACM Trans. Graphics Kwatra, V., Schoedl, A., Essa, I., Turk, G., Bobick, A.: Graphcut textures: image and video synthesis using graph cuts. In: Proceedings of SIGGRAPH 2003, pp. 277–286 (2003). ACM Trans. Graphics
22.
Zurück zum Zitat Lukić, T.: Discrete tomography reconstruction based on the multi-well potential. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol. 6636, pp. 335–345. Springer, Heidelberg (2011). doi:10.1007/978-3-642-21073-0_30 CrossRef Lukić, T.: Discrete tomography reconstruction based on the multi-well potential. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol. 6636, pp. 335–345. Springer, Heidelberg (2011). doi:10.​1007/​978-3-642-21073-0_​30 CrossRef
23.
Zurück zum Zitat Lukić, T., Balázs, P.: Binary tomography reconstruction based on shape orientation. Pattern Recognit. Lett. 79, 18–24 (2016)CrossRef Lukić, T., Balázs, P.: Binary tomography reconstruction based on shape orientation. Pattern Recognit. Lett. 79, 18–24 (2016)CrossRef
24.
Zurück zum Zitat Lukić, T., Nagy, B.: Deterministic discrete tomography reconstruction method for images on triangular grid. Pattern Recognit. Lett. 49, 11–16 (2014)CrossRef Lukić, T., Nagy, B.: Deterministic discrete tomography reconstruction method for images on triangular grid. Pattern Recognit. Lett. 49, 11–16 (2014)CrossRef
25.
Zurück zum Zitat Zisler, M., Petra, S., Schnörr, C., Schnörr, C.: Discrete tomography by continuous multilabeling subject to projection constraints. In: Rosenhahn, B., Andres, B. (eds.) GCPR 2016. LNCS, vol. 9796, pp. 261–272. Springer, Cham (2016). doi:10.1007/978-3-319-45886-1_21 CrossRef Zisler, M., Petra, S., Schnörr, C., Schnörr, C.: Discrete tomography by continuous multilabeling subject to projection constraints. In: Rosenhahn, B., Andres, B. (eds.) GCPR 2016. LNCS, vol. 9796, pp. 261–272. Springer, Cham (2016). doi:10.​1007/​978-3-319-45886-1_​21 CrossRef
26.
Zurück zum Zitat Nagy, B., Lukić, T.: Dense projection tomography on the triangular tiling. Fundamenta Informaticae 145, 125–141 (2016)MathSciNetCrossRef Nagy, B., Lukić, T.: Dense projection tomography on the triangular tiling. Fundamenta Informaticae 145, 125–141 (2016)MathSciNetCrossRef
27.
Zurück zum Zitat Raydan, M.: The Barzilai and Browein gradient method for the large scale unconstrained minimization problem. SIAM J. Optim. 7, 26–33 (1997)MathSciNetCrossRefMATH Raydan, M.: The Barzilai and Browein gradient method for the large scale unconstrained minimization problem. SIAM J. Optim. 7, 26–33 (1997)MathSciNetCrossRefMATH
28.
Zurück zum Zitat Schüle, T., Schnörr, C., Weber, S., Hornegger, J.: Discrete tomography by convex-concave regularization and D.C. programming. Discrete Appl. Math. 151, 229–243 (2005)MathSciNetCrossRefMATH Schüle, T., Schnörr, C., Weber, S., Hornegger, J.: Discrete tomography by convex-concave regularization and D.C. programming. Discrete Appl. Math. 151, 229–243 (2005)MathSciNetCrossRefMATH
29.
Zurück zum Zitat Snow, D., Viola, P., Zabih, R.: Exact voxel occupacy with graph cuts. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 345–352 (2000) Snow, D., Viola, P., Zabih, R.: Exact voxel occupacy with graph cuts. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 345–352 (2000)
30.
Zurück zum Zitat Varga, L., Balázs, P., Nagy, A.: An energy minimization reconstruction algorithm for multivalued discrete tomography. In: Proceedings of 3rd International Symposium on Computational Modeling of Objects Represented in Images, pp. 179–185. Taylor & Francis, Rome (2012) Varga, L., Balázs, P., Nagy, A.: An energy minimization reconstruction algorithm for multivalued discrete tomography. In: Proceedings of 3rd International Symposium on Computational Modeling of Objects Represented in Images, pp. 179–185. Taylor & Francis, Rome (2012)
31.
Zurück zum Zitat Weber, S., Nagy, A., Schüle, T., Schnörr, C., Kuba, A.: A benchmark evaluation of large-scale optimization approaches to binary tomography. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 146–156. Springer, Heidelberg (2006). doi:10.1007/11907350_13 CrossRef Weber, S., Nagy, A., Schüle, T., Schnörr, C., Kuba, A.: A benchmark evaluation of large-scale optimization approaches to binary tomography. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 146–156. Springer, Heidelberg (2006). doi:10.​1007/​11907350_​13 CrossRef
Metadaten
Titel
Gradient and Graph Cuts Based Method for Multi-level Discrete Tomography
verfasst von
Tibor Lukić
Marina Marčeta
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-59108-7_25