30 August 2013 Selection of optimal texture algorithms for evaluating degradation of carpets through experimental design
Sergio A. Orjuela, Benhur Ortiz-Jaramillo, Ewout Vansteenkiste, Lieva Van Langenhove, Robain De Keyser, Wilfried Philips
Author Affiliations +
Abstract
Optimal texture analysis algorithms for describing degradation of carpets are identified. Experimental design is applied to select from a set of texture analysis algorithms those optimal for identifying texture changes due to degradation of carpets. The degree of wear of a degraded carpet is quantified by comparing its texture to the original texture. The set of texture algorithms is applied on intensity images obtained from the American and the European standards. The performance of the texture algorithms is evaluated using measures that quantify characteristics in the relationship between the metrics and the changes in texture. The statistical analysis of the experimental results shows that the local binary patterns algorithm is optimal in <50% of the cases, for describing degradation of the carpets. Other texture algorithms that optimally characterize the degradation of carpets include the use of the power spectrum, Wigner distribution, and average co-occurrence matrix algorithms.
© 2013 SPIE and IS&T 0091-3286/2013/$25.00 © 2013 SPIE and IS&T
Sergio A. Orjuela, Benhur Ortiz-Jaramillo, Ewout Vansteenkiste, Lieva Van Langenhove, Robain De Keyser, and Wilfried Philips "Selection of optimal texture algorithms for evaluating degradation of carpets through experimental design," Journal of Electronic Imaging 22(3), 033020 (30 August 2013). https://doi.org/10.1117/1.JEI.22.3.033020
Published: 30 August 2013
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Autoregressive models

Image analysis

Statistical analysis

Picosecond phenomena

Image processing

Image quality

Image enhancement

RELATED CONTENT


Back to Top