The detection of cracking on the road surface is an important issue in many countries to insure the maintenance and the monitoring of the roadways. This paper proposes a method which adapts the single pair shortest path A* algorithm to the detection of cracks within pavement images. The proposed A* algorithm computes the crack skeleton by calculating the minimal path between a pair of pixels which belong to the crack structure. Compared with the widespread and ubiquitous Dijkstra’s algorithm and to its bidirectional version, the proposed A* reduces the amount of the visited pixels; it is thus about 4 times faster than Dijkstra while keeping a large similarity coefficient with the ground truth.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.