SearcharxivSearch

arXiv · 2605.08265

CrackMorph-XAI-Net: A Topology-Preserving and Explainable Framework for Automated Crack Morphology

Abstract

Automated crack inspection is increasingly recognized as a critical component of infrastructure monitoring; however, cracks continue to be reported primarily as binary segmentation masks by many current vision-based systems. While localization is facilitated by such masks, limited structural information is provided for robust engineering interpretation. For practical crack assessment, measurable morphological features -- including centerline geometry, branching behavior, junction locations, topology, and severity-related indicators -- are required. In this work, \textit{CrackMorph-XAI-Net}, an explainable morphology-aware framework for image-based crack analysis, is presented. Crack image and region-mask data are converted into a sequence of interpretable structural outputs through four distinct stages: topology-preserving skeleton extraction, junction detection via Gaussian heatmap regression, morphology descriptor computation, and severity-oriented screening. To support rigorous stage-wise evaluation, the standard \textit{CRACK500} benchmark is extended with aligned skeleton maps, junction heatmaps, and topology labels. Experimental validation demonstrates that a mean Dice coefficient of 0.991 is achieved by the learned skeleton extraction stage, with topology preserved in 98.5\% of test images. Furthermore, a recall of 0.964 and an F1-score of 0.887 are obtained in the junction detection stage, highlighting the efficacy of heatmap regression for sparse structural targets. Strong agreement between predicted and reference morphology values is revealed by descriptor-level evaluation, with correlations exceeding 0.95 for length, width, orientation, junction count, and tortuosity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sri Surya Pravallika Ajjarapu, S. M. Mallikarjunaiah. 2026-05-08. CrackMorph-XAI-Net: A Topology-Preserving and Explainable Framework for Automated Crack Morphology. https://arxiv.org/abs/2605.08265

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

KEEP EXPLORING

Related papers

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM