Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (24)
  • Open Access

    ARTICLE

    YOLOv2PD: An Efficient Pedestrian Detection Algorithm Using Improved YOLOv2 Model

    Chintakindi Balaram Murthy1, Mohammad Farukh Hashmi1, Ghulam Muhammad2,3,*, Salman A. AlQahtani2,3

    CMC-Computers, Materials & Continua, Vol.69, No.3, pp. 3015-3031, 2021, DOI:10.32604/cmc.2021.018781

    Abstract Real-time pedestrian detection is an important task for unmanned driving systems and video surveillance. The existing pedestrian detection methods often work at low speed and also fail to detect smaller and densely distributed pedestrians by losing some of their detection accuracy in such cases. Therefore, the proposed algorithm YOLOv2 (“YOU ONLY LOOK ONCE Version 2”)-based pedestrian detection (referred to as YOLOv2PD) would be more suitable for detecting smaller and densely distributed pedestrians in real-time complex road scenes. The proposed YOLOv2PD algorithm adopts a Multi-layer Feature Fusion (MLFF) strategy, which helps to improve the model’s feature extraction ability. In addition, one… More >

  • Open Access

    ARTICLE

    Performances of K-Means Clustering Algorithm with Different Distance Metrics

    Taher M. Ghazal1,2, Muhammad Zahid Hussain3, Raed A. Said5, Afrozah Nadeem6, Mohammad Kamrul Hasan1, Munir Ahmad7, Muhammad Adnan Khan3,4,*, Muhammad Tahir Naseem3

    Intelligent Automation & Soft Computing, Vol.30, No.2, pp. 735-742, 2021, DOI:10.32604/iasc.2021.019067

    Abstract Clustering is the process of grouping the data based on their similar properties. Meanwhile, it is the categorization of a set of data into similar groups (clusters), and the elements in each cluster share similarities, where the similarity between elements in the same cluster must be smaller enough to the similarity between elements of different clusters. Hence, this similarity can be considered as a distance measure. One of the most popular clustering algorithms is K-means, where distance is measured between every point of the dataset and centroids of clusters to find similar data objects and assign them to the nearest… More >

  • Open Access

    ARTICLE

    Binaural Speech Separation Algorithm Based on Deep Clustering

    Lin Zhou1,*, Kun Feng1, Tianyi Wang1, Yue Xu1, Jingang Shi2

    Intelligent Automation & Soft Computing, Vol.30, No.2, pp. 527-537, 2021, DOI:10.32604/iasc.2021.018414

    Abstract Neutral network (NN) and clustering are the two commonly used methods for speech separation based on supervised learning. Recently, deep clustering methods have shown promising performance. In our study, considering that the spectrum of the sound source has time correlation, and the spatial position of the sound source has short-term stability, we combine the spectral and spatial features for deep clustering. In this work, the logarithmic amplitude spectrum (LPS) and the interaural phase difference (IPD) function of each time frequency (TF) unit for the binaural speech signal are extracted as feature. Then, these features of consecutive frames construct feature map,… More >

  • Open Access

    ARTICLE

    Safest Route Detection via Danger Index Calculation and K-Means Clustering

    Isha Puthige1, Kartikay Bansal1, Chahat Bindra1, Mahekk Kapur1, Dilbag Singh1, Vipul Kumar Mishra1, Apeksha Aggarwal1, Jinhee Lee2, Byeong-Gwon Kang2, Yunyoung Nam2,*, Reham R. Mostafa3

    CMC-Computers, Materials & Continua, Vol.69, No.2, pp. 2761-2777, 2021, DOI:10.32604/cmc.2021.018128

    Abstract The study aims to formulate a solution for identifying the safest route between any two inputted Geographical locations. Using the New York City dataset, which provides us with location tagged crime statistics; we are implementing different clustering algorithms and analysed the results comparatively to discover the best-suited one. The results unveil the fact that the K-Means algorithm best suits for our needs and delivered the best results. Moreover, a comparative analysis has been performed among various clustering techniques to obtain best results. we compared all the achieved results and using the conclusions we have developed a user-friendly application to provide… More >

  • Open Access

    ARTICLE

    Oversampling Method Based on Gaussian Distribution and K-Means Clustering

    Masoud Muhammed Hassan1, Adel Sabry Eesa1,*, Ahmed Jameel Mohammed2, Wahab Kh. Arabo1

    CMC-Computers, Materials & Continua, Vol.69, No.1, pp. 451-469, 2021, DOI:10.32604/cmc.2021.018280

    Abstract Learning from imbalanced data is one of the greatest challenging problems in binary classification, and this problem has gained more importance in recent years. When the class distribution is imbalanced, classical machine learning algorithms tend to move strongly towards the majority class and disregard the minority. Therefore, the accuracy may be high, but the model cannot recognize data instances in the minority class to classify them, leading to many misclassifications. Different methods have been proposed in the literature to handle the imbalance problem, but most are complicated and tend to simulate unnecessary noise. In this paper, we propose a simple… More >

  • Open Access

    ARTICLE

    Driving Pattern Profiling and Classification Using Deep Learning

    Meenakshi Malik1, Rainu Nandal1, Surjeet Dalal2, Vivek Jalglan3, Dac-Nhuong Le4,5,*

    Intelligent Automation & Soft Computing, Vol.28, No.3, pp. 887-906, 2021, DOI:10.32604/iasc.2021.016272

    Abstract The last several decades have witnessed an exponential growth in the means of transport globally, shrinking geographical distances and connecting the world. The automotive industry has grown by leaps and bounds, with millions of new vehicles being sold annually, be it for personal commuting or for public or commodity transport. However, millions of motor vehicles on the roads also mean an equal number of drivers with varying levels of skill and adherence to safety regulations. Very little has been done in the way of exploring and profiling driving patterns and vehicular usage using real world data. This paper focuses on… More >

  • Open Access

    ARTICLE

    Determination of Cup to Disc Ratio Using Unsupervised Machine Learning Techniques for Glaucoma Detection

    R. Praveena*, T. R. GaneshBabu

    Molecular & Cellular Biomechanics, Vol.18, No.2, pp. 69-86, 2021, DOI:10.32604/mcb.2021.014622

    Abstract The cup nerve head, optic cup, optic disc ratio and neural rim configuration are observed as important for detecting glaucoma at an early stage in clinical practice. The main clinical indicator of glaucoma optic cup to disc ratio is currently determined manually by limiting the mass screening was potential. This paper proposes the following methods for an automatic cup to disc ratio determination. In the first part of the work, fundus image of the optic disc region is considered. Clustering means K is used automatically to extract the optic disc whereas K-value is automatically selected by algorithm called hill climbing.… More >

  • Open Access

    ARTICLE

    The Application of Sparse Reconstruction Algorithm for Improving Background Dictionary in Visual Saliency Detection

    Lei Feng1,2, Haibin Li1,*, Yakun Gao1, Yakun Zhang1

    Intelligent Automation & Soft Computing, Vol.26, No.4, pp. 831-839, 2020, DOI:10.32604/iasc.2020.010117

    Abstract In the paper, we apply the sparse reconstruction algorithm of improved background dictionary to saliency detection. Firstly, after super-pixel segmentation, two bottom features are extracted: the color information of LAB and the texture features of the image by Gabor filter. Secondly, the convex hull theory is used to remove object region in boundary region, and K-means clustering algorithm is used to continue to simplify the background dictionary. Finally, the saliency map is obtained by calculating the reconstruction error. Compared with the mainstream algorithms, the accuracy and efficiency of this algorithm are better than those of other algorithms. More >

  • Open Access

    ARTICLE

    Reducing Operational Time Complexity of k-NN Algorithms Using Clustering in Wrist-Activity Recognition

    Sun-Taag Choe, We-Duke Cho*, Jai-Hoon Kim, and Ki-Hyung Kim

    Intelligent Automation & Soft Computing, Vol.26, No.4, pp. 679-691, 2020, DOI:10.32604/iasc.2020.010102

    Abstract Recent research on activity recognition in wearable devices has identified a key challenge: k-nearest neighbors (k-NN) algorithms have a high operational time complexity. Thus, these algorithms are difficult to utilize in embedded wearable devices. Herein, we propose a method for reducing this complexity. We apply a clustering algorithm for learning data and assign labels to each cluster according to the maximum likelihood. Experimental results show that the proposed method achieves effective operational levels for implementation in embedded devices; however, the accuracy is slightly lower than that of a traditional k-NN algorithm. Additionally, our method provides the advantage of controlling the… More >

  • Open Access

    ARTICLE

    Prediction of College Students’ Physical Fitness Based on K-Means Clustering and SVR

    Peng Tang, Yu Wang, Ning Shen

    Computer Systems Science and Engineering, Vol.35, No.4, pp. 237-246, 2020, DOI:10.32604/csse.2020.35.237

    Abstract In today’s modern society, the physical fitness of college students is gradually declining. In this paper, a prediction model for college students’ physical fitness is established, in which support vector regression (SVR) and k-means clustering are combined together for the prediction of college students’ fitness. Firstly, the physical measurement data of college students are classified according to gender and class characteristics. Then, the k-means clustering method is used to classify the physical measurement data of college students. Next, the physical characteristics of college students are extracted by SVR to establish the prediction model of physical indicators, and the model for… More >

Displaying 11-20 on page 2 of 24. Per Page