Pith. sign in

REVIEW 5 major objections 6 minor 1 cited by

MARL-MambaContour: Unleashing Multi-Agent Deep Reinforcement Learning for Active Contour Optimization in Medical Image Segmentation

T0 review · 5 major / 6 minor · reviewed 2026-08-06 · deepseek-v4-flash

Pith's one-line read Modeling each contour point as a cooperative Soft Actor-Critic agent, with a Mamba policy network and an adaptive entropy schedule, yields state-of-the-art medical segmentation and the largest margins on boundary fidelity.

desk verdict Plausible new MARL/Mamba contour framework with an unsupported SOTA claim; needs sound statistical and baseline-adaptation evidence. read the letter →

arxiv 2506.18679 v2 pith:Z2P3NGRK submitted 2025-06-23 cs.CV

classification cs.CV
keywords medicalimagesegmentationmulti-agentreinforcementlearningactivecontourSoftActor-CriticMambastatespacemodelentropyregularizationboundaryF-score
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish that contour-based segmentation driven by multi-agent reinforcement learning can beat pixel-wise classifiers on medical images. It models each contour point as an agent that moves in a continuous 2D action space, coordinated by a shared Mamba policy network, and optimizes with Soft Actor-Critic plus an entropy-regularization mechanism that adapts exploration to contour smoothness. Across five datasets, including brain MRI, spine CT, abdominal CT, laparoscopic video, and histopathology, the method reports top mIoU and mDice on most datasets and larger boundary-F-score gains, such as +3.29% on BraTS2023 and +4.98% on VerSe. If correct, object-level contours with topological constraints are a viable alternative to per-pixel classification in clinical segmentation.

What carries the argument

The load-bearing construction is a multi-agent Markov decision process in which $N$ contour points are agents. State $s_i$ for agent $i$ combines its coordinates $(x_i,y_i)$, local features $f_i$ from an Inception module, and sinusoidal position embeddings of neighbors; action $a_i \in \mathbb{R}^2$ is a bounded displacement ($\|a_i\| \le 25$); reward $r_i$ sums an initialization Dice term, incremental mIoU, incremental mBoundF, and a cooperative smoothness penalty. Optimization uses a contour-specific Soft Actor-Critic with double Q-networks. ERAM computes a consistency index $C = \lambda_1 \mathrm{Var}(\{d_{i,i+1}\}) + \lambda_2 \mathrm{Var}(\{\kappa_i\})$ and sets $\alpha = \alpha_0/(1+\beta C)$. The actor is a six-layer bidirectional Mamba (SS2D) network; BCHFM partitions the forward and backward hidden states into windows of size $w$, applies cross-attention within each window pair, and adds the fused state $\gamma\,h_{\mathrm{fused}}$ into the SS2D recursion. That fusion is what gives each agent neighbor-aware, long-range context without the memory confusion of plain state-space compression.

What would settle it

Run the strongest 3D baselines (nnU-Net V2, UNETR, MedSAM) natively in 3D on the same BraTS2023, VerSe, and RAOS volumes, and compare mIoU, mDice, and mBoundF against MARL-MambaContour on the same reconstructed 3D masks; if the baselines' sagittal-slice adaptation was suboptimal, the reported margins would shrink or reverse.

Watch

Extended reading notes

Core claim

On its own terms, the paper's central claim is that segmentation can be reliably driven by treating each contour point as an autonomous, cooperating agent rather than by classifying pixels. Iterating a Soft Actor-Critic policy over bounded 2D displacements, with an entropy coefficient that shrinks when the contour becomes irregular and grows when it is smooth, plus a bidirectional Mamba policy network whose hidden states are fused by windowed cross-attention, produces top mIoU and mDice on most of five datasets and the best boundary F-score on all of them. The paper calls this the first contour-based medical segmentation framework built on multi-agent reinforcement learning.

Load-bearing premise

The load-bearing premise is that every compared baseline was evaluated on the same 2D slices with equally tuned settings, even though the paper never states how 3D-trained baselines such as nnU-Net V2, UNETR, and MedSAM were adapted to those slices, nor how much the ground-truth-box training initialization contributed.

Editorial extensions

If this is right

  • On five datasets spanning MRI, CT, laparoscopy, and histopathology, the method reports the best mIoU and mDice on most and the best mBoundF on all, implying contour-based MARL is broadly applicable across modalities.
  • The +3.29% (BraTS2023) and +4.98% (VerSe) mBoundF gains over the strongest competitors mean the largest advantage is boundary fidelity, not just region overlap.
  • The RL strategy improves a supervised contour baseline by 4.26 mIoU, 4.02 mDice, and 4.16 mBoundF, showing iterative reward-driven refinement beats one-shot distance supervision.
  • ERAM and BCHFM are complementary: ERAM alone raises mBoundF by 7.80 points, BCHFM alone raises mIoU by 3.03, mDice by 4.20, and mBoundF by 4.84, and together they produce the full-model gains.
  • With 128 contour points and five evolution iterations the best balance of accuracy and cost is reached; more points or more iterations do not help.
  • A contour initialized from a detector box is robust to position and scale perturbations of up to 10%, with Dice loss under 0.5%, and stays within about 2% Dice loss even at 20% perturbation.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Not tested in the paper: because training initializes contours from ground-truth bounding boxes while inference relies on detector boxes, the reported margins likely overstate a fully automatic detect-then-segment pipeline; an end-to-end evaluation with detected boxes only would separate detector error from contour-evolution skill.
  • The 2.5D slice-propagation scheme suggests the same contour agents could be applied to video or volumetric tracking, where the previous frame's contour is a natural initialization; that extension is not explored here.
  • ERAM's consistency-based entropy schedule is a generic mechanism for any deformable-model or polygon-editing task, not only medical segmentation.
  • A hybrid contour-plus-pixel head could address the stated limitation on objects with holes or disconnected fragments, which the paper admits fall outside the pure contour paradigm.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 6 minor

Summary. This paper proposes MARL-MambaContour, a contour-based medical image segmentation framework in which each contour point is modeled as a cooperating agent in a multi-agent Soft Actor-Critic (SAC) formulation. The method initializes an octagonal contour from a detector bounding box, then iteratively evolves contour points using a Mamba-based policy network with a bidirectional cross-attention hidden-state fusion mechanism (BCHFM) and an adaptive entropy regularization mechanism (ERAM). Experiments are reported on five datasets (BraTS2023, VerSe, RAOS, m2caiSeg, PanNuke) using mIoU, mDice, and mBoundF; the authors claim state-of-the-art performance, including mBoundF gains of 3.29 and 4.98 percentage points over the strongest competitors. Ablations on RAOS attribute the gains to ERAM and BCHFM, and a sensitivity analysis studies robustness to initialization perturbations.

Significance. If the empirical results hold, the paper introduces a novel and potentially useful design space: treating contour evolution as cooperative multi-agent reinforcement learning rather than pixel classification, with a policy network tailored to long contour sequences. The method is described in enough detail to be re-implemented, and the component ablations support the internal contributions. The authors also explicitly acknowledge limitations in Section 5 (holes, disconnected or very small structures, and dependence on detection), which is a sign of balanced reporting. However, the headline state-of-the-art claim rests entirely on Table 1, and the evidence as presented does not yet support that claim at the statistical level expected for a medical-imaging benchmark comparison.

major comments (5)
  1. [Section 4.2.1, Table 1] The central state-of-the-art claim is based on single numbers with no standard deviations, confidence intervals, or significance tests. Several reported margins are small enough to fall within typical fold-to-fold variation, for example m2caiSeg mIoU of 66.81 versus 66.18 and 66.00 for UNETR and nnU-Net V2, and BraTS2023 mDice of 91.74 versus 91.00 for nnU-Net V2. The statement that the method achieves 'consistent superiority' is not statistically supported. Please report fold-wise results, standard deviations, and a significance test for the main comparisons.
  2. [Supplementary Sections B and C] The adaptation of the compared baselines to the 2D-sliced 3D datasets is unspecified. The supplementary states that BraTS2023 and RAOS are densely sliced along the sagittal plane and that VerSe uses mid-sagittal reconstructions, with the proposed method propagating contours slice-by-slice. The manuscript does not state how nnU-Net V2, UNETR, TransUNet, SwinUNet, VM-UNet, or MedSAM were trained or evaluated under this slicing, or whether 3D-optimized baselines were reconfigured. Without this information, the margins in Table 1 could reflect suboptimal baseline deployment rather than a genuine advantage of the proposed method.
  3. [Section 4.4.4] Training initializes contour evolution from ground-truth bounding boxes, while inference uses detector boxes. The reported robustness to synthetic positional and scale perturbations does not quantify the actual train/test distribution shift introduced by using detector outputs at inference time. Because the method is a two-stage detector-plus-contour pipeline and Section 5 lists detection dependence as a limitation, this gap is load-bearing. Please provide end-to-end results with detector-initialized training, or otherwise quantify the performance difference between the disclosed training protocol and a fully detected pipeline.
  4. [Equations (5)-(9) and Table 8] The reward function includes terms computed from the same metrics used for evaluation: region overlap (mIoU) in Eq. (5), boundary F-score (mBoundF) in Eq. (7), and Dice in Eq. (4). This is not circular by construction, but the reward weights are reported as experimentally tuned (Table 8 footnote), and if tuning is performed on RAOS while RAOS also serves as a test dataset, the RAOS gains may partly reflect hyperparameter selection. Please state the tuning protocol per dataset and whether the weights are fixed for all datasets or re-tuned per dataset.
  5. [Section 4.4.1 and Tables 3-4] The ablations in Tables 3 and 4 lack error bars, and the 'Supervised Baseline' used to justify the reinforcement-learning claim is not specified beyond being 'similar to [113]'. The mBoundF improvement of 7.80 percentage points attributed to ERAM in Table 4 is large and would be more convincing with details of the baseline training objective, loss function, and evaluation protocol, as well as repeated-run variability.
minor comments (6)
  1. [Section 3.4, Eqs. (17)-(19)] The text says 'the hidden state sequences h_fwd and h_fwd' where the second should be h_bwd; the branch-specific subscripts are lost in the notation.
  2. [Algorithm 1, line 6] The initial state is written as [(x_i, y_i), f_i, Delta p_i], but the state definition in Eq. (1) uses Embedding{(x_j, y_j)} and does not include Delta p_i; please reconcile the notation.
  3. [Section 4.4.2] The text says 'integrating both ERAM and BHFM' but the mechanism is introduced as BCHFM; the acronym BHFM is not defined.
  4. [Supplementary Section B] The sentence 'Although Mamba Snake is fundamentally a 2D paradigm' appears to refer to MARL-MambaContour rather than Mamba Snake; please correct the name to avoid confusion.
  5. [Table 1 and Table 7] The dataset name is written inconsistently as 'Verse' and 'VerSe'; please use a single consistent spelling.
  6. [References] The bibliography contains many template placeholder entries (e.g., [1], [2], [43], [44]) that are unrelated to the content; the reference list should be cleaned and completed.

Circularity Check

0 steps flagged · score 2.0 of 10

No derivation-level circularity found; score 2 reflects one non-load-bearing self-citation and metric-aligned reward design, not a reduction of results to inputs.

full rationale

MARL-MambaContour is an empirical pipeline paper; its SOTA claim is a benchmark measurement (Table 1), not a theorem derived from assumptions. The reward in Eqs. (4)-(9) uses mIoU, mBoundF, and Dice, the same families as the evaluation metrics in Eq. (23), but this is ordinary training-objective alignment: the policy is learned and then evaluated, and the reported numbers are not algebraic restatements of the reward weights. The footnote that "Reward weights were determined through experimental tuning" (Supplementary Table 8) and the ground-truth-bounding-box training initialization (Sec. 4.4.4) are experimental-hygiene caveats, affecting statistical independence and train/test distribution shift, not construction-level circularity. The only overlapping-author citation, GAMED-Snake [156], appears as a related-work and comparison baseline; it is not load-bearing for any design choice and does not forbid alternatives. Thus no circular step reduces a claimed prediction to its own input; the low score reflects the rubric's minor self-citation level plus the metric-overlap caveat, not a demonstrated circularity.

Assumptions & free parameters 6 free parameters · 4 assumptions · 0 invented entities

The central claim rests mainly on tuned reward design and architecture choices. No new physical entities, forces, or conserved quantities are introduced, and no independent falsifiable handles beyond benchmark numbers are supplied.

free parameters (6)
  • Reward weights w0-w3 = w0=0.5, w1=1.0, w2=1.5, w3=0.1
    Tuned experimentally on RAOS and fixed across datasets; reward design largely determines optimization behavior.
  • ERAM baseline entropy alpha0 and sensitivity beta = alpha0=0.2; beta=0.05 in Section 3.3, beta=0.5 in Supplementary Table 8
    Controls the exploration/smoothness balance; the two locations give inconsistent values.
  • ERAM consistency weights lambda1, lambda2 = lambda1=0.1, lambda2=0.5
    Hand-chosen weights for distance and curvature variance in the contour consistency index.
  • Maximum action step delta = 25 pixels
    Bounded action space; no sensitivity analysis is reported for this value.
  • Number of contour points N = 128
    Selected on RAOS via ablation; no analysis across datasets is shown.
  • Evolution iterations T = 5
    Selected via ablation on RAOS; larger T gives only slight improvement with added cost.
assumptions (4)
  • domain assumption Contour evolution is a Markov decision process whose state features are sufficient for optimal point displacement.
    Section 3.2 formalizes the MDP; if local states omit needed boundary context, the RL objective is not well posed.
  • domain assumption Ground-truth masks are available for reward computation, and the evaluation metrics reuse the same overlap and boundary functions as the rewards.
    Equations (4) through (9) and (23) share mIoU and mBoundF; this couples optimization and evaluation, so reported scores are not independent predictions.
  • domain assumption Mamba's recurrent state compression can be repaired by windowed cross-attention fusion of bidirectional hidden states without harming convergence.
    Section 3.4, Equations (17) through (21); no theorem or controlled experiment isolates the memory-confusion mechanism.
  • domain assumption SAC with shared policy parameters over agents converges under the non-stationary multi-agent reward structure.
    Section 3.3 gives no multi-agent convergence guarantee for cooperative SAC with shared rewards and simultaneous updates.

how reviews work

0 comments
Cite this review

Pith. "Pith review of MARL-MambaContour: Unleashing Multi-Agent Deep Reinforcement Learning for Active Contour Optimization in Medical Image Segmentation." pith.science (2026). https://pith.science/paper/Z2P3NGRK

@misc{pith2026250618679,
  author       = {Pith},
  title        = {Pith review of: MARL-MambaContour: Unleashing Multi-Agent Deep Reinforcement Learning for Active Contour Optimization in Medical Image Segmentation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/Z2P3NGRK}},
  note         = {Machine review of arXiv:2506.18679}
}
read the original abstract

We introduce MARL-MambaContour, the first contour-based medical image segmentation framework based on Multi-Agent Reinforcement Learning (MARL). Our approach reframes segmentation as a multi-agent cooperation task focused on generate topologically consistent object-level contours, addressing the limitations of traditional pixel-based methods which could lack topological constraints and holistic structural awareness of anatomical regions. Each contour point is modeled as an autonomous agent that iteratively adjusts its position to align precisely with the target boundary, enabling adaptation to blurred edges and intricate morphologies common in medical images. This iterative adjustment process is optimized by a contour-specific Soft Actor-Critic (SAC) algorithm, further enhanced with the Entropy Regularization Adjustment Mechanism (ERAM) which dynamically balance agent exploration with contour smoothness. Furthermore, the framework incorporates a Mamba-based policy network featuring a novel Bidirectional Cross-attention Hidden-state Fusion Mechanism (BCHFM). This mechanism mitigates potential memory confusion limitations associated with long-range modeling in state space models, thereby facilitating more accurate inter-agent information exchange and informed decision-making. Extensive experiments on five diverse medical imaging datasets demonstrate the state-of-the-art performance of MARL-MambaContour, highlighting its potential as an accurate and robust clinical application.

Figures

Figures reproduced from arXiv: 2506.18679 by the authors.

Figure 1
Figure 1. (a) Task challenges in various aspects. (b) Design comparison between our method and pixel-based methods. [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. (a) Feature extraction backbone built on the FasterNet [ [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Qualitative comparison of segmentation results between MARL-MambaContour and other methods. [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Model efficiency comparison. Evolution Iterations 3 4 5 6 7 mIoU (%) 81.54 83.17 85.65 85.67 85.67 mDice (%) 87.57 91.07 93.58 93.63 93.61 mBoundF (%) 86.73 89.23 92.30 92.38 92.37 [PITH_FULL_IMAGE:figures/full_fig_p009_4.png]

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. CRISP-SAM2: SAM2 with Cross-Modal Interaction and Semantic Prompting for Multi-Organ Segmentation

    eess.IV 2025-06 conditional novelty 5.0 of 10

    A text-guided SAM2 variant with cross-modal attention, semantic prompt generation, and a similarity-sorted memory bank achieves top Dice and surface scores on seven public multi-organ CT datasets.

Reference graph

Works this paper leans on

150 extracted references · 37 canonical work pages · cited by 1 Pith paper

  1. [113]

    Sida Peng, Wen Jiang, Huaijin Pi, Xiuli Li, Hujun Bao, and Xiaowei Zhou

  2. [1]

    SIGCOMM Comput

    1984. SIGCOMM Comput. Commun. Rev. 13-14, 5-1 (1984)

  3. [2]

    CHI ’08: CHI ’08 extended abstracts on Human factors in computing systems (Florence, Italy)

    2008. CHI ’08: CHI ’08 extended abstracts on Human factors in computing systems (Florence, Italy). ACM, New York, NY, USA. General Chair-Czerwinski, Mary and General Chair-Lund, Arnie and Program Chair-Tan, Desney

  4. [3]

    Rafal Ablamowicz and Bertfried Fauser. 2007. CLIFFORD: a Maple 11 Package for Clifford Algebra Computations, version 11 . Retrieved February 28, 2008 from http://math.tntech.edu/rafal/cliff11/index.html

  5. [4]

    Abril and Robert Plant

    Patricia S. Abril and Robert Plant. 2007. The patent holder’s dilemma: Buy, sell, or troll? Commun. ACM 50, 1 (Jan. 2007), 36–44. doi:10.1145/1188913.1188915

  6. [5]

    A. Adya, P. Bahl, J. Padhye, A.Wolman, and L. Zhou. 2004. A multi-radio unification protocol for IEEE 802.11 wireless networks. In Proceedings of the Conference’17, July 2017, Washington, DC, USA R. Zhang, Y. Sun, et al. IEEE 1st International Conference on Broadnets Networks (BroadNets’04) . IEEE, Los Alamitos, CA, 210–217

  7. [6]

    I. F. Akyildiz, T. Melodia, and K. R. Chowdhury. 2007. A Survey on Wireless Multimedia Sensor Networks. Computer Netw. 51, 4 (2007), 921–960

  8. [7]

    I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. 2002. Wireless Sensor Networks: A Survey. Comm. ACM 38, 4 (2002), 393–422

Show all 150 references
  1. [8]

    Using the amsthm Package

    American Mathematical Society 2015. Using the amsthm Package . American Mathematical Society. http://www.ctan.org/pkg/amsthm

  2. [9]

    Sten Andler. 1979. Predicate Path expressions. In Proceedings of the 6th. ACM SIGACT-SIGPLAN symposium on Principles of Programming Languages (POPL ’79). ACM Press, New York, NY, 226–236. doi:10.1145/567752.567774

  3. [10]

    David A. Anisi. 2003. Optimal Motion Control of a Ground Vehicle . Master’s thesis. Royal Institute of Technology (KTH), Stockholm, Sweden

  4. [11]

    Sam Anzaroot and Andrew McCallum. 2013. UMass Citation Field Extraction Dataset. Retrieved May 27, 2019 from http://www.iesl.cs.umass.edu/data/data- umasscitationfield

  5. [12]

    Sam Anzaroot, Alexandre Passos, David Belanger, and Andrew McCallum. 2014. Learning Soft Linear Constraints with Application to Citation Field Extraction. In Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (ACL). Association for Computat...

  6. [13]

    J. E. Archer, Jr., R. Conway, and F. B. Schneider. 1984. User recovery and reversal in interactive systems. ACM Trans. Program. Lang. Syst. 6, 1 (Jan. 1984), 1–19

  7. [14]

    Kai Arulkumaran, Marc Peter Deisenroth, Miles Brundage, and Anil Anthony Bharath. 2017. Deep Reinforcement Learning: A Brief Survey. IEEE SPM 34, 6 (2017), 26–38. doi:10.1109/MSP.2017.2743240

  8. [15]

    P. Bahl, R. Chancre, and J. Dungeon. 2004. SSCH: Slotted Seeded Channel Hopping for Capacity Improvement in IEEE 802.11 Ad-Hoc Wireless Networks. In Proceeding of the 10th International Conference on Mobile Computing and Networking (MobiCom’04). ACM, New York, NY, 112–117

  9. [16]

    Shubhi Bansal, Sreekanth Madisetty, Mohammad Zia Ur Rehman, Chandravard- han Singh Raghaw, Gaurav Duggal, Nagendra Kumar, et al. 2024. A comprehen- sive survey of mamba architectures for medical image analysis: Classification, segmentation, restoration and beyond. arXiv (2024)...

  10. [17]

    Brad Wray, and Robin Haunschild

    Lutz Bornmann, K. Brad Wray, and Robin Haunschild. 2019. Citation concept analysis (CCA)—A new form of citation analysis revealing the usefulness of concepts for other researchers illustrated by two exemplary case studies includ- ing classic books by Thomas S. Kuhn and Karl R....

  11. [18]

    Debray, and Larry L

    Mic Bowman, Saumya K. Debray, and Larry L. Peterson. 1993. Reasoning About Naming Systems. ACM Trans. Program. Lang. Syst. 15, 5 (November 1993), 795–825. doi:10.1145/161468.161471

  12. [19]

    Johannes Braams. 1991. Babel, a Multilingual Style-Option System for Use with LaTeX’s Standard Document Styles. TUGboat 12, 2 (June 1991), 291–301

  13. [21]

    Buss, Arnold L

    Jonathan F. Buss, Arnold L. Rosenberg, and Judson D. Knott. 1987. Vertex Types in Book-Embeddings. Technical Report. Amherst, MA, USA

  14. [22]

    Sabuncu, John Guttag, and Adrian V

    Victor Ion Butoi, Jose Javier Gonzalez Ortiz, Tianyu Ma, Mert R. Sabuncu, John Guttag, and Adrian V. Dalca. 2023. UniverSeg: Universal Medical Image Segmentation. In IEEE/CVF International Conference on Computer Vision (ICCV) . 21381–21394. doi:10.1109/ICCV51070.2023.01960

  15. [23]

    Caicedo and Svetlana Lazebnik

    Juan C. Caicedo and Svetlana Lazebnik. 2015. Active Object Localization with Deep Reinforcement Learning. In IEEE/CVF International Conference on Com- puter Vision (ICCV). 2488–2496. doi:10.1109/ICCV.2015.286

  16. [24]

    Hu Cao, Yueyue Wang, Joy Chen, Dongsheng Jiang, Xiaopeng Zhang, Qi Tian, and Manning Wang. 2021. Swin-Unet: Unet-like Pure Transformer for Medical Image Segmentation. In International Conference on Medical Image Computing and Computer-Assisted Intervention (MICCAI). 205–214. d...

  17. [26]

    Jianbo Chen, Yutong Xie, Fengxiang He, Zhiqiang Fan, Yixiao Lu, Liangzhi Li, Yutong Bai, and Alan Yuille. 2021. TransUNet: Transformers Make Strong Encoders for Medical Image Segmentation. InIEEE/CVF International Conference on Computer Vision (ICCV) . 10486–10495. doi:10.1109...

  18. [27]

    Tianxiang Chen, Zi Ye, Zhentao Tan, Tao Gong, Yue Wu, Qi Chu, Bin Liu, Nenghai Yu, and Jieping Ye. 2024. MiM-ISTD: Mamba-in-Mamba for Efficient Infrared Small-Target Detection. IEEE Transactions on Geoscience and Remote Sensing 62 (2024), 1–13. doi:10.1109/TGRS.2024.3485721

  19. [28]

    Malcolm Clark. 1991. Post Congress Tristesse. In TeX90 Conference Proceedings. TeX Users Group, 84–89

  20. [29]

    Clarkson

    Kenneth L. Clarkson. 1985. Algorithms for Closest-Point Problems (Computational Geometry). Ph. D. Dissertation. Stanford University, Palo Alto, CA. UMI Order Number: AAT 8506171

  21. [30]

    Kenneth Lee Clarkson. 1985. Algorithms for Closest-Point Problems (Computa- tional Geometry). Ph. D. Dissertation. Stanford University, Stanford, CA, USA. Advisor(s) Yao, Andrew C. AAT 8506171

  22. [31]

    Jacques Cohen (Ed.). 1996. Special issue: Digital Libraries. Commun. ACM 39, 11 (Nov. 1996)

  23. [32]

    Sarah Cohen, Werner Nutt, and Yehoshua Sagic. 2007. Deciding equivalances among conjunctive aggregate queries. J. ACM 54, 2, Article 5 (April 2007), 50 pages. doi:10.1145/1219092.1219093

  24. [34]

    Mancini, and Alessandro Mei

    Mauro Conti, Roberto Di Pietro, Luigi V. Mancini, and Alessandro Mei. 2009. (old) Distributed data source verification in wireless sensor networks.Inf. Fusion 10, 4 (2009), 342–353. doi:10.1016/j.inffus.2009.01.002

  25. [35]

    XBOW Sensor Motes Specifications

    CROSSBOW 2008. XBOW Sensor Motes Specifications. http://www.xbow.com

  26. [36]

    Culler, D

    D. Culler, D. Estrin, and M. Srivastava. 2004. Overview of Sensor Networks. IEEE Comput. 37, 8 (Special Issue on Sensor Networks) (2004), 41–49

  27. [37]

    Jia Deng, Wei Dong, Richard Socher, Li-Jia Li, Kai Li, and Li Fei-Fei. 2009. ImageNet: A large-scale hierarchical image database. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) . 248–255. doi:10.1109/CVPR. 2009.5206848

  28. [38]

    Dijkstra

    E. Dijkstra. 1979. Go to statement considered harmful. In Classics in software engineering (incoll). Yourdon Press, Upper Saddle River, NJ, USA, 27–33. http: //portal.acm.org/citation.cfm?id=1241515.1241518

  29. [39]

    Yi Ding, Xue Qin, Mingfeng Zhang, Ji Geng, Dajiang Chen, Fuhu Deng, and Chunhe Song. 2023. RLSegNet: An Medical Image Segmentation Network Based on Reinforcement Learning. IEEE/ACM TCBB 20, 4 (2023), 2565–2576. doi:10.1109/TCBB.2022.3195705

  30. [40]

    Douglass, David Harel, and Mark B

    Bruce P. Douglass, David Harel, and Mark B. Trakhtenbrot. 1998. Statecarts in use: structured analysis and object-orientation. In Lectures on Embedded Systems, Grzegorz Rozenberg and Frits W. Vaandrager (Eds.). Lecture Notes in Computer Science, Vol. 1494. Springer-Verlag, Lon...

  31. [41]

    Xiuquan Du, Xuebin Xu, Jiajia Chen, Xuejun Zhang, Lei Li, Heng Liu, and Shuo Li. 2025. UM-Net: Rethinking ICGNet for polyp segmentation with uncertainty modeling. MedIA 99 (2025), 103347

  32. [42]

    D. D. Dunlop and V. R. Basili. 1985. Generalizing specifications for uniformly implemented loops. ACM Trans. Program. Lang. Syst. 7, 1 (Jan. 1985), 137–158

  33. [45]

    Simon Fear. 2005. Publication quality tables in LATEX. http://www.ctan.org/pkg/ booktabs

  34. [46]

    Jevgenij Gamper, Navid Koohbanani, Simon Graham, Mostafa Jahanifar, Syed Ali Khurram, Ayesha Azam, Katherine Hewitt, and Nasir Rajpoot. 2020. PanNuke Dataset Extension, Insights and Baselines. (03 2020). doi:10.48550/arXiv.2003. 10778

  35. [47]

    Dan Geiger and Christopher Meek. 2005. Structured Variational Inference Procedures and their Realizations (as incol). InProceedings of Tenth International Workshop on Artificial Intelligence and Statistics, The Barbados. The Society for Artificial Intelligence and Statistics

  36. [48]

    Michael Gerndt. 1989. Automatic Parallelization for Distributed-Memory Multi- processing Systems. Ph. D. Dissertation. University of Bonn, Bonn, Germany

  37. [49]

    Michel Goossens, S. P. Rahtz, Ross Moore, and Robert S. Sutor. 1999. The Latex Web Companion: Integrating TEX, HTML, and XML (1st ed.). Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA

  38. [50]

    Albert Gu and Tri Dao. 2024. Mamba: Linear-Time Sequence Modeling with Selective State Spaces. In International Conference on Learning Representations (ICLR). https://openreview.net/forum?id=tEYskw1VY2

  39. [51]

    Matthew Van Gundy, Davide Balzarotti, and Giovanni Vigna. 2007. Catch me, if you can: Evading network signatures with web-based polymorphic worms. In Proceedings of the first USENIX workshop on Offensive Technologies (WOOT ’07) . USENIX Association, Berkley, CA, Article 7, 9 pages

  40. [52]

    Matthew Van Gundy, Davide Balzarotti, and Giovanni Vigna. 2008. Catch me, if you can: Evading network signatures with web-based polymorphic worms. In Proceedings of the first USENIX workshop on Offensive Technologies (WOOT ’08) . USENIX Association, Berkley, CA, Article 7, 2 pages

  41. [53]

    Matthew Van Gundy, Davide Balzarotti, and Giovanni Vigna. 2009. Catch me, if you can: Evading network signatures with web-based polymorphic worms. In Proceedings of the first USENIX workshop on Offensive Technologies (WOOT ’09) . USENIX Association, Berkley, CA, 90–100

  42. [54]

    Tuomas Haarnoja, Aurick Zhou, Pieter Abbeel, and Sergey Levine. 2018. Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor. In International Conference on Machine Learning (ICML) (Proceedings of Machine Learning Research, Vol. 80) ,...

  43. [55]

    Ian Munro

    Torben Hagerup, Kurt Mehlhorn, and J. Ian Munro. 1993. Maintaining Discrete Probability Distributions Optimally. In Proceedings of the 20th International Col- loquium on Automata, Languages and Programming (Lecture Notes in Computer Science, Vol. 700). Springer-Verlag, Berlin, 253–264

  44. [56]

    1978.LOGICS of Programs: AXIOMATICS and DESCRIPTIVE POWER

    David Harel. 1978.LOGICS of Programs: AXIOMATICS and DESCRIPTIVE POWER. MIT Research Lab Technical Report TR-200. Massachusetts Institute of Tech- nology, Cambridge, MA

  45. [57]

    David Harel. 1979. First-Order Dynamic Logic . Lecture Notes in Computer Science, Vol. 68. Springer-Verlag, New York, NY. doi:10.1007/3-540-09237-4

  46. [58]

    CodeBlue: Sensor Networks for Medical Care

    Harvard CodeBlue 2008. CodeBlue: Sensor Networks for Medical Care. http://www.eecs.harvard.edu/mdw/ proj/codeblue/

  47. [59]

    Roth, and Daguang Xu

    Ali Hatamizadeh, Yucheng Tang, Vishwesh Nath, Dong Yang, Holger R. Roth, and Daguang Xu. 2022. UNETR: Transformers for 3D Medical Image Segmen- tation. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (W ACV). 574–584. doi:10.1109/WACV51458.2...

  48. [60]

    Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. 2016. Deep residual learning for image recognition. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). 770–778

  49. [61]

    Heering and P

    J. Heering and P. Klint. 1985. Towards monolingual programming environments. ACM Trans. Program. Lang. Syst. 7, 2 (April 1985), 183–213

  50. [62]

    Maurice Herlihy. 1993. A Methodology for Implementing Highly Concurrent Data Objects. ACM Trans. Program. Lang. Syst. 15, 5 (November 1993), 745–770. doi:10.1145/161468.161469

  51. [63]

    C. A. R. Hoare. 1972. Chapter II: Notes on data structuring. In Structured pro- gramming (incoll), O. J. Dahl, E. W. Dijkstra, and C. A. R. Hoare (Eds.). Academic Press Ltd., London, UK, UK, 83–174. http://portal.acm.org/citation.cfm?id= 1243380.1243382

  52. [64]

    Billy S. Hollis. 1999. Visual Basic 6: Design, Specification, and Objects with Other (1st ed.). Prentice Hall PTR, Upper Saddle River, NJ, USA

  53. [65]

    Lars Hörmander. 1985. The analysis of linear partial differential operators. III . Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], Vol. 275. Springer-Verlag, Berlin, Germany. viii+525 pages. Pseudodifferential operators

  54. [66]

    Lars Hörmander. 1985. The analysis of linear partial differential operators. IV . Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], Vol. 275. Springer-Verlag, Berlin, Germany. vii+352 pages. Fourier integral operators

  55. [67]

    Vincent Tao Hu, Stefan Andreas Baumann, Ming Gui, Olga Grebenkova, Pingchuan Ma, Johannes Fischer, and Björn Ommer. 2024. ZigMa: A DiT- style Zigzag Mamba Diffusion Model. In European Conference on Computer Vision (ECCV) (Milan, Italy). Springer-Verlag, Berlin, Heidelberg, 148...

  56. [68]

    Tao Huang, Xiaohuan Pei, Shan You, Fei Wang, Chen Qian, and Chang Xu. 2024. LocalMamba: Visual State Space Model with Windowed Selective Scan. arXiv (2024). arXiv:2403.09338

  57. [69]

    IEEE TCSC Executive Committee

    IEEE 2004. IEEE TCSC Executive Committee. In Proceedings of the IEEE In- ternational Conference on Web Services (ICWS ’04) . IEEE Computer Society, Washington, DC, USA, 21–22. doi:10.1109/ICWS.2004.64

  58. [70]

    Jaeger, Simon A

    Fabian Isensee, Paul F. Jaeger, Simon A. A. Kohl, Jens Petersen, and Klaus Her- mann Maier-Hein. 2020. nnU-Net: a self-configuring method for deep learning- based biomedical image segmentation. Nat Methods 18 (2020), 203 – 211. https://api.semanticscholar.org/CorpusID:227947847

  59. [71]

    Saferi Rahman, Modhumonty Das, Monika Barua, and Md

    Razin Bin Issa, Md. Saferi Rahman, Modhumonty Das, Monika Barua, and Md. Golam Rabiul Alam. 2020. Reinforcement Learning based Autonomous Vehicle for Exploration and Exploitation of Undiscovered Track. In 2020 Inter- national Conference on Information Networking (ICOIN) . 276–...

  60. [72]

    Michael Kass, Andrew Witkin, and Demetri Terzopoulos. 1988. Snakes: Active Contour Models. IJCV 1, 4 (1988), 321–331

  61. [73]

    Anahita Fathi Kazerooni, Nastaran Khalili, Xinyang Liu, Debanjan Haldar, Zhi- fan Jiang, Syed Muhammed Anwar, Jake Albrecht, Maruf Adewole, Udunna Anazodo, Hannah Anderson, et al. 2024. The brain tumor segmentation (BraTS) challenge 2023: focus on pediatrics (CBTN-CONNECT-DIPG...

  62. [74]

    Markus Kirschmer and John Voight. 2010. Algorithmic Enumeration of Ideal Classes for Quaternion Orders. SIAM J. Comput. 39, 5 (Jan. 2010), 1714–1747. doi:10.1137/080734467

  63. [75]

    Donald E. Knuth. 1981. Seminumerical Algorithms. Addison-Wesley

  64. [76]

    Donald E. Knuth. 1981.Seminumerical Algorithms (2nd ed.). The Art of Computer Programming, Vol. 2. Addison-Wesley, Reading, MA

  65. [77]

    Donald E. Knuth. 1984. The TEXbook. Addison-Wesley, Reading, MA

  66. [78]

    Donald E. Knuth. 1997. The Art of Computer Programming, Vol. 1: Fundamental Algorithms (3rd. ed.). Addison Wesley Longman Publishing Co., Inc

  67. [79]

    Donald E. Knuth. 1998.The Art of Computer Programming (3rd ed.). Fundamental Algorithms, Vol. 1. Addison Wesley Longman Publishing Co., Inc. (book)

  68. [86]

    Wei-Chang Kong. 2006. E-commerce and cultural values (Inbook-num chap) . IGI Publishing, Hershey, PA, USA, Chapter (in type field) 22, 51–74. http: //portal.acm.org/citation.cfm?id=887006.887010

  69. [87]

    Korach, D

    E. Korach, D. Rotem, and N. Santoro. 1984. Distributed algorithms for finding centers and medians in networks. ACM Trans. Program. Lang. Syst. 6, 3 (July 1984), 380–401

  70. [88]

    Jacob Kornerup. 1994. Mapping Powerlists onto Hypercubes . Master’s thesis. The University of Texas at Austin. (In preparation)

  71. [89]

    David Kosiur. 2001. Understanding Policy-Based Networking (2nd. ed.). Wiley, New York, NY

  72. [90]

    Leslie Lamport. 1986. LATEX: A Document Preparation System . Addison-Wesley, Reading, MA

  73. [91]

    Justin Lazarow, Weijian Xu, and Zhuowen Tu. 2022. Instance Segmentation with Mask-supervised Polygonal Boundary Transformers. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) . 4372–4381. doi:10.1109/ CVPR52688.2022.00434

  74. [92]

    Jan Lee. 1981. Transcript of question and answer session. In History of program- ming languages I (incoll) , Richard L. Wexelblat (Ed.). ACM, New York, NY, USA, 68–71. doi:10.1145/800025.1198348

  75. [93]

    Newton Lee. 2005. Interview with Bill Kinder: January 13, 2005. Video. Comput. Entertain. 3, 1, Article 4 (Jan.-March 2005). doi:10.1145/1057270.1057278

  76. [94]

    Buyuktur, David K

    Cheng-Lun Li, Ayse G. Buyuktur, David K. Hutchful, Natasha B. Sant, and Satyendra K. Nainwal. 2008. Portalis: using competitive online interactions to support aid initiatives for the homeless. In CHI ’08 extended abstracts on Human factors in computing systems (Florence, Italy...

  77. [95]

    Yang Li, Yue Zhang, Weigang Cui, Baiying Lei, Xihe Kuang, and Teng Zhang

  78. [96]

    Justin Liang, Namdar Homayounfar, Wei Chiu Ma, Yuwen Xiong, and Raquel Urtasun. 2020. PolyTransform: Deep Polygon Transformer for Instance Seg- mentation. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)

  79. [97]

    Huan Ling, Jun Gao, Amlan Kar, Wenzheng Chen, and Sanja Fidler. 2019. Fast Interactive Object Annotation With Curve-GCN. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) . 5252–5261. doi:10.1109/CVPR. 2019.00540

  80. [98]

    Yating Ling, Yuling Wang, Wenli Dai, Jie Yu, Ping Liang, and Dexing Kong. 2023. Mtanet: Multi-task attention network for automatic medical image segmentation and classification. IEEE TMI (2023)

  81. [99]

    Manmatha

    Jiang Liu, Hui Ding, Zhaowei Cai, Yuting Zhang, Ravi Kumar Satzoda, Vijay Mahadevan, and R. Manmatha. 2023. PolyFormer: Referring Image Segmentation as Sequential Polygon Generation. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) . 18653–18663. doi:10...

  82. [100]

    Yue Liu, Yunjie Tian, Yuzhong Zhao, Hongtian Yu, Lingxi Xie, Yaowei Wang, Qixiang Ye, Jianbin Jiao, and Yunfan Liu. 2024. VMamba: Vi- sual State Space Model. In Advances in Neural Information Processing Sys- tems (NeurIPS) , A. Globerson, L. Mackey, D. Belgrave, A. Fan, U. Pa-...

  83. [101]

    Xiangde Luo, Zihan Li, Shaoting Zhang, Wenjun Liao, and Guotai Wang. 2024. Rethinking Abdominal Organ Segmentation (RAOS) in the Clinical Scenario: A Robustness Evaluation Benchmark with Challenging Cases. In International Conference on Medical Image Computing and Computer-Ass...

  84. [102]

    Jun Ma, Yuting He, Feifei Li, Lin Han, Chenyu You, and Bo Wang. 2024. Segment anything in medical images. Nat Commun 15, 1 (2024), 654

  85. [103]

    Salman Maqbool, Aqsa Riaz, Hasan Sajid, and Osman Hasan. 2020. m2caiSeg: Semantic Segmentation of Laparoscopic Images using Convolutional Neural Networks. arXiv (2020). arXiv:2008.10134

  86. [104]

    McCracken and Donald G

    Daniel D. McCracken and Donald G. Golden. 1990. Simplified Structured COBOL with Microsoft/MicroFocus COBOL . John Wiley & Sons, Inc., New York, NY, USA

  87. [105]

    Daniela O Medley, Carlos Santiago, and Jacinto C Nascimento. 2021. Cycoseg: A cyclic collaborative framework for automated medical image segmentation. IEEE TPAMI 44, 11 (2021), 8167–8182

  88. [106]

    Di Meng, Edmond Boyer, and Sergi Pujades. 2023. Vertebrae localization, segmen- tation and identification using a graph optimization and an anatomic consistency cycle. CMIG 107 (2023), 102235

  89. [107]

    Sape Mullender (Ed.). 1993. Distributed systems (2nd Ed.) . ACM Press/Addison- Wesley Publishing Co., New York, NY, USA

  90. [108]

    E. Mumford. 1987. Managerial expert systems and organizational change: some critical research issues. In Critical issues in information systems research (incoll) . John Wiley & Sons, Inc., New York, NY, USA, 135–155. http://portal.acm.org/ citation.cfm?id=54905.54911

  91. [109]

    Natarajan, M

    A. Natarajan, M. Motani, B. de Silva, K. Yap, and K. C. Chua. 2007. Investigat- ing Network Architectures for Body Sensor Networks. In Network Architec- tures, G. Whitcomb and P. Neece (Eds.). Keleuven Press, Dayton, OH, 322–328. arXiv:960935712 [cs]

  92. [110]

    F. Nielson. 1985. Program transformations in a denotational setting. ACM Trans. Program. Lang. Syst. 7, 3 (July 1985), 359–379

  93. [111]

    Dave Novak. 2003. Solder man. Video. In ACM SIGGRAPH 2003 Video Review on Animation theater Program: Part I - Vol. 145 (July 27–27, 2003) . ACM Press, New York, NY, 4. doi:99.9999/woot07-S422 http://video.google.com/videoplay? docid=6528042696351994555

  94. [112]

    Barack Obama. 2008. A more perfect union. Video. Retrieved March 21, 2008 from http://video.google.com/videoplay?docid=6528042696351994555

  95. [114]

    Perazzi, J

    F. Perazzi, J. Pont-Tuset, B. McWilliams, L. Van Gool, M. Gross, and A. Sorkine- Hornung. 2016. A Benchmark Dataset and Evaluation Methodology for Video Object Segmentation. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). 724–732. doi:10.1109/CVPR.2016.85

  96. [115]

    Charles J. Petrie. 1986. New Algorithms for Dependency-Directed Backtracking (Master’s thesis). Technical Report. Austin, TX, USA

  97. [116]

    Charles J. Petrie. 1986. New Algorithms for Dependency-Directed Backtracking (Master’s thesis). Master’s thesis. University of Texas at Austin, Austin, TX, USA

  98. [117]

    Poker-Edge.Com. 2006. Stats and Analysis. Retrieved June 7, 2006 from http://www.poker-edge.com/stats.php

  99. [118]

    R Core Team. 2019. R: A Language and Environment for Statistical Computing . R Foundation for Statistical Computing, Vienna, Austria. https://www.R- project.org/

  100. [119]

    Yongming Rao, Jiwen Lu, and Jie Zhou. 2017. Attention-Aware Deep Reinforce- ment Learning for Video Face Recognition. InIEEE/CVF International Conference on Computer Vision (ICCV) . 3951–3960. doi:10.1109/ICCV.2017.424

  101. [120]

    Brian K. Reid. 1980. A high-level approach to computer document format- ting. In Proceedings of the 7th Annual Symposium on Principles of Programming Languages. ACM, New York, 24–31

  102. [121]

    Olaf Ronneberger, Philipp Fischer, and Thomas Brox. 2015. U-net: Convolu- tional networks for biomedical image segmentation. In International Conference on Medical Image Computing and Computer-Assisted Intervention (MICCAI) . Springer, 234–241

  103. [122]

    Bernard Rous. 2008. The Enabling of Digital Libraries. Digital Libraries 12, 3, Article 5 (July 2008). To appear

  104. [123]

    Jiacheng Ruan, Jincheng Li, and Suncheng Xiang. 2024. VM-UNet: Vision Mamba UNet for Medical Image Segmentation. arXiv (Feb. 2024). doi:10.48550/arXiv. 2402.02491 arXiv:2402.02491

  105. [124]

    Mehdi Saeedi, Morteza Saheb Zamani, and Mehdi Sedighi. 2010. A library-based synthesis methodology for reversible logic. Microelectron. J. 41, 4 (April 2010), 185–194

  106. [125]

    Mehdi Saeedi, Morteza Saheb Zamani, Mehdi Sedighi, and Zahra Sasanian. 2010. Synthesis of Reversible Circuit Using Cycle-Based Approach. J. Emerg. Technol. Comput. Syst. 6, 4 (Dec. 2010)

  107. [126]

    Salas and Einar Hille

    S.L. Salas and Einar Hille. 1978. Calculus: One and Several Variable . John Wiley and Sons, New York

  108. [127]

    Robin Schneider. 2022. The doclicense package. Retrieved May 27, 2022 from http://www.ctan.org/pkg/doclicense

  109. [128]

    Joseph Scientist. 2009. The fountain of youth. Patent No. 12345, Filed July 1st., 2008, Issued Aug. 9th., 2009

  110. [129]

    Husseini, Amirhossein Bayat, and Maximilian Löf- fler et al

    Anjany Sekuboyina, Malek E. Husseini, Amirhossein Bayat, and Maximilian Löf- fler et al. 2021. VerSe: A Vertebrae labelling and segmentation benchmark for multi-detector CT images. MedIA 73 (2021), 102166. doi:10.1016/j.media.2021. 102166

  111. [130]

    Stan W. Smith. 2010. An experiment in bibliographic mark-up: Parsing metadata for XML export. In Proceedings of the 3rd. annual workshop on Librarians and Computers (LAC ’10, Vol. 3) , Reginald N. Smythe and Alexander Noble (Eds.). Paparazzi Press, Milan Italy, 422–431. doi:99...

  112. [131]

    Asad Z. Spector. 1990. Achieving application requirements. In Distributed Systems (2nd. ed.), Sape Mullender (Ed.). ACM Press, New York, NY, 19–33. doi:10.1145/90417.90738

  113. [132]

    Christian Szegedy, Vincent Vanhoucke, Sergey Ioffe, Jon Shlens, and Zbigniew Wojna. 2016. Rethinking the Inception Architecture for Computer Vision. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) . 2818–

  114. [133]

    Rong Tao, Wenyong Liu, and Guoyan Zheng. 2022. Spine-transformers: Ver- tebra labeling and segmentation in arbitrary field-of-view spine CTs via 3D transformers. MedIA 75 (2022), 102258

  115. [134]

    Harry Thornburg. 2001. Introduction to Bayesian Statistics . Retrieved March 2, 2005 from http://ccrma.stanford.edu/~jos/bayes/bayes.html

  116. [135]

    Z. Tian, X. Si, and Y. et al. Zheng. 2022. Multi-step medical image segmentation based on reinforcement learning. J Ambient Intell Human Comput 13 (2022), 5011–5022. doi:10.1007/s12652-020-01905-3

  117. [136]

    Institutional members of the T EX Users Group

    TUG 2017. Institutional members of the T EX Users Group . Retrieved May 27, 2017 from http://wwtug.org/instmem.html

  118. [137]

    Tzamaloukas and J

    A. Tzamaloukas and J. J. Garcia-Luna-Aceves. 2000. Channel-Hopping Multiple Access. Technical Report I-CA2301. Department of Computer Science, University of California, Berkeley, CA

  119. [138]

    Jeya Maria Jose Valanarasu, Poojan Oza, Ilker Hacihaliloglu, and Vishal M Patel. 2021. Medical transformer: Gated axial-attention for medical image segmentation. In International Conference on Medical Image Computing and Computer-Assisted Intervention (MICCAI). Springer, 36–46

  120. [139]

    Rejin Varghese and Sambath M. 2024. YOLOv8: A Novel Object Detection Algorithm with Enhanced Performance and Robustness. In 2024 International Conference on Advances in Data Engineering and Intelligent Computing Systems (ADICS). 1–6. doi:10.1109/ADICS58448.2024.10533619

  121. [140]

    Boris Veytsman. 2017. acmart—Class for typesetting publications of ACM . Re- trieved May 27, 2017 from http://www.ctan.org/pkg/acmart

  122. [141]

    Zuluaga, Rosalind Pratt, Premal A

    Guotai Wang, Wenqi Li, Maria A. Zuluaga, Rosalind Pratt, Premal A. Patel, Michael Aertsen, Tom Doel, Anna L. David, Jan Deprest, Sébastien Ourselin, and Tom Vercauteren. 2018. Interactive Medical Image Segmentation Using Deep Learning With Image-Specific Fine Tuning. IEEE TMI ...

  123. [142]

    Elizabeth M. Wenzel. 1992. Three-dimensional virtual acoustic displays. In Multimedia interface design (incoll) . ACM, New York, NY, USA, 257–288. doi:10. 1145/146022.146089

  124. [144]

    Renato Werneck, João Setubal, and Arlindo da Conceicão. 2000. (old) Finding minimum congestion spanning trees. J. Exp. Algorithmics 5 (2000), 11. doi:10. 1145/351827.384253

  125. [145]

    Renkai Wu, Yinghao Liu, Pengchen Liang, and Qing Chang. 2025. H-vmunet: High-order Vision Mamba UNet for medical image segmentation. Neurocom- puting 624 (2025), 129447. doi:10.1016/j.neucom.2025.129447

  126. [146]

    Likun Xia, Hao Zhang, Yufei Wu, Ran Song, Yuhui Ma, Lei Mou, Jiang Liu, Yixuan Xie, Ming Ma, and Yitian Zhao. 2022. 3D vessel-like structure segmentation in medical images by an edge-reinforced network. MedIA 82 (2022), 102581

  127. [147]

    Enze Xie, Peize Sun, Xiaoge Song, Wenhai Wang, Xuebo Liu, Ding Liang, Chun- hua Shen, and Ping Luo. 2020. PolarMask: Single Shot Instance Segmentation With Polar Representation. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). doi:10.1109/cvpr42600.2020.01221

  128. [148]

    Chenchu Xu, Yifei Wang, Dong Zhang, Longfei Han, Yanping Zhang, Jie Chen, and Shuo Li. 2022. BMAnet: Boundary mining with adversarial learning for semi-supervised 2D myocardial infarction segmentation. IEEE JBHI 27, 1 (2022), 87–96

  129. [149]

    Wenqiang Xu, Haiyang Wang, Fubo Qi, and Cewu Lu. 2019. Explicit Shape Encoding for Real-Time Instance Segmentation. In IEEE/CVF International Con- ference on Computer Vision (ICCV)

  130. [150]

    Zheyuan Xu, Yingfu Wang, Jiaqin Jiang, Jian Yao, and Liang Li. 2020. Adaptive Feature Selection With Reinforcement Learning for Skeleton-Based Action Recognition. IEEE Access 8 (2020), 213038–213051. doi:10.1109/ACCESS.2020. 3038235

  131. [151]

    Feiyang Yang, Xiongfei Li, Haoran Duan, Feilong Xu, Yawen Huang, Xiaoli Zhang, Yang Long, and Yefeng Zheng. 2024. MRL-Seg: Overcoming Imbalance in Medical Image Segmentation With Multi-Step Reinforcement Learning. IEEE JBHI 28, 2 (2024), 858–869. doi:10.1109/JBHI.2023.3336726 ...

  132. [152]

    Yijun Yang, Zhaohu Xing, and Lei Zhu. 2024. Vivim: a Video Vision Mamba for Medical Video Object Segmentation. arXiv (2024). arXiv:2401.14168

  133. [153]

    Xinlei Yu, Ahmed Elazab, Ruiquan Ge, Jichao Zhu, Lingyan Zhang, Gangyong Jia, Qing Wu, Xiang Wan, Lihua Li, and Changmiao Wang. 2025. ICH-PRNet: a cross-modal intracerebral haemorrhage prognostic prediction method using joint-attention interaction mechanism. Neural Networks 18...

  134. [154]

    Xinlei Yu, Changmiao Wang, Hui Jin, Ahmed Elazab, Gangyong Jia, Xiang Wan, Changqing Zou, and Ruiquan Ge. 2025. CRISP-SAM2: SAM2 with Cross-Modal Interaction and Semantic Prompting for Multi-Organ Segmentation. arXiv preprint arXiv:2506.23121 (2025)

  135. [155]

    Mingya Zhang, Yue Yu, Sun Jin, Limei Gu, Tingsheng Ling, and Xianping Tao. 2024. VM-UNET-V2: Rethinking Vision Mamba UNet for Medical Im- age Segmentation. In Bioinformatics Research and Applications: 20th Interna- tional Symposium, ISBRA 2024, Kunming, China, July 19–21, 2024...

  136. [156]

    Ruicheng Zhang, Haowei Guo, Zeyu Zhang, Puxin Yan, and Shen Zhao. 2025. GAMED-Snake: Gradient-aware Adaptive Momentum Evolution Deep Snake Model for Multi-organ Segmentation. arXiv (2025). arXiv:2501.12844

  137. [157]

    Shen Zhao, Jinhong Wang, Xinxin Wang, Yikang Wang, Hanying Zheng, Bin Chen, An Zeng, Fuxin Wei, Sadeer Al-Kindi, and Shuo Li. 2023. Attractive deep morphology-aware active contour network for vertebral body contour extraction with extensions to heterogeneous and semi-supervise...

  138. [158]

    G. Zhou, J. Lu, C.-Y. Wan, M. D. Yarvis, and J. A. Stankovic. 2008.Body Sensor Networks. MIT Press, Cambridge, MA

  139. [159]

    Stankovic, and Tarek F

    Gang Zhou, Yafeng Wu, Ting Yan, Tian He, Chengdu Huang, John A. Stankovic, and Tarek F. Abdelzaher. 2010. A multifrequency MAC specially designed for wireless sensor network applications. ACM Trans. Embed. Comput. Syst. 9, 4, Article 39 (April 2010), 41 pages. doi:10.1145/1721...

  140. [160]

    Lianghui Zhu, Bencheng Liao, Qian Zhang, Xinlong Wang, Wenyu Liu, and Xinggang Wang. 2024. Vision mamba: efficient visual representation learning with bidirectional state space model. In International Conference on Machine Learning (ICML) (Vienna, Austria) (ICML’24). JMLR.org,...

  141. [2022]

    IEEE TMI 41, 8 (2022), 1975–1989

    Dual encoder-based dynamic-channel graph convolutional network with edge enhancement for retinal vessel segmentation. IEEE TMI 41, 8 (2022), 1975–1989

  142. [2826]

    doi:10.1109/CVPR.2016.308

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.