A Pre-processing framework for spectral classification of hyperspectral images

Multimedia Tools and Applications - Classification of Hyperspectral images is mostly based on the spectral-spatial features in existing classification techniques. The captured Hyperspectral images...     

A modular framework for the automatic classification of chromosomes in Q-band images

The manual analysis of the karyogram is a complex and time-consuming operation, as it requires meticulous attention to details and well-trained personnel. Routine Q-band laboratory images show chromosomes that are randomly rotated, blurred or corrupted by overlapping and dye stains. We address here the problem of robust automatic classification, which is still an open issue. The proposed method starts with an improved estimation of the chromosome medial axis, along which an established set of features is then extracted. The following novel polarization stage estimates the chromosome orientation and makes this feature set independent on the reading direction along the axis. Feature rescaling and normalizing techniques take full advantage of the results of the polarization step, reducing the intra-class and increasing the inter-class variances. After a standard neural network based classification, a novel class reassignment algorithm is employed to maximize the probability of correct classification, by exploiting the constrained composition of the human karyotype. An average 94% of correct classification was achieved by the proposed method on 5474 chromosomes, whose images were acquired during laboratory routine and comprise karyotypes belonging to slightly different prometaphase stages. In order to provide the scientific community with a public dataset, all the data we used are publicly available for download.     

An end-user-oriented framework for the classification of multitemporal SAR images

In this article, we present an end-user-oriented framework for multitemporal synthetic aperture radar (SAR) data classification. It accepts as input the recently introduced Level-1α products, whose peculiarities are a high degree of interpretability and increased class separability with respect to single greyscale images. These properties make the Level-1α products very attractive in the application of simple supervised classification algorithms. Specifically, (1) the high degree of interpretability of the maps makes the training phase extremely simple; and (2) the good separation between classes gives excellent results using simple discrimination rules. The end product is a simple, fast, accurate, and repeatable framework.     

Multi-class support vector machine for classification of the ultrasonic images of supraspinatus

This article proposes an effort to apply the multi-class support vector machine classifiers to classify the supraspinatus image into different disease groups that are normal, tendon inflammation, calcific tendonitis and supraspinatus tear. The supraspinatus tendon is often involved in the above-mentioned disease groups. Four different texture analysis methods – texture feature coding method, gray-level co-occurrence matrix, fractal dimension evaluation and texture spectrum – are used to extract features of tissue characteristic in the ultrasonic supraspinatus images. The mutual information criterion is adopted to select the powerful features from ones generated from the above-mentioned four texture analysis methods in the training stage, meanwhile, the five implementations of multi-class support vector machine classifiers are also designed to discriminate each image into one of the four disease groups in the classification stage. In experiments, the most commonly used performance measures including sensitivity, specificity, classification accuracy and false-negative rate are applied to evaluate the classification of the five implantations of multi-class support vector machines. In addition, the receiver operating characteristics analysis is also used to analyze the classification capability. The present results demonstrate that the implementation of multi-class fuzzy support vector machine can achieve 90% classification accuracy, and performance measures of this implementation are significantly superior to the others.     

A statistical model for contours in images

In this paper, we describe a statistical model for the gradient vector field of the gray level in images validated by different experiments. Moreover, we present a global constrained Markov model for contours in images that uses this statistical model for the likelihood. Our model is amenable to an iterative conditional estimation (ICE) procedure for the estimation of the parameters; our model also allows segmentation by means of the simulated annealing (SA) algorithm, the iterated conditional modes (ICM) algorithm, or the modes of posterior marginals (MPM) Monte Carlo (MC) algorithm. This yields an original unsupervised statistical method for edge-detection, with three variants. The estimation and the segmentation procedures have been tested on a total of 160 images. Those tests indicate that the model and its estimation are valid for applications that require an energy term based on the log-likelihood ratio. Besides edge-detection, our model can be used for semiautomatic extraction of contours, localization of shapes, non-photo-realistic rendering; more generally, it might be useful in various problems that require a statistical likelihood for contours.     

A statistical framework for mining substitution rules

In this paper, a new mining capability, called mining of substitution rules, is explored. A substitution refers to the choice made by a customer to replace the purchase of some items with that of others. The mining of substitution rules in a transaction database, the same as that of association rules, will lead to very valuable knowledge in various aspects, including market prediction, user behaviour analysis and decision support. The process of mining substitution rules can be decomposed into two procedures. The first procedure is to identify concrete itemsets among a large number of frequent itemsets, where a concrete itemset is a frequent itemset whose items are statistically dependent. The second procedure is then on the substitution rule generation. In this paper, we first derive theoretical properties for the model of substitution rule mining and devise a technique on the induction of positive itemset supports to improve the efficiency of support counting for negative itemsets. Then, in light of these properties, the SRM (substitution rule mining) algorithm is designed and implemented to discover the substitution rules efficiently while attaining good statistical significance. Empirical studies are performed to evaluate the performance of the SRM algorithm proposed. It is shown that the SRM algorithm not only has very good execution efficiency but also produces substitution rules of very high quality.     

A statistical framework for few-shot action recognition

Along with the exponential growth of online video creation platforms such as Tik Tok and Instagram, state of the art research involving quick and effective action/gesture recognition remains crucial. This work addresses the challenge of classifying short video clips, using a domain-specific feature design approach, capable of performing significantly well using as little as one training example per action. The method is based on Gunner Farneback’s dense optical flow (GF-OF) estimation strategy, Gaussian mixture models, and information divergence. We first aim to obtain accurate representations of the human movements/actions by clustering the results given by GF-OF using K-means method of vector quantization. We then proceed by representing the result of one instance of each action by a Gaussian mixture model. Furthermore, using Kullback-Leibler divergence (KL-divergence), we attempt to find similarities between the trained actions and the ones in the test videos. Classification is done by matching each test video to the trained action with the highest similarity (a.k.a lowest KL-divergence). We have performed experiments on the KTH and Weizmann Human Action datasets using One-Shot and K-Shot learning approaches, and the results reveal the discriminative nature of our proposed methodology in comparison with state-of-the-art techniques.

     

A residual network-based framework for COVID-19 detection from CXR images

Neural Computing and Applications - In late 2019, a new Coronavirus disease (COVID-19) appeared in Wuhan, Hubei Province, China. The virus began to spread throughout many countries, affecting a...     

A hybrid hierarchical framework for classification of breast density using digitized film screen mammograms

Multimedia Tools and Applications - In the present work, a hybrid hierarchical framework for classification of breast density using digitized film screen mammograms has been proposed. For designing...     

Spatial neighborhood intensity constraint (SNIC) and knowledge-based clustering framework for tumor region segmentation in breast histopathology images

Multimedia Tools and Applications - Based on the Nottingham Histological Grading (NHG) system, precise and accurate segmentation of breast tumor regions is crucial, typically in the scoring...     

A two-stage framework for cross-domain sentiment classification

Supervised sentiment classification systems are typically domain-specific, and the performance decreases sharply when transferred from one domain to another domain. Building these systems involves annotating a large amount of data for every domain, which needs much human labor. So, a reasonable way is to utilize labeled data in one existed (or called source) domain for sentiment classification in target domain. To address this problem, we propose a two-stage framework for cross-domain sentiment classification. At the “building a bridge” stage, we build a bridge between the source domain and the target domain to get some most confidently labeled documents in the target domain; at the “following the structure” stage, we exploit the intrinsic structure, revealed by these most confidently labeled documents, to label the target-domain data. The experimental results indicate that the proposed approach could improve the performance of cross-domain sentiment classification dramatically.     

Automated breast cancer detection and classification using ultrasound images: A survey

Breast cancer is the second leading cause of death for women all over the world. Since the cause of the disease remains unknown, early detection and diagnosis is the key for breast cancer control, and it can increase the success of treatment, save lives and reduce cost. Ultrasound imaging is one of the most frequently used diagnosis tools to detect and classify abnormalities of the breast. In order to eliminate the operator dependency and improve the diagnostic accuracy, computer-aided diagnosis (CAD) system is a valuable and beneficial means for breast cancer detection and classification. Generally, a CAD system consists of four stages: preprocessing, segmentation, feature extraction and selection, and classification. In this paper, the approaches used in these stages are summarized and their advantages and disadvantages are discussed. The performance evaluation of CAD system is investigated as well.     

Deep feature extraction and classification of breast ultrasound images

Controlled despeckling (structure/edges/feature preservation with smoothing the homogeneous areas) is a desired pre-processing step for the design of computer-aided diagnostic (CAD) systems using ultrasound images as the presence of speckle noise masks diagnostically important information making interpretation difficult even for experienced radiologist. For efficiently classifying the breast tumors, the conventional CAD system designs use hand-crafted features. However, these features are not robust to the variations in size, shape and orientation of the tumors resulting in lower sensitivity. Thus deep feature extraction and classification of breast ultrasound images have recently gained attention from research community. The deep networks come with an advantage of directly learning the representative features from the images. However, these networks are difficult to train from scratch if the representative training data is small in size. Therefore transfer learning approach for deep feature extraction and classification of medical images has been widely used. In the present work the performance of four pre-trained convolutional neural networks VGG-19, SqueezeNet, ResNet-18 and GoogLeNet has been evaluated for differentiating between benign and malignant tumor types. From the results of the experiments, it is noted that CAD system design using GoogLeNet architecture for deep feature extraction followed by correlation based feature selection and fuzzy feature selection using ANFC-LH yields highest accuracy of 98.0% with individual class accuracy value of 100% and 96% for benign and malignant classes respectively. For differentiating between the breast tumors, the proposed CAD system design can be utilized in routine clinical environment.

     

A statistical tool based binarization method for document images

Multimedia Tools and Applications - Binarization of document images has great importance in several applications like historical document restoration, Optical Character Recognition (OCR). It is a...     

A global energy optimization framework for 2.1D sketch extraction from monocular images

The 2.1D sketch is a layered image representation, which assigns a partial depth ordering of over-segmented regions in a monocular image. This paper presents a global optimization framework for inferring the 2.1D sketch from a monocular image. Our method only uses over-segmented image regions (i.e., superpixels) as input, without any information of objects in the image, since (1) segmenting objects in images is a difficult problem on its own and (2) the objective of our proposed method is to be generic as an initial module useful for downstream high-level vision tasks. This paper formulates the inference of the 2.1D sketch using a global energy optimization framework. The proposed energy function consists of two components: (1) one is defined based on the local partial ordering relations (i.e., figure-ground) between two adjacent over-segmented regions, which captures the marginal information of the global partial depth ordering and (2) the other is defined based on the same depth layer relations among all the over-segmented regions, which groups regions of the same object to account for the over-segmentation issues. A hybrid evolution algorithm is utilized to minimize the global energy function efficiently. In experiments, we evaluated our method on a test data set containing 100 diverse real images from Berkeley segmentation data set (BSDS500) with the annotated ground truth. Experimental results show that our method can infer the 2.1D sketch with high accuracy.     

超声乳腺肿瘤图像的自动分割

为解决传统Snake模型对初始轮廓敏感和凹陷边界提取困难的问题,分别提出了双阈值分割算法和Snake模型的改进方案.通过双阈值分割算法与形态学运算、滤波技术的综合应用,获得靠近边缘的初始轮廓.采用改进的Snake模型使初始轮廓跟踪到实际边界.由于对模型的能量定义做了调整,凹陷边界也可被准确跟踪.通过临床采集的20例乳腺图像肿瘤边缘的提取和分析,结果表明,该方法能有效提取出肿瘤边缘,实现超声肿瘤的自动分割.