Skip to main content

2020 | OriginalPaper | Buchkapitel

Graph Cuts Based Tomography Enhanced by Shape Orientation

verfasst von : Marina Marčeta, Tibor Lukić

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

The topic of this paper includes graph cuts based tomography reconstruction methods in binary and multi-gray level cases. A energy-minimization based reconstruction method for binary tomography is introduced. This approach combines the graph cuts and a gradient based method, and applies a shape orientation as an a priori information. The new method is capable for reconstructions in cases of limited projection view availability. Results of experimental evaluation of the considered graph cuts type reconstruction methods for both binary and multi level tomography are presented .

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
1.
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)
2.
Zurück zum Zitat Birchfield, S., Tomasi, C.: Multiway cut for stereo and motion with slanted surfaces. In: Proceedings of the 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 the International Conference on Computer Vision, pp. 489–495 (1999)
3.
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)CrossRef 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)CrossRef
4.
Zurück zum Zitat Birgin, E., Martínez, J.: A box-constrained optimization algorithm with negative curvature directions and spectral projected gradients. Computing 15, 49–60 (2001)MathSciNetMATH Birgin, E., Martínez, J.: A box-constrained optimization algorithm with negative curvature directions and spectral projected gradients. Computing 15, 49–60 (2001)MathSciNetMATH
5.
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 the 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 the International Conference on Computer Vision, pp. 105–112 (2001)
6.
Zurück zum Zitat Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: Proceedings of the International Conference on Computer Vision, pp. 26–33 (2003) Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: Proceedings of the International Conference on Computer Vision, pp. 26–33 (2003)
7.
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)CrossRef 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)CrossRef
8.
Zurück zum Zitat Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: Proceedings of the International 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 the International Conference on Computer Vision and Pattern Recognition, pp. 648–655 (1998)
9.
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
10.
Zurück zum Zitat Delong, A., Osokin, A., Isack, H.N., Boykov, Y.: Fast approximate energy minimization with label costs. In: Proceedings of the International Conference on Computer Vision and Pattern Recognition, vol. 96(1), pp. 1–27 (2010) Delong, A., Osokin, A., Isack, H.N., Boykov, Y.: Fast approximate energy minimization with label costs. In: Proceedings of the International Conference on Computer Vision and Pattern Recognition, vol. 96(1), pp. 1–27 (2010)
11.
Zurück zum Zitat Herman, G.T., Kuba, A.: Discrete Tomography: Foundations, Algorithms and Applications. Birkhäuser, Boston (1999)CrossRef Herman, G.T., Kuba, A.: Discrete Tomography: Foundations, Algorithms and Applications. Birkhäuser, Boston (1999)CrossRef
12.
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)
13.
Zurück zum Zitat Kim, J., Zabih, R.: Automatic Segmentation of Contrast- Enhanced Image Sequences. In: Proceedings of the International Conference on Computer Vision, pp. 502–509 (2003) Kim, J., Zabih, R.: Automatic Segmentation of Contrast- Enhanced Image Sequences. In: Proceedings of the International Conference on Computer Vision, pp. 502–509 (2003)
14.
Zurück zum Zitat Kolmogorov, V., Zabih, R.: Visual correspondence with occlusions using graph cuts. In: Proceedings of the International Conference on Computer Vision, pp. 508–515 (2001) Kolmogorov, V., Zabih, R.: Visual correspondence with occlusions using graph cuts. In: Proceedings of the International Conference on Computer Vision, pp. 508–515 (2001)
15.
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)CrossRef Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Trans. PAMI 26(2), 147–159 (2004)CrossRef
16.
Zurück zum Zitat Kwatra, V., Schoedl, A., Essa, I., Turk, G., Bobick, A.: Graphcut Textures: Image and Video Synthesis Using Graph Cuts. In: Proc. SIGGRAPH 2003. pp. 277–286. ACM Trans. Graphics (2003) Kwatra, V., Schoedl, A., Essa, I., Turk, G., Bobick, A.: Graphcut Textures: Image and Video Synthesis Using Graph Cuts. In: Proc. SIGGRAPH 2003. pp. 277–286. ACM Trans. Graphics (2003)
18.
Zurück zum Zitat Lukić, T., Balázs, P.: Binary tomography reconstruction based on shape orientation. Pattern Recogn. Lett. 79, 18–24 (2016)CrossRef Lukić, T., Balázs, P.: Binary tomography reconstruction based on shape orientation. Pattern Recogn. Lett. 79, 18–24 (2016)CrossRef
21.
Zurück zum Zitat Lukić, T., Nagy, B.: Deterministic discrete tomography reconstruction method for images on triangular grid. Pattern Recogn. Lett. 49, 11–16 (2014)CrossRef Lukić, T., Nagy, B.: Deterministic discrete tomography reconstruction method for images on triangular grid. Pattern Recogn. Lett. 49, 11–16 (2014)CrossRef
22.
Zurück zum Zitat Nagy, B., Lukić, T.: Dense projection tomography on the triangular tiling. Fundam. Inform. 145, 125–141 (2016)MathSciNetCrossRef Nagy, B., Lukić, T.: Dense projection tomography on the triangular tiling. Fundam. Inform. 145, 125–141 (2016)MathSciNetCrossRef
23.
Zurück zum Zitat Sonka, M., Hlavac, V., Boyle, R.: Image Processing, Analysis, and Machine Vision. Thomson-Engineering, Toranto (2007) Sonka, M., Hlavac, V., Boyle, R.: Image Processing, Analysis, and Machine Vision. Thomson-Engineering, Toranto (2007)
24.
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)
26.
Zurück zum Zitat Žunić, J., Rosin, P.L., Kopanja, L.: On the orientability of shapes. IEEE Trans. Image Process. 15, 3478–3487 (2006)CrossRef Žunić, J., Rosin, P.L., Kopanja, L.: On the orientability of shapes. IEEE Trans. Image Process. 15, 3478–3487 (2006)CrossRef
Metadaten
Titel
Graph Cuts Based Tomography Enhanced by Shape Orientation
verfasst von
Marina Marčeta
Tibor Lukić
Copyright-Jahr
2020
DOI
https://doi.org/10.1007/978-3-030-51002-2_16

Premium Partner