TY - GEN
T1 - Dynamic local tracing for 3D axon curvilinear structure detection from microscopic image stack
AU - Wang, Jun
AU - Zhou, Xiaobo
AU - Lu, Ju
AU - Lichtman, Jeff
AU - Chang, Shih Fu
AU - Wong, Stephen T.C.
PY - 2007
Y1 - 2007
N2 - To study the morphologic structure of axons can help neuroscientists understand the neuronal function and development. The modern microscopes provide the fundamental tool for visual inspection of axonal structure. Due to the high volume of generated microscopic axon image data, it is critical to develop an automated technique for robustly and rapidly detecting 3D axonal structure. In this paper, we present a pure 3D approach to extract the curvilinear structure of axonal axes from microscopic image stacks. The method mimics the axon tracing procedure in 3D space as walking along a path with minimized cost value, which corresponds to the shortest path problem (SPP) in graph theory. The global solution for SPP, such as Dijkstra's algorithm, is infeasible for the real axon tracing problem because of the computation cost. We simplify this problem using a dynamic local tracing technique with linear computation complexity. The merits of the proposed method lie in that it can handle the short turn and non-vertical problems and also can separate closely distributed axons from each other.
AB - To study the morphologic structure of axons can help neuroscientists understand the neuronal function and development. The modern microscopes provide the fundamental tool for visual inspection of axonal structure. Due to the high volume of generated microscopic axon image data, it is critical to develop an automated technique for robustly and rapidly detecting 3D axonal structure. In this paper, we present a pure 3D approach to extract the curvilinear structure of axonal axes from microscopic image stacks. The method mimics the axon tracing procedure in 3D space as walking along a path with minimized cost value, which corresponds to the shortest path problem (SPP) in graph theory. The global solution for SPP, such as Dijkstra's algorithm, is infeasible for the real axon tracing problem because of the computation cost. We simplify this problem using a dynamic local tracing technique with linear computation complexity. The merits of the proposed method lie in that it can handle the short turn and non-vertical problems and also can separate closely distributed axons from each other.
UR - http://www.scopus.com/inward/record.url?scp=36348967199&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=36348967199&partnerID=8YFLogxK
U2 - 10.1109/ISBI.2007.356793
DO - 10.1109/ISBI.2007.356793
M3 - Conference contribution
AN - SCOPUS:36348967199
SN - 1424406722
SN - 9781424406722
T3 - 2007 4th IEEE International Symposium on Biomedical Imaging: From Nano to Macro - Proceedings
SP - 81
EP - 84
BT - 2007 4th IEEE International Symposium on Biomedical Imaging
T2 - 2007 4th IEEE International Symposium on Biomedical Imaging: From Nano to Macro; ISBI'07
Y2 - 12 April 2007 through 15 April 2007
ER -