Abstract

This paper presents the image-processing algorithm customized for high-speed, real-time inspection of pavement cracking. In the algorithm, a pavement image is divided into grid cells of 8x8 pixels and each cell is classified as a non-crack or crack cell using the grayscale information of the border pixels. Whether a crack cell can be regarded as a basic element (or seed) depends on its contrast to the neighboring cells. A number of crack seeds can be called a crack cluster if they fall on a linear string. A crack cluster corresponds to a dark strip in the original image that may or may not be a section of a real crack. Additional conditions to verify a crack cluster include the requirements in the contrast, width and length of the strip. If verified crack clusters are oriented in similar directions, they will be joined to become one crack. Because many operations are performed on crack seeds rather than on the original image, crack detection can be executed simultaneously when the frame grabber is forming a new image, permitting real-time, online pavement survey. The trial test results show a good repeatability and accuracy when multiple surveys were conducted at different driving conditions.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.