A Computational Approach to Edge Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Design and Use of Steerable Filters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Machine Vision and Applications
An Active Testing Model for Tracking Roads in Satellite Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
New Prospects in Line Detection by Dynamic Programming
IEEE Transactions on Pattern Analysis and Machine Intelligence
Novel Approach to Pavement Image Segmentation Based on Neighboring Difference Histogram Method
CISP '08 Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02
Automatic Recognition of Pavement Surface Crack Based on BP Neural Network
ICCEE '08 Proceedings of the 2008 International Conference on Computer and Electrical Engineering
Novel Approach to Pavement Cracking Automatic Detection Based on Segment Extending
KAM '08 Proceedings of the 2008 International Symposium on Knowledge Acquisition and Modeling
A family of quadratic snakes for road extraction
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part I
Enhancement of Low-Contrast Curvilinear Features in Imagery
IEEE Transactions on Image Processing
Detecting Wide Lines Using Isotropic Nonlinear Filtering
IEEE Transactions on Image Processing
Fuzzy graph modeling for text segmentation from land map images
Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing
Hi-index | 0.00 |
Most existing approaches for pavement crack line detection implicitly assume that pavement cracks in images are with high contrast and good continuity. This assumption does not hold in pavement distress detection practice, where pavement cracks are often blurry and discontinuous due to particle materials of road surface, crack degradation, and unreliable crack shadows. To this end, we propose in this paper FoSA - F* Seed-growing Approach for automatic crack-line detection, which extends the F* algorithm in two aspects. It exploits a seed-growing strategy to remove the requirement that the start and end points should be set in advance. Moreover, it narrows the global searching space to the interested local space to improve its efficiency. Empirical study demonstrates the correctness, completeness and efficiency of FoSA.