Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2602.22974

An automatic counting algorithm for the quantification and uncertainty analysis of the number of microglial cells trainable in small and heterogeneous datasets

L. Martino·M. M. Garcia·P. S. Paradas·E. Curbelo
View original source ↗Read source document ↗Export metadata ↓

Abstract

Counting immunopositive cells on biological tissues generally requires either manual annotation or (when available) automatic rough systems, for scanning signal surface and intensity in whole slide imaging. In this work, we tackle the problem of counting microglial cells in lumbar spinal cord cross-sections of rats by omitting cell detection and focusing only on the counting task. Manual cell counting is, however, a time-consuming task and additionally entails extensive personnel training. The classic automatic color-based methods roughly inform about the total labeled area and intensity (protein quantification) but do not specifically provide information on cell number. Since the images to be analyzed have a high resolution but a huge amount of pixels contain just noise or artifacts, we first perform a pre-processing generating several filtered images {(providing a tailored, efficient feature extraction)}. Then, we design an automatic kernel counter that is a non-parametric and non-linear method. The proposed scheme can be easily trained in small datasets since, in its basic version, it relies only on one hyper-parameter. However, being non-parametric and non-linear, the proposed algorithm is flexible enough to express all the information contained in rich and heterogeneous datasets as well (providing the maximum overfit if required). Furthermore, the proposed kernel counter also provides uncertainty estimation of the given prediction, and can directly tackle the case of receiving several expert opinions over the same image. Different numerical experiments with artificial and real datasets show very promising results. Related Matlab code is also provided.

Explore related subjects

cs.CEcs.CVeess.IVeess.SPstat.ML

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

L. Martino, M. M. Garcia, P. S. Paradas, E. Curbelo. 2026-02-26. An automatic counting algorithm for the quantification and uncertainty analysis of the number of microglial cells trainable in small and heterogeneous datasets. https://doi.org/10.1016/j.eswa.2025.129208

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

KEEP EXPLORING

Related papers

arXiv2026

KATOsuper: Surrogate-accelerated neural topology optimization with sensitivity-consistent Fourier neural operators

Topology optimization (TO) remains computationally intensive due to repeated finite element analysis (FEA) evaluations required at each iteration. While neural network-based surrogates offer potential acceleration, existing approaches often suffer from gradient inconsistency between predicted objectives and sensitivities, leading to optimization instability. This work presents KATOsuper, an objective-agnostic framework that couples neural-reparameterized topology optimization with a Sensitivity-Consistent Fourier Neural Operator (SC-FNO). The framework employs the forward_split architecture, which derives deployed sensitivities via automatic differentiation through the predicted objective field and thereby preserves consistency between the predicted objective and the gradient used for optimization. The case studies include three 2D benchmark problems and three 3D structures considering compliance or stress minimization. A physics-informed multi-channel input encoding with Fourier position embedding enables resolution-invariant learning, supporting zero-shot extrapolation beyond the training resolution, with useful performance at moderate scaling factors and topology-preserving exploration at up to 64x without retraining. The framework extends to 3D through KATO3D, featuring novel KANConv3D blocks with learnable B-spline activations. KATOsuper demonstrates 15--110x deployment-time speedup over MATLAB baselines while maintaining competitive optimality, with the clearest gains observed in complex 3D and stress-optimization cases. The insight that sensitivity direction matters more than magnitude enables robust optimization even with approximate physics evaluation, extensible to other differentiable physics-driven design objectives.

cs.CE↗
arXiv2026

Geometry-Based Metrics for Early-Stage Hull-Form Producibility Screening

This paper presents a representation-aware framework for geometry-based screening of hull-form producibility at early design stages. The proposed signature combines dimensionless total and signed developability deviation with curvature-class area fractions, distributed fields, metric-specific validity, and representation provenance. These descriptors characterize surface features relevant to plate forming and developability, but are not calibrated predictors of fabrication cost, forming effort, or process feasibility. Native IGES/STEP boundary representations (BReps) are evaluated through direct differential geometry and trimmed-domain quadrature, whereas triangulated surfaces use discrete curvature recovery and area-weighted aggregation. Analytical and semi-analytical controls verify the formulation, while matched-face BRep-to-mesh tests assess discrete curvature recovery. Application to DTMB 5415, KCS, JBC, and KVLCC2M shows that curvature intensity and areal extent provide complementary information and that derivative-based outcomes can be representation sensitive. KCS, for example, exhibits approximately 24% greater developability deviation than DTMB 5415, while double-curved regions occupy 72.9% of its valid surface versus nearly the entire DTMB valid surface. The resulting quantities provide an early geometric screening layer for subsequent use as objectives, constraints, surrogate responses, or design-space features. HullProd, the companion open-source software, implements the signature, distributed fields, validity, and provenance.

cs.CE↗
arXiv2026

Topology optimization of multimaterial aircraft pylons using generalized shape function approach

As the primary structural component connecting the engine to the wing or fuselage, an aircraft pylon requires optimized structural efficiency; this paper provides topology optimization of multimaterial pylons using the generalized shape function (gSF) approach. The gSF method uses $n$ natural-coordinate design variables per element to provide optimized designs up to $2^n$ distinct material phases while promoting close to discrete material layouts in conjunction with the density and formulated Heaviside projection filters. Pylon structural compliance is minimized subject to volume constraints. Exploiting the geometric features of a typical pylon structure, multimaterial evolution is performed on a corresponding 2D design domain representing the midplane, with up to 14 candidate materials. The optimized two-dimensional layout is then extruded to achieve the corresponding three-dimensional optimized pylon structure. The Method of Moving Asymptotes is employed to achieve the final design variables. The resulting convergence histories exhibit smooth and stable objective minimization. The results highlight the capability of the multimaterial topology optimization framework to effectively optimized aircraft pylons with multiple candidate materials, without requiring a considerable expansion of the design variable set.

cs.CE↗