Abstract

AbstractThe paper illustrates a dynamic programming-based search algorithm known as the Pruned Exact Linear Time (PELT) algorithm to produce a solution for an optimization problem to identify change-points within the measurement series to delineate a pavement stretch into homogeneous sections. The data used in this paper was measured using a Falling Weight Deflectometer (FWD) in the runway stretch of an international airport with a length of 3220 m. This paper also comprehensively demonstrates two other existing methods, namely Cumulative Difference Approach (CDA) and Bayesian Segmentation Method, for delineating the same pavement stretch into homogeneous sections. Some of the shortcomings of both the methods have been discussed and the algorithms have been modified to overcome few of the drawbacks. This paper also formulated a comparative study between the three methods in terms of their sensitivity toward type of data, profound mathematical definition of homogeneity, computational complexity and ability for post-segmentation analysis for identification of homogeneous sections.KeywordsPruned exact linear time (PELT)Cumulative difference approach (CDA)Homogeneous sections

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.