A graph optimization problem in virtual colonoscopy

DOI10.1007/3-540-68535-9_33MaRDI QIDQ4218432zbMATH OpenFDO

Authors Yaorong Ge, Jie Wang

Publication date 18 May 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-68535-9_33

zbMATH Keywords

graph optimization problemhelical computed tomography

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10) Computing methodologies and applications (68U99)

Recommendations

• An optimization problem in virtual endoscopy
• Optimal Path: Theory and Models for Vessel Segmentation
• Clinical evaluation of an automatic path tracker for virtual colonoscopy
• The generalized Steiner cable-trench problem with application to error correction in vascular image analysis

Cited in

(1)

• An optimization problem in virtual endoscopy

This page was built for publication: A graph optimization problem in virtual colonoscopy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4218432)