Reviewerly/exHarmony huggingface dataset:
A new imputation method based on genetic programming and weighted KNN for symbolic regression with incomplete data

Incompleteness is one of the problematic data quality challenges in real-world machine learning tasks. A large number of studies have been conducted for addressing this challenge. However, most of the existing studies focus on the classification task and only a limited number of studies for symbolic regression with missing values exist. In this work, a new imputation method for symbolic regression with incomplete data is proposed. The method aims to improve both the effectiveness and efficiency of imputing missing values for symbolic regression. This method is based on genetic programming (GP) and weighted K-nearest neighbors (KNN). It constructs GP-based models using other available features to predict the missing values of incomplete features. The instances used for constructing such models are selected using weighted KNN. The experimental results on real-world data sets show that the proposed method outperforms a number of state-of-the-art methods with respect to the imputation accuracy, the symbolic regression performance, and the imputation time.
Two Ensemble-CNN Approaches for Colorectal Cancer Tissue Type Classification

In recent years, automatic tissue phenotyping has attracted increasing interest in the Digital Pathology (DP) field. For Colorectal Cancer (CRC), tissue phenotyping can diagnose the cancer and differentiate between different cancer grades. The development of Whole Slide Images (WSIs) has provided the required data for creating automatic tissue phenotyping systems. In this paper, we study different hand-crafted feature-based and deep learning methods using two popular multi-classes CRC-tissue-type databases: Kather-CRC-2016 and CRC-TP. For the hand-crafted features, we use two texture descriptors (LPQ and BSIF) and their combination. In addition, two classifiers are used (SVM and NN) to classify the texture features into distinct CRC tissue types. For the deep learning methods, we evaluate four Convolutional Neural Network (CNN) architectures (ResNet-101, ResNeXt-50, Inception-v3, and DenseNet-161). Moreover, we propose two Ensemble CNN approaches: Mean-Ensemble-CNN and NN-Ensemble-CNN. The experimental results show that the proposed approaches outperformed the hand-crafted feature-based methods, CNN architectures and the state-of-the-art methods in both databases.
Unsupervised Adversarial Instance-Level Image Retrieval

With the wide use of visual sensors in the Internet of Things (IoT) in the past decades, huge amounts of images are captured in people's daily lives, which poses challenges to traditional deep-learning-based image retrieval frameworks. Most such frameworks need a large amount of annotated training data, which are expensive. Moreover, machines still lack human intelligence, as illustrated by the fact that they pay less attention to the interesting regions that humans generally focus on when searching for images. Hence, this paper proposes a novel unsupervised framework that focuses on the instance object in the image and integrates human intelligence into the deep-learning-based image retrieval. This framework is called adversarial instance-level image retrieval (AILIR). We incorporate adversarial training and an attention mechanism into this framework that considers human intelligence with artificial intelligence. The generator and discriminator are redesigned to guarantee that the generator retrieves similar images while the discriminator selects unmatched images and creates an adversarial reward for the generator. A minimax game is conducted by the adversarial reward retrieval mechanism until the discriminator is unable to judge whether the image sequence retrieved matches the query. Comparison and ablation experiments on four benchmark datasets prove that the proposed adversarial training framework indeed improves instance retrieval and outperforms the state-of-the-art methods focused on instance retrieval.
An Image Encryption Scheme Based on Lorenz Hyperchaotic System and RSA Algorithm

This research proposes a new image encryption scheme based on Lorenz hyperchaotic system and Rivest–Shamir–Adleman (RSA) algorithm. Firstly, the initial values of the Lorenz hyperchaotic system are generated by RSA algorithm, and the key stream is produced iteratively. In order to change the position and gray value of the pixel, the image data are hidden by additive mode diffusion. Secondly, the diffusion image matrix is reshaped into a one-dimensional image matrix, which is confused without repetition to hide the image data again. Then, the finite field diffusion algorithm is executed to realize the third hiding of the image information. In order to diffuse the pixel information into the entire cipher image, the additive mode diffusion algorithm needs to be looped twice. Finally, the cipher image can be obtained. The experimental results prove that the image encryption scheme proposed in this research is effective and has strong antiattack and key sensitivity. Moreover, the security of this encryption scheme relies on the RSA algorithm, which has high security.
Collision-free motion planning for the litchi-picking robot

In unstructured environments, picking robots could collide with branches, thus reducing the success rate of picking. In this study, collision-free motion planning is performed in two steps based on the binocular stereo vision information of the environment. First, according to the 3D information collected in the stereo vision environment, the improved adaptive weight particle swarm optimization (APSO) algorithm is adopted to solve the inverse kinematics problem of robots and obtain the collision-free picking posture. Second, to address the limitations of the Bi-RRT algorithm in a high-dimensional environment, such as randomness and slow convergence speed, the target gravity concept and adaptive coefficient adjustment method are introduced to the Bi-RRT algorithm, which is called the AtBi-RRT algorithm. The AtBi-RRT algorithm is used to determine the collision-free path of the robot. Simulation results indicate that the APSO algorithm can swiftly obtain the proper collision-free picking posture, and the average path-determination time of the AtBi-RRT algorithm is 4.24 s. The success rate of path determination is 100% for the laboratory’s picking scene. Experimental results verify that the proposed collision-free motion-planning method allows the picking robot to avoid obstacles in the workspace and efficiently complete the picking task.
An Exhaustive Research on the Application of Intrusion Detection Technology in Computer Network Security in Sensor Networks

Intrusion detection is crucial in computer network security issues; therefore, this work is aimed at maximizing network security protection and its improvement by proposing various preventive techniques. Outlier detection and semisupervised clustering algorithms based on shared nearest neighbors are proposed in this work to address intrusion detection by converting it into a problem of mining outliers using the network behavior dataset. The algorithm uses shared nearest neighbors as similarity, judges whether it is an outlier according to the number of nearest neighbors of a data point, and performs semisupervised clustering on the dataset where outliers are deleted. In the process of semisupervised clustering, vast prior knowledge is added, and the dataset is clustered according to the principle of graph segmentation. The novelty of the proposed algorithm lies in outlier detection while effectively avoiding the dependence on parameters, thus eliminating the influence of outliers on clustering. This article uses real datasets: lypmphography and glass for simulation purposes. The simulation results show that the algorithm proposed in this paper can effectively detect outliers and has a good clustering effect. Furthermore, the experimentation reveals that the outlier detection-based SCA-SNN algorithm has the best practical effect on the dataset without outliers, clearly validating the clustering performance of the outlier detection-based SCA-SNN algorithm. Furthermore, compared to the other state-of-the-art anomaly detection method, it was revealed that the anomaly detection technology based on outlier mining does not require a training process. Thus, they overcome the current anomaly detection problems caused due to incomplete normal patterns in training samples.
Design and Implementation of Smart City Applications Based on the Internet of Things

&lt;p class="0abstract"&gt;Since the emergence of the Coronavirus and its declaration as a global pandemic, the world has changed all sectors radically. Covid-19 has caused a very strong effect on daily life and adaptation to new ways of learning, working, and communicating. The smart city is one of the most important solutions that enable us to go on with daily life during the pandemic and beyond. The smart city employs the current technology and smart solutions to serve the community, and improve the services provided to the people, particularly in vital sectors such as health, education, electricity, transportation, communications, and others. This article deals with two innovative applications for the Internet of things in smart cities: The first refers to designing an intelligent health monitoring system, which aims to reduce the spread of Coronavirus infection from people to the medical staff, as well as reduce work pressure on the medical staff. The second application refers to monitoring electrical energy consumed by measuring and monitoring electrical parameters and energy consumption. In addition, it helps us to know the power line trespasser. Both systems are implemented by using sensors to gather data in real-time and then transmit it to the server.&lt;/p&gt;
Review of Breast Cancer Pathologigcal Image Processing

Breast cancer is one of the most common malignancies. Pathological image processing of breast has become an important means for early diagnosis of breast cancer. Using medical image processing to assist doctors to detect potential breast cancer as early as possible has always been a hot topic in the field of medical image diagnosis. In this paper, a breast cancer recognition method based on image processing is systematically expounded from four aspects: breast cancer detection, image segmentation, image registration, and image fusion. The achievements and application scope of supervised learning, unsupervised learning, deep learning, CNN, and so on in breast cancer examination are expounded. The prospect of unsupervised learning and transfer learning for breast cancer diagnosis is prospected. Finally, the privacy protection of breast cancer patients is put forward.
Deep One-Class Classification via Interpolated Gaussian Descriptor

One-class classification (OCC) aims to learn an effective data description to enclose all normal training samples and detect anomalies based on the deviation from the data description. Current state-of-the-art OCC models learn a compact normality description by hyper-sphere minimisation, but they often suffer from overfitting the training data, especially when the training set is small or contaminated with anomalous samples. To address this issue, we introduce the interpolated Gaussian descriptor (IGD) method, a novel OCC model that learns a one-class Gaussian anomaly classifier trained with adversarially interpolated training samples. The Gaussian anomaly classifier differentiates the training samples based on their distance to the Gaussian centre and the standard deviation of these distances, offering the model a discriminability w.r.t. the given samples during training. The adversarial interpolation is enforced to consistently learn a smooth Gaussian descriptor, even when the training data is small or contaminated with anomalous samples. This enables our model to learn the data description based on the representative normal samples rather than fringe or anomalous samples, resulting in significantly improved normality description. In extensive experiments on diverse popular benchmarks, including MNIST, Fashion MNIST, CIFAR10, MVTec AD and two medical datasets, IGD achieves better detection accuracy than current state-of-the-art models. IGD also shows better robustness in problems with small or contaminated training sets.
Multitask AET with Orthogonal Tangent Regularity for Dark Object Detection

Dark environment becomes a challenge for computer vision algorithms owing to insufficient photons and undesirable noise. To enhance object detection in a dark environment, we propose a novel multitask auto encoding transformation (MAET) model which is able to explore the intrinsic pattern behind illumination translation. In a self-supervision manner, the MAET learns the intrinsic visual structure by encoding and decoding the realistic illumination-degrading transformation considering the physical noise model and image signal processing (ISP). Based on this representation, we achieve the object detection task by decoding the bounding box coordinates and classes. To avoid the over-entanglement of two tasks, our MAET disentangles the object and degrading features by imposing an orthogonal tangent regularity. This forms a parametric manifold along which multitask predictions can be geometrically formulated by maximizing the orthogonality between the tangents along the outputs of respective tasks. Our framework can be implemented based on the mainstream object detection architecture and directly trained end-to-end using normal target detection datasets, such as VOC and COCO. We have achieved the state-of-the-art performance using synthetic and real-world datasets. Codes will be released at https://github.com/cuiziteng/MAET.
ARFDNet: An efficient activity recognition &amp; fall detection system using latent feature pooling

This paper presents an efficient activity recognition and fall detection system (ARFDNet). Here, the raw RGB videos are passed to a pose estimation network to extract skeleton features of the user. These skeleton coordinates are then pre-processed and inputted in a sliding window fashion to specially designed convolutional neural networks (CNNs) followed by gated recurrent units (GRUs), to learn the spatiotemporal dynamics present in the data. The output of the GRUs is then passed to fully connected layers for the classifications. The proposed model is tested on two databases, namely, ADLF (activities of daily living and fall) and UP-Fall detection dataset. ADLF dataset is an in-house dataset collected from 12 participants with a single web camera. It consists of 119 videos (740,375 frames), recorded for a total duration of 29,077 s. UP-Fall detection dataset is a publicly available large-scale dataset for ADL (activities of daily living) monitoring and fall detection. In the current research, we consider only the vision-based UP-Fall detection dataset, which utilizes 2 cameras for recording 6 ADLs and 5 types of falls with the help of 17 individuals. It comprises 277 GB of vision data with a total number of 589,418 images. Result reveals that the proposed system demonstrated – (a) an accuracy of 89.05% and 89.64% before and after polling, respectively, on the ADLF dataset; (b) an accuracy of 96.7% on the UP-Fall detection dataset. These results show the superiority of the proposed system over the most recent state-of-the-art work.
A Survey of Outlier Detection Techniques in IoT: Review and Classification

The Internet of Things (IoT) is a fact today where a high number of nodes are used for various applications. From small home networks to large-scale networks, the aim is the same: transmitting data from the sensors to the base station. However, these data are susceptible to different factors that may affect the collected data efficiency or the network functioning, and therefore the desired quality of service (QoS). In this context, one of the main issues requiring more research and adapted solutions is the outlier detection problem. The challenge is to detect outliers and classify them as either errors to be ignored, or important events requiring actions to prevent further service degradation. In this paper, we propose a comprehensive literature review of recent outlier detection techniques used in the IoTs context. First, we provide the fundamentals of outlier detection while discussing the different sources of an outlier, the existing approaches, how we can evaluate an outlier detection technique, and the challenges facing designing such techniques. Second, comparison and discussion of the most recent outlier detection techniques are presented and classified into seven main categories, which are: statistical-based, clustering-based, nearest neighbour-based, classification-based, artificial intelligent-based, spectral decomposition-based, and hybrid-based. For each category, available techniques are discussed, while highlighting the advantages and disadvantages of each of them. The related works for each of them are presented. Finally, a comparative study for these techniques is provided.
DBGC: Dimension-Based Generic Convolution Block for Object Recognition

The object recognition concept is being widely used a result of increasing CCTV surveillance and the need for automatic object or activity detection from images or video. Increases in the use of various sensor networks have also raised the need of lightweight process frameworks. Much research has been carried out in this area, but the research scope is colossal as it deals with open-ended problems such as being able to achieve high accuracy in little time using lightweight process frameworks. Convolution Neural Networks and their variants are widely used in various computer vision activities, but most of the architectures of CNN are application-specific. There is always a need for generic architectures with better performance. This paper introduces the Dimension-Based Generic Convolution Block (DBGC), which can be used with any CNN to make the architecture generic and provide a dimension-wise selection of various height, width, and depth kernels. This single unit which uses the separable convolution concept provides multiple combinations using various dimension-based kernels. This single unit can be used for height-based, width-based, or depth-based dimensions; the same unit can even be used for height and width, width and depth, and depth and height dimensions. It can also be used for combinations involving all three dimensions of height, width, and depth. The main novelty of DBGC lies in the dimension selector block included in the proposed architecture. Proposed unoptimized kernel dimensions reduce FLOPs by around one third and also reduce the accuracy by around one half; semi-optimized kernel dimensions yield almost the same or higher accuracy with half the FLOPs of the original architecture, while optimized kernel dimensions provide 5 to 6% higher accuracy with around a 10 M reduction in FLOPs.
HarmoFL: Harmonizing Local and Global Drifts in Federated Learning on Heterogeneous Medical Images

Multiple medical institutions collaboratively training a model using federated learning (FL) has become a promising solution for maximizing the potential of data-driven models, yet the non-independent and identically distributed (non-iid) data in medical images is still an outstanding challenge in real-world practice. The feature heterogeneity caused by diverse scanners or protocols introduces a drift in the learning process, in both local (client) and global (server) optimizations, which harms the convergence as well as model performance. Many previous works have attempted to address the non-iid issue by tackling the drift locally or globally, but how to jointly solve the two essentially coupled drifts is still unclear. In this work, we concentrate on handling both local and global drifts and introduce a new harmonizing framework called HarmoFL. First, we propose to mitigate the local update drift by normalizing amplitudes of images transformed into the frequency domain to mimic a unified imaging setting, in order to generate a harmonized feature space across local clients. Second, based on harmonized features, we design a client weight perturbation guiding each local model to reach a flat optimum, where a neighborhood area of the local optimal solution has a uniformly low loss. Without any extra communication cost, the perturbation assists the global model to optimize towards a converged optimal solution by aggregating several local flat optima. We have theoretically analyzed the proposed method and empirically conducted extensive experiments on three medical image classification and segmentation tasks, showing that HarmoFL outperforms a set of recent state-of-the-art methods with promising convergence behavior. Code is available at: https://github.com/med-air/HarmoFL
Energy Efficient Local Path Planning Algorithm Based on Predictive Artificial Potential Field

Energy efficiency is one of the most important parameters in transportation electrification. It allows to improve the production rate due to longer operation without charging or decrease the cost related to transportation. To provide collision-free operation in unknown or various environment, the local path planning algorithm should be considered. An Artificial Potential Field (APF) algorithm is commonly used for this task, however it provides unsmooth and oscillating motion of autonomous ground vehicle (AGV), and is prone to being trapped in a local minimum, e.g, dead-end. In such a case, the energy used to achieve the goal position is higher than necessary. In this paper, the energy-efficient local path planning algorithm is proposed. Future movement prediction has been introduced to APF to allow AGV to bypass obstacles in advance. A novel method for local minimum avoidance is introduced. It is based on placement of virtual obstacles called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">top quarks</i> in critical areas. These obstacles provide additional repulsive force for the APF based path planner. Considering the predicted stagnation-free path of the AGV, the new temporary goal for APF is selected. Such a combination allows to reduce traveled route length, improve its smoothness, and bypass local minima. The proposed Predictive Artificial Potential Field (PAPF) algorithm has been examined using Husarion ROSbot 2.0 PRO mobile robot, and the obtained results in form of videos are also attached as supplementary files. In comparison to original APF, the proposed path planning algorithm allows to reduce the used electric power by 21.4 %. PAPF provided a shorter path by up to 8.73 % and shorter time to reach the goal position by up to 40.23 %. The movement of the AGV is also much smoother in a case of usage of the proposed algorithm, and the proposed <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">top quarks</i> -based local minimum avoidance mechanism allows to bypass the local minima.