Reviewerly/exHarmony huggingface dataset:
Improved Whale Optimization Algorithm Based on Nonlinear Adaptive Weight and Golden Sine Operator

Whale optimization algorithm (WOA) is a swarm intelligence-based algorithm that simulates whale population predation in the sea.Aiming at the shortcomings of WOA such as low precision and slow convergence speed, an improved whale optimization algorithm based on nonlinear adaptive weight and golden sine operator (NGS-WOA) was proposed.NGS-WOA first introduced a non-linear adaptive weigh so that search agents can adaptively explore the search space, and balance the development and exploration stages.Secondly, the improved golden sine operator is incorporated into the WOA.Due to the special relationship between the sine function and the unit circle, traversing the sine function is equivalent to scanning the unit circle.The search agent performs an efficient search with a sine route so as to improve the convergence speed and global exploration capability of the algorithm.At the same time, the addition of the golden section coefficient allows search agents to exploit with a fixed shrink step.The search agent can develop to areas with excellent results, which improves the optimization accuracy and local exploitation ability of the algorithm.In the simulation experiments, the gold sine algorithm (GoldSA), whale optimization algorithm (WOA), particle swarm optimization (PSO) algorithm, firefly algorithm (FA), fireworks algorithm (FWA), sine cosine algorithm (SCA) and NGS-WOA were selected for comparison experiments.Then, the effectiveness of the proposed improved strategies is verified.Finally, the improved WOA is applied to high-dimensional optimization and engineering optimization problems.The experimental results show that the improved strategy can effectively improve the performance of the algorithm, so that NGS-WOA has the advantages of high global convergence and avoiding falling into local optimal values.
The Benefits of the Matthews Correlation Coefficient (MCC) Over the Diagnostic Odds Ratio (DOR) in Binary Classification Assessment

To assess the quality of a binary classification, researchers often take advantage of a four-entry contingency table called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">confusion matrix</i> , containing true positives, true negatives, false positives, and false negatives. To recap the four values of a confusion matrix in a unique score, researchers and statisticians have developed several rates and metrics. In the past, several scientific studies already showed why the Matthews correlation coefficient (MCC) is more informative and trustworthy than confusion-entropy error, accuracy, F <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> score, bookmaker informedness, markedness, and balanced accuracy. In this study, we compare the MCC with the diagnostic odds ratio (DOR), a statistical rate employed sometimes in biomedical sciences. After examining the properties of the MCC and of the DOR, we describe the relationships between them, by also taking advantage of an innovative geometrical plot called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">confusion tetrahedron</i> , presented here for the first time. We then report some use cases where the MCC and the DOR produce discordant outcomes, and explain why the Matthews correlation coefficient is more informative and reliable between the two. Our results can have a strong impact in computer science and statistics, because they clearly explain why the trustworthiness of the information provided by the Matthews correlation coefficient is higher than the one generated by the diagnostic odds ratio.
CFN: A Complex-Valued Fuzzy Network for Sarcasm Detection in Conversations

Sarcasm detection in conversation, a theoretically and practically challenging artificial intelligence task, aims to discover elusively ironic, contemptuous, and metaphoric information implied in daily conversations. Most of the recent approaches in sarcasm detection have neglected the intrinsic vagueness and uncertainty of human language in emotional expression and understanding. To address this gap, we propose a complex-valued fuzzy network by leveraging the mathematical formalisms of quantum theory and fuzzy logic. In particular, the target utterance to be recognized is considered as a quantum superposition of a set of separate words. The contextual interaction between adjacent utterances is described as the interaction between a quantum system and its surrounding environment, constructing the quantum composite system, where the weight of interaction is determined by a fuzzy membership function. In order to model both the vagueness and uncertainty, the aforementioned superposition and composite systems are mathematically encapsulated in a density matrix. Finally, a quantum fuzzy measurement is performed on the density matrix of each utterance to yield the probabilistic outcomes of sarcasm recognition. Extensive experiments are conducted on the MUStARD and the 2020 sarcasm detection Reddit track datasets, and the results show that our model outperforms a wide range of strong baselines.
Night-Time Scene Parsing With a Large Real Dataset

Although huge progress has been made on scene analysis in recent years, most existing works assume the input images to be in day-time with good lighting conditions. In this work, we aim to address the night-time scene parsing (NTSP) problem, which has two main challenges: 1) labeled night-time data are scarce, and 2) over- and under-exposures may co-occur in the input night-time images and are not explicitly modeled in existing pipelines. To tackle the scarcity of night-time data, we collect a novel labeled dataset, named NightCity, of 4,297 real night-time images with ground truth pixel-level semantic annotations. To our knowledge, NightCity is the largest dataset for NTSP. In addition, we also propose an exposure-aware framework to address the NTSP problem through augmenting the segmentation process with explicitly learned exposure features. Extensive experiments show that training on NightCity can significantly improve NTSP performances and that our exposure-aware model outperforms the state-of-the-art methods, yielding top performances on our dataset as well as existing datasets.
An optimized deep learning architecture for breast cancer diagnosis based on improved marine predators algorithm

Abstract Breast cancer is the second leading cause of death in women; therefore, effective early detection of this cancer can reduce its mortality rate. Breast cancer detection and classification in the early phases of development may allow for optimal therapy. Convolutional neural networks (CNNs) have enhanced tumor detection and classification efficiency in medical imaging compared to traditional approaches. This paper proposes a novel classification model for breast cancer diagnosis based on a hybridized CNN and an improved optimization algorithm, along with transfer learning, to help radiologists detect abnormalities efficiently. The marine predators algorithm (MPA) is the optimization algorithm we used, and we improve it using the opposition-based learning strategy to cope with the implied weaknesses of the original MPA. The improved marine predators algorithm (IMPA) is used to find the best values for the hyperparameters of the CNN architecture. The proposed method uses a pretrained CNN model called ResNet50 (residual network). This model is hybridized with the IMPA algorithm, resulting in an architecture called IMPA-ResNet50. Our evaluation is performed on two mammographic datasets, the mammographic image analysis society (MIAS) and curated breast imaging subset of DDSM (CBIS-DDSM) datasets. The proposed model was compared with other state-of-the-art approaches. The obtained results showed that the proposed model outperforms the compared state-of-the-art approaches, which are beneficial to classification performance, achieving 98.32% accuracy, 98.56% sensitivity, and 98.68% specificity on the CBIS-DDSM dataset and 98.88% accuracy, 97.61% sensitivity, and 98.40% specificity on the MIAS dataset. To evaluate the performance of IMPA in finding the optimal values for the hyperparameters of ResNet50 architecture, it compared to four other optimization algorithms including gravitational search algorithm (GSA), Harris hawks optimization (HHO), whale optimization algorithm (WOA), and the original MPA algorithm. The counterparts algorithms are also hybrid with the ResNet50 architecture produce models named GSA-ResNet50, HHO-ResNet50, WOA-ResNet50, and MPA-ResNet50, respectively. The results indicated that the proposed IMPA-ResNet50 is achieved a better performance than other counterparts.
More than a Feeling: Accuracy and Application of Sentiment Analysis

Sentiment is fundamental to human communication. Countless marketing applications mine opinions from social media communication, news articles, customer feedback, or corporate communication. Various sentiment analysis methods are available and new ones have recently been proposed. Lexicons can relate individual words and expressions to sentiment scores. In contrast, machine learning methods are more complex to interpret, but promise higher accuracy, i.e., fewer false classifications. We propose an empirical framework and quantify these trade-offs for different types of research questions, data characteristics, and analytical resources to enable informed method decisions contingent on the application context. Based on a meta-analysis of 272 datasets and 12 million sentiment-labeled text documents, we find that the recently proposed transfer learning models indeed perform best, but can perform worse than popular leaderboard benchmarks suggest. We quantify the accuracy-interpretability trade-off, showing that, compared to widely established lexicons, transfer learning models on average classify more than 20 percentage points more documents correctly. To form realistic performance expectations, additional context variables, most importantly the desired number of sentiment classes and the text length, should be taken into account. We provide a pre-trained sentiment analysis model (called SiEBERT) with open-source scripts that can be applied as easily as an off-the-shelf lexicon.
Survey On Recognition Hand Gesture By Using Data Mining Algorithms

We investigated the usage of hand motion recognition using data mining approaches. In gesture detection applications, I've discovered that employing data mining to recognize hand motions has several advantages. To begin, we employ data mining to recognize bandwidth hand motions. Second, we have a high temporal resolution, which is great for data mining. A short-range, close-pulse broadcast signal is required in most cases. The frequency components of the data mining for hand gesture recognition are the same as the pulse, but the phase components are different. Our vision must be strong enough to differentiate a far hand from distant things. Data mining is equal to recognizing hand motions by heart rate divided by length in these categorized articles. Obtaining significant power for a brief period.
Recent advances on image edge detection: A comprehensive review

Edge detection is one of the most important and fundamental problems in the field of computer vision and image processing. Edge contours extracted from images are widely used as critical cues for various image understanding tasks such as image segmentation, object detection, image retrieval, and corner detection. The purpose of this paper is to review the latest developments on image edge detection. Firstly, the definition and properties of edges are introduced. Secondly, the existing edge detection methods are classified and introduced in detail. Thirdly, the existing widely used datasets and evaluation criteria for edge detection methods are summarized. Finally, future research directions for edge detection are elaborated.
Augmented Reality and Artificial Intelligence in industry: Trends, tools, and future challenges

Augmented Reality (AR) is an augmented depiction of reality formed by overlaying digital information on an image of objects being seen through a device. Artificial Intelligence (AI) techniques have experienced unprecedented growth and are being applied in various industries. The combination of AR and AI is the next prominent direction in upcoming years with many industries and academia recognizing the importance of their adoption. With the advancements in the silicone industry that push the boundaries of Moore’s law, processors will be less expensive, more efficient, and power-optimized in the forthcoming years. This is a tremendous support and necessity for an AR boom, and with the help of AI, there is an excellent potential for smart industries to increase the production speed and workforce training along with improved manufacturing, error handling, assembly, and packaging. In this work, we provide a systematic review of recent advances, tools, techniques, and platforms of AI-empowered AR along with the challenges of using AI in AR applications. This paper will serve as a guideline for future research in the domain of AI-assisted AR in industrial applications.
A Novel 3D Chaotic System With Line Equilibrium: Multistability, Integral Sliding Mode Control, Electronic Circuit, FPGA Implementation and Its Image Encryption

This paper announces a novel three-dimensional chaotic system with line equilibrium and discusses its dynamic properties such as Lyapunov exponents, phase portraits, equilibrium points, bifurcation diagram, multistability and coexisting attractors. New synchronization results based on integral sliding mode control (ISMC) are also derived for the new chaotic system with line equilibrium. In addition, an electronic circuit implementation of the new chaotic system with line equilibrium is reported and a good qualitative agreement is exhibited between the MATLAB simulations of the theoretical model and the MultiSim results. We also display the implementation of the Field-Programmable Gate Array (FPGA) based Pseudo-Random Number Generator (PRNG) by using the new chaotic system. The throughput of the proposed FPGA based new chaotic PRNG is 462.731 Mbps. Randomness analysis of the generated numbers has been performed with respect to the NIST-800-22 tests and they have successfully passed all of the tests. Finally, an image encryption algorithm based on the pixel-level scrambling, bit-level scrambling, and pixel value diffusion is proposed. The experimental results show that the encryption algorithm not only shuffles the pixel positions of the image, but also replaces the pixel values with different values, which can effectively resist various attacks such as brute force attack and differential attack.
Category Contrast for Unsupervised Domain Adaptation in Visual Tasks

Instance contrast for unsupervised representation learning has achieved great success in recent years. In this work, we explore the idea of instance contrastive learning in unsupervised domain adaptation (UDA) and propose a novel Category Contrast technique (CaCo) that introduces semantic priors on top of instance discrimination for visual UDA tasks. By considering instance contrastive learning as a dictionary look-up operation, we construct a semantics-aware dictionary with samples from both source and target domains where each target sample is assigned a (pseudo) category label based on the category priors of source samples. This allows category contrastive learning (between target queries and the category-level dictionary) for category-discriminative yet domain-invariant feature representations: samples of the same category (from either source or target domain) are pulled closer while those of different categories are pushed apart simultaneously. Extensive UDA experiments in multiple visual tasks (e.g., segmentation, classification and detection) show that CaCo achieves superior performance as compared with state-of-the-art methods. The experiments also demonstrate that CaCo is complementary to existing UDA methods and gen-eralizable to other learning setups such as unsupervised model adaptation, open-/partial-set adaptation etc.
An improved whale optimization algorithm based on multi-population evolution for global optimization and engineering design problems

• The population is divided into three sub-populations. • A novel population evolution strategy is introduced to improve the basic WOA. • The proposed algorithm (MEWOA) has high solution accuracy and converges fast. • CEC 2019 test suite and 30 benchmark functions are used to test MEWOA. • MEWOA is applied to four engineering design problems. The whale optimization algorithm (WOA) tends to suffer from slow convergence speed and quickly falling into the local optimum. To alleviate these drawbacks, a WOA variant is proposed based on multi-population evolution (MEWOA) to better solve these problems. Firstly, individuals are classified into three equal-sized sub-populations: exploratory sub-population, exploitative sub-population, and modest sub-population, according to their fitness. Secondly, the moving strategies of each sub-population are assigned using different mechanisms. The exploratory and exploitative sub-populations perform global and local search, respectively, while the modest sub-population randomly explores or exploits the search space. Finally, we introduce a novel population evolution strategy to help MEWOA improve its global optimization ability and avoid local optimum. MEWOA is compared with five state-of-the-art WOA variants and seven basic metaheuristic algorithms over 30 benchmark functions with dimensions of 100, 500, 1000, and 2000 respectively. It is observed that MEWOA achieves faster convergence speed, shows shorter runtime, and provides higher solution accuracy than other algorithms on the majority of benchmark functions. In addition, we tested MEWOA's ability to solve challenging real-world and constrained optimization problems on the CEC 2019 test suite and four engineering design problems. The experimental results demonstrate the competitiveness and merits of the proposed MEWOA algorithm.
VQGAN-CLIP: Open Domain Image Generation and Editing with Natural Language Guidance

Generating and editing images from open domain text prompts is a challenging task that heretofore has required expensive and specially trained models. We demonstrate a novel methodology for both tasks which is capable of producing images of high visual quality from text prompts of significant semantic complexity without any training by using a multimodal encoder to guide image generations. We demonstrate on a variety of tasks how using CLIP [37] to guide VQGAN [11] produces higher visual quality outputs than prior, less flexible approaches like minDALL-E [19], GLIDE [33] and Open-Edit [24], despite not being trained for the tasks presented. Our code is available in a public repository .
ActionFormer: Localizing Moments of Actions with Transformers

Self-attention based Transformer models have demonstrated impressive results for image classification and object detection, and more recently for video understanding. Inspired by this success, we investigate the application of Transformer networks for temporal action localization in videos. To this end, we present ActionFormer—a simple yet powerful model to identify actions in time and recognize their categories in a single shot, without using action proposals or relying on pre-defined anchor windows. ActionFormer combines a multiscale feature representation with local self-attention, and uses a light-weighted decoder to classify every moment in time and estimate the corresponding action boundaries. We show that this orchestrated design results in major improvements upon prior works. Without bells and whistles, ActionFormer achieves 71.0% mAP at tIoU = 0.5 on THUMOS14, outperforming the best prior model by 14.1 absolute percentage points. Further, ActionFormer demonstrates strong results on ActivityNet 1.3 (36.6% average mAP) and EPIC-Kitchens 100 (+13.5% average mAP over prior works). Our code is available at https://github.com/happyharrycn/actionformer_release .
Class Re-Activation Maps for Weakly-Supervised Semantic Segmentation

Extracting class activation maps (CAM) is arguably the most standard step of generating pseudo masks for weakly-supervised semantic segmentation (WSSS). Yet, we find that the crux of the unsatisfactory pseudo masks is the binary crossentropy loss (BCE) widely used in CAM. Specifically, due to the sum-over-class pooling nature of BCE, each pixel in CAM may be responsive to multiple classes co-occurring in the same receptive field. As a result, given a class, its hot CAM pixels may wrongly invade the area belonging to other classes, or the non-hot ones may be actually a part of the class. To this end, we introduce an embarrassingly simple yet surprisingly effective method: Reactivating the converged CAM with BCE by using softmax crossentropy loss (SCE), dubbed ReCAM. Given an image, we use CAM to extract the feature pixels of each single class, and use them with the class label to learn another fully-connected layer (after the backbone) with SCE. Once converged, we extract ReCAM in the same way as in CAM. Thanks to the contrastive nature of SCE, the pixel response is disentangled into different classes and hence less mask ambiguity is expected. The evaluation on both PASCAL VOC and MS COCO shows that ReCAM not only generates high-quality masks, but also supports plug-and-play in any CAM variant with little overhead. Our code is public at https://github.com/zhaozhengChenIReCAM.
Targeted Supervised Contrastive Learning for Long-Tailed Recognition

Real-world data often exhibits long tail distributions with heavy class imbalance, where the majority classes can dominate the training process and alter the decision bound-aries of the minority classes. Recently, researchers have in-vestigated the potential of supervised contrastive learning for long-tailed recognition, and demonstrated that it provides a strong performance gain. In this paper, we show that while supervised contrastive learning can help improve performance, past baselines suffer from poor uniformity brought in by imbalanced data distribution. This poor uni-formity manifests in samples from the minority class having poor separability in the feature space. To address this problem, we propose targeted supervised contrastive learning (TSC), which improves the uniformity of the feature distribution on the hypersphere. TSC first generates a set of targets uniformly distributed on a hypersphere. It then makes the features of different classes converge to these distinct and uniformly distributed targets during training. This forces all classes, including minority classes, to main-tain a uniform distribution in the feature space, improves class boundaries, and provides better generalization even in the presence of long-tail data. Experiments on multi-ple datasets show that TSC achieves state-of-the-art performance on long-tailed recognition tasks.