REVIEW 3 major objections 4 minor 7 references
Sparse Annotations with Random Walks for U-Net Segmentation of Biodegradable Bone Implants in Synchrotron Microtomograms
T0 review · 3 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read Scribble labels match dense expert segmentation of bone implants with the help of a random-walk expansion and one closing step.
desk verdict A modest, plausibly useful scribble-supervision pipeline whose headline result — random walk plus closing matches dense annotation — rests on a per-method preprocessing choice evaluated on the same four volumes. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing mechanism is a two-stage target-generation pipeline: a random-walk algorithm propagates sparse scribble labels to a dense grid, using image gray values to keep the propagated labels aligned with edges, followed by a binary morphological closing on the bone label to fill small holes and connect nearby bone regions. The random walk supplies dense supervision from a fraction of annotated pixels, and the closing step lifts total Dice from 0.687 to 0.751. The network itself is a 2.5D U-Net that takes eight neighbouring slices as input and reduces the depth to one, enabling supervision with individual 2D segmentations on partially labelled volumes.
What would settle it
Run the identical random-walk-plus-closing training on an unseen synchrotron bone-implant dataset with different bone structure or contrast and compare it with a densely supervised U-Net: a gap near or above six Dice percentage points would contradict the claimed equivalence.
Extended reading notes
Core claim
The paper's central claim is that, for this task, a U-Net trained on scribble labels propagated by random walks and then morphologically closed on the bone class produces segmentation quality equal to one trained on full expert labels. The measured total Dice is 0.751 ± 0.068 versus 0.750 ± 0.102, a difference of 0.1 percentage points, while per-class results show the closing step mainly repairs the bone and corroded-screw labels. This is what the paper argues for, with the caveat that the closing step is essential: without it the random-walk target reaches only 0.687 Dice. The corroded-screw class remains the weakest segment in every configuration, attributed to its small area and difficult gray-value contrast.
Load-bearing premise
The load-bearing premise is that the binary closing of the bone label is a generally valid correction for this imaging task and not a tweak that happens to help these four scans; without it, the random-walk target trails dense annotation by 6.3 Dice percentage points (0.687 vs 0.750).
Editorial extensions
If this is right
- Scribble annotation on selected slices is enough to train a U-Net that matches dense-label accuracy, so scaling training databases to more microtomogram volumes no longer requires full pixelwise tracing.
- A simple fixed pipeline, random-walk propagation plus one morphological closing, replaces earlier iterative scribble-supervision setups that combine recurrent networks and conditional random fields.
- The 2.5D U-Net can be trained on volumes where only every tenth slice carries a label, making partial-volume annotation a practical training protocol.
- The corroded-screw class is the limiting category, so acquiring more variable training data for corrosion regions is the immediate path to further improvement.
- The matching total Dice means a scribble-trained model can stand in for a dense-trained model in the segmentation step of implant degradation studies without changing the measured overlap.
Reading between the lines
- The same scribble-to-dense conversion could be tested on other synchrotron or micro-CT data where bone or biomaterial boundaries are visible in gray values; the edge-preserving random walk should carry over, while the choice of closing may need re-tuning per task.
- The binary closing of the bone label acts as an implicit prior that bone is a connected structure around the implant; a principled rule for when to apply such a prior would make the pipeline more portable.
- Boundary metrics or component-wise error could reveal whether the matched Dice hides a different error distribution, which matters if the goal is quantifying degradation geometry rather than only overlap.
- A natural extension is to let the random walk use multiple scribbled slices jointly, which might sharpen the weak corroded-screw class without adding dense annotations.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper addresses the annotation bottleneck for segmenting biodegradable magnesium-based bone implants in synchrotron microtomograms. The authors propose a pipeline in which a user provides only sparse scribble annotations, a random walk algorithm propagates these to dense pixel-wise labels, an optional morphological closing is applied to the bone label, and a multi-slice 2.5D U-Net is trained on the resulting targets. Using leave-one-out cross-validation on four volumes, they report that this random-walk-based target with closing achieves a Dice coefficient of 0.751 ± 0.068, nearly identical to 0.750 ± 0.102 for dense supervision, while directly training on scribbles yields only 0.482 ± 0.106. The paper concludes that the random-walk approach with morphological post-processing matches dense annotation quality and therefore offers a practical alternative to exhaustive pixel-level labeling.
Significance. If the central claim were fully validated, the paper would make a useful practical contribution by showing that expensive dense expert annotations can be replaced by much cheaper scribbles for this implant-imaging task, without degradation in segmentation quality. The experimental design is simple and the comparison across supervision targets is informative, including the important negative result that direct scribble training fails badly. The paper also honestly reports per-label Dice and notes the difficulty of the corroded screw region. However, the claim of equivalence rests on a single configuration whose key preprocessing step is selected on the test folds of only four datasets, and the paper lacks any statistical analysis that would support an equivalence claim. The significance is therefore conditional on a more rigorous validation protocol.
major comments (3)
- [Section 2 (Experiments) and Table 1] The headline comparison is not apples-to-apples: the random walk result of 0.751 is obtained with the binary closing preprocessing, while the dense baseline of 0.750 is the variant without preprocessing. Table 1 shows that closing changes the dense result from 0.750 to 0.703 but changes the random walk result from 0.687 to 0.751. The paper gives no rationale for why this morphological operation should benefit the random walk target but harm the dense target, and the structuring element shape and size are not specified. Because the closing variant was evaluated in the same leave-one-out cross-validation and selected after seeing the test Dice, the reported 0.751 estimate is a test-set-selected maximum over two preprocessing choices. With only four volumes, this can easily produce the observed 'match' even if the closing has no generalizable benefit. The authors should pre-specify the preprocessing choice on a separate validation split, or at minimum report all variants with a clear statement of how the choice was made, and justify the asymmetry between the random walk and dense conditions.
- [Section 3 (Results and Discussion) and Table 1] The central empirical claim is a statement of equivalence between random walk with closing (0.751 ± 0.068) and dense supervision (0.750 ± 0.102), yet no statistical test is reported. With n=4, the difference of 0.001 Dice is meaningless without a paired analysis, and the 6.4-point improvement from closing is also not shown to be significant. The paper should report per-fold results, perform a paired significance test or compute a confidence interval for the difference, and explicitly define an equivalence margin if the claim is that the methods are equivalent. Without such analysis, the reader cannot distinguish a genuine match from noise.
- [Section 2 (Data and Training)] The random walk algorithm is described only as using 'the grayvalue scan for edge-preservation,' but no details are given for the edge-weight parameter (e.g., beta or conductance), the scribble annotation protocol (number of scribbles, their placement, or the fraction of annotated pixels per slice), or the number of labeled slices per volume beyond '25 slices.' These choices directly affect the random walk target and therefore the reported Dice. Without these details, the method is not reproducible and the sensitivity of the result to these hyperparameters is unknown.
minor comments (4)
- [Abstract and Section 4] The abstract and conclusion state that the random walk approach 'achieves the same Dice overlap as a dense supervision' without noting that this holds only for the variant with binary closing; the unprocessed random walk target is 6.4 percentage points worse. Please qualify the claim.
- [Section 2 (Data)] It is unclear whether '25 slices have been labeled (every 10th slice)' means 25 slices per dataset or 25 slices in total across all four datasets. Please clarify the annotation density.
- [Section 1 and Section 2] The network is described as a 'multi-slice 2.5D U-Net' and later as a modified 3D U-Net, but the exact input/output configuration (eight input slices collapsed to one output slice) is only implicit. A short explicit description of the tensor shapes would improve clarity.
- [Throughout] There are minor typographical issues, e.g., 'synchroton' in the conclusion, and the reference list would benefit from consistent conference/journal formatting.
Circularity Check
No significant circularity: the random-walk targets are training labels, and the reported Dice is evaluated against independent dense expert ground truth.
full rationale
The paper's central claim is empirical: a U-Net trained on scribble annotations expanded by a random walk (plus morphological closing) reaches Dice 0.751 ± 0.068, matching the dense-supervision baseline of 0.750 ± 0.102 in leave-one-out cross-validation on four volumes. The training targets are generated from the same images via a random walk, but this is self-training/pseudo-labeling rather than circular, because the evaluation Dice is computed against held-out dense expert annotations that are not used to construct the target. No fitted parameter, learned constant, or self-cited theorem enters the reported Dice; the random walk (Grady, 2006) and U-Net (Ronneberger et al., 2015) are external, established methods. The references to Moosmann et al. (2017) describe the imaging setup and are not load-bearing for the segmentation result. The main methodological concern is not circularity but validation: the binary-closing preprocessing is evaluated on the same leave-one-out folds used to select it, and with n=4 choosing the better of two preprocessing variants may inflate the reported match. That is a correctness/selection-bias issue, not a definitional reduction of the prediction to its inputs. Accordingly, no circular step can be quoted or exhibited, and the circularity score is 0.
Assumptions & free parameters
free parameters (2)
- Random walk edge-weight parameter (beta or conductance)
- Binary closing kernel for the bone label
assumptions (3)
- domain assumption Random walk propagation from scribble labels, guided by gray values, produces accurate dense target labels on unannotated pixels.
- domain assumption The annotated slices, one every tenth slice, are representative of the full volume, so a 2.5D U-Net trained on them generalizes to unlabeled slices.
- standard math Grady's random walk algorithm, as originally published, applies correctly to the synchrotron image modality.
Cite this review
Pith. "Pith review of Sparse Annotations with Random Walks for U-Net Segmentation of Biodegradable Bone Implants in Synchrotron Microtomograms." pith.science (2026). https://pith.science/paper/IBO6ZQIG
@misc{pith2026190804173,
author = {Pith},
title = {Pith review of: Sparse Annotations with Random Walks for U-Net Segmentation of Biodegradable Bone Implants in Synchrotron Microtomograms},
year = {2026},
howpublished = {\url{https://pith.science/paper/IBO6ZQIG}},
note = {Machine review of arXiv:1908.04173}
}
read the original abstract
Currently, most bone implants used in orthopedics and traumatology are non-degradable and may need to be surgically removed later on e.g. in the case of children. This removal is associated with health risks which could be minimized by using biodegradable implants. Therefore, research on magnesium-based implants is ongoing, which can be objectively quantified through synchrotron radiation microtomography and subsequent image analysis. In order to evaluate the suitability of these materials, e.g. their stability over time, accurate pixelwise segmentations of these high-resolution scans are necessary. The fully-convolutional U-Net architecture achieves a Dice coefficient of 0.750 +/- 0.102 when trained with a small dataset with dense expert annotations. However, extending the learning to larger databases would require prohibitive annotation efforts. Hence, in this work we implemented and compared new training methods that require only a small fraction of manually annotated pixels. While directly training on these scribble annotation deteriorates the segmentation quality by 26.8 percentage points, our new random walk-based semi-automatic target achieves the same Dice overlap as a dense supervision, and thus offers a more promising approach for sparse annotations.
Figures
Reference graph
Works this paper leans on
-
[1]
Learning to segment medical images with scribble-supervision alone
Yigit B Can, Krishna Chaitanya, Basil Mustafa, Lisa M Koch, Ender Konukoglu, and Christian F Baumgartner. Learning to segment medical images with scribble-supervision alone. In Deep Learning in Medical Image Analysis and Multimodal Learning for Clinical Decision Support, pages 236--244. Springer, 2018
work page 2018
-
[2]
Random walks for image segmentation
Leo Grady. Random walks for image segmentation. IEEE transactions on pattern analysis and machine intelligence, 28 0 (11): 0 1768--1783, 2006
work page 2006
-
[3]
A survey on deep learning in medical image analysis
Geert Litjens, Thijs Kooi, Babak Ehteshami Bejnordi, Arnaud Arindra Adiyoso Setio, Francesco Ciompi, Mohsen Ghafoorian, Jeroen Awm Van Der Laak, Bram Van Ginneken, and Clara I S \'a nchez. A survey on deep learning in medical image analysis. Medical image analysis, 42: 0 60--88, 2017
2017
-
[4]
M-net: A convolutional neural network for deep brain structure segmentation
Raghav Mehta and Jayanthi Sivaswamy. M-net: A convolutional neural network for deep brain structure segmentation. In Biomedical Imaging (ISBI 2017), 2017 IEEE 14th International Symposium on, pages 437--440. IEEE, 2017
work page 2017
-
[5]
V-net: Fully convolutional neural networks for volumetric medical image segmentation
Fausto Milletari, Nassir Navab, and Seyed-Ahmad Ahmadi. V-net: Fully convolutional neural networks for volumetric medical image segmentation. In 3D Vision (3DV), 2016 Fourth International Conference on, pages 565--571. IEEE, 2016
work page 2016
-
[6]
Biodegradable magnesium-based implants in bone studied by synchrotron radiation microtomography
Julian Moosmann, Berit Zeller-Plumhoff, DC Florian Wieland, Silvia Galli, Diana Kr \"u ger, Thomas Dose, Hilmar Burmester, Fabian Wilde, Martin Bech, Niccol \`o Peruzzi, et al. Biodegradable magnesium-based implants in bone studied by synchrotron radiation microtomography. In Developments in X-Ray Tomography XI, volume 10391, page 103910O. International S...
work page 2017
-
[7]
U-net: Convolutional networks for biomedical image segmentation
Olaf Ronneberger, Philipp Fischer, and Thomas Brox. U-net: Convolutional networks for biomedical image segmentation. In International Conference on Medical image computing and computer-assisted intervention, pages 234--241. Springer, 2015
2015
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.