Skip to main content
. Author manuscript; available in PMC: 2012 Apr 25.
Published in final edited form as: Neuroinformatics. 2011 Sep;9(2-3):263–278. doi: 10.1007/s12021-011-9121-2

Figure 5.

Figure 5

Local optimization based branch merging strategy. Maximum intensity projection of an image stack showing a cluster of 4 end-points of the optimal trace (thin lines). All possible branch merger scenarios are considered by the algorithm. Three of these scenarios are shown in A, B, and C. The associated distances between branch end-points [D (in pixels)], cosines of angles made by the merging branch pairs [cos(χ)], average normalized intensities (I), curvatures (K) of the optimally connecting paths (thick red and green lines), and the corresponding costs are shown. Merger scenario shown in A seems to be the best choice as judged by the total cost of merger. Scale bar in A is 5 μm.