Issue 42

A. De Santis et alii, Frattura ed Integrità Strutturale, 42 (2017) 231-238; DOI: 10.3221/IGF-ESIS.42.25 233 It is worth noting that, starting from the classification with respect to the shape (the Type), all the characterizations (distribution, size, nodularity, nodule count) could be further particularized with respect to the other properties, suggesting a sequential procedure for the classification. Therefore, first it will be determined the type-class to which the specimen belongs and then the other characterizations will be established. (a) (b) (c) Figure 1 : Examples graphite morphologies: a) Type I; b) Type VI; c) Type VII; [7]. An efficient procedure to classify the specimens with respect to the type is to use binary classifiers in a sequential way: Step 1: with a binary classifier C1 first establish if a specimen could be assigned to Type I class or not - If it belongs to Type I class one can refine the classification with respect to the other characteristics. - If the specimen does not belong to Type I one proceeds to Step 2; Step 2: with a binary classifier C2 establish if the specimen (that is not of TypeI) may be classified of Type II or of Type III-IV-V-VI-VII. If it belongs to Type II, then again one refines the classification with respect to the other characteristics, otherwise one goes to step 3 using another binary classifier C3 and so on. As it can be noted the core of the global procedure is the binary classification step. From now on we will refer to the first step in which one wants to classify a specimen as belonging to the Class 1 (Type I specimen) or the Class 2 (Type II-III-IV-V-VI-VII specimens), thus determining the classifier C1. Therefore it will be possible to distinguish the specimens with normal and well-formed nodules with respect to all the other situations. In Fig. 2 a scheme of the overall classification procedure, simplified when considering only three types, is presented. The classifiers distinguishes the specimens on the basis of suitable features that are evaluated from a simplified representation of the image obtained by using a segmentation procedure; then the features are efficiently modified by the principal components analysis that provides the most efficient data representation. Finally a classifier is obtained by using the support vector machine. The block diagram of the binary classification step is outlined in Fig.3. It consists of two steps; a first one is off-line, aiming at determining the classifier after a proper data processing (image segmentation, features computation and extraction) and training. The second step is on-line, and represents the application of the classifier over images of specimens not used for training.