Scalable Whole Slide Image Representation Using K-Means Clustering and Fisher Vector Aggregation

Whole slide images (WSIs) are high-resolution, gigapixel-sized images that pose significant computational challenges for traditional machine learning models due to their size and heterogeneity. In this paper, we present a scalable and efficient methodology for WSI classification by leveraging patch-based feature extraction, clustering, and Fisher vector encoding. Initially, WSIs are divided into fixed-size patches, and deep feature embeddings are extracted from each patch using a pre-trained convolutional neural network (CNN). These patch-level embeddings are subsequently clustered using K-means clustering, where each cluster aggregates semantically similar regions of the WSI. To effectively summarize each cluster, Fisher vector representations are computed by modeling the distribution of patch embeddings in each cluster as a parametric Gaussian mixture model (GMM). The Fisher vectors from each cluster are concatenated into a high-dimensional feature vector, creating a compact and informative representation of the entire WSI. This feature vector is then used by a classifier to predict the WSI's diagnostic label. Our method captures local and global tissue structures and yields robust performance for large-scale WSI classification, demonstrating superior accuracy and scalability compared to other approaches.

Authors

Institutions

Publication Details

Published
2025-04-14
DOI
https://doi.org/10.1109/isbi60581.2025.10981271
Primary Topic
Image Retrieval and Classification Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scalable Whole Slide Image Representation Using K-Means Clustering and Fisher Vector Aggregation

Ardhendu Sekhar, Shounak Das, Amit Sethi, Ravi Kant Gupta
Image Retrieval and Classification Techniques
article

Scalable Whole Slide Image Representation Using K-Means Clustering and Fisher Vector Aggregation

Ardhendu Sekhar, Shounak Das, Amit Sethi, Ravi Kant Gupta
article en

Abstract

Whole slide images (WSIs) are high-resolution, gigapixel-sized images that pose significant computational challenges for traditional machine learning models due to their size and heterogeneity. In this paper, we present a scalable and efficient methodology for WSI classification by leveraging patch-based feature extraction, clustering, and Fisher vector encoding. Initially, WSIs are divided into fixed-size patches, and deep feature embeddings are extracted from each patch using a pre-trained convolutional neural network (CNN). These patch-level embeddings are subsequently clustered using K-means clustering, where each cluster aggregates semantically similar regions of the WSI. To effectively summarize each cluster, Fisher vector representations are computed by modeling the distribution of patch embeddings in each cluster as a parametric Gaussian mixture model (GMM). The Fisher vectors from each cluster are concatenated into a high-dimensional feature vector, creating a compact and informative representation of the entire WSI. This feature vector is then used by a classifier to predict the WSI's diagnostic label. Our method captures local and global tissue structures and yields robust performance for large-scale WSI classification, demonstrating superior accuracy and scalability compared to other approaches.

Indian Institute of Technology Bombay (IN)
Openalex Percentile: Top 92%
Image Retrieval and Classification Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.