G-LoG Bi-filtration for Medical Image Classification

• URL: http://arxiv.org/abs/2602.18329v1
• Date: Fri, 20 Feb 2026 16:35:24 GMT
• Title: G-LoG Bi-filtration for Medical Image Classification
• Authors: Qingsong Wang, Jiaxing He, Bingzhe Hou, Tieru Wu, Yang Cao, Cailing Yao,
• Abstract summary: We use the Laplacian of Gaussian operator to enhance the boundaries of medical images.<n>By modeling volumetric images as bounded functions, we prove the interleaving distance on the persistence modules is stable.<n>We conduct experiments on the MedMNIST dataset.
• Score: 16.162636980856423
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Building practical filtrations on objects to detect topological and geometric features is an important task in the field of Topological Data Analysis (TDA). In this paper, leveraging the ability of the Laplacian of Gaussian operator to enhance the boundaries of medical images, we define the G-LoG (Gaussian-Laplacian of Gaussian) bi-filtration to generate the features more suitable for multi-parameter persistence module. By modeling volumetric images as bounded functions, then we prove the interleaving distance on the persistence modules obtained from our bi-filtrations on the bounded functions is stable with respect to the maximum norm of the bounded functions. Finally, we conduct experiments on the MedMNIST dataset, comparing our bi-filtration against single-parameter filtration and the established deep learning baselines, including Google AutoML Vision, ResNet, AutoKeras and auto-sklearn. Experiments results demonstrate that our bi-filtration significantly outperforms single-parameter filtration. Notably, a simple Multi-Layer Perceptron (MLP) trained on the topological features generated by our bi-filtration achieves performance comparable to complex deep learning models trained on the original dataset.

Related papers

• Frequent subgraph-based persistent homology for graph classification [7.282967595233251]
  We propose a novel graph filtration called Frequent Subgraph filtration (FSF)<n>FSF is derived from frequent subgraphs and produces stable and information-rich frequency-based persistent homology (FPH) features.<n>We introduce two approaches for graph classification: an FPH-based machine learning model (FPH-ML) and a hybrid framework that integrates FPH with graph neural networks (FPH-GNNs)
  arXiv  Detail & Related papers  (2025-12-31T15:21:15Z)
• MCbiF: Measuring Topological Autocorrelation in Multiscale Clusterings via 2-Parameter Persistent Homology [1.5813217907813781]
  We define the Multiscale Clustering Bifiltration (MCbiF) as a filtration of abstract simplicial complexes that encodes cluster intersection patterns across scales.<n>We show that the persistent homology (MPH) of the MCbiF yields a finitely presented and block decomposable module.<n>We demonstrate through experiments the use of MCbiF Hilbert functions as topological feature maps for downstream machine learning tasks.
  arXiv  Detail & Related papers  (2025-10-16T14:11:12Z)
• The Quest for Universal Master Key Filters in DS-CNNs [52.091987605762135]
  We find 8 universal filters that depthwise separable convolutional networks inherently converge to.<n>Our analysis reveals these filters are predominantly linear shifts (ax+b) of our discovered universal set.<n>Remarkably, networks with these 8 unique frozen filters achieve over 80% ImageNet accuracy.
  arXiv  Detail & Related papers  (2025-09-15T09:10:13Z)
• Enhancing Spectral Graph Neural Networks with LLM-Predicted Homophily [48.135717446964385]
  Spectral Graph Neural Networks (SGNNs) have achieved remarkable performance in tasks such as node classification.<n>We propose a novel framework that leverages Large Language Models (LLMs) to estimate the homophily level of a graph.<n>Our framework consistently improves performance over strong SGNN baselines.
  arXiv  Detail & Related papers  (2025-06-17T06:17:19Z)
• Filtration learning in exact multi-parameter persistent homology and classification of time-series data [3.193388094899312]
  We propose a framework for filtration learning of EMPH. We derive the exact formula of the gradient of the loss function with respect to the filtration parameters.
  arXiv  Detail & Related papers  (2024-06-28T00:25:43Z)
• Closed-form Filtering for Non-linear Systems [83.91296397912218]
  We propose a new class of filters based on Gaussian PSD Models, which offer several advantages in terms of density approximation and computational efficiency. We show that filtering can be efficiently performed in closed form when transitions and observations are Gaussian PSD Models. Our proposed estimator enjoys strong theoretical guarantees, with estimation error that depends on the quality of the approximation and is adaptive to the regularity of the transition probabilities.
  arXiv  Detail & Related papers  (2024-02-15T08:51:49Z)
• Mix-GENEO: A Flexible Filtration for Multiparameter Persistent Homology Detects Digital Images [0.8437187555622164]
  Two important tasks in the field of Topological Data Analysis are building practical multifiltrations on objects and using TDA to detect the geometry.<n>Motivated by the tasks, we build multiparameter filtrations by operators on images named multi-GENEO, multi-DGENEO and mix-GENEO.<n>In practical applications, we regard image as a discrete function space, and then we build multifiltrations on the discrete function space.
  arXiv  Detail & Related papers  (2024-01-09T03:05:53Z)
• Decomposed Guided Dynamic Filters for Efficient RGB-Guided Depth Completion [46.04264366475848]
  RGB-guided depth completion aims at predicting dense depth maps from sparse depth measurements and corresponding RGB images. Guided dynamic filters generate spatially-variant depth-wise separable convolutional filters from RGB features to guide depth features. We propose to decompose the guided dynamic filters into a spatially-shared component multiplied by content-adaptive adaptors at each spatial location.
  arXiv  Detail & Related papers  (2023-09-05T08:37:58Z)
• Filter Pruning for Efficient CNNs via Knowledge-driven Differential Filter Sampler [103.97487121678276]
  Filter pruning simultaneously accelerates the computation and reduces the memory overhead of CNNs. We propose a novel Knowledge-driven Differential Filter Sampler(KDFS) with Masked Filter Modeling(MFM) framework for filter pruning.
  arXiv  Detail & Related papers  (2023-07-01T02:28:41Z)
• Learning Versatile Convolution Filters for Efficient Visual Recognition [125.34595948003745]
  This paper introduces versatile filters to construct efficient convolutional neural networks. We conduct theoretical analysis on network complexity and an efficient convolution scheme is introduced. Experimental results on benchmark datasets and neural networks demonstrate that our versatile filters are able to achieve comparable accuracy as that of original filters.
  arXiv  Detail & Related papers  (2021-09-20T06:07:14Z)
• Online Multi-Object Tracking and Segmentation with GMPHD Filter and Mask-based Affinity Fusion [79.87371506464454]
  We propose a fully online multi-object tracking and segmentation (MOTS) method that uses instance segmentation results as an input. The proposed method is based on the Gaussian mixture probability hypothesis density (GMPHD) filter, a hierarchical data association (HDA), and a mask-based affinity fusion (MAF) model. In the experiments on the two popular MOTS datasets, the key modules show some improvements.
  arXiv  Detail & Related papers  (2020-08-31T21:06:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.