Search

With the continuous deepening of the urbanization process and the progress of science and technology, people transform nature and develop nature on a larger and larger scale, among which the most iconic transformation is a variety of building structures built by people. And with the passage of time, the building structure in the perennial wind and sun, there will be signs of "illness", if not timely treatment, it will have a huge impact on the stability and safety of the building structure. Based on this, in this paper, according to the characteristics of crack identification on the surface of concrete structure, background subtraction algorithm is selected for image noise reduction processing. Through three steps of digital image noise reduction, crack extraction and crack parameter identification, the quantitative recognition of cracks is completed and a complete system of crack parameter identification is formed. The experimental results show that the machine learning model of building structure health monitoring and damage recognition algorithm proposed in this paper has excellent statistical performance, and the relative error accuracy of recognition can be controlled within 10%. [ABSTRACT FROM AUTHOR]

The research of biomedical data is crucial for disease diagnosis, health management, and medicine development. However, biomedical data are usually characterized by high dimensionality and class imbalance, which increase computational cost and affect the classification performance of minority class, making accurate classification difficult. In this paper, we propose a biomedical data classification method based on feature selection and data resampling. First, use the minimal-redundancy maximal-relevance (mRMR) method to select biomedical data features, reduce the feature dimension, reduce the computational cost, and improve the generalization ability; then, a new SMOTE oversampling method (Spectral-SMOTE) is proposed, which solves the noise sensitivity problem of SMOTE by an improved spectral clustering method; finally, the marine predators algorithm is improved using piecewise linear chaotic maps and random opposition-based learning strategy to improve the algorithm's optimization seeking ability and convergence speed, and the key parameters of the spectral-SMOTE are optimized using the improved marine predators algorithm, which effectively improves the performance of the over-sampling approach. In this paper, five real biomedical datasets are selected to test and evaluate the proposed method using four classifiers, and three evaluation metrics are used to compare with seven data resampling methods. The experimental results show that the method effectively improves the classification performance of biomedical data. Statistical test results also show that the proposed PRMPA-Spectral-SMOTE method outperforms other data resampling methods. [ABSTRACT FROM AUTHOR]

Structure learning is the core of graph model Bayesian Network learning, and the current mainstream single search algorithm has problems such as poor learning effect, fuzzy initial network, and easy falling into local optimum. In this paper, we propose a heuristic learning algorithm HC-PSO combining the HC (Hill Climbing) algorithm and PSO (Particle Swarm Optimization) algorithm, which firstly uses HC algorithm to search for locally optimal network structures, takes these networks as the initial networks, then introduces mutation operator and crossover operator, and uses PSO algorithm for global search. Meanwhile, we use the DE (Differential Evolution) strategy to select the mutation operator and crossover operator. Finally, experiments are conducted in four different datasets to calculate BIC (Bayesian Information Criterion) and HD (Hamming Distance), and comparative analysis is made with other algorithms, the structure shows that the HC-PSO algorithm is superior in feasibility and accuracy. [ABSTRACT FROM AUTHOR]

PCB defect detection aims to identify the presence of gaps, open circuits, short circuits, and other defects in the PCB boards produced in the industry. Designing effective deep learning algorithms is crucial to finding a solution. Previously proposed PCB defect detection algorithms are limited in detecting tiny objects in high-density. Directly applying previous models to tackle PCB defect detection tasks will cause serious issues, such as missed detection and false detection. In this paper, we present a detection algorithm for tiny PCB defect targets in high-density regions to solve the above-mentioned problems. We firstly propose a detection head to detect tiny objects. Then, we design a four-channel feature fusion mechanism to fuse four different scale features and add an attention mechanism to find the attention region in scenarios with dense objects. Finally, we achieved accurate detection of tiny targets in high-density areas. Experiments were performed on the publicly available PCB defect dataset from Peking University. Our mAP@.5:.95 achieves 48.6%, while mAP@0.5 exceeds 90%. Compared with YOLOX and YOLOv5, our improved model can better localize tiny objects in high-density scenes. The experimental results certify that our model can obtain higher performance in comparison with the baseline and the state of the art. [ABSTRACT FROM AUTHOR]

The quality of sleep plays a crucial role in physical well-being, and individuals are becoming increasingly concerned about sleep quality and its associated health issues. Although various sleep monitoring devices exist, there remains a need for a highly accurate sleep state identification algorithm. To address this, we present a paper that utilizes machine learning techniques to identify human sleep states based on electroencephalogram (EEG) signals collected by an EEG instrument. We propose a model that incorporates two nonlinear characteristic parameters, MSE and PSE, extracted from artificially designed EEG signals as input. Additionally, we employ a Support Vector Machine (SVM) classifier algorithm to accurately identify sleep states, eliminating uncertainties associated with manually designed feature parameters. Experimental results demonstrate the superior accuracy of our proposed model for sleep state analysis, offering valuable insights for improving sleep quality and addressing related health concerns. [ABSTRACT FROM AUTHOR]

There is a widespread use of cluster-based routing in wireless sensor networks since it is the most energy-efficient. Idealizing cluster heads, on the other hand, is NP-hard and hence requires heuristic or metaheuristic approaches. However, while outperforming algorithms, metaheuristics computation time restricts its ability to respond to routing requests as rapidly as algorithms can today. A network's or an application's parameters can't be easily accommodated by routing methods. This paper offers the HMML, a combination model combining hybrid metaheuristics and machine-learning. Our HMML model makes use of an automated tuning metaheuristic (e.g. evolutionary algorithm) to fine-tune the heuristic technique for each specific configuration. For a variety of combinations, this is done. A network simulation is run using the modified heuristic algorithm in each configuration to arrive at a solution. As a result, a comprehensive dataset for a variety of conditions is produced (e.g., support vector machine). These characteristics include local (round-state), global (network-state), and application-specific aspects of the input feature vector. After training, the HMML model may be used to quickly cluster data. Machine learning's capacity to generalize helps us comprehend the metaheuristic algorithm's behavior in identifying optimal paths for previous configurations. Simulation studies show that HMML can adapt to varied applications while extending network life which increases upto 5% for total energy consumption. [ABSTRACT FROM AUTHOR]

Designers refer to existing product cases and innovate products to develop new products. However, when designers screen product cases, there is no user participation, which leads to the lack of user-side knowledge and emotional drive that is very important for design. Therefore, it is necessary to play the role of user emotional knowledge in promoting the whole design process. This paper proposes the concept of the positive perceptual sample, which applies the knowledge emotion integration of designers and users to the screening sample case stage at the beginning of the design process. This study is based on the lack of user-side knowledge and emotional drive of reference cases and integrates user emotion into the reference case screening process. Then, in the emotion measurement process, users' cognitive data in the screening process are obtained through the eye-brain fusion cognitive experiment. Finally, the XGBoost algorithm is used to process feature index data to realize the classification and recognition of cognitive data and applied to the positive perceptual classification of products. The results show that the classification accuracy of physiological cognitive data with user emotional representation by the XGBoost algorithm is 90.87%. The results of cognitive data classification are applied to the screening of positive perceptual samples, and the satisfaction rate is 98.35%. The results show that the method proposed in this paper provides a new source of ideas for obtaining positive perceptual samples and can be applied to new product development. [ABSTRACT FROM AUTHOR]

The traditional negative selection algorithm with a randomly generated hypersphere detector is unable to satisfy the development needs of continuous learning due to the inherent defects of the detector. This paper proposes a novel negative selection algorithm for hyper-rectangle detectors that overcomes the shortcomings of randomly generated hyper-sphere detectors and lays the foundation for a negative selection algorithm with continuous learning capability. It uses self-sample clusters of equal-sized hypercubes instead of self-samples for training. The hyper-rectangle detectors are generated by cutting the nonself-space along the boundary of the self-sample clusters. The state space is covered without overlapping each other by self-sample clusters and detectors. The anomaly detection performance of the proposed method was demonstrated using Iris data, vowel recognition data (Vowel), and Wisconsin Breast Cancer (BCW) data. The experimental results show that the proposed method outperforms other artificial immune algorithms and clustering algorithms under the same parameter conditions. [ABSTRACT FROM AUTHOR]

The traditional fuzzy C-means clustering technology only considers one performance Angle of image segmentation process when processing data, resulting in low accuracy of image segmentation. In this paper, the traditional FCM algorithm is analyzed, and the low clustering accuracy, noise interference and lack of flexibility and other problems are fully considered from the relationship between parameter components, non-local spatial information elements and noise sensitivity. Firstly, a distance calculation method based on robust statistics theory is proposed, which can deal with abnormal noise stably. Secondly, based on the extreme learning machine theory, the non-local spatial information coefficient is introduced to improve the identification ability of the influence factors. This method not only guarantees the anti-noise performance of the algorithm, but also preserves the image data, improving the iteration efficiency and segmentation accuracy of the algorithm. The test results show that the accuracy of the improved C-means clustering algorithm for image segmentation is 95.5%, which is compared with the traditional C-means clustering technique and other optimization algorithms. [ABSTRACT FROM AUTHOR]

In this paper, a novel hybrid approach for deterministic and probabilistic occupancy detection is proposed with a novel heuristic optimization and Back-Propagation (BP) based algorithms. Generally, PB based neural network (BPNN) suffers with the optimal value of weight, bias, trapping problem in local minima and sluggish convergence rate. In this paper, the GSA (Gravitational Search Algorithm) is implemented as a new training technique for BPNN is order to enhance the performance of the BPNN algorithm by decreasing the problem of trapping in local minima, enhance the convergence rate and optimize the weight and bias value to reduce the overall error. The experimental results of BPNN with and without GSA are demonstrated and presented for fair comparison and adoptability. The demonstrated results show that BPNNGSA has outperformance for training and testing phase in form of enhancement of processing speed, convergence rate and avoiding the trapping problem of standard BPNN. The whole study is analyzed and demonstrated by using R language open access platform. The proposed approach is validated with different hidden-layer neurons for both experimental studies based on BPNN and BPNNGSA. [ABSTRACT FROM AUTHOR]

Non-negative Tucker decomposition of tensor data has a wide range of applications in machine learning. With the non-negative constraints, tensor data can be decomposed into the mode product of a core tensor and a series of projection matrices. The core tensor usually is be regarded as the low-dimensional representation of the original tensor. The process of dimensionality reduction preserves the global properties of tensor data. But many applications in machine learning expect the continuous dependencies of data local feature to remain unchanged during dimensionality reduction. To this end, this paper proposes a local homeomorphism regularized non-negative Tucker decomposition algorithm for tensor data. The proposed method introduce a local homeomorphism regularized term to tensor non-negative Tucker decomposition constrain for effectively preserving the global and local characters of tensor. Experiments on four commonly used real data sets and six compared algorithms have demonstrate the well performance of the proposed algorithms. [ABSTRACT FROM AUTHOR]

Imbalanced dataset classification is challenging because of the severely skewed class distribution. The traditional machine learning algorithms show degraded performance for these skewed datasets. However, there are additional characteristics of a classification dataset that are not only challenging for the traditional machine learning algorithms but also increase the difficulty when constructing a model for imbalanced datasets. Data complexity metrics identify these intrinsic characteristics, which cause substantial deterioration of the learning algorithms' performance. Though many research efforts have been made to deal with class noise, none of them focused on imbalanced datasets coupled with other intrinsic factors. This paper presents a novel hybrid pre-processing algorithm focusing on treating the class-label noise in the imbalanced dataset, which suffers from other intrinsic factors such as class overlapping, non-linear class boundaries, small disjuncts, and borderline examples. This algorithm uses the wCM complexity metric (proposed for imbalanced dataset) to identify noisy, borderline, and other difficult instances of the dataset and then intelligently handles these instances. Experiments on synthetic datasets and real-world datasets with different levels of imbalance, noise, small disjuncts, class overlapping, and borderline examples are conducted to check the effectiveness of the proposed algorithm. The experimental results show that the proposed algorithm offers an interesting alternative to popular state-of-the-art pre-processing algorithms for effectively handling imbalanced datasets along with noise and other difficulties. [ABSTRACT FROM AUTHOR]

Detecting vehicle at night is critical to both assistant driving systems and autonomous driving systems. In this paper, we propose a deep network scheme assisted by light information with good generalization to detect vehicle at night. Our approach is divided into two branches, the object stream and the pixel stream. The object stream generates a batch of bounding boxes, and the pixel stream utilizes the vehicle light information to calibrate the bounding boxes of the object stream. In the object stream, we propose a new structure, Direction Attention Pooling (DAP), to improve the accuracy of the prior boxes. DAP leads into attention mechanism. The feature maps obtained from backbone network is divided into two branches. One branch obtains direction perception information through IRNN layer, and the other branch learns attention weights. The weights are multiplied with the direction perception features in an element-wise manner. In the pixel stream, we propose a corner localization algorithm based on Bayes to get more accurate corners with the vehicle light pixels. The locations of the corners are considered as a discrete random variable. When the mask of the object is known, solving the probability distribution of the corner of the object is the next step. The corners with the highest probability is the correct corner. On the nighttime vehicle detection datasets CHUK and SYSU, our method achieves the accuracy of 97.2% and 96.86%, which outperforms other state-of-the-art methods by at least 0.31% and 0.34%. [ABSTRACT FROM AUTHOR]