Skip to main content

2016 | OriginalPaper | Buchkapitel

11. Fast Surgical Algorithm for Cutting with Liver Standard Triangulation Language Format Using Z-Buffers in Graphics Processing Unit

verfasst von : Hiroshi Noborio, Katsuhiko Onishi, Masanao Koeda, Kiminori Mizushino, Takahiro Kunii, Masaki Kaibori, Masanori Kon, Yen-Wei Chen

Erschienen in: Computer Aided Surgery

Verlag: Springer Japan

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

search-config
loading …

Abstract

In this paper, we propose a graphics processing unit-based efficient surgical algorithm for operating on a human liver by a cavitron ultrasonic surgical aspirator (CUSA) scalpel in a virtual environment built with polyhedral objects in Standard Triangulation Language format. First, using z-buffers of a human liver and a CUSA scalpel in a general-purpose graphics processing unit, we rapidly detect their intersections of rectangular parallelepipeds. Then, depending on the plastic, elastic, and viscous material properties of the operated portion of the liver, we determine the rectangular parallelepiped lengths. From that point, based on the correspondence between a vertex and pixel via the XY-image of the z-buffer, the corresponding vertices of the liver polyhedron are moved along the Z-axis of the z-buffer according to its extended or contracted length of rectangular parallelepipeds. By this function, the liver polyhedron can be efficiently and precisely deformed or cut by the CUSA polyhedron.

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 Canny, J.F.: Collision detection for moving polyhedra. IEEE Trans. PAMI 8(2), 200–209 (1986)CrossRef Canny, J.F.: Collision detection for moving polyhedra. IEEE Trans. PAMI 8(2), 200–209 (1986)CrossRef
2.
Zurück zum Zitat Gilbert, E., Johnson, D., Keerthi, S.: A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE J. Robot. Autom. 4(2), 193–203 (1988)CrossRef Gilbert, E., Johnson, D., Keerthi, S.: A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE J. Robot. Autom. 4(2), 193–203 (1988)CrossRef
3.
Zurück zum Zitat Lin, M., Canny, J.: A fast algorithm for incremental distance calculation. In: Proceedings of the IEEE conference on robotics and automation, Sacramento, CA, pp. 1008–1014 (1991) Lin, M., Canny, J.: A fast algorithm for incremental distance calculation. In: Proceedings of the IEEE conference on robotics and automation, Sacramento, CA, pp. 1008–1014 (1991)
4.
Zurück zum Zitat Quinlan, S.: Efficient distance computation between non-convex objects. In: Proceedings of international conference on robotics and automation, San Diego, CA, pp. 3324–3329 (1994) Quinlan, S.: Efficient distance computation between non-convex objects. In: Proceedings of international conference on robotics and automation, San Diego, CA, pp. 3324–3329 (1994)
5.
Zurück zum Zitat Noborio, H., Fukuda, S., Arimoto, S.: Fast interference check method using octree representation. Adv. Robot. 3(3), 193–212 (1988)CrossRef Noborio, H., Fukuda, S., Arimoto, S.: Fast interference check method using octree representation. Adv. Robot. 3(3), 193–212 (1988)CrossRef
6.
Zurück zum Zitat Gottschalk, S., Lin, M.C., Manocha, D.: OBB-tree: a hierarchical structure for rapid interference detection. In: Proceedings of the SIGGRAPH, New Orleans, LA, pp. 171–180 (1996) Gottschalk, S., Lin, M.C., Manocha, D.: OBB-tree: a hierarchical structure for rapid interference detection. In: Proceedings of the SIGGRAPH, New Orleans, LA, pp. 171–180 (1996)
7.
Zurück zum Zitat Bergen, G.: Efficient collision detection of complex deformable models using AABB trees. J. Graph. Tools 2(4), 1–13 (1997)CrossRefMATH Bergen, G.: Efficient collision detection of complex deformable models using AABB trees. J. Graph. Tools 2(4), 1–13 (1997)CrossRefMATH
8.
Zurück zum Zitat Lorensen, W.E., Cline, H.E.: Marching cubes: a high resolution 3D surface construction algorithm. Comput. Graph. 21(4), 163–169 (1987)CrossRef Lorensen, W.E., Cline, H.E.: Marching cubes: a high resolution 3D surface construction algorithm. Comput. Graph. 21(4), 163–169 (1987)CrossRef
9.
Zurück zum Zitat Zhang, Z.: Iterative point matching for registration of free-form curves. Research report 1658, INRIA Sophia-Antipolis (1992) Zhang, Z.: Iterative point matching for registration of free-form curves. Research report 1658, INRIA Sophia-Antipolis (1992)
10.
Zurück zum Zitat Foruzan, A.H., Chen, Y.-W., et al.: Segmentation of liver in low-contrast images using K-means clustering and geodesic active contour algorithms. IEICE Trans. E96-D, 798–807 (2013) Foruzan, A.H., Chen, Y.-W., et al.: Segmentation of liver in low-contrast images using K-means clustering and geodesic active contour algorithms. IEICE Trans. E96-D, 798–807 (2013)
11.
Zurück zum Zitat Noborio H., Kunii T., Mizushino K.: GPU-based shortest distance algorithm for liver surgery navigation. In: Proceedings of the 10th anniversary Asian conference on computer aided surgery, Kyusyu University, Fukuoka, pp. 42–43 (2014) Noborio H., Kunii T., Mizushino K.: GPU-based shortest distance algorithm for liver surgery navigation. In: Proceedings of the 10th anniversary Asian conference on computer aided surgery, Kyusyu University, Fukuoka, pp. 42–43 (2014)
12.
Zurück zum Zitat Zienkiewicz, O.C., Taylor, R.L., Zhu, J.Z.: The Finite Element Method: Its Basis and Fundamentals, 7th edn. Butterworth-Heinemann, Oxford (2013) Zienkiewicz, O.C., Taylor, R.L., Zhu, J.Z.: The Finite Element Method: Its Basis and Fundamentals, 7th edn. Butterworth-Heinemann, Oxford (2013)
13.
Zurück zum Zitat Sundaraj, K., Montbonnot, S.M., Laugier, C., Costa, I.F.: An approach to LEM modeling: construction, collision detection and dynamic simulation. In: Proceedings of the IEEE/RSJ international conference on intelligent robots and systems, Maui, HI, pp. 2196–2201 (2001) Sundaraj, K., Montbonnot, S.M., Laugier, C., Costa, I.F.: An approach to LEM modeling: construction, collision detection and dynamic simulation. In: Proceedings of the IEEE/RSJ international conference on intelligent robots and systems, Maui, HI, pp. 2196–2201 (2001)
Metadaten
Titel
Fast Surgical Algorithm for Cutting with Liver Standard Triangulation Language Format Using Z-Buffers in Graphics Processing Unit
verfasst von
Hiroshi Noborio
Katsuhiko Onishi
Masanao Koeda
Kiminori Mizushino
Takahiro Kunii
Masaki Kaibori
Masanori Kon
Yen-Wei Chen
Copyright-Jahr
2016
Verlag
Springer Japan
DOI
https://doi.org/10.1007/978-4-431-55810-1_11

Neuer Inhalt