Search

We applied the bag of visual words model for visual texture to a dataset of realistic powder micrograph images drawn from eight closely related particle size distributions. We found that image texture based powder classification performance saturates at 89 ± 3 % with 640 training images (80 images per class). This classification accuracy is comparable to classification using conventional segmentation-based particle size analysis. Furthermore, we found that particle size distributions obtained via watershed segmentation are generally not statistically equivalent to the ground truth particle size distributions, as quantified by the two-sample Kolmogorov-Smirnov test for distribution equivalence. We expect image texture classification methods to outperform particle size analysis for more challenging real-world powder classification tasks by capturing additional information about particle morphology and surface textures, which add complexity to the image segmentation task inherent in particle size distribution estimation. [ABSTRACT FROM AUTHOR]

Motivated by researching new image texture modeling that improves state-of-the-art LBP variants and non-LBP descriptors, this paper proposes a novel approach for constructing local image descriptors, which are suitable for histogram based image representation. Instead of heuristic code constructions, the proposed approach is based on local concave-and-convex characteristics, which have high ability to extract discriminative and stable texture representation. Different from the majority of descriptors that only encode relationships between the pixels in doublets around central pixel (within 3  ×  3 neighborhood), the proposed approach encodes relationships between the pixels in triplets by including the central pixel in the modeling. We build two distinct descriptors by dividing local features into two distinct groups, i.e., local concave and convex microstructure patterns (LCvMSP and LCxMSP), according to relationships between the pixels inside the triplets, formed along closed path around the central pixel of a 3 × 3-grayscale image patch. To make the descriptors more insensitive to noise and invariant to monotonic gray scale transformation, two supplementary triplets are added in the modeling. These triplets are formed using the central pixel and four virtual pixels set to the median of the grey-scale values of the 3 × 3 neighbourhood and the whole image and the average local and global gray levels respectively. The histograms obtained from the single scale descriptors LCvMSP and LCxMSP are concatenated together to build multi-scale histogram feature vector referred to as local concave-and-convex micro-structure pattern (LCCMSP), that is expected to better represent salient local texture structure. We evaluated the effectiveness of the proposed methods on thirteen challenging representative widely-used texture datasets, and found that the proposed LCvMSP, LCxMSP and LCCMSP operators achieve performances that are competitive or better than a large number of recent most promising state-of- the-art LBP variants and non-LBP descriptors. Statistical comparison based on Wilcoxon signed rank test demonstrated that the proposed methods are the top three over all the tested datasets. [ABSTRACT FROM AUTHOR]

Abstract: Recent approaches to crater detection have been inspired by face detection’s use of gray-scale texture features. Using gray-scale texture features for supervised machine learning crater detection algorithms provides better classification of craters in planetary images than previous methods. When using Haar features it is typical to generate thousands of numerical values from each candidate crater image. This magnitude of image features to extract and consider can spell disaster when the application is an entire planetary surface. One solution is to reduce the number of features extracted and considered in order to increase accuracy as well as speed. Feature subset selection provides the operational classifiers with a concise and denoised set of features by reducing irrelevant and redundant features. Feature subset selection is known to be NP-hard. To provide an efficient suboptimal solution, four genetic algorithms are proposed to use greedy selection, weighted random selection, and simulated annealing to distinguish discriminate features from indiscriminate features. Inspired by analysis regarding the relationship between subset size and accuracy, a squeezing algorithm is presented to shrink the genetic algorithm’s chromosome cardinality during the genetic iterations. A significant increase in the classification performance of a Bayesian classifier in crater detection using image texture features is observed. [Copyright &y& Elsevier]

• An automated, machine-learning based, material-testing fracture characterization process is elaborated. • Image-based, highly-significant texture features are identified and classified. • Neural network, high accuracy material-testing fracture classifiers are trained. • The applicability of the methodology in different ductile fracture experiments is illustrated. Correctly determining the onset of fracture is crucial when performing mechanical experiments. Commonly carried out by visual inspection, here an image-based machine learning approach is proposed to classify cracked and un-cracked specimens. It yields the potential to objectify and automate crack detection, thereby removing sources of uncertainty and error from the post-processing of experiments. More than 30'000 speckle-pattern images obtained from 77 experiments on three specimen geometries are evaluated. They comprise uniaxial tension, notched tension as well as axisymmetric V-bending experiments. Statistical texture features are extracted from all images. They include both first-order (variance, skewness, kurtosis) and higher-order statistical texture features, i.e. Haralick features. The discriminatory power of the texture information is evaluated based on the Fisher's Discriminant Ratio and feature correlations are identified and quantified. Image texture feature subsets of high discriminatory power are used to parse neural network architectures of different complexities from simple perceptron to feed-forward and cascade neural networks. It is found that a small subset of the investigated texture features is highly significant for all experiments. Using this feature subset in conjunction with multi-layer, non-linear and low complexity feed-forward network architectures classification accuracies in the order of 99% are obtained. At the same time, it is shown that linear classifiers are not sufficient to robustly distinguish the state of the specimens, even when high discriminatory power features are used. Graphical Abstract: [Display omitted] [ABSTRACT FROM AUTHOR]