An optimization problem in virtual endoscopy

✍ Scribed by Jie Wang; Yaorong Ge

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 894 KB
• Volume: 207
• Category: Article
• ISSN: 0304-3975
• DOI: 10.1016/s0304-3975(98)00065-6

✦ Synopsis

This paper studies a graph optimization problem occurring in virtual endoscopy, which concerns finding the central path of a colon model created from helical computed tomography (CT) image data. The central path is an essential aid for navigating through complex anatomy such as colon. Recently, Ge et al. (1998) devised an efficient method for finding the central path of a colon. The method first generates colon data from a helical CT data volume by image segmentation. It then generates a 3D skeleton of the colon. In the ideal situation, namely, if the skeleton does not contain branches, the skeleton will be the desired central path. However, almost always the skeleton contains extra branches caused by holes in the colon model, which are artifacts produced during image segmentation. To remove false branches, Ge et al. (1998) formulated a graph optimization problem for obtaining the central path. This paper presents a refined formulation and justifies that the solution of the refined optimization problem represents the accurate central path of a colon. We then provide a fast algorithm for solving the problem.