基于嵌入式系统的智能售货柜目标检测算法

针对普通商品识别算法在智能售货柜嵌入式系统平台上检测速度慢、识别率低的问题,提出了一种在YOLOv3基础上的改进型商品识别算法DS_YOLOv3.利用k-means++聚类算法得到适应于售货柜中售卖饮料图像数据的先验框;采用深度可分离卷积替换标准卷积,并加入倒置残差模块重构YOLOv3算法,减少了计算复杂度使其能在嵌入式平台实时检测;同时引入CIoU作为边界框回归损失函数,提高目标图像定位精度,实现了对传统YOLOv3算法的改进.在计算机工作站和Jeston Xavier NX嵌入式平台上进行了典型场景下的商品检测实验.实验结果表明,DS_YOLOv3算法mAP达到了96.73％,在Jeston Xavier NX平台上实际检测的速率为20.34fps,满足了基于嵌入式系统平台的智能售货柜对实时性和商品识别精度的要求.     

A Tradeoff Between Accuracy and Speed for K-Means Seed Determination

With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.     

Ensemble cluster pruning via convex-concave programming

Ensemble learning is the process of aggregating the decisions of different learners/models. Fundamentally, the performance of the ensemble relies on the degree of accuracy in individual learner predictions and the degree of diversity among the learners. The trade-off between accuracy and diversity within the ensemble needs to be optimized to provide the best grouping of learners as it relates to their performance. In this optimization theory article, we propose a novel ensemble selection algorithm which, focusing specifically on clustering problems, selects the optimal subset of the ensemble that has both accurate and diverse models. Those ensemble selection algorithms work for a given number of the best learners within the subset prior to their selection. The cardinality of a subset of the ensemble changes the prediction accuracy. The proposed algorithm in this study determines both the number of best learners and also the best ones. We compared our prediction results to recent ensemble clustering selection algorithms by the number of cardinalities and best predictions, finding better and approximated results to the optimum solutions.     

Fingerprint optimization method for the indoor localization system

The accuracy of the indoor localization is influenced directly by the quality of the fingerprint. But the indoor localization algorithms in existence are almost conducted based on the original fingerprint which is not optimized. The k-means is introduced to optimize the fingerprint in this paper. And deleting the collected bad-points through the theory of cluster could make the fingerprint more accurate for the indoor localization algorithm. Compared with the indoor localization systems in existence, the result of experiments shows that the optimized fingerprint can increase the accurate of indoor localization with a higher probability.     

基于高斯映射的CAD网格法向聚类分割方法

网格模型特征的分割和识别,能够极大地提高复杂机械产品设计中模型重用、模型编辑的效率。由此,提出一种基于高斯映射的法向聚类CAD网格分割方法。对网格模型各面片法向进行高斯映射,建立各单元面片边连接邻域与高斯球面法向的对应关系。对各法向在高斯球面上进行k-means聚类分割,依据法向初始聚类类型和二面角阈值细化分割。将过分割的细小区域进行合并处理,根据各区域邻接矩阵及其类型的相似性进行特征识别和归并处理。本算法能够高效地对复杂机械产品的网格模型进行分割和识别,不受网格疏密的限制。     

基于改进的K-means聚类的多区域物流中心选址算法

针对当前多区域物流中心选址需建立配送中心个数不定、位置、覆盖范围不明的问题,本文提出了一种改进的k-means聚类算法,以城市经济引力模型为基础,将城市运输距离与居民消费能力的指标相结合,重新定义对象之间相似性度量的距离因子.并将密度思想引入k-means算法,提出类内差分均值的概念确定最优聚类数.实现分区后,分别在这些区域中利用重心法对配送中心进行最终的确定.最后实例分析了在西部地区37个城市创建物流配送中心的选址过程,并通过和传统的k-means聚类的选址结果对比,说明改进后的算法不仅可以节省配送时间,而且大大降低了运输成本,有很好的经济利用价值.     

A Fast and Effective Multiple Kernel Clustering Method on Incomplete Data

Multiple kernel clustering is an unsupervised data analysis method that has been used in various scenarios where data is easy to be collected but hard to be labeled. However, multiple kernel clustering for incomplete data is a critical yet challenging task. Although the existing absent multiple kernel clustering methods have achieved remarkable performance on this task, they may fail when data has a high value-missing rate, and they may easily fall into a local optimum. To address these problems, in this paper, we propose an absent multiple kernel clustering (AMKC) method on incomplete data. The AMKC method first clusters the initialized incomplete data. Then, it constructs a new multiple-kernel-based data space, referred to as K-space, from multiple sources to learn kernel combination coefficients. Finally, it seamlessly integrates an incomplete-kernel-imputation objective, a multiple-kernel-learning objective, and a kernel-clustering objective in order to achieve absent multiple kernel clustering. The three stages in this process are carried out simultaneously until the convergence condition is met. Experiments on six datasets with various characteristics demonstrate that the kernel imputation and clustering performance of the proposed method is significantly better than state-of-the-art competitors. Meanwhile, the proposed method gains fast convergence speed.     

Trade-Off between Efficiency and Effectiveness: A Late Fusion Multi-View Clustering Algorithm

Late fusion multi-view clustering (LFMVC) algorithms aim to integrate the base partition of each single view into a consensus partition. Base partitions can be obtained by performing kernel k-means clustering on all views. This type of method is not only computationally efficient, but also more accurate than multiple kernel k-means, and is thus widely used in the multi-view clustering context. LFMVC improves computational efficiency to the extent that the computational complexity of each iteration is reduced from O(n³) to O(n) (where n is the number of samples). However, LFMVC also limits the search space of the optimal solution, meaning that the clustering results obtained are not ideal. Accordingly, in order to obtain more information from each base partition and thus improve the clustering performance, we propose a new late fusion multi-view clustering algorithm with a computational complexity of O(n²). Experiments on several commonly used datasets demonstrate that the proposed algorithm can reach quickly convergence. Moreover, compared with other late fusion algorithms with computational complexity of O(n), the actual time consumption of the proposed algorithm does not significantly increase. At the same time, comparisons with several other state-of-the-art algorithms reveal that the proposed algorithm also obtains the best clustering performance.     

基于声发射技术的Si-Cr-Ti高温抗氧化涂层弯曲失效机理研究

本研究借助声发射技术对铌基高温抗氧化涂层在常温下的弯曲失效过程进行了研究。利用k均值聚类方法对信号进行了分类, 结合截面扫描电镜观测结果确定高温抗氧化涂层在弯曲载荷下的信号分别对应基体变形、表面垂直裂纹、滑动型界面裂纹和张开型界面裂纹, 通过快速傅里叶变换得到了各类信号的主频分别为100、310、590和450 kHz, 借助小波分析得到了各信号的小波能量系数。涂层弯曲失效过程主要包括四个阶段, 分别为受拉侧表面垂直裂纹萌生的初始损伤阶段、表面垂直裂纹增殖阶段、两侧界面裂纹快速扩展的损伤积累阶段和受压侧涂层明显剥落的宏观剥落阶段。     

基于聚类和用户偏好的协同过滤推荐算法

协同过滤推荐算法使用评分数据作为学习的数据源,针对协同过滤推荐算法中存在的评分数据稀疏以及算法的可拓展性问题,提出了一种基于聚类和用户偏好的协同过滤推荐算法。为了挖掘用户的偏好,该算法引入了用户对项目类型的平均评分到评分矩阵中,并加入了基于用户自身属性的相似度;同时,为了降低数据稀疏性,该算法使用Weighted Slope One算法填充评分数据中的未评分项,并通过融入密度和距离优化初始聚类中心的K-means算法聚类填充后的评分数据中的用户,缩小了相似用户的搜索空间;最后在聚类后的数据集中使用传统的协同过滤推荐算法生成目标用户的推荐结果。通过使用MovieLens100K数据集实验证明,提出的算法对推荐效果有所改善。