- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies how much shape-decoding capacity is necessary for joint nuclei detection, classification, and instance segmentation. Through Fourier contour fitting on four histopathological datasets, the author found that lower-order representations can achieve high shape reconstruction accuracy, and proposed LiNA: separating point localization, instance classification, and compact Fourier contour prediction, and combining curvature-aware boundary loss and prototype distillation to improve segmentation and classification. Validation includes Fourier-order sweeps, comparisons against a per-instance dense-mask decoder across four backbone scales, joint-analysis benchmarks on PanNuke and Lizard, and transfer without fine-tuning to MoNuSeg and CPM17. LiNA achieves a favorable accuracy–inference-efficiency trade-off among the evaluated systems.
Critical strengths
- This paper introduces a clear notion of “shape capacity” for nuclear contours, using Fourier order for representational complexity.
- This paper designs LiNA to decouple detection/typing from geometry, enabling controlled capacity studies that isolate the effect of the shape pathway.
- This paper proposes a practical curvature-aware boundary loss to preserve sharp details under low-order contour representations.
- This paper presents a prototype distillation scheme that transfers semantics from a frozen teacher into a compact codebook and fuses it with student features, yielding sizable classification gains.
Critical weaknesses
-
The evidence for a general shape-capacity mismatch remains limited. The main controlled comparison uses a Mask R-CNN-style per-instance dense decoder, whose computational cost inherently grows with nucleus count. This establishes LiNA’s advantage over the tested design, but does not establish that dense shape decoding is generally over-provisioned. Comparisons against shared dense decoders or substantially lighter mask heads would better support the paper’s central claim.
-
The conceptual advance beyond existing compact-contour methods needs clearer substantiation. CPN and FourierNet already establish the effectiveness of Fourier-based instance representations. LiNA adds a useful joint-analysis architecture, boundary supervision, and prototype distillation, but the current evidence more clearly demonstrates an effective system than a substantially new principle. In particular, detection and classification are architecturally separated from geometry prediction, so their stability across Fourier orders offers limited additional support for the broader shape-capacity argument.
-
The overall performance gains are not fully disentangled from pretrained representations and distillation. LiNA benefits from DINOv3 initialization and pathology-teacher supervision, while its comparisons against larger systems involve different architectures and training recipes. Table 6 usefully isolates CAB and distillation gains within LiNA, but does not establish how much of the advantage over competing systems comes from compact geometry rather than these other factors. Table 8 provides encouraging cross-dataset segmentation results, although the conclusions about transferable joint-analysis performance remain limited without corresponding detection and fine-grained classification evaluation.
Questions for authors
-
A comparison against a shared dense decoder or a substantially lighter per-instance mask head is needed to substantiate the broader shape-capacity mismatch claim. Without such evidence, the conclusion should be restricted to the tested decoding pathways.
-
The consistency of source training splits, checkpoint-selection procedures, and image resolutions across the models in Table 8 should be clarified. Evidence of cross-domain fine-grained classification or joint-analysis performance is also needed to establish whether LiNA’s advantage extends beyond binary instance segmentation.
-
Comparisons with matched pretrained initialization and teacher supervision are needed to establish whether LiNA retains its advantage over larger systems. The contributions of compact geometry, backbone pretraining, and prototype distillation should be distinguished more clearly.
6 comments
Q1. Validating Shape-Capacity Mismatch with Shared and Lightweight Decoders (2/3)
Q1. Validating Shape-Capacity Mismatch with Shared and Lightweight Decoders (2/3)
2. Performance Comparison Across Geometry Decoders
Table Q1-1. Performance comparison across geometry decoders (PanNuke, three-fold average).
| Model | Det-F1 | Cls-F1 | avgPQ |
|---|---|---|---|
| LiNA (Ours) | 88.08 | 71.91 | 45.12 |
| Dense28 | 87.38 | 70.47 | 44.06 |
| Dense56-A | 87.46 | 70.34 | 44.22 |
| Dense56-B | 87.42 | 70.37 | 44.36 |
| CondInst-style | 87.50 | 70.87 | 44.04 |
| SharedPixel (K=8) | 87.48 | 70.45 | 43.30 |
| SharedPixel (K=32) | 87.50 | 70.50 | 43.37 |
| SharedPixel (K=64) | 87.47 | 70.43 | 43.51 |
| Binary + Watershed | 87.70 | 71.19 | 42.41 |
For the per-instance dense decoders, increasing the mask resolution from 28×28 to 56×56 and further increasing the RoIAlign resolution improved avgPQ by only 0.30 percentage points, from 44.06 to 44.36. Similarly, increasing the number of spatial prototypes in SharedPixel eightfold, from K=8 to K=64, yielded only a 0.21 percentage-point improvement in avgPQ.
More importantly, CondInst-style and SharedPixel achieved competitive segmentation performance without high-capacity per-instance dense decoding. CondInst-style achieved an avgPQ of 44.04, only 0.32 percentage points below Dense56-B (44.36), while SharedPixel achieved avgPQ scores ranging from 43.30 to 43.51.
These results are also competitive with existing high-capacity nuclei analysis methods. For example, CellViT and PromptNucSeg achieved avgPQ scores of 43.1 and 44.3, respectively, as reported in our manuscript, but required approximately 943 and 570 GFLOPs. In contrast, CondInst-style and SharedPixel achieved comparable levels of accuracy using only approximately 58–63 GFLOPs, corresponding to 9–16× fewer total FLOPs. We note that these comparisons concern the efficiency of complete systems and do not attribute the performance differences solely to their geometry decoders.
These findings show that increasing decoding capacity provides limited performance improvements in both Dense and SharedPixel decoders, while other lightweight geometry decoders, such as CondInst-style, can also achieve competitive segmentation accuracy. This supports our observation that high shape-decoding capacity is not necessarily required for high accuracy and that this finding is not specific to a single decoder architecture.
Binary + Watershed achieved the lowest avgPQ among the compared methods, at 42.41. Unlike LiNA and the other lightweight decoders, which generate individual shape predictions for each nucleus, this approach separates nuclei using a global binary foreground mask and detected nucleus centers. These results support the effectiveness of reducing shape-decoding computation while retaining the ability to predict individual nucleus shapes.
Q1. Validating Shape-Capacity Mismatch with Shared and Lightweight Decoders (3/3)
Q1. Validating Shape-Capacity Mismatch with Shared and Lightweight Decoders (3/3)
3. Computational Efficiency of Geometry Decoding
To compare computational costs across decoders, we measured the total model FLOPs, geometry branch FLOPs, and geometry branch GPU execution time.
Table Q1-2. Computational costs of geometry decoders (multipliers relative to LiNA in parentheses). Total FLOPs are measured with THOP (FLOPs = 2 × MACs) on a single 256×256 input with all 256 candidate RoIs decoded, using the same counting as Table 5(b). Multipliers are computed from unrounded values.
| Model | Total FLOPs (G) | Geometry FLOPs (G) | Geometry GPU Time (ms) |
|---|---|---|---|
| LiNA (Ours) | 48.0 (1.0×) | 0.042 (1.0×) | 0.23 (1.0×) |
| Dense28 | 395.6 (8.2×) | 347.63 (≈8,300×) | 10.61 (46.1×) |
| Dense56-A | 816.8 (17.0×) | 768.84 (≈18,400×) | 21.78 (94.7×) |
| Dense56-B | 1,421.8 (29.6×) | 1,373.89 (≈32,900×) | 39.42 (171.4×) |
| CondInst-style | 58.3 (1.2×) | 10.41 (≈250×) | 9.14 (39.7×) |
| SharedPixel (K=8) | 63.2 (1.3×) | 15.22 (≈365×) | 1.43 (6.2×) |
| SharedPixel (K=32) | 63.2 (1.3×) | 15.27 (≈366×) | 1.60 (7.0×) |
| SharedPixel (K=64) | 63.3 (1.3×) | 15.34 (≈368×) | 1.98 (8.6×) |
| Binary + Watershed | 58.3 (1.2×) | 10.37 (≈249×) | 0.70 (3.0×) |
Dense56-B required approximately 3.6× more total FLOPs than Dense28, yet improved avgPQ by only 0.30 percentage points. In contrast, CondInst-style and SharedPixel shared most of their computation at the image level and achieved competitive segmentation accuracy with approximately 22–24× fewer total FLOPs than Dense56-B.
In particular, these shared decoders incur relatively little additional computation per instance, limiting the growth in total computational cost as the number of nuclei increases. This further reinforces our observation that high-capacity per-instance dense decoding is not essential for nuclei segmentation.
Meanwhile, Fourier contours offer an additional advantage over these lightweight decoders by substantially reducing the computational cost of the geometry prediction pathway itself.
LiNA's geometry branch requires only 0.042 GFLOPs, approximately 1/250 of CondInst-style and 1/365 of SharedPixel. Its geometry branch GPU execution time is also only 0.23 ms, approximately 39.7× faster than CondInst-style and 6.2–8.6× faster than SharedPixel.
This efficiency arises because Fourier contours directly predict each nucleus's shape using compact Fourier coefficients, without requiring separate spatial mask feature generation or dynamic convolutions. However, the differences in total model FLOPs relative to CondInst-style and SharedPixel are approximately 1.2–1.3×. We therefore distinguish the substantial computational savings in the geometry branch from the overall inference efficiency of the complete model.
4. Implications for Shape-Capacity Mismatch
Our central claim is not that Fourier contours are the only effective lightweight geometry representation, but that high shape-decoding capacity provides limited benefits for modeling nucleus geometry.
Beyond the low representational complexity of ground-truth contours and the Fourier-versus-dense comparison presented in the original manuscript, these additional experiments demonstrate that increasing the capacity of Dense and SharedPixel decoders yields only limited performance gains, while alternative lightweight decoders such as CondInst-style can also achieve competitive accuracy. In contrast, the lower performance of Binary + Watershed highlights the importance of effective instance separation rather than simply eliminating geometry computation.
Motivated by these observations, LiNA separates detection/classification from geometry prediction and achieves high segmentation accuracy with a highly compact Fourier contour representation and minimal geometry-decoding cost. These additional results therefore support that shape-capacity mismatch is not limited to the comparison with the original Mask R-CNN-style decoder.
Q1. Validating Shape-Capacity Mismatch with Shared and Lightweight Decoders (1/3)
Q1. Validating Shape-Capacity Mismatch with Shared and Lightweight Decoders (1/3)
As the reviewer pointed out, comparing LiNA only against the Mask R-CNN-style dense decoder in the original manuscript is insufficient to establish that shape-capacity mismatch is not specific to a particular decoder architecture. To address this concern, we introduced additional CondInst-style dynamic decoders, YOLACT-style shared pixel decoders, and Binary + Center-guided Watershed, along with experiments that increase the output mask resolution and RoI sampling resolution of the original dense decoder.
Our goal is not to claim that Fourier contours are the only effective lightweight representation, but rather to investigate whether the limited benefits of high shape-decoding capacity are consistently observed across different geometry decoder architectures.
1. Additional Decoder Architectures and Experimental Setup
We constructed the additional models by replacing LiNA's geometry prediction pathway while retaining the same backbone, point detection, classification, prototype distillation, and Hungarian matching.
The compared decoders are as follows:
All additional decoders were evaluated on the same three train/validation/test splits of PanNuke. Decoders producing pixel-wise instance masks were trained using BCE and Dice losses, while Binary + Watershed was trained for binary foreground prediction and performed instance separation using settings selected on the validation set.