A Fast Algorithm for Liver Surgery Planning
Assume that a simplified liver model consists of some vein cells and liver cells. Such a liver model contains two kinds of components, the vein component and the liver components, each of them consists of cells which are 26-connected. The vein component has a tree-shape topology. Suppose that the vein component has already been cut into two parts, and one of them is diseased. Liver surgery planning systems need to design an algorithm to decompose the liver components into two kinds of subsets, one (usually just one component) that has been affected by the diseased vein component while the other one is still healthy. So far, existing algorithms depend heavily on surgeons’ personal expertise to detect the diseased liver component which needs to be removed. We propose an efficient algorithm for computing the diseased liver component which is based on the diseased vein component, and not on surgeons’ personal manipulations.
KeywordsMain Algorithm Liver Model Digital Geometry Euclidean Distance Transform Liver Component
- 1.Bosch, F.X., Ribes, J., Diaz, M., Cléries, R.: Primary liver cancer: worldwide incidence and trends. Gastroenterology 127, S5–S16 (2004)Google Scholar
- 2.Cao, T.-T., Tang, K., Mohamed, A., Tan, T.-S.: Parallel banding algorithm to compute exact distance transform with the GPU. In: Symp. Interactive 3D Graphics, pp. 83–90 (2010)Google Scholar
- 3.Konrad-Verse, O., Preim, B., Littmann, A.: Virtual resection with a deformable cutting plane. In: Simulation und Visualisierung, pp. 203–214 (2004)Google Scholar
- 12.Shevchenko, N., Seidl, B., Schwaiger, J., Markert, M., Lueth, T.C.: MiMed Liver: A planning system for liver surgery. In: Int. Conf. IEEE EMBS, pp. 1882–1885 (2010)Google Scholar