VISCOM: A robust video summarization approach using color co-occurrence matrices

Multimedia Tools and Applications - Video summarization techniques have allowed the content analysis of large volumes of digital video sequences of different categories, such as movies,...     

Fuzzy chromatic co-occurrence matrices for tracking objects

Pattern Analysis and Applications - Tracking objects is an important field for many applications like driving assistance and video surveillance. Every tracking system should be able to track...     

A new feature extraction approach based on one dimensional gray level co-occurrence matrices for bearing fault classification

ABSTRACT

Recently, precise and deterministic feature extraction is one of the current research topics for bearing fault diagnosis. For this aim, an experimental bearing test setup was created in this study. In this setup, vibration signals were obtained from the bearings on which artificial faults were generated in specific sizes. A new feature extraction method based on co-occurrence matrices for bearing vibration signals was proposed instead of the conventional feature extraction methods, as in the literature. The One (1) Dimensional–Local Binary Patterns (1D-LBP) method was first applied to bearing vibration signals, and a new signal whose values ranged between 0–255 was obtained. Then, co-occurrence matrices were obtained from these signals. The correlation, energy, homogeneity, and contrast features were extracted from these matrices. Different machine learning methods were employed with these features to carry out the classification process. Three different data sets were used to test the proposed approach. As a result of analysing the signals with the proposed model, the success rate is 87.50% for dataset1 (different speed), 96.5% for dataset2 (fault size (mm)) and 99.30% for dataset3 (fault type – inner ring, outer ring, ball) was found, respectively.     

Discriminative feature co-occurrence selection for object detection

This paper describes an object detection framework that learns the discriminative co-occurrence of multiple features. Feature co-occurrences are automatically found by Sequential Forward Selection at each stage of the boosting process. The selected feature co-occurrences are capable of extracting structural similarities of target objects leading to better performance. The proposed method is a generalization of the framework proposed by Viola and Jones, where each weak classifier depends only on a single feature. Experimental results obtained using four object detectors, for finding faces and three different hand gestures, respectively, show that detectors trained with the proposed algorithm yield consistently higher detection rates than those based on their framework while using the same number of features.     

A novel automatic retinal vessel extraction using maximum entropy based EM algorithm

Multimedia Tools and Applications - The extraction of blood vessels helps in the diagnosis of diseases and to develop advances of medicine. Retinal blood vessel extraction plays a crucial role in...     

A new approach for physical human activity recognition based on co-occurrence matrices

The Journal of Supercomputing - In recent years, it has been observed that many researchers have been working on different areas of detection, recognition and monitoring of human activities. The...     

Human facial expression recognition using curvelet feature extraction and normalized mutual information feature selection

To recognize expressions accurately, facial expression systems require robust feature extraction and feature selection methods. In this paper, a normalized mutual information based feature selection technique is proposed for FER systems. The technique is derived from an existing method, that is, the max-relevance and min-redundancy (mRMR) method. We, however, propose to normalize the mutual information used in this method so that the domination of the relevance or of the redundancy can be eliminated. For feature extraction, curvelet transform is used. After the feature extraction and selection the feature space is reduced by employing linear discriminant analysis (LDA). Finally, hidden Markov model (HMM) is used to recognize the expressions. The proposed FER system (CNF-FER) is validated using four publicly available standard datasets. For each dataset, 10-fold cross validation scheme is utilized. CNF-FER outperformed the existing well-known statistical and state-of-the-art methods by achieving a weighted average recognition rate of 99 % across all the datasets.     

Transformation-invariant clustering using the EM algorithm

Clustering is a simple, effective way to derive useful representations of data, such as images and videos. Clustering explains the input as one of several prototypes, plus noise. In situations where each input has been randomly transformed (e.g., by translation, rotation, and shearing in images and videos), clustering techniques tend to extract cluster centers that account for variations in the input due to transformations, instead of more interesting and potentially useful structure. For example, if images from a video sequence of a person walking across a cluttered background are clustered, it would be more useful for the different clusters to represent different poses and expressions, instead of different positions of the person and different configurations of the background clutter. We describe a way to add transformation invariance to mixture models, by approximating the nonlinear transformation manifold by a discrete set of points. We show how the expectation maximization algorithm can be used to jointly learn clusters, while at the same time inferring the transformation associated with each input. We compare this technique with other methods for filtering noisy images obtained from a scanning electron microscope, clustering images from videos of faces into different categories of identification and pose and removing foreground obstructions from video. We also demonstrate that the new technique is quite insensitive to initial conditions and works better than standard techniques, even when the standard techniques are provided with extra data.     

An optimized skin texture model using gray-level co-occurrence matrix

Neural Computing and Applications - Texture analysis is devised to address the weakness of color-based image segmentation models by considering the statistical and spatial relations among the group...     

Multiresolution feature extraction and selection for texturesegmentation

An approach is described for unsupervised segmentation of textured images. Local texture properties are extracted using local linear transforms that have been optimized for maximal texture discrimination. Local statistics (texture energy measures) are estimated at the output of an equivalent filter bank by means of a nonlinear transformation (absolute value) followed by an iterative Gaussian smoothing algorithm. This procedure generates a multiresolution sequence of feature planes with a half-octave scale progression. A feature reduction technique is then applied to the data and is determined by simultaneously diagonalizing scatter matrices evaluated at two different spatial resolutions. This approach provides a good approximation of R.A. Fisher's (1950) multiple linear discriminants and has the advantage of requiring no a priori knowledge. This feature reduction methods appears to be an improvement on the commonly used Karhunen-Loeve transform and allows efficient texture segmentation based on simple thresholding     

Generalized selection of complementary matrices in the inclusionprinciple

This paper presents a strategy for choosing complementary matrices in the framework of the inclusion principle with state LQ optimal control of LTI systems, it is based on translating the basic restrictions given by the inclusion principle into explicit block structures for these matrices, the degree of freedom given by these structures is illustrated by means of an example of overlapping decentralized control design     

一种基于决策矩阵的属性约简及规则提取算法

研究了Rough集理论中属性约简和值约简问题,扩展了决策矩阵的定义,提出了一种基于决策矩阵的完备属性约简算法,该算法利用决策属性把论域划分成多个等价类,然后利用每个等价类对应的决策矩阵计算属性约简。与区分矩阵相比,采用决策矩阵可以有效地减少存储空间,提高约简算法效率。同时,借助决策矩阵进行值约简,提出了一种新的规则提取算法,使最终得到的决策规则更加简洁。实验结果表明,本文提出的属性约简和值约简算法是正确、有效、可行的。     

Image analysis techniques and gray-level co-occurrence matrices (GLCM) for calculating bioturbation indices and characterizing biogenic sedimentary structures

Aspects of texture and structure in a bed resulting from bioturbation can provide valuable information about the ecology and environment at the time of deposition. However, not only the degree of bioturbation, but the structure of the burrows is important for interpreting biogenic fabrics. Here, image analysis is applied to real and artificial images of biogenic sedimentary structures. Image segmentation was applied to images of Middle Ordovician biogenic sedimentary structures from Dixon, Illinois (Pecatonica Formation), isolating the biogenic sedimentary structures. A gray-level co-occurrence matrix (GLCM) is calculated from the segmented image and eight artificial images representing different levels of image noise. Texture measures were calculated from the GLCMs and compared with identify scale and directional structural differences between the images. Principal component analysis was used to statistically group the images. Artificial images were found to be distinguishable from the real images by GLCM texture measures, and the real images differed most significantly at the largest scales.     

Clustering based band selection for endmember extraction using simplex growing algorithm in hyperspectral images

Multimedia Tools and Applications - With the advancement in technology, hyperspectral images have potential applications in the field of remote sensing due to their high spectral resolution....     

Text Classification from Labeled and Unlabeled Documents using EM

This paper shows that the accuracy of learned text classifiers can be improved by augmenting a small number of labeled training documents with a large pool of unlabeled documents. This is important because in many text classification problems obtaining training labels is expensive, while large quantities of unlabeled documents are readily available.We introduce an algorithm for learning from labeled and unlabeled documents based on the combination of Expectation-Maximization (EM) and a naive Bayes classifier. The algorithm first trains a classifier using the available labeled documents, and probabilistically labels the unlabeled documents. It then trains a new classifier using the labels for all the documents, and iterates to convergence. This basic EM procedure works well when the data conform to the generative assumptions of the model. However these assumptions are often violated in practice, and poor performance can result. We present two extensions to the algorithm that improve classification accuracy under these conditions: (1) a weighting factor to modulate the contribution of the unlabeled data, and (2) the use of multiple mixture components per class. Experimental results, obtained using text from three different real-world tasks, show that the use of unlabeled data reduces classification error by up to 30%.     

An extended EM algorithm for joint feature extraction and classification in brain-computer interfaces

For many electroencephalogram (EEG)-based brain-computer interfaces (BCIs), a tedious and time-consuming training process is needed to set parameters. In BCI Competition 2005, reducing the training process was explicitly proposed as a task. Furthermore, an effective BCI system needs to be adaptive to dynamic variations of brain signals; that is, its parameters need to be adjusted online. In this article, we introduce an extended expectation maximization (EM) algorithm, where the extraction and classification of common spatial pattern (CSP) features are performed jointly and iteratively. In each iteration, the training data set is updated using all or part of the test data and the labels predicted in the previous iteration. Based on the updated training data set, the CSP features are reextracted and classified using a standard EM algorithm. Since the training data set is updated frequently, the initial training data set can be small (semi-supervised case) or null (unsupervised case). During the above iterations, the parameters of the Bayes classifier and the CSP transformation matrix are also updated concurrently. In online situations, we can still run the training process to adjust the system parameters using unlabeled data while a subject is using the BCI system. The effectiveness of the algorithm depends on the robustness of CSP feature to noise and iteration convergence, which are discussed in this article. Our proposed approach has been applied to data set IVa of BCI Competition 2005. The data analysis results show that we can obtain satisfying prediction accuracy using our algorithm in the semisupervised and unsupervised cases. The convergence of the algorithm and robustness of CSP feature are also demonstrated in our data analysis.     

Loop transformation using nonunimodular matrices

Linear transformations are widely used to vectorize and parallelize loops. A subset of these transformations are unimodular transformations. When a unimodular transformation is used, the exact bounds of the transformed loop nest are easily computed and the steps of the loops are equal to 1. Unimodular loop transformations have been widely used since they permit the implementation of many useful loop transformations. Recently, nonunimodular transformations have been proposed to reduce communication requirements or to use the memory hierarchy efficiently. The methods used for unimodular transformations do not work in the case of nonunimodular transformations, since they do not produce the exact bounds of the transformed loop nest. In this paper, we present a method for nested loop transformation which gives the exact bounds for both unimodular and nonunimodular transformations. The basic idea is to use the Hermite Normal Form (HNF) of the transformation matrix