IDEAS home Printed from https://ideas.repec.org/a/hin/complx/3511375.html
   My bibliography  Save this article

Computer Vision-Based Patched and Unpatched Pothole Classification Using Machine Learning Approach Optimized by Forensic-Based Investigation Metaheuristic

Author

Listed:
  • Nhat-Duc Hoang
  • Thanh-Canh Huynh
  • Van-Duc Tran
  • Gonzalo Farias

Abstract

During the phase of periodic asphalt pavement survey, patched and unpatched potholes need to be accurately detected. This study proposes and verifies a computer vision-based approach for automatically distinguishing patched and unpatched potholes. Using two-dimensional images, patched and unpatched potholes may have similar shapes. Therefore, this study relies on image texture descriptors to delineate these two objects of interest. The texture descriptors of statistical measurement of color channels, the gray-level cooccurrence matrix, and the local ternary pattern are used to extract texture information from image samples of asphalt pavement roads. To construct a classification model based on the extracted texture-based dataset, this study proposes and validates an integration of the Support Vector Machine Classification (SVC) and the Forensic-Based Investigation (FBI) metaheuristic. The SVC is used to generalize a classification boundary that separates the input data into two class labels of patched and unpatched potholes. To optimize the SVC performance, the FBI algorithm is utilized to fine-tune the SVC hyperparameters. To establish the hybrid FBI-SVC framework, an image dataset consisting of 600 samples has been collected. The experiment supported by the Wilcoxon signed-rank test demonstrates that the proposed computer vision is highly suitable for the task of interest with a classification accuracy rate = 94.833%.

Suggested Citation

  • Nhat-Duc Hoang & Thanh-Canh Huynh & Van-Duc Tran & Gonzalo Farias, 2021. "Computer Vision-Based Patched and Unpatched Pothole Classification Using Machine Learning Approach Optimized by Forensic-Based Investigation Metaheuristic," Complexity, Hindawi, vol. 2021, pages 1-17, September.
  • Handle: RePEc:hin:complx:3511375
    DOI: 10.1155/2021/3511375
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/3511375.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/3511375.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/3511375?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:3511375. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.