scholarly journals Assessment of Non-Verbal Communication Online Job Recruitment Using Gray Level Co-Occurrence Matrix and Fuzzy C-Means Algorithm

2021 ◽  
Author(s):  
Anita Sindar Sinaga
2020 ◽  
Vol 35 (5) ◽  
pp. 499-507
Author(s):  
赵战民 ZHAO Zhan-min ◽  
朱占龙 ZHU Zhan-long ◽  
王军芬 WANG Jun-fen

Author(s):  
Jinping Hu ◽  
Qian Cheng ◽  
Zhicheng Wen

Aiming at the low performance of classifying images under the computing model of single node. With GLCM (Gray Level Co-occurrence Matrix) which fuses gray level with texture of image, a parallel fuzzy C-means clustering method based on MapReduce is designed to classify massive images and improve the real-time performance of classification. The experimental results show that the speedup ratio of this method is more than 10% higher than that of the other two methods, moreover, the accuracy of image classification has not decreased. It shows that this method has high real-time processing efficiency in massive images classification.


2014 ◽  
Vol 1030-1032 ◽  
pp. 1846-1850
Author(s):  
Hong Chen

The leather productions are produced rapidly in people’s living, the productions’ quality is required stricter. Leather must be detected include leather plainness; leather surface defects and the density of leather before they are produced to be productions.. The most important aspect is the surface defects; the defects’ location, size and quantity should be confirmed. One of the most important steps of leather defects detection is leather image segmentation so as to extract leather defects. Gray level co-occurrence matrix is used to extract a lot of leather surface texture feature, the method of optimized Fuzzy C-means is used to segment leather image in the article. The optimized Fuzzy C-means add the spatial information; the precision of segmentation is improved. The image needs to be treated use morphological approach after it is segmented. As a result, the defective areas are separated from non-defective areas successfully.


Information ◽  
2020 ◽  
Vol 11 (7) ◽  
pp. 351
Author(s):  
Barbara Cardone ◽  
Ferdinando Di Martino

A novel bit reduced fuzzy clustering method applied to segment high resolution massive images is proposed. The image is decomposed in blocks and compressed by using the fuzzy transform method, then adjoint pixels with same gray level are binned and the fuzzy c-means algorithm is applied on the bins to segment the image. This method has the advantage to be applied to massive images as the compressed image can be stored in memory and the runtime to segment the image are reduced. Comparison tests are performed with respect to the fuzzy c-means algorithm to segment high resolution images; the results shown that for not very high compression the results are comparable with the ones obtained applying to the fuzzy c-means algorithm on the source image and the runtimes are reduced by about an eighth with respect to the runtimes of fuzzy c-means.


2012 ◽  
Vol 31 (6) ◽  
pp. 1628-1630
Author(s):  
Jia-jia OU ◽  
Bi-ye CAI ◽  
Bing XIONG ◽  
Feng LI

2019 ◽  
Vol 13 (2) ◽  
pp. 136-141 ◽  
Author(s):  
Abhisek Sethy ◽  
Prashanta Kumar Patra ◽  
Deepak Ranjan Nayak

Background: In the past decades, handwritten character recognition has received considerable attention from researchers across the globe because of its wide range of applications in daily life. From the literature, it has been observed that there is limited study on various handwritten Indian scripts and Odia is one of them. We revised some of the patents relating to handwritten character recognition. Methods: This paper deals with the development of an automatic recognition system for offline handwritten Odia character recognition. In this case, prior to feature extraction from images, preprocessing has been done on the character images. For feature extraction, first the gray level co-occurrence matrix (GLCM) is computed from all the sub-bands of two-dimensional discrete wavelet transform (2D DWT) and thereafter, feature descriptors such as energy, entropy, correlation, homogeneity, and contrast are calculated from GLCMs which are termed as the primary feature vector. In order to further reduce the feature space and generate more relevant features, principal component analysis (PCA) has been employed. Because of the several salient features of random forest (RF) and K- nearest neighbor (K-NN), they have become a significant choice in pattern classification tasks and therefore, both RF and K-NN are separately applied in this study for segregation of character images. Results: All the experiments were performed on a system having specification as windows 8, 64-bit operating system, and Intel (R) i7 – 4770 CPU @ 3.40 GHz. Simulations were conducted through Matlab2014a on a standard database named as NIT Rourkela Odia Database. Conclusion: The proposed system has been validated on a standard database. The simulation results based on 10-fold cross-validation scenario demonstrate that the proposed system earns better accuracy than the existing methods while requiring least number of features. The recognition rate using RF and K-NN classifier is found to be 94.6% and 96.4% respectively.


Sign in / Sign up

Export Citation Format

Share Document