Zhenqiu Xiao^1,*, Bin Yang², Desy Tjahjadi³

CMC-Computers, Materials & Continua, Vol.60, No.3, pp. 1141-1154, 2019, DOI:10.32604/cmc.2019.05638

Abstract Crowd counting is a challenging task in crowded scenes due to heavy occlusions, appearance variations and perspective distortions. Current crowd counting methods typically operate on an image patch level with overlaps, then sum over the patches to get the final count. In this paper we describe a real-time pedestrian counting framework based on a two-stage human detection algorithm. Existing works with overhead cameras is mainly based on visual tracking, and their robustness is rather limited. On the other hand, some works, which focus on improving the performances, are too complicated to be realistic. By adopting… More >

Ruikang Xing^1,*, Chenghai Li¹

CMC-Computers, Materials & Continua, Vol.60, No.2, pp. 767-780, 2019, DOI:10.32604/cmc.2019.04500

Abstract In clustering analysis, the key to deciding clustering quality is to determine the optimal number of clusters. At present, most clustering algorithms need to give the number of clusters in advance for clustering analysis of the samples. How to gain the correct optimal number of clusters has been an important topic of clustering validation study. By studying and analyzing the FCM algorithm in this study, an accurate and efficient algorithm used to confirm the optimal number of clusters is proposed for the defects of traditional FCM algorithm. For time and clustering accuracy problems of FCM More >

Gang Xu^1,2,*, Ke Xiao^1,*, Zongpeng Li³, Xin-Xin Niu^2,4, Michael Ryan⁵

CMC-Computers, Materials & Continua, Vol.58, No.3, pp. 809-827, 2019, DOI:10.32604/cmc.2019.04400

Abstract In this paper, we first re-examine the previous protocol of controlled quantum secure direct communication of Zhang et al.’s scheme, which was found insecure under two kinds of attacks, fake entangled particles attack and disentanglement attack. Then, by changing the party of the preparation of cluster states and using unitary operations, we present an improved protocol which can avoid these two kinds of attacks. Moreover, the protocol is proposed using the three-qubit partially entangled set of states. It is more efficient by only using three particles rather than four or even more to transmit one More >

Jin Wang^1,2,3, Yu Gao³, Wei Liu³, Wenbing Wu¹, Se-Jung Lim^4,*

CMC-Computers, Materials & Continua, Vol.58, No.3, pp. 711-725, 2019, DOI:10.32604/cmc.2019.05450

Abstract Recently, Wireless sensor networks (WSNs) have become very popular research topics which are applied to many applications. They provide pervasive computing services and techniques in various potential applications for the Internet of Things (IoT). An Asynchronous Clustering and Mobile Data Gathering based on Timer Mechanism (ACMDGTM) algorithm is proposed which would mitigate the problem of “hot spots” among sensors to enhance the lifetime of networks. The clustering process takes sensors’ location and residual energy into consideration to elect suitable cluster heads. Furthermore, one mobile sink node is employed to access cluster heads in accordance with More >

Mohammed Kaddi^1,3,*, Khelifa Benahmed², Mohammed Omari³

CMC-Computers, Materials & Continua, Vol.58, No.3, pp. 603-624, 2019, DOI:10.32604/cmc.2019.05341

Abstract Wireless Sensor Networks (WSNs) have hardware and software limitations and are deployed in hostile environments. The problem of energy consumption in WSNs has become a very important axis of research. To obtain good performance in terms of the network lifetime, several routing protocols have been proposed in the literature. Hierarchical routing is considered to be the most favorable approach in terms of energy efficiency. It is based on the concept parent-child hierarchy where the child nodes forward their messages to their parent, and then the parent node forwards them, directly or via other parent nodes,… More >

Zhe Liu^1,2,*, Bao Xiang^1,3, Yuqing Song¹, Hu Lu¹, Qingfeng Liu¹

CMC-Computers, Materials & Continua, Vol.58, No.2, pp. 451-461, 2019, DOI:10.32604/cmc.2019.04069

Abstract Most image segmentation methods based on clustering algorithms use single-objective function to implement image segmentation. To avoid the defect, this paper proposes a new image segmentation method based on a multi-objective particle swarm optimization (PSO) clustering algorithm. This unsupervised algorithm not only offers a new similarity computing approach based on electromagnetic forces, but also obtains the proper number of clusters which is determined by scale-space theory. It is experimentally demonstrated that the applicability and effectiveness of the proposed multi-objective PSO clustering algorithm. More >

Lili He^1,2, Dantong Ouyang^1,2, Meng Wang^1,2, Hongtao Bai^1,2, Qianlong Yang^1,2, Yaqing Liu^3,4, Yu Jiang^1,2,*

CMC-Computers, Materials & Continua, Vol.57, No.3, pp. 549-570, 2018, DOI:10.32604/cmc.2018.03840

Abstract In this paper, the clustering analysis is applied to the satellite image segmentation, and a cloud-based thunderstorm cloud recognition method is proposed in combination with the strong cloud computing power. The method firstly adopts the fuzzy C-means clustering (FCM) to obtain the satellite cloud image segmentation. Secondly, in the cloud image, we dispose the ‘high-density connected’ pixels in the same cloud clusters and the ‘low-density connected’ pixels in different cloud clusters. Therefore, we apply the DBSCAN algorithm to the cloud image obtained in the first step to realize cloud cluster knowledge. Finally, using the method More >

Kehua Yang^1,2,*, Tian Tan¹, Wei Zhang¹

CMC-Computers, Materials & Continua, Vol.57, No.2, pp. 269-281, 2018, DOI:10.32604/cmc.2018.03696

Abstract Dempster-Shafer (D-S) evidence theory is a key technology for integrating uncertain information from multiple sources. However, the combination rules can be paradoxical when the evidence seriously conflict with each other. In the paper, we propose a novel combination algorithm based on unsupervised Density-Based Spatial Clustering of Applications with Noise (DBSCAN) density clustering. In the proposed mechanism, firstly, the original evidence sets are preprocessed by DBSCAN density clustering, and a successfully focal element similarity criteria is used to mine the potential information between the evidence, and make a correct measure of the conflict evidence. Then, two More >

Lianggui Liu^1,*, Wei Li¹, Huiling Jia¹

CMC-Computers, Materials & Continua, Vol.57, No.1, pp. 97-106, 2018, DOI:10.32604/cmc.2018.03511

Abstract With the rapid development of mobile communication all over the world, the similarity of mobile phone communication data has received widely attention due to its advantage for the construction of smart cities. Mobile phone communication data can be regarded as a type of time series and dynamic time warping (DTW) and derivative dynamic time warping (DDTW) are usually used to analyze the similarity of these data. However, many traditional methods only calculate the distance between time series while neglecting the shape characteristics of time series. In this paper, a novel hybrid method based on the More >

Xuewen Zhang¹, Zhonghao Li¹, Gongshen Liu^1,*, Jiajun Xu¹, Tiankai Xie², Jan Pan Nees¹

CMC-Computers, Materials & Continua, Vol.55, No.3, pp. 405-417, 2018, DOI:10.3970/cmc.2018.02527

Abstract As a main distributed computing system, Spark has been used to solve problems with more and more complex tasks. However, the native scheduling strategy of Spark assumes it works on a homogenized cluster, which is not so effective when it comes to heterogeneous cluster. The aim of this study is looking for a more effective strategy to schedule tasks and adding it to the source code of Spark. After investigating Spark scheduling principles and mechanisms, we developed a stratifying algorithm and a node scheduling algorithm is proposed in this paper to optimize the native scheduling More >