- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper proposes an end-to-end 3D neuron reconstruction algorithm for optical neuron images. It formulates 3D neuron reconstruction as starting from a voxel crop and a point-direction hint , and at each step predicting the direction to the next node, the node type, and a bounded position residual. Data results in the paper show that the proposed method achieves favorable reconstruction results on CWMBS and CORAL.
Critical strengths
The guided autoregressive subtree generation employed in the paper constitutes a meaningful contribution. In the process of neuron reconstruction, branch detection is transformed from a post-hoc connection rule into a supervised, in-the-loop decision-making process, and the per-node targets (type + outgoing direction + residual) can be transferred to other trackers.
Critical weaknesses
The methods section of this paper is difficult to understand, especially Section 3.2. Many of the mathematical symbols lack rigorous definitions, and the relationships between symbols are not sufficiently explained, making it hard for me to accurately understand the method proposed by the authors. How the method in Section 3.2 is used in conjunction with the model architecture in Section 3.3 is also unclear, as there is no high-level description of this.
Questions for authors
Q1. Why does the experimental section of the paper lack experiments on the BigNeuron dataset, which is commonly used for neuron reconstruction?
Q2. What is the prompt inference cost of the sandwich variant of TreeTracer? Table 13 only provides the results for the vanilla version.
9 comments
Part [2/2] Response to Q1 & Q2
Response to Q1: BigNeuron
We did not evaluate on BigNeuron, and we will list the single-domain evaluation as a limitation. TreeTracer targets brain-wide reconstruction of long-projecting neurons in mouse whole-brain light microscopy. CWMBS and CORAL come from this setting (blocks cropped from whole mouse-brain images; CORAL is fMOST) and provide both training subtrees and test blocks. The brain-wide experiment then traces 14 complete neurons through volumes exceeding voxels per side, which tests continuation across many windows. BigNeuron's Gold166 covers many species and imaging modalities in small image stacks. It is a good test of cross-domain generalization, but each modality has only a few annotated stacks for training a learned tracer, and the small stacks do not exercise long-range continuation.
Response to Q2: inference cost of the sandwich variant
Sandwich runs the same tracer from the supplied prompt and from up to 32 accepted automatic seeds, each traced in two directions, and then fuses and refines the traces (Algorithm 1). The table extends Table 13 (CWMBS test set, 483 prompts from 37 images, RTX 3090, same timing scope; the Trexplorer and vanilla rows match Part 1 of our response to Reviewer c9bY). Generated length rewards spurious paths, so we report correctly traced length per second.
| Method | Correct length (voxels) | Time (s) | Time per prompt (s) | Correct length per second ↑ |
|---|---|---|---|---|
| APP2(SegMamba) | 23,018.81 | 467.40 | 0.97 | 49.25 |
| Kimimaro(SegMamba) | 15,824.06 | 240.43 | 0.50 | 65.82 |
| neuTube(SegMamba) | 29,885.47 | 751.38 | 1.56 | 39.77 |
| APP2(GBP-Net) | 30,974.88 | 1,396.51 | 2.89 | 22.18 |
| Kimimaro(GBP-Net) | 59,672.82 | 954.42 | 1.98 | 62.52 |
| neuTube(GBP-Net) | 51,990.33 | 2,038.37 | 4.22 | 25.51 |
| Trexplorer | 18,578.93 | 5,630.76 | 11.66 | 3.30 |
| Trexplorer Super | 50,112.71 | 3,293.98 | 6.82 | 15.21 |
| TreeTracer (vanilla) | 50,465.62 | 630.06 | 1.30 | 80.10 |
| TreeTracer (sandwich) | 62,831.50 | 5,646.71 | 11.69 | 11.13 |
Sandwich is the most expensive configuration: 11.7 s per prompt, 9.0× vanilla and 5.9× Kimimaro(GBP-Net), and about the same as Trexplorer. The extra time is spent tracing the automatic seeds and fusing and refining the traces. In return it traces the most correct length, 5.3% more than Kimimaro(GBP-Net) and 24.5% more than vanilla, and reaches the highest Fiber F1. Vanilla is the fastest per correctly traced voxel. We will add these rows to Table 13.
Dear Reviewer,
Thank you again for your thoughtful feedback. We would like to follow up on our two-part response to your comments.
In Part [1/2], we provided a step-by-step overview connecting the tree-generation procedure in Section 3.2 to the network architecture in Section 3.3, together with a notation table. In Part [2/2], we explained our dataset selection, and reported the inference cost of TreeTracer (sandwich).
We would greatly appreciate your feedback on whether these responses address your concerns, particularly regarding the clarity of the method and the connection between Sections 3.2 and 3.3. If any aspects remain unclear, we would be happy to provide further explanations.
Thank you for your time and consideration.
Best regards,
The Authors
Part [1/2] Response to W1: clarity of Sections 3.2 and 3.3
Thank you for the specific feedback on presentation. We agree that Section 3.2 introduces many symbols without a high-level picture and that its link to Section 3.3 is not stated. In the revision we will open Section 3 with the overview below and a step-by-step algorithm, add a notation table, and remove overloaded symbols.
Overview. TreeTracer reconstructs the subtree selected by a prompt (p0,d0), a start point and an initial direction (Sec. 3.1). It keeps a set of active paths, each ending at a current node t, and repeats the following for every active path.
Only step 2 has learned parameters; steps 3–5 are fixed rules that turn the network outputs into a tree. Training (Sec. 3.4) supervises the three outputs of step 2 along annotated paths. For images larger than the 32×96×96 crop, a path that reaches the crop boundary continues in a new crop together with its recent history (Appendix A.7, Algorithm 2).
Notation table (to be added to Section 3)