by Li, F, Fu, X, Klette, G and Klette, R
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.
Reference:
A Fast Algorithm for Liver Surgery Planning (Li, F, Fu, X, Klette, G and Klette, R), In Springer, Lecture Notes in Computer Science (Gonzalez Diaz, R, Jimenez, MJ, Medrano, BG, eds.), Springer, volume LNCS7749, 2013.
Bibtex Entry:
@inproceedings{li2013aplanning,
address = "Fajie Li, Huaqiao University, College of Computer Science and Technology, Xiamen, Fujian, China and Xinbo Fu, Huaqiao University, College of Computer Science and Technology, Xiamen, Fujian, China and Gisela Klette, AUT University of Technology, School of Computing and Mathematical Sciences, Private Bag 92006, Auckland, 1142, New Zealand and Reinhard Klette, The University of Auckland, Computer Science Department, Private Bag 92019, Auckland, 1042, New Zealand",
author = "Li, F and Fu, X and Klette, G and Klette, R",
booktitle = "Springer, Lecture Notes in Computer Science",
editor = "Gonzalez Diaz, R and Jimenez, MJ and Medrano, BG",
month = "Mar",
note = "has been published.",
organization = "Sevilla, Spain",
pages = "228--240",
publisher = "Springer",
school = "Heidelberg",
title = "A Fast Algorithm for Liver Surgery Planning",
volume = "LNCS7749",
year = "2013",
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.",
startyear = "2013",
startmonth = "Mar",
startday = "20",
finishyear = "2013",
finishmonth = "Mar",
finishday = "22",
isbn = "978-3-642-37067-0",
issn = "0302-9743",
keyword = "shortest path",
keyword = "surgery planning",
conference = "Int. Conf. Discrete Geometry Computer Imagery.",
day = "20",
publicationstatus = "published",
}