2022
DOI: 10.1016/j.conbuildmat.2022.128450
|View full text |Cite
|
Sign up to set email alerts
|

A two-dimensional entropy-based method for detecting the degree of segregation in asphalt mixture

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 33 publications
0
4
0
Order By: Relevance
“…Due to the different mean values of the particle mass ratio being measured, using the standard deviation of the deviation degree for further comparison is not very accurate. [25] Therefore, the coefficient of variation was introduced to characterize the degree of variation of the particle distribution. The coefficient of variation for large particles C x can be expressed as the ratio of the unbiased standard deviation of the deviation degree 𝜀 xi and the mean value εx : By following the above steps, the coefficient of variation for the middle particle and small particle C y and C z can be obtained.…”
Section: Determination Of Coefficient Of Variation Of Particle Deviationmentioning
confidence: 99%
See 2 more Smart Citations
“…Due to the different mean values of the particle mass ratio being measured, using the standard deviation of the deviation degree for further comparison is not very accurate. [25] Therefore, the coefficient of variation was introduced to characterize the degree of variation of the particle distribution. The coefficient of variation for large particles C x can be expressed as the ratio of the unbiased standard deviation of the deviation degree 𝜀 xi and the mean value εx : By following the above steps, the coefficient of variation for the middle particle and small particle C y and C z can be obtained.…”
Section: Determination Of Coefficient Of Variation Of Particle Deviationmentioning
confidence: 99%
“…g j (X) = y j (X) − U j for y j > U j g j (X) = 0 for L j ≤ y j ≤ U j g j (X) = L j − y j (X) for y j < L j (24) where X represents design variables in optimization space; g j is the constraint function of the j-th iteration; y j is the optimal response of the j-th iteration; and U j and L j are reactions constrained by upper and lower limits, respectively. This forms a constraint system, which can be solved as an unconstrained problem by the penalty function method, as shown in Equation (25). The goal of the penalty function is to provide a mountain to climb when the optimization starts at an undesired position.…”
Section: Optimization Based On Hc Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…Zhang Z, et al [13] and Hu T, et al [14] use the support of the Canny edge detection method to solve image processing problems such as the detection of asphalt pavement thickness [14] and also the detection of quality of crosssectional fiber image [13].…”
Section: Introductionmentioning
confidence: 99%