Abstract
In this paper we address the problem of finding an “optimal” strategy for placing k biopsy needles, given a large number of possible initial needle positions. This problem arises for example in guided, endoscopic needle biopsies, where the position of the endoscope’s tip is known with some error. We consider two variations of the problem: (1) Calculate the smallest set of needles, needed to guarantee a successful biopsy. (2) Given a number k, calculate k needles such that the probability of a successful biopsy is maximized. We formulate both problems in terms of two general, NP-hard optimization problems. Our solution to both problems is “optimal” with respect to the best approximative algorithm known for the respective NP-hard problem. For the latter problem there exists an approximative algorithm which requires virtually no implementation effort and is guaranteed to be within a factor of 1 - \(\frac{1}{e}\) of the exact solution. For both variations of the problem we are able to provide success probabilities for each needle to the physician. We have implemented the approximative algorithm for the second variation. The resulting probabilities show that our approach can provide valuable decision support for the physician in choosing how many needles to place and how to place them.
Chapter PDF
Similar content being viewed by others
Keywords
- Approximative Algorithm
- Placement Strategy
- Greedy Approach
- Biopsy Protocol
- TransBronchial Needle Aspiration
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Shen, D., et al.: A Statistical Atlas of Prostate Cancer for Optimal Biopsy. In: Niessen, W.J., Viergever, M.A. (eds.) MICCAI 2001. LNCS, vol. 2208, pp. 416–424. Springer, Heidelberg (2001)
Zeng, J., et al.: Distribution of Prostate Cancer for Optimized Biopsy Protocols. In: Delp, S.L., DiGoia, A.M., Jaramaz, B. (eds.) MICCAI 2000. LNCS, vol. 1935, pp. 287–296. Springer, Heidelberg (2000)
Kukuk, M., et al.: TBNA-protocols - Guiding TransBronchial Needle Aspirations Without a Computer in the Operating Room. In: Niessen, W.J., Viergever, M.A. (eds.) MICCAI 2001. LNCS, vol. 2208, pp. 997–1006. Springer, Heidelberg (2001)
Kukuk, M., Geiger, B.: A Real-Time Deformable Model for Flexible Instruments Inserted Into Tubular Structures. In: Dohi, T., Kikinis, R. (eds.) MICCAI 2002. LNCS, vol. 2489, pp. 330–338. Springer, Heidelberg (2002)
Mori, K., et al.: A Method for Tracking the Camera Motion of Real Endoscope by Epipolar Geometry Analysis and Virtual Endoscopy System. In: Niessen, W.J., Viergever, M.A. (eds.) MICCAI 2001. LNCS, vol. 2208, pp. 1–8. Springer, Heidelberg (2001)
Fisher, M.L., Kedia, P.: Optimal solution of set covering/partitioning problems using dual heuristics. Management Science 36, 674–688 (1990)
Beasley, J.E.: A Genetic Algorithm for the Set Covering Problem. European Journal of Operational Research, 392–404 (1994)
Hochbaum, D.S., Pathria, A.: Analysis of the Greedy Approach in Problems of Maximum k-Coverage. Naval Research 45, 615–627 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kukuk, M. (2003). An “Optimal” k-Needle Placement Strategy Given an Approximate Initial Needle Position. In: Ellis, R.E., Peters, T.M. (eds) Medical Image Computing and Computer-Assisted Intervention - MICCAI 2003. MICCAI 2003. Lecture Notes in Computer Science, vol 2878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39899-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-39899-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20462-6
Online ISBN: 978-3-540-39899-8
eBook Packages: Springer Book Archive