Search arXivSearch

arXiv · 2609.00704

FTU-Seek: Foundation Model-Guided Hard-Negative Learning for Sparse Functional Tissue Unit Segmentation

Abstract

Functional tissue units (FTUs), including tertiary lymphoid structures (TLSs), blood vessels, and glands, encode localized immune, vascular, and epithelial organization in histopathology. Accurate quantification of these structures is important for studying tissue architecture and disease-associated tissue organization. However, FTUs are frequently sparse, heterogeneous, and surrounded by large amounts of morphologically similar background tissue, making automated segmentation in whole-slide images (WSIs) challenging. We therefore developed FTU-Seek, a pathology foundation model-guided framework that treats morphology-aware negative-patch selection as a key component of sparse FTU segmentation. FTU-Seek uses frozen multi-depth features from the UNI pathology foundation model to train a patch-level classifier that distinguishes FTU-containing from FTU-absent tissue. Target-absent patches are subsequently ranked according to their predicted target-containing probabilities, and the highest-scoring hard negatives are selected through a static Top$K$ strategy to construct compact segmentation training sets. The framework was evaluated using five-fold cross-validation and internal test cohorts across TLS, blood-vessel, and gland segmentation tasks, with an additional independent 30-WSI held-out cohort for TLS. Positive-only, all-tissue, random-negative, and matched random Top$K$ sampling strategies served as comparators. Segmentation-derived phenotypes were further explored in external TCGA cohorts.

Explore related subjects

Keep this discovery

BibTeXRIS

Zonghao Liu, Lei Su, Jiguang Yu, Xuqing Geng, Louis Shuo Wang, Jianmin Wang, Jingfeng Liu. 2026-09-01. FTU-Seek: Foundation Model-Guided Hard-Negative Learning for Sparse Functional Tissue Unit Segmentation. https://arxiv.org/abs/2609.00704

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Greedy Thiele continued-fraction approximation on continuum domains in the complex plane

We describe an adaptive greedy algorithm for Thiele continued-fraction (TCF) approximation of a function defined on a continuum domain in the complex plane. The algorithm iteratively selects interpolation nodes from an adaptively refined set of sample points on the domain boundary. We also present new algorithms for evaluating Thiele continued fractions and their accessory weights using only a single floating-point division. Numerical experiments comparing the greedy TCF method with the AAA algorithm on several challenging functions defined on the interval $[-1,1]$ and on the unit circle show that continuum TCF is consistently faster than AAA, by factors ranging from 8 to 40.

math.NA

Poisson Image Denoising Using Minimax Concave and Reweighted $\ell_1$ Penalties: Nonblind and Blind Approaches

Images are important tools in various sciences. Despite the development of photo-taking tools, creating clear and image without noise remains challenging in practice. In particular, Poisson noise has an effect on medical and astronomical images, and reduces their quality. Additionally, blur is another factor that has an effect on image quality. The problem of image restoration becomes very complicated when we have no information about the Point Spread Function (PSF). These types of problems are known as blind case. However, in some images, such as some astronomical images, the type of PSF can be specified, and these types of problems are known as nonblind problems. Total Variation (TV) is a widely used method for solving such inverse problems, where the selection of the penalty function is the most critical factor that affects the method's performance. In this paper, to improve edge preservation, we employ a reweighted $\ell_1$-regularization of the fractional order derivative. Furthermore, we propose a nonblind and blind image deblurring approach under Poisson noise using the Minimax Concave Penalty (MCP), which is a continuous, sparsity promoting, and nearly unbiased regularizer. This formulation leads to a nonconvex optimization model. To solve the proposed model, we introduce an efficient numerical algorithm based on the Alternating Direction Method of Multipliers (ADMM) and provide an analysis of its convergence. Finally, the effectiveness of the proposed algorithm are demonstrated through extensive experiments on various images.

cs.CV