A fast algorithm for liver surgery planning

Authors:
Fajie Li;Xinbo Fu;Gisela Klette;Reinhard Klette
Affiliations:
College of Computer Science and Technology, Huaqiao University, Xiamen, Fujian, China;Xiamen ZhiYe Software Engineering Company Limited, Xiamen, Fujian, China;School of Computing & Mathematical Sciences, Auckland University of Technology, Auckland, New Zealand;Computer Science Department, The University of Auckland, Auckland, New Zealand
Venue:
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Year:
2013

Citing 3
Cited 0

A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions

IEEE Transactions on Pattern Analysis and Machine Intelligence
Liver Surgery Planning Using Virtual Reality

IEEE Computer Graphics and Applications
Parallel Banding Algorithm to compute exact distance transform with the GPU

Proceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and Games

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.