SearcharxivSearch

arXiv subjects

Krishnakant Saboo

Publications and source records attributed to Krishnakant Saboo.

2 recordsLinked to original sources

RACR-MIL: Rank-aware contextual reasoning for weakly supervised grading of squamous cell carcinoma using whole slide images

Squamous cell carcinoma (SCC) is one of the most common cancer subtype, with an increasing incidence and a significant impact on cancer-related mortality. SCC grading using whole slide images is inherently challenging due to the lack of a standardized grading protocol and substantial tissue heterogeneity. We propose RACR-MIL, a weakly-supervised SCC grading approach that achieves robust generalization across multiple anatomies (skin, head & neck, lung). RACR-MIL is an attention-based multiple-instance learning framework that introduces two key innovations for learning grade-specific contextual representations: (1) a hybrid WSI graph that captures both local tissue context and non-local phenotypic dependencies between tumor regions, and (2) rank-ordering constraints on the attention mechanism that encourage consistent prioritization of higher-grade tumor regions and improve region-level grade confidence, aligning with pathologist's diagnostic process. Our model achieves state-of-the-art performance across multiple SCC datasets, achieving 3-9% improvements over existing methods and up to 10% improvement in tumor localization. In a pilot study, pathologists reported that RACR-MIL improved grading efficiency in 60% of cases, underscoring its potential as a clinically viable cancer diagnosis and grading assistant.

cs.CV

Parallel and Distributed Approaches for Graph Based Semi-supervised Learning

Two approaches for graph based semi-supervised learning are proposed. The firstapproach is based on iteration of an affine map. A key element of the affine map iteration is sparsematrix-vector multiplication, which has several very efficient parallel implementations. The secondapproach belongs to the class of Markov Chain Monte Carlo (MCMC) algorithms. It is based onsampling of nodes by performing a random walk on the graph. The latter approach is distributedby its nature and can be easily implemented on several processors or over the network. Boththeoretical and practical evaluations are provided. It is found that the nodes are classified intotheir class with very small error. The sampling algorithm's ability to track new incoming nodesand to classify them is also demonstrated.

cs.LG