arXiv subjects

Zhanping Song

Publications and source records attributed to Zhanping Song.

3 recordsLinked to original sources

arXiv2026

Rapid-Deployment Crack Measurement Based on SAM3 Semantic-Edge Response Decoding

Reliable crack measurement is essential for infrastructure condition assessment, yet existing image-based approaches typically depend on pixel-wise annotations, task-specific segmentation training, and mask-based geometric measurement, making cross-scene deployment costly and sensitive to segmentation errors. We identify an output-interface mismatch in SAM3: its prompt-conditioned semantic response preserves crack evidence that is often suppressed or spatially distorted in the final candidate masks. Across six public crack datasets, the internal response achieves 82.66% average crack-pixel recall, compared with 74.66% for the retained SAM3 proposals, with an average mismatch ratio of 8.73%. Based on this observation, we propose Semantic-Edge Response Decoding (SERD) to calibrate the semantic response using a fixed Sobel structural field, and further develop SERD-DQ, a training-free framework that directly estimates crack centerline and transverse geometry from the continuous decoded response without generating an intermediate predicted mask. Experiments verify both segmentation fidelity and direct geometric measurement against manually established pixel-level references. Compared with native SAM3 mask-based quantification, SERD-DQ reduces width MAE from 6.072 to 5.547 pixels, length relative error from 22.245% to 17.355%, and area relative error from 33.921% to 26.228%, while achieving a latent geometry recovery rate of 0.394. The results indicate that continuous semantic-edge responses provide a more reliable interface for training-free crack quantification than conventional mask-mediated measurement.

cs.CV↗

arXiv2026

Training-Free Tunnel Defect Inspection and Engineering Interpretation via Visual Recalibration and Entity Reconstruction

Tunnel inspection requires outputs that can support defect localization, measurement, severity grading, and engineering documentation. Existing training-free foundation-model pipelines usually stop at coarse open-vocabulary proposals, which are difficult to use directly in interference-heavy tunnel scenes. We propose a training-free framework TunnelMIND. Specifically, language-guided defect proposals are not treated as final outputs; instead, their spatial support is recalibrated at inference time through dense visual consistency, so that coarse semantic anchors can be transformed into more reliable prompts under tunnel-specific hard negatives. The resulting masks are further reconstructed into structured defect entities with category, location, geometry, severity, and context attributes, which are then mapped to retrieval-grounded explanation and engineering-readable report generation under expert knowledge constraints. On visible, GPR, and road defect tasks, TunnelMIND achieves F1 scores of 0.68, 0.78, and 0.72, respectively. Overall, TunnelMIND shows that training-free tunnel inspection can move beyond coarse localization toward structured defect evidence for engineering assessment.

cs.CV↗

arXiv2024

Contrastive Learning for Image Complexity Representation

Quantifying and evaluating image complexity can be instrumental in enhancing the performance of various computer vision tasks. Supervised learning can effectively learn image complexity features from well-annotated datasets. However, creating such datasets requires expensive manual annotation costs. The models may learn human subjective biases from it. In this work, we introduce the MoCo v2 framework. We utilize contrastive learning to represent image complexity, named CLIC (Contrastive Learning for Image Complexity). We find that there are complexity differences between different local regions of an image, and propose Random Crop and Mix (RCM), which can produce positive samples consisting of multi-scale local crops. RCM can also expand the train set and increase data diversity without introducing additional data. We conduct extensive experiments with CLIC, comparing it with both unsupervised and supervised methods. The results demonstrate that the performance of CLIC is comparable to that of state-of-the-art supervised methods. In addition, we establish the pipelines that can apply CLIC to computer vision tasks to effectively improve their performance.

cs.CV↗