Reviewerly/exHarmony huggingface dataset:
MonoRUn: Monocular 3D Object Detection by Reconstruction and Uncertainty Propagation

Object localization in 3D space is a challenging aspect in monocular 3D object detection. Recent advances in 6DoF pose estimation have shown that predicting dense 2D-3D correspondence maps between image and object 3D model and then estimating object pose via Perspective-n-Point (PnP) algorithm can achieve remarkable localization accuracy. Yet these methods rely on training with ground truth of object geometry, which is difficult to acquire in real outdoor scenes. To address this issue, we propose MonoRUn, a novel detection framework that learns dense correspondences and geometry in a self-supervised manner, with simple 3D bounding box annotations. To regress the pixel-related 3D object coordinates, we employ a regional reconstruction network with uncertainty awareness. For self-supervised training, the predicted 3D coordinates are projected back to the image plane. A Robust KL loss is proposed to minimize the uncertainty-weighted reprojection error. During testing phase, we exploit the network uncertainty by propagating it through all downstream modules. More specifically, the uncertainty-driven PnP algorithm is leveraged to estimate object pose and its covariance. Extensive experiments demonstrate that our proposed approach outperforms current state-of-the-art methods on KITTI benchmark. <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup>
Bayesian optimization with safety constraints: safe and automatic parameter tuning in robotics

Selecting the right tuning parameters for algorithms is a pravelent problem in machine learning that can significantly affect the performance of algorithms. Data-efficient optimization algorithms, such as Bayesian optimization, have been used to automate this process. During experiments on real-world systems such as robotic platforms these methods can evaluate unsafe parameters that lead to safety-critical system failures and can destroy the system. Recently, a safe Bayesian optimization algorithm, called SafeOpt, has been developed, which guarantees that the performance of the system never falls below a critical value; that is, safety is defined based on the performance function. However, coupling performance and safety is often not desirable in practice, since they are often opposing objectives. In this paper, we present a generalized algorithm that allows for multiple safety constraints separate from the objective. Given an initial set of safe parameters, the algorithm maximizes performance but only evaluates parameters that satisfy safety for all constraints with high probability. To this end, it carefully explores the parameter space by exploiting regularity assumptions in terms of a Gaussian process prior. Moreover, we show how context variables can be used to safely transfer knowledge to new situations and tasks. We provide a theoretical analysis and demonstrate that the proposed algorithm enables fast, automatic, and safe optimization of tuning parameters in experiments on a quadrotor vehicle.
Sequential End-to-end Network for Efficient Person Search

Person search aims at jointly solving Person Detection and Person Re-identification (re-ID). Existing works have designed end-to-end networks based on Faster R-CNN. However, due to the parallel structure of Faster R-CNN, the extracted features come from the low-quality proposals generated by the Region Proposal Network, rather than the detected high-quality bounding boxes. Person search is a fine-grained task and such inferior features will significantly reduce re-ID performance. To address this issue, we propose a Sequential End-to-end Network (SeqNet) to extract superior features. In SeqNet, detection and re-ID are considered as a progressive process and tackled with two sub-networks sequentially. In addition, we design a robust Context Bipartite Graph Matching (CBGM) algorithm to effectively employ context information as an important complementary cue for person matching. Extensive experiments on two widely used person search benchmarks, CUHK-SYSU and PRW, have shown that our method achieves state-of-the-art results. Also, our model runs at 11.5 fps on a single GPU and can be integrated into the existing end-to-end framework easily.
Fast convolutional neural networks on FPGAs with hls4ml

Abstract We introduce an automated tool for deploying ultra low-latency, low-power deep neural networks with convolutional layers on field-programmable gate arrays (FPGAs). By extending the hls4ml library, we demonstrate an inference latency of 5 µ s using convolutional architectures, targeting microsecond latency applications like those at the CERN Large Hadron Collider. Considering benchmark models trained on the Street View House Numbers Dataset, we demonstrate various methods for model compression in order to fit the computational constraints of a typical FPGA device used in trigger and data acquisition systems of particle detectors. In particular, we discuss pruning and quantization-aware training, and demonstrate how resource utilization can be significantly reduced with little to no loss in model accuracy. We show that the FPGA critical resource consumption can be reduced by 97% with zero loss in model accuracy, and by 99% when tolerating a 6% accuracy degradation.
A Two-branch Neural Network for Non-homogeneous Dehazing via Ensemble Learning

Recently, there has been rapid and significant progress on image dehazing. Many deep learning based methods have shown their superb performance in handling homogeneous dehazing problems. However, we observe that even if a carefully designed convolutional neural network (CNN) can perform well on large-scaled dehazing benchmarks, the network usually fails on the non-homogeneous dehazing datasets introduced by NTIRE challenges. The reasons are mainly in two folds. Firstly, due to its non-homogeneous nature, the non-uniformly distributed haze is harder to be removed than the homogeneous haze. Secondly, the research challenge only provides limited data (there are only 25 training pairs in NH-Haze 2021 dataset). Thus, learning the mapping from the domain of hazy images to that of clear ones based on very limited data is extremely hard. To this end, we propose a simple but effective approach for non-homogeneous dehazing via ensemble learning. To be specific, we introduce a two-branch neural network to separately deal with the aforementioned problems and then map their distinct features by a learnable fusion tail. We show extensive experimental results to illustrate the effectiveness of our proposed method. The source code is available at https://github.com/liuh127/Two-branch-dehazing.
Domain Consensus Clustering for Universal Domain Adaptation

In this paper, we investigate Universal Domain Adaptation (UniDA) problem, which aims to transfer the knowledge from source to target under unaligned label space. The main challenge of UniDA lies in how to separate common classes (i.e., classes shared across domains), from private classes (i.e., classes only exist in one domain). Previous works treat the private samples in the target as one generic class but ignore their intrinsic structure. Consequently, the resulting representations are not compact enough in the latent space and can be easily confused with common samples. To better exploit the intrinsic structure of the target domain, we propose Domain Consensus Clustering (DCC), which exploits the domain consensus knowledge to discover discriminative clusters on both common samples and private ones. Specifically, we draw the domain consensus knowledge from two aspects to facilitate the clustering and the private class discovery, i.e., the semantic-level consensus, which identifies the cycle-consistent clusters as the common classes, and the sample-level consensus, which utilizes the cross-domain classification agreement to determine the number of clusters and discover the private classes. Based on DCC, we are able to separate the private classes from the common ones, and differentiate the private classes themselves. Finally, we apply a class-aware alignment technique on identified common samples to minimize the distribution shift, and a prototypical regularizer to inspire discriminative target clusters. Experiments on four benchmarks demonstrate DCC significantly outperforms previous state-of-the-arts.
Towards High Performance Human Keypoint Detection

Human keypoint detection from a single image is very challenging due to occlusion, blur, illumination, and scale variance. In this paper, we address this problem from three aspects by devising an efficient network structure, proposing three effective training strategies, and exploiting four useful postprocessing techniques. First, we find that context information plays an important role in reasoning human body configuration and invisible keypoints. Inspired by this, we propose a cascaded context mixer (CCM), which efficiently integrates spatial and channel context information and progressively refines them. Then, to maximize CCM’s representation capability, we develop a hard-negative person detection mining strategy and a joint-training strategy by exploiting abundant unlabeled data. It enables CCM to learn discriminative features from massive diverse poses. Third, we present several sub-pixel refinement techniques for postprocessing keypoint predictions to improve detection accuracy. Extensive experiments on the MS COCO keypoint detection benchmark demonstrate the superiority of the proposed method over representative state-of-the-art (SOTA) methods. Our single model achieves comparable performance with the winner of the 2018 COCO Keypoint Detection Challenge. The final ensemble model sets a new SOTA on this benchmark. The source code will be released at https://github.com/chaimi2013/CCM .
Benchmarking Representation Learning for Natural World Image Collections

Recent progress in self-supervised learning has resulted in models that are capable of extracting rich representations from image collections without requiring any explicit label supervision. However, to date the vast majority of these approaches have restricted themselves to training on standard benchmark datasets such as ImageNet. We argue that fine-grained visual categorization problems, such as plant and animal species classification, provide an informative testbed for self-supervised learning. In order to facilitate progress in this area we present two new natural world visual classification datasets, iNat2021 and NeWT. The former consists of 2.7M images from 10k different species up-loaded by users of the citizen science application iNaturalist. We designed the latter, NeWT, in collaboration with domain experts with the aim of benchmarking the performance of representation learning algorithms on a suite of challenging natural world binary classification tasks that go beyond standard species classification. These two new datasets allow us to explore questions related to large-scale representation and transfer learning in the context of fine-grained categories. We provide a comprehensive analysis of feature extractors trained with and without supervision on ImageNet and iNat2021, shedding light on the strengths and weaknesses of different learned features across a diverse set of tasks. We find that features produced by standard supervised methods still outperform those produced by self-supervised approaches such as SimCLR. However, improved self-supervised learning methods are constantly being released and the iNat2021 and NeWT datasets are a valuable resource for tracking their progress.
A DEMATEL analysis of smart city determinants

Substantial population growth, increasing urbanization, overloaded infrastructure, more energy consumption, environmental impacts, and investment in technological developments are major challenges in city management and development. Municipalities seek to improve their citizens' wellbeing and quality of life, but the need to find a balance between these complex factors makes decision-making processes more difficult. Experts must analyze the determinants of smart cities, which are urban centers intended to be socially involved, habitable, and economically and environmentally sustainable, and that rely strongly on technology and innovation. Based on multiple-criteria decision analysis (MCDA) principles, this study combines cognitive mapping techniques and the decision-making trial and evaluation laboratory (DEMATEL) method to develop a multicriteria model that can help managers analyze smart city determinants in a collaborative manner. The research included identifying these determinants and their respective cause-and-effect relationships using an expert panel's experience and knowledge related to the subject under analysis. The results were validated by both the panel and the city councilor responsible for mobility and municipal projects within Évora City Council, Portugal, which has implemented smart city strategies. The latter specialist verified that the proposed evaluation system can be used as a tool to facilitate smart city collaborative decision-making processes. The study's main advantages and limitations are also analyzed and discussed.
Understanding service attributes of robot hotels: A sentiment analysis of customer online reviews

Robots and artificial intelligence are essential to the future of the hospitality industry, and they are receiving increasing interest from hotel managers and researchers. However, the adoption of robotic services in hotel operations is a challenging task owing to the current level of technology and lack of understanding on the relationship between various aspects of robotic services and customer satisfaction. Moreover, no prior study has examined the service attributes of robots in hotels. To fill these gaps, this study analyzes customers’ sentiments on major hotels employing robotic services expressed through online reviews. A list of robot quality and operational area attributes is first constructed, through which underperforming robot service areas are identified. Sentiments on robotic services have a positive correlation with hotel service satisfaction, which plays an important role in determining the overall satisfaction of customers. The analysis and findings are valuable to researchers and managers for future research and adoption of robotic services in hotels.
Fast Strategies for the Implementation of SIKE Round 3 on ARM Cortex-M4

The Supersingular Isogeny Key Encapsulation mechanism (SIKE) is the only post-quantum key encapsulation protocol based on elliptic curves and isogeny maps between them. Despite the quantum security of the protocol, SIKE requires a greater number of clock cycles and hence does not provide competitive timing and energy consumption results. However, it is more attractive offering the smallest public key as well as ciphertext sizes, which considering the impact of the communication costs and storage of the keys could become a good fit for resource-constrained devices. In this work, we present the fastest practical implementation of SIKE, targeting the platform Cortex-M4 based on the ARMv7-M architecture. We performed our measurements on the STM32F407VG microcontroller for benchmarking the clock cycles and on Nucleo-F411RE attached to X-NUCLEO-LPM01A (Power Shield) for measuring the energy consumption of the protocol. The low-level finite field arithmetic operations play main role in determining the efficiency of SIKE. Therefore, we mainly focus on their optimization and apply them to all NIST-required security levels. Our SIKEp434 implementation for NIST security level 1 is about 22.97% faster than the counterparts appeared in Seo <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> (2020), where for the SIKEp503, SIKEp610 and SIKEp751 the speedup reaches 21.10%, 19.21% and 19.08%. Finally, we benchmark energy consumption and report optimization of up to 11.9% depending on the NIST security level implementation.
Evolutionary Multitasking for Feature Selection in High-Dimensional Classification via Particle Swarm Optimization

Feature selection (FS) is an important preprocessing technique for improving the quality of feature sets in many practical applications. Particle swarm optimization (PSO) has been widely used for FS due to being efficient and easy to implement. However, when dealing with high-dimensional data, most of the existing PSO-based FS approaches face the problems of falling into local optima and high-computational cost. Evolutionary multitasking is an effective paradigm to enhance global search capability and accelerate convergence by knowledge transfer among related tasks. Inspired by evolutionary multitasking, this article proposes a multitasking PSO approach for high-dimensional FS. The approach converts a high-dimensional FS task into several related low-dimensional FS tasks, then finds an optimal feature subset by knowledge transfer between these low-dimensional FS tasks. Specifically, a novel task generation strategy based on the importance of features is developed, which can generate highly related tasks from a dataset adaptively. In addition, a new knowledge transfer mechanism is presented, which can effectively implement positive knowledge transfer among related tasks. The results demonstrate that the proposed method can evolve a feature subset with higher classification accuracy in a shorter time than other state-of-the-art FS methods on high-dimensional classification.
Pedestrian attribute recognition: A survey

Pedestrian Attribute Recognition (PAR) is an important task in computer vision community and plays an important role in practical video surveillance. The goal of this paper is to review existing works using traditional methods or based on deep learning networks. Firstly, we introduce the background of pedestrian attribute recognition, including the fundamental concepts and formulation of pedestrian attributes and corresponding challenges. Secondly, we analyze popular solutions for this task from eight perspectives. Thirdly, we discuss the specific attribute recognition, then, give a comparison between deep learning and traditional algorithm based PAR methods. After that, we show the connections between PAR and other computer vision tasks. Fourthly, we introduce the benchmark datasets, evaluation metrics in this community, and give a brief performance comparison. Finally, we summarize this paper and give several possible research directions for PAR. The project page of this paper can be found at: https://sites.google.com/view/ahu-pedestrianattributes/.
Recurrent Mask Refinement for Few-Shot Medical Image Segmentation

Although having achieved great success in medical image segmentation, deep convolutional neural networks usually require a large dataset with manual annotations for training and are difficult to generalize to unseen classes. Few-shot learning has the potential to address these challenges by learning new classes from only a few labeled examples. In this work, we propose a new framework for few-shot medical image segmentation based on prototypical networks. Our innovation lies in the design of two key modules: 1) a context relation encoder (CRE) that uses correlation to capture local relation features between foreground and background regions; and 2) a recurrent mask refinement module that repeatedly uses the CRE and a prototypical network to recapture the change of context relationship and refine the segmentation mask iteratively. Experiments on two abdomen CT datasets and an abdomen MRI dataset show the proposed method obtains substantial improvement over the state-of-the-art methods by an average of 16.32%, 8.45% and 6.24% in terms of DSC, respectively. Code is publicly available <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> .
SHADE–WOA: A metaheuristic algorithm for global optimization

Differential evolution and its variants have already proven their worth in the field of evolutionary optimization techniques. This study further enhances the success history-based adaptive differential evolution (SHADE) by hybridizing it with a modified Whale optimization algorithm (WOA). In the new algorithm, the two algorithms, SHADE and modified WOA, carry out the search process independently and share information like the global best solution and whole population and thus guides both the algorithms to explore and exploit new promising areas in the search space. It also reduces the chance of being trapped in local optima and stagnation. The proposed algorithm (SHADE–WOA) is tested, evaluating CEC 2017 functions using dimensions 30, 50, and 100. The results are compared with modified DE algorithms, namely SaDE, SHADE, LSHADE, LSHADE-SPACMA, and LSHADE-cnEpSin, also with modified WOA algorithms, namely ACWOA, AWOA, IWOA, HIWOA, and MCSWOA. The new algorithm’s efficiency in solving real-world problems is examined by solving two unconstrained and four constrained engineering design problems. The performance is verified statistically using non-parametric statistical tests like Friedman’s test and Wilcoxon’s test. Analysis of numerical results, convergence analysis, diversity analysis, and statistical analysis ensures the enhanced performance of the proposed SHADE–WOA.
Secure-Enhanced Federated Learning for AI-Empowered Electric Vehicle Energy Prediction

Although AI-empowered schemes bring some sound solutions to stimulate more reasonable energy distribution schemes between charging stations (CSs) and CS providers, frequent data sharing between them is possible to incur many security and privacy breaches. To solve these problems, federated learning (FL) is an ideal solution that only requires CSs to upload local models instead of detailed data. Although the CSs’ electricity consumption need not to be exposed to the server directly, FL-based schemes still have been excavated several security threats such as information exploiting attacks, data poisoning attacks, model poisoning attacks, and free-riding attacks. Hence, in this article, both the effectiveness of energy management and the potential risks of FL for electric vehicle infrastructures (EVIs) are considered, we propose a lightweight authentication FL-based energy demand prediction for EVIs with premium-penalty mechanism. Security analysis and performance evaluation prove that our proposed framework can generate an accurate electricity demand prediction framework to defend multiple FL attacks for EVIs.
ParsBERT: Transformer-based Model for Persian Language Understanding

The surge of pre-trained language models has begun a new era in the field of Natural Language Processing (NLP) by allowing us to build powerful language models. Among these models, Transformer-based models such as BERT have become increasingly popular due to their state-of-the-art performance. However, these models are usually focused on English, leaving other languages to multilingual models with limited resources. This paper proposes a monolingual BERT for the Persian language (ParsBERT), which shows its state-of-the-art performance compared to other architectures and multilingual models. Also, since the amount of data available for NLP tasks in Persian is very restricted, a massive dataset for different NLP tasks as well as pre-training the model is composed. ParsBERT obtains higher scores in all datasets, including existing ones as well as composed ones and improves the state-of-the-art performance by outperforming both multilingual BERT and other prior works in Sentiment Analysis, Text Classification and Named Entity Recognition tasks.