基于Dirichlet过程的无线视频码率变化识别算法

研究了通过对终端视频帧质量的聚类分析来识别无线视频传输中码率变化的方法,以便为无线视频传输过程中视频码率自适应调整提供参考依据.针对经典模糊C均值(FCM)算法和K均值(K-means)算法需要设定聚类数目的问题,提出一种基于荻利克雷过程(DP)的FCM算法——DP-FCM算法.该算法将Dirichlet过程和FCM算法相结合,由视频帧信息权重峰值信噪比(IWPSNR)值使用DP过程混合模型模拟估计出聚类数目,然后进行FCM模糊聚类,通过设定合理的阈值,合并聚类结果相似项,完成视频帧的聚类,从而实现视频传输码率变化的识别.以LIVE视频库为试验数据源,对该算法进行了性能测试.试验结果表明,DP-FCM算法能够在无需设定聚类数目的前提下实现视频传输码率变化的分类识别.     

一种快速的基于稀疏表示的人脸识别算法

基于稀疏表示的人脸识别算法（SRC）识别率相当高,但是当使用l1范数求最优的稀疏表示时,大大增加了算法的计算复杂度,矩阵随着维度的增加,计算时间呈几何级别上升,该文提出利用拉格朗日算法求解矩阵的逆的推导思路,用一种简化的伪逆求解方法来代替l1范数的计算,可将运算量较高的矩阵求逆运算转变为轻量级向量矩阵运算,基于AR人脸库的实验证明,维度高的时候识别率高达97%,同时,计算复杂度和开销比SRC算法大幅度降低95%。     

Multi-task Joint Sparse Representation Classification Based on Fisher Discrimination Dictionary Learning

Recently, sparse representation classification (SRC) and fisher discrimination dictionary learning (FDDL) methods have emerged as important methods for vehicle classification. In this paper, inspired by recent breakthroughs of discrimination dictionary learning approach and multi-task joint covariate selection, we focus on the problem of vehicle classification in real-world applications by formulating it as a multi-task joint sparse representation model based on fisher discrimination dictionary learning to merge the strength of multiple features among multiple sensors. To improve the classification accuracy in complex scenes, we develop a new method, called multi-task joint sparse representation classification based on fisher discrimination dictionary learning, for vehicle classification. In our proposed method, the acoustic and seismic sensor data sets are captured to measure the same physical event simultaneously by multiple heterogeneous sensors and the multi-dimensional frequency spectrum features of sensors data are extracted using Mel frequency cepstral coefficients (MFCC). Moreover, we extend our model to handle sparse environmental noise. We experimentally demonstrate the benefits of joint information fusion based on fisher discrimination dictionary learning from different sensors in vehicle classification tasks.     

High-resolution multiband polarization epithelial tissue imaging method by sparse representation and fusion

Multiband polarization epithelial tissue imaging is an effective tool to measure tissue's birefringence and structure for quantitative pathology analysis. To discriminate the pathology accurately, high-resolution multiband polarization images are essential. But it is difficult to acquire high-resolution polarization images because of the limitations of imaging systems. The polarization image calculation process can be regarded as image fusion with fixed rules, and multiband polarization images are intrinsically sparse. In this paper, we propose a novel high-resolution multiband polarization image calculation method by utilizing the sparse representation and image fusion method. The multiband images are first represented in the sparse domain and we further introduce total-variation-regularization terms into the sparse representation framework. Then, polarization parameter images are calculated by simultaneous fusion and reconstruction. Higher quality multiband polarization images can be obtained through additional regularization constraint in the fusion process. Extensive experiments validate that the proposed method achieves much better results than many state-of-the-art algorithms in terms of both peak signal-to-noise-ratio and visual perception.     

Integrated use of fuzzy c-means and fuzzy KNN for GT part family and machine cell formation

This paper presents a new approach for GT part family and machine cell formation. It involves the integrated use of two fuzzy clustering algorithms: fuzzy c-means and fuzzy k-nearest neighbours. It is shown that the proposed approach performs better than using fuzzy c-means alone or FACT (Kamal and Burke) in terms of some commonly used measures such as grouping efficacy, grouping index, number of voids, number of exceptional elements, and number of bottleneck machines. The approach is developed a result of our quest for a better clustering algorithm to process non-binary data and to produce a non-binary classification in the domain of GT applications. These features are deemed important to handle imprecise data and to provide a higher degree of flexibility in the operation stage.     

基于核竞争学习算法的图像特征提取

利用核函数学习可有效解决图像特征线性不可分的特性,结合稀疏表示算法的优势,提出了一种新的图像特征提取方法。采用基于竞争学习规则的独立分量分析法对图像进行稀疏表示,该算法可提取数据的高维特征,且不需要优化高阶的非线性函数和进行稀疏密度估计,因而有较快的收敛速度。与仅使用基于竞争学习的独立分量分析法相比,在PolyU数据库上的实验结果表明,采用基于核函数学习和稀疏表示相结合的方法所提取的数据特征有利于提高特征分类精度。     

Improving representation-based classification for robust face recognition

The sparse representation classification (SRC) method proposed by Wright et al. is considered as the breakthrough of face recognition because of its good performance. Nevertheless it still cannot perfectly address the face recognition problem. The main reason for this is that variation of poses, facial expressions, and illuminations of the facial image can be rather severe and the number of available facial images are fewer than the dimensions of the facial image, so a certain linear combination of all the training samples is not able to fully represent the test sample. In this study, we proposed a novel framework to improve the representation-based classification (RBC). The framework first ran the sparse representation algorithm and determined the unavoidable deviation between the test sample and optimal linear combination of all the training samples in order to represent it. It then exploited the deviation and all the training samples to resolve the linear combination coefficients. Finally, the classification rule, the training samples, and the renewed linear combination coefficients were used to classify the test sample. Generally, the proposed framework can work for most RBC methods. From the viewpoint of regression analysis, the proposed framework has a solid theoretical soundness. Because it can, to an extent, identify the bias effect of the RBC method, it enables RBC to obtain more robust face recognition results. The experimental results on a variety of face databases demonstrated that the proposed framework can improve the collaborative representation classification, SRC, and improve the nearest neighbor classifier.     

区域生长和C-均值聚类结合的图像分割方法

结合边缘检测的模糊C-均值聚类图像分割方法,本文提出一种基于区域生长和模糊C-均值聚类相结合的图像分割方法.采用与区域生长类似的方法,寻找图像中封闭边缘围成的相互独立的区域,根据物理就近原则对边缘点进行归类,完成图像的分割.经实验验证:目标区的分割相对完整.     

Weighted Sparse Image Classification Based on Low Rank Representation

The conventional sparse representation-based image classification usually codes the samples independently, which will ignore the correlation information existed in the data. Hence, if we can explore the correlation information hidden in the data, the classification result will be improved significantly. To this end, in this paper, a novel weighted supervised spare coding method is proposed to address the image classification problem. The proposed method firstly explores the structural information sufficiently hidden in the data based on the low rank representation. And then, it introduced the extracted structural information to a novel weighted sparse representation model to code the samples in a supervised way. Experimental results show that the proposed method is superiority to many conventional image classification methods.     

Combining classifiers through fuzzy cognitive maps in natural images

A new automatic hybrid classifier for natural images by combining two base classifiers through the fuzzy cognitive maps (FCMs) approach is presented in this study. The base classifiers used are fuzzy clustering (FC) and the parametric Bayesian (BP) method. During the training phase, different partitions are established until a valid partition is found. Partitioning and validation are two automatic processes based on validation measurements. From a valid partition, the parameters of both classifiers are estimated. During the classification phase, FC provides for each pixel the supports (membership degrees) that determine which cluster the pixel belongs to. These supports are punished or rewarded based on the supports (probabilities) provided by BP. This is achieved through the FCM approach, which combines the different supports. The automatic strategy and the combined strategy under the FCM framework make up the main findings of this study. The analysis of the results shows that the performance of the proposed method is superior to other hybrid methods and more accurate than the single usage of existing base classifiers.     

An improved SRC method based on virtual samples for face recognition

The sparse representation classifier (SRC) performs classification by evaluating which class leads to the minimum representation error. However, in real world, the number of available training samples is limited due to noise interference, training samples cannot accurately represent the test sample linearly. Therefore, in this paper, we first produce virtual samples by exploiting original training samples at the aim of increasing the number of training samples. Then, we take the intra-class difference as data representation of partial noise, and utilize the intra-class differences and training samples simultaneously to represent the test sample in a linear way according to the theory of SRC algorithm. Using weighted score level fusion, the respective representation scores of the virtual samples and the original training samples are fused together to obtain the final classification results. The experimental results on multiple face databases show that our proposed method has a very satisfactory classification performance.     

融合2D-PCA及稀疏表示的掌纹识别方法

提出一种基于稀疏表示的掌纹识别方法,该方法借鉴二维主成分分析(PCA)良好的数据压缩属性和较快的特征提取速度,生成掌纹特征图像.二维PCA不仅克服了一维PCA数据维数过大不易计算的缺点,而且保留了原始图像的数据结构,提取的特征能更好的代表原始图像.为了便于稀疏表达,对提取的掌纹特征图像利用一维主成分分析进行二次特征提取,得到训练样本.虽然此处使用了一维PCA,但是由于这是二次特征提取,提取的特征还是保留了原始图像的数据结构,相比单纯的一维PCA,提高了识别率.利用训练样本构造出冗余字典,并采用稀疏表示理论将测试样本表示为字典原子的线性组合,然后根据表示系数的稀疏性与稀疏集中度实现分类识别.由于该方法利用了表达系数的稀疏性,因此减小了算法的时间和空间复杂度.实验表明,针对香港理工大学的MSpalmprints Database,本文方法的识别率较传统方法有明显提高.     

A supervised dimensionality reduction method-based sparse representation for face recognition

The sparse representation-based classification (SRC) method is a powerful tool to present high-dimensionality data and its superiority in many fields, especially in face recognition application has been proved. With sparsity appropriately harnessed, the SRC can solve face classification problems caused by varying expression, illumination as well as occlusion and disguise. However, face images as high-dimensionality data are usually noisy and the dimensionality is always larger than the number of training sample in real-world applications, which bring a disadvantage for the performance of SRC. Therefore, it is beneficial to perform dimensionality reduction (DR) before utilizing the SRC method. But most prevalent DR methods have no direct connection to SRC. In this paper, we proposed a supervised DR algorithm which suits SRC well and improves the discriminating ability in the low-dimensionality space. The proposed method utilizes the fisher discriminant criterion and low-dimensionality reconstructive restriction to extract the discriminating structure of data. The extensive experiments on public face databases verified the effectiveness of the supervised DR with the model of sparse representation.     

Medical Data Clustering and Classification Using TLBO and Machine Learning Algorithms

This study aims to empirically analyze teaching-learning-based optimization (TLBO) and machine learning algorithms using k-means and fuzzy c-means (FCM) algorithms for their individual performance evaluation in terms of clustering and classification. In the first phase, the clustering (k-means and FCM) algorithms were employed independently and the clustering accuracy was evaluated using different computational measures. During the second phase, the non-clustered data obtained from the first phase were preprocessed with TLBO. TLBO was performed using k-means (TLBO-KM) and FCM (TLBO-FCM) (TLBO-KM/FCM) algorithms. The objective function was determined by considering both minimization and maximization criteria. Non-clustered data obtained from the first phase were further utilized and fed as input for threshold optimization. Five benchmark datasets were considered from the University of California, Irvine (UCI) Machine Learning Repository for comparative study and experimentation. These are breast cancer Wisconsin (BCW), Pima Indians Diabetes, Heart-Statlog, Hepatitis, and Cleveland Heart Disease datasets. The combined average accuracy obtained collectively is approximately 99.4% in case of TLBO-KM and 98.6% in case of TLBO-FCM. This approach is also capable of finding the dominating attributes. The findings indicate that TLBO-KM/FCM, considering different computational measures, perform well on the non-clustered data where k-means and FCM, if employed independently, fail to provide significant results. Evaluating different feature sets, the TLBO-KM/FCM and SVM(GS) clearly outperformed all other classifiers in terms of sensitivity, specificity and accuracy. TLBO-KM/FCM attained the highest average sensitivity (98.7%), highest average specificity (98.4%) and highest average accuracy (99.4%) for 10-fold cross validation with different test data.     

MRI brain segmentation in combination of clustering methods with Markov random field

Medical image segmentation is a preliminary stage of inclusion in identification tools. The correct segmentation of brain Magnetic Resonance Imaging (MRI) images is crucial for an accurate detection of the disease diagnosis. Due to in‐homogeneity, low distinction and noise the segmentation of the brain MRI images is treated as the most challenging task. In this article, we proposed hybrid segmentation, by combining the clustering methods with Hidden Markov Random Field (HMRF) technique. This aims to decrease the computational load and improves the runtime of segmentation method, as MRF methodology is used in post‐processing the images. Its evaluation has performed on real imaging data, resulting in the classification of brain tissues with dice similarity metric. These results indicate the improvement in performance of the proposed method with various noise levels, compared with existing algorithms. In implementation, selection of clustering method provides better results in the segmentation of MRI brain images.     

模拟退火与模糊C-均值聚类相结合的图像分割算法

模糊C-均值(FCM)聚类算法是一种结合无监督聚类和模糊集合概念的图像分割技术,比较有效,但存在着受初始聚类中心和隶属度矩阵影响,可能收敛到局部极小的缺点.将模拟退火算法(SA)与模糊C-均值聚类算法相结合,在合理选择冷却进度表的基础上,依据模糊C-均值聚类算法建立模拟退火算法的目标函数,实现了基于模拟退火的模糊C-均值聚类图像分割算法.实验表明,该方法具有搜索全局最优解的能力,因而可得到很好的图像分割结果.     

Algorithmic Scheme for Concurrent Detection and Classification of Printed Circuit Board Defects

An ideal printed circuit board (PCB) defect inspection system can detect defects and classify PCB defect types. Existing defect inspection technologies can identify defects but fail to classify all PCB defect types. This research thus proposes an algorithmic scheme that can detect and categorize all 14-known PCB defect types. In the proposed algorithmic scheme, fuzzy c-means clustering is used for image segmentation via image subtraction prior to defect detection. Arithmetic and logic operations, the circle hough transform (CHT), morphological reconstruction (MR), and connected component labeling (CCL) are used in defect classification. The algorithmic scheme achieves 100% defect detection and 99.05% defect classification accuracies. The novelty of this research lies in the concurrent use of CHT, MR, and CCL algorithms to accurately detect and classify all 14-known PCB defect types and determine the defect characteristics such as the location, area, and nature of defects. This information is helpful in electronic parts manufacturing for finding the root causes of PCB defects and appropriately adjusting the manufacturing process. Moreover, the algorithmic scheme can be integrated into machine vision to streamline the manufacturing process, improve the PCB quality, and lower the production cost.     

运用稀疏表示法进行单幅图像超分辨的内点方法

稀疏表示法在单幅图像超分辨率重建问题中受到广泛的关注.本文介绍了一种使用稀疏表示进行超分辨率图像重建的方案.该方案首先由低分辨率的输入图像块求取稀疏表示系数,然后根据此系数生成对应的高分辨率图像块,最后由高分辨率块重建出整幅图像.在求取稀疏表示系数时,本文采用了一种借助预处理共轭梯度算法计算搜索方向的内点方法.仿真结果...     

基于超像素快速模糊聚类的印刷品图像分割方法

针对当前彩色印刷品色差检测过程中效率低、复杂性高等问题,提出了一种基于超像素快速模糊聚类的印刷品图像分割方法（SFFCM）。先用简单线性迭代聚类（SLIC）算法将图像分割为紧密相邻的超像素区域。每个超像素区域被视为一个独立的聚类单元。随后,将模糊C均值聚类（FCM）算法应用于超像素的归属关系计算中,即引入隶属度值,允许超像素归属于多个聚类中心,并通过权衡归属度值来实现模糊聚类。实验结果表明,相对于其他算法,本文方法在保持良好实时性的同时,实现了较好的分割效果,有效平衡了算法复杂度与分割效果之间的关系。     

基于改进判别字典学习的故障诊断方法

近年来,基于稀疏表示的分类技术在模式识别中取得一定的成功。该框架中,字典的学习和分类器的训练通常是两个独立的模块,降低了方法的识别精度。针对以上问题,提出了一种特征提取和模式识别相融合的改进判别字典学习模型,将重构误差项、稀疏编码判别项及分类误差项进行了整合,并用K奇异值分解算法对目标函数进行优化,实现了字典和分类器的同步学习。该方法先对原始信号进行经验模态分解,并从分解的本征模态函数中提取时、频特征,形成故障样本;然后将训练样本输入改进模型用K奇异值分解优化;最后用习得字典及分类器权重对测试样本进行识别。实验结果表明：该算法不但适用于小样本故障问题,而且鲁棒性和分类性能都明显高于其它算法。