Geometrical characterization of textures consisting of two or three discrete colorings

Geometrical characterization for discretized contrast textures is realized by computing the Gaussian and mean curvatures relative to the central pixel of a clique and four neighboring pixels, these four neighbors either being first or second order neighbors. Practical formulae for computing these curvatures are presented. Curvatures based on the central pixel depend upon the brightness configuration of the clique pixels. Therefore the cliques are classified into classes by configuration of pixel contrast or coloring. To look at the textures formed by geometrically classified cliques, we create several textures using overlapping tiling of cliques belonging to a single curvature class. Several examples of hyperbolic textures, consisting of repeated hyperbolic cliques surrounded by non-hyperbolic cliques, are presented with the nonhyperbolic textures. We also introduce a system of 81 rotationally and brightness shift invariant geo-cliques that have shared curvatures and show that histograms of these 81 geo-cliques seem to be able to distinguish isotrigon textures

Classification of interstitial lung disease patterns with topological texture features

Topological texture features were compared in their ability to classify morphological patterns known as 'honeycombing' that are considered indicative for the presence of fibrotic interstitial lung diseases in high-resolution computed tomography (HRCT) images. For 14 patients with known occurrence of honey-combing, a stack of 70 axial, lung kernel reconstructed images were acquired from HRCT chest exams. A set of 241 regions of interest of both healthy and pathological (89) lung tissue were identified by an experienced radiologist. Texture features were extracted using six properties calculated from gray-level co-occurrence matrices (GLCM), Minkowski Dimensions (MDs), and three Minkowski Functionals (MFs, e.g. MF.euler). A k-nearest-neighbor (k-NN) classifier and a Multilayer Radial Basis Functions Network (RBFN) were optimized in a 10-fold cross-validation for each texture vector, and the classification accuracy was calculated on independent test sets as a quantitative measure of automated tissue characterization. A Wilcoxon signed-rank test was used to compare two accuracy distributions and the significance thresholds were adjusted for multiple comparisons by the Bonferroni correction. The best classification results were obtained by the MF features, which performed significantly better than all the standard GLCM and MD features (p < 0.005) for both classifiers. The highest accuracy was found for MF.euler (97.5%, 96.6%; for the k-NN and RBFN classifier, respectively). The best standard texture features were the GLCM features 'homogeneity' (91.8%, 87.2%) and 'absolute value' (90.2%, 88.5%). The results indicate that advanced topological texture features can provide superior classification performance in computer-assisted diagnosis of interstitial lung diseases when compared to standard texture analysis methods.Comment: 8 pages, 5 figures, Proceedings SPIE Medical Imaging 201

A new approach for improving coronary plaque component analysis based on intravascular ultrasound images

Virtual histology intravascular ultrasound (VH-IVUS) is a clinically available technique for atherosclerosis plaque characterization. It, however, suffers from a poor longitudinal resolution due to electrocardiogram (ECG)-gated acquisition. This article presents an effective algorithm for IVUS image-based histology to overcome this limitation. After plaque area extraction within an input IVUS image, a textural analysis procedure consisting of feature extraction and classification steps is proposed. The pixels of the extracted plaque area excluding the shadow region were classified into one of the three plaque components of fibro-fatty (FF), calcification (CA) or necrotic core (NC) tissues. The average classification accuracy for pixel and region based validations is 75% and 87% respectively. Sensitivities (specificities) were 79% (85%) for CA, 81% (90%) for FF and 52% (82%) for NC. The kappa (kappa) = 0.61 and p value = 0.02 indicate good agreement of the proposed method with VH images. Finally, the enhancement in the longitudinal resolution was evaluated by reconstructing the IVUS images between the two sequential IVUS-VH images

Exemplar Based Deep Discriminative and Shareable Feature Learning for Scene Image Classification

In order to encode the class correlation and class specific information in image representation, we propose a new local feature learning approach named Deep Discriminative and Shareable Feature Learning (DDSFL). DDSFL aims to hierarchically learn feature transformation filter banks to transform raw pixel image patches to features. The learned filter banks are expected to: (1) encode common visual patterns of a flexible number of categories; (2) encode discriminative information; and (3) hierarchically extract patterns at different visual levels. Particularly, in each single layer of DDSFL, shareable filters are jointly learned for classes which share the similar patterns. Discriminative power of the filters is achieved by enforcing the features from the same category to be close, while features from different categories to be far away from each other. Furthermore, we also propose two exemplar selection methods to iteratively select training data for more efficient and effective learning. Based on the experimental results, DDSFL can achieve very promising performance, and it also shows great complementary effect to the state-of-the-art Caffe features.Comment: Pattern Recognition, Elsevier, 201

Clustering and classifying images with local and global variability

A procedure for clustering and classifying images determined by three classification variables is presented. A measure of global variability based on the singular value decomposition of the image matrices, and two average measures of local variability based on spatial correlation and spatial changes. The performance of the procedure is compared using three different databases