TrueDeep: A systematic approach of crack detection with less data

Ram Krishna Pandey, Akshit Achara
5/30/2023
cs.CV

No confident code implementation found for this paper.

Abstract

Supervised and semi-supervised semantic segmentation algorithms require significant amount of annotated data to achieve a good performance. In many situations, the data is either not available or the annotation is expensive. The objective of this work is to show that by incorporating domain knowledge along with deep learning architectures, we can achieve similar performance with less data. We have used publicly available crack segmentation datasets and shown that selecting the input images using knowledge can significantly boost the performance of deep-learning based architectures. Our proposed approaches have many fold advantages such as low annotation and training cost, and less energy consumption. We have measured the performance of our algorithm quantitatively in terms of mean intersection over union (mIoU) and F score. Our algorithms, developed with 23% of the overall data; have a similar performance on the test data and significantly better performance on multiple blind datasets.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{pandey2023truedeep,
  title  = {TrueDeep: A systematic approach of crack detection with less data},
  author = {Ram Krishna Pandey and Akshit Achara},
  year   = {2023},
  eprint = {2305.19088},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.19088v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.19088.svg)](https://codeofpaper.com/paper/2305.19088)

Discussion