Abstract

Rationale and Objectives: The aim of this study was to identify the optimal parameter configuration of a new algorithm for fully automaticsegmentation of hepatic vessels, evaluating its accuracy in view of its use in a computer system for three-dimensional (3D) planning of liversurgery.Materials and Methods: A phantom reproduction of a human liver with vessels up to the fourth subsegment order, corresponding toa minimum diameter of 0.2 mm, was realized through stereolithography, exploiting a 3D model derived from a real human computed tomographicdata set. Algorithm parameter configuration was experimentally optimized, and the maximum achievable segmentation accuracywas quantified for both single two-dimensional slices and 3D reconstruction of the vessel network, through an analytic comparison of theautomatic segmentation performed on contrast-enhanced computed tomographic phantom images with actual model features.Results: The optimal algorithm configuration resulted in a vessel detection sensitivity of 100% for vessels > 1 mm in diameter, 50% in therange 0.5 to 1 mm, and 14% in the range 0.2 to 0.5 mm. An average area overlap of 94.9% was obtained between automatically andmanually segmented vessel sections, with an average difference of 0.06 mm2. The average values of corresponding false-positive andfalse-negative ratios were 7.7% and 2.3%, respectively.Conclusions: A robust and accurate algorithm for automatic extraction of the hepatic vessel tree from contrast-enhanced computedtomographic volume images was proposed and experimentally assessed on a liver model, showing unprecedented sensitivity in vesseldelineation. This automatic segmentation algorithm is promising for supporting liver surgery planning and for guiding intraoperativeresections.

Autore Pugliese

• Conversano Francesco , Franchini Roberto , Casciaro Sergio

Tutti gli autori

• Conversano F.; Franchini R.; Demitri C.; Massoptier L.; Montagna F.; Maffezzoli A.; Malvasi A.; Casciaro S.

Titolo volume/Rivista

Academic radiology

Anno di pubblicazione

2011

ISSN

1076-6332

ISBN

Non Disponibile

Numero di citazioni Wos

Nessuna citazione

Ultimo Aggiornamento Citazioni

Non Disponibile

Numero di citazioni Scopus

Non Disponibile

Ultimo Aggiornamento Citazioni

Non Disponibile

Settori ERC

Non Disponibile

Codici ASJC

Non Disponibile