Reviewerly/exHarmony huggingface dataset:
Object Detection and Tracking Using Yolo

Artificial Intelligence is being adapted by the world since past few years and deep learning played a crucial role in it. This paper focuses on deep learning and how it is applied to detect and track the objects. Deep learning works with the algorithms influenced by the layout and functionalities of the brain. The advantage of working with such algorithms is that the performance increases with increase in data which isn't the case for traditional learning algorithms whose performance stabilizes even with increase in the amount data. Real time object tracking has been at the forefront of some of the most sought out research topics in computer vision applications. Regardless of the tremendous progress made in this area, effectiveness and fidelity of accuracy in tracking the objects in real time at a substantial level still remains a grave challenge. Detection and tracking algorithms are specified in terms of extricating the features of images and videos for security and scrutiny applications. Popular algorithms of object detection include You Only Look Once (YOLO), Region-based Convolutional Neural Networks (RCNN), Faster RCNN (F-RCNN). RCNN has better accuracy compared to other algorithms but YOLO surpasses when speed is considered over accuracy. In YOLO, Object detection is implemented as a regression problem and class probabilities are provided for detected images.
Distribution-free, Risk-controlling Prediction Sets

While improving prediction accuracy has been the focus of machine learning in recent years, this alone does not suffice for reliable decision-making. Deploying learning systems in consequential settings also requires calibrating and communicating the uncertainty of predictions. To convey instance-wise uncertainty for prediction tasks, we show how to generate set-valued predictions from a black-box predictor that controls the expected loss on future test points at a user-specified level. Our approach provides explicit finite-sample guarantees for any dataset by using a holdout set to calibrate the size of the prediction sets. This framework enables simple, distribution-free, rigorous error control for many tasks, and we demonstrate it in five large-scale machine learning problems: (1) classification problems where some mistakes are more costly than others; (2) multi-label classification, where each observation has multiple associated labels; (3) classification problems where the labels have a hierarchical structure; (4) image segmentation, where we wish to predict a set of pixels containing an object of interest; and (5) protein structure prediction. Last, we discuss extensions to uncertainty quantification for ranking, metric learning, and distributionally robust learning.
Temporal-resolution cascade model for separation of 1-min beam and diffuse irradiance

The procedure for splitting beam and diffuse components from the global radiation is known as separation modeling. Since the separation of irradiance components is required in a range of solar applications, hundreds of models with various complexities have been proposed in the literature. In this work, a new modeling philosophy, called the temporal-resolution cascade (TRC), is presented. The working principle of TRC models is to use low-resolution diffuse fraction estimates as input of a 1-min model. Based on a preliminary study, using two years (2019–2020) of data from seven locations, it is found that the TRC models are able to outperform most, if not all, existing separation models. All code and data are released for reproducibility.
Trusting the trust machine: Evaluating trust signals of blockchain applications

Information systems research emphasizes that blockchain requires trust in the technology itself. However, we lack knowledge on the applicability of established trust cues to blockchain technology. Thus, this paper’s objective is to empirically evaluate the effectiveness of several established IS trust formation factors on end user trust. We do so by conducting a between-groups experiment. While we can validate the applicability of previous IS trust research for blockchain technology to some extent, we find that trust signals emphasizing the technology’s underlying trust-building characteristics are most effective. Hence, we highlight the need for contextualization of trust research on blockchain technology. We provide both researchers and practitioners with insights for building trustworthy blockchain applications that enable trust-less interactions not only in theory but in practice.
Text is Text, No Matter What: Unifying Text Recognition using Knowledge Distillation

Text recognition remains a fundamental and extensively researched topic in computer vision, largely owing to its wide array of commercial applications. The challenging nature of the very problem however dictated a fragmentation of research efforts: Scene Text Recognition (STR) that deals with text in everyday scenes, and Handwriting Text Recognition (HTR) that tackles hand-written text. In this paper, for the first time, we argue for their unification – we aim for a single model that can compete favourably with two separate state-of-the-art STR and HTR models. We first show that cross-utilisation of STR and HTR models trigger significant performance drops due to differences in their inherent challenges. We then tackle their union by introducing a knowledge distillation (KD) based framework. This however is non-trivial, largely due to the variable-length and sequential nature of text sequences, which renders off-the-shelf KD techniques that mostly work with global fixed length data, inadequate. For that, we propose four distillation losses, all of which are specifically designed to cope with the aforementioned unique characteristics of text recognition. Empirical evidence suggests that our proposed unified model performs at par with individual models, even surpassing them in certain cases. Ablative studies demonstrate that naive baselines such as a two-stage framework, multi-task and domain adaption/generalisation alternatives do not work that well, further authenticating our design.
Unbalanced Incomplete Multi-View Clustering Via the Scheme of View Evolution: Weak Views are Meat; Strong Views Do Eat

Incomplete multi-view clustering is an important technique to deal with real-world incomplete multi-view data. Previous works assume that all views have the same incompleteness, i.e., balanced incompleteness. However, different views often have distinct incompleteness, i.e., unbalanced incompleteness, which results in strong views (low-incompleteness views) and weak views (high-incompleteness views). The unbalanced incompleteness prevents us from directly using the previous methods for clustering. In this paper, inspired by the effective biological evolution theory, we design the novel scheme of view evolution to cluster strong and weak views. Moreover, we propose an Unbalanced Incomplete Multi-view Clustering method (UIMC), which is the first effective method based on view evolution for unbalanced incomplete multi-view clustering. Compared with previous methods, UIMC has two unique advantages: 1) it proposes weighted multi-view subspace clustering to integrate these unbalanced incomplete views, which effectively solves the unbalanced incomplete multi-view problem; 2) it designs the low-rank and robust representation to recover the data, which diminishes the impact of the incompleteness and noises. Extensive experimental results demonstrate that UIMC improves the clustering performance by up to 40% on three evaluation metrics over other state-of-the-art methods.
Blind color deconvolution, normalization, and classification of histological images using general super Gaussian priors and Bayesian inference

Color variations in digital histopathology severely impact the performance of computer-aided diagnosis systems. They are due to differences in the staining process and acquisition system, among other reasons. Blind color deconvolution techniques separate multi-stained images into single stained bands which, once normalized, can be used to eliminate these negative color variations and improve the performance of machine learning tasks.In this work, we decompose the observed RGB image in its hematoxylin and eosin components. We apply Bayesian modeling and inference based on the use of Super Gaussian sparse priors for each stain together with prior closeness to a given reference color-vector matrix. The hematoxylin and eosin components are then used for image normalization and classification of histological images. The proposed framework is tested on stain separation, image normalization, and cancer classification problems. The results are measured using the peak signal to noise ratio, normalized median intensity and the area under ROC curve on five different databases.The obtained results show the superiority of our approach to current state-of-the-art blind color deconvolution techniques. In particular, the fidelity to the tissue improves 1,27 dB in mean PSNR. The normalized median intensity shows a good normalization quality of the proposed approach on the tested datasets. Finally, in cancer classification experiments the area under the ROC curve improves from 0.9491 to 0.9656 and from 0.9279 to 0.9541 on Camelyon-16 and Camelyon-17, respectively, when the original and processed images are used. Furthermore, these figures of merits are better than those obtained by the methods compared with.The proposed framework for blind color deconvolution, normalization and classification of images guarantees fidelity to the tissue structure and can be used both for normalization and classification. In addition, color deconvolution enables the use of the optical density space for classification, which improves the classification performance.
Learning to select cuts for efficient mixed-integer programming

Cutting plane methods play a significant role in modern solvers for tackling mixed-integer programming (MIP) problems. Proper selection of cuts would remove infeasible solutions in the early stage, thus largely reducing the computational burden without hurting the solution accuracy. However, the major cut selection approaches heavily rely on heuristics, which strongly depend on the specific problem at hand and thus limit their generalization capability. In this paper, we propose a data-driven and generalizable cut selection approach, named Cut Ranking, in the settings of multiple instance learning. To measure the quality of the candidate cuts, a scoring function, which takes the instance-specific cut features as inputs, is trained and applied in cut ranking and selection. In order to evaluate our method, we conduct extensive experiments on both synthetic datasets and real-world datasets. Compared with commonly used heuristics for cut selection, the learning-based policy has shown to be more effective, and is capable of generalizing over multiple problems with different properties. Cut Ranking has been deployed in an industrial solver for large-scale MIPs. In the online A/B testing of the product planning problems with more than 107 variables and constraints daily, Cut Ranking has achieved the average speedup ratio of 12.42% over the production solver without any accuracy loss of solution.
Towards Mixed-Precision Quantization of Neural Networks via Constrained Optimization

Quantization is a widely used technique to compress and accelerate deep neural networks. However, conventional quantization methods use the same bit-width for all (or most of) the layers, which often suffer significant accuracy degradation in the ultra-low precision regime and ignore the fact that emergent hardware accelerators begin to support mixed-precision computation. Consequently, we present a novel and principled framework to solve the mixed-precision quantization problem in this paper. Briefly speaking, we first formulate the mixed-precision quantization as a discrete constrained optimization problem. Then, to make the optimization tractable, we approximate the objective function with second-order Taylor expansion and propose an efficient approach to compute its Hessian matrix. Finally, based on the above simplification, we show that the original problem can be reformulated as a MultipleChoice Knapsack Problem (MCKP) and propose a greedy search algorithm to solve it efficiently. Compared with existing mixed-precision quantization works, our method is derived in a principled way and much more computationally efficient. Moreover, extensive experiments conducted on the ImageNet dataset and various kinds of network architectures also demonstrate its superiority over existing uniform and mixed-precision quantization approaches.
Video Semantic Segmentation via Sparse Temporal Transformer

Currently, video semantic segmentation mainly faces two challenges: 1) the demand of temporal consistency; 2) the balance between segmentation accuracy and inference efficiency. For the first challenge, existing methods usually use optical flow to capture the temporal relation in consecutive frames and maintain the temporal consistency, but the low inference speed by means of optical flow limits the real-time applications. For the second challenge, flow based key frame warping is one mainstream solution. However, the unbalanced inference latency of flow-based key frame warping makes it unsatisfactory for real-time applications. Considering the segmentation accuracy and inference efficiency, we propose a novel Sparse Temporal Transformer (STT) to bridge temporal relation among video frames adaptively, which is also equipped with query selection and key selection. The key selection and query selection strategies are separately applied to filter out temporal and spatial redundancy in our temporal transformer. Specifically, our STT can reduce the time complexity of temporal transformer by a large margin without harming the segmentation accuracy and temporal consistency. Experiments on two benchmark datasets, Cityscapes and Camvid, demonstrate that our method achieves the state-of-the-art segmentation accuracy and temporal consistency with comparable inference speed.
Blockchain-Based Task Offloading for Edge Computing on Low-Quality Data via Distributed Learning in the Internet of Energy

With the development of the Internet of energy, more and more participants share data by different types of edge devices. However, such multi-source heterogenous data typically contain low-quality data, e.g., missing values, which may result in potential risks. Besides, resource-constrained devices incur large latency in edge computing networks. To alleviate such latency, distributed task offloading schemes are designed to share the computation burden between edge nodes and nearby servers. However, there are three main drawbacks of such schemes. First, low-quality data are not carefully evaluated by constraints under scenarios, which may result in slow convergence in distributed computation. Second, multi-source data including sensitive information are computed and shared among edge nodes without privacy protection. Third, distributed tasks on low-quality data may result in low-quality results even with an optimal offloading scheme. To address the problems above, a task offloading framework for edge computing based on consortium blockchain and distributed reinforcement learning is proposed in this paper, which can provide high-quality task offloading policies with data privacy protected. This framework consists of three key components: data quality evaluation (DQ) with multiple data quality dimensions, data repairing (DR) with a repairing algorithm based on a novel repairing consensus mechanism and distributed reinforcement learning for task arrangement (DELTA) with a distributed reinforcement learning algorithm based on a novel low-quality data distributing strategy. Numeric results are presented to illustrate the effectiveness and efficiency of the proposed task offloading framework for edge computing on low-quality data in the IoE.
Underwater Species Detection using Channel Sharpening Attention

With the continuous exploration of marine resources, underwater artificial intelligent robots play an increasingly important role in the fish industry. However, the detection of underwater objects is a very challenging problem due to the irregular movement of underwater objects, the occlusion of sand and rocks, the diversity of water illumination, and the poor visibility and low color contrast in the underwater environment. In this article, we first propose a real-world underwater object detection dataset (UODD), which covers more than 3K images of the most common aquatic products. Then we propose Channel Sharpening Attention Module (CSAM) as a plug-and-play module to further fuse high-level image information, providing the network with the privilege of selecting feature maps. Fusion of original images through CSAM can improve the accuracy of detecting small and medium objects, thereby improving the overall detection accuracy. We also use Water-Net as a preprocessing method to remove the haze and color cast in complex underwater scenes, which shows a satisfactory detection result on small-sized objects. In addition, we use the class weighted loss as the training loss, which can accurately describe the relationship between classification and precision of bounding boxes of targets, and the loss function converges faster during the training process. Experimental results show that the proposed method reaches a maximum AP of 50.1%, outperforming other traditional and state-of-the-art detectors. In addition, our model only needs an average inference time of 25.4 ms per image, which is quite fast and might suit the real-time scenario.
Platform capitalism: a socio-economic analysis

Abstract The emergence of multinational platforms organizing the interplay of a multiplicity of firms and consumers is analysed by regulation theory approach. The fall of Yahoo! and then the rise of Google, Amazon, Facebook, Apple and Wikipedia give an unprecedented impetus to the construction of new eco-system led by a constant flow of innovations on information. Can it define a new configuration in the history of capitalisms? Against the hypothesis of a technological determinism, various types of platform may coexist and delineate contrasted reconfigurations of the modern world: a market led platform capitalism in the USA, a panoptic control society in China, whereas ideally the European Union aims at converting information into a global Common, monitored by citizens.
Time-optimal trajectory planning of manipulator with simultaneously searching the optimal path

Time-optimal trajectory planning can improve the efficiency of the manipulator, which has a paramount research significance. Nonetheless, almost all the current algorithms have the problem of path limitation — the algorithm constantly searches for the optimal motion time of the manipulator on a specific motion path. To solve this problem, we design a time-optimal trajectory planning method for the manipulator by searching the optimal path simultaneously. We propose using a cubic uniform B-spline interpolation algorithm to derive the motion curve expression of the manipulator joint with unknown path points. Then we use a genetic algorithm to optimize the path point and the motion time of the manipulator at the same time to get the time-optimal motion path of the manipulator. Moreover, we prove that the algorithm proposed in this paper is comparable with similar algorithms with known paths through experiments.
Provider fairness across continents in collaborative recommender systems

When a recommender system suggests items to the end-users, it gives a certain exposure to the providers behind the recommended items. Indeed, the system offers a possibility to the items of those providers of being reached and consumed by the end-users. Hence, according to how recommendation lists are shaped, the experience of under-recommended providers in online platforms can be affected. To study this phenomenon, we focus on movie and book recommendation and enrich two datasets with the continent of production of an item. We use this data to characterize imbalances in the distribution of the user–item observations and regarding where items are produced ( geographic imbalance ). To assess if recommender systems generate a disparate impact and (dis)advantage a group, we divide items into groups, based on their continent of production, and characterize how represented is each group in the data. Then, we run state-of-the-art recommender systems and measure the visibility and exposure given to each group. We observe disparities that favor the most represented groups. We overcome these phenomena by introducing equity with a re-ranking approach that regulates the share of recommendations given to the items produced in a continent ( visibility ) and the positions in which items are ranked in the recommendation list ( exposure ), with a negligible loss in effectiveness, thus controlling fairness of providers coming from different continents. A comparison with the state of the art shows that our approach can provide more equity for providers, both in terms of visibility and of exposure. • We assess unfairness for groups of providers belonging to different geo-graphic continents, considering state-of-the-art recommendation models. • We propose a multiclass re-ranking algorithm to introduce provider fairness following a notion of equity that distributes the recommendations according to the representation of the groups in the input data. • We evaluate our algorithm in two recommendation domains and study its effectiveness at producing fair but effective recommendations.
TBRA

Tile-based approach is widely adopted in adaptive 360\textdegree~video streaming systems. Existing QoE-driven streaming approaches usually obtain the tile selection and adjust the bitrate based on the viewport prediction with a fixed tiling, which fail to consider the unstable prediction performance. However, varying the tiling of the video can produce different number of tiles with different sizes, and thus can have distinct impacts on error tolerance for viewport prediction and on decoding complexity for resource-constrained mobile client. In this work, we introduce adaptive tiling into the conventional bitrate adaptation for mobile 360degree~video streaming. We first analyze the impacts of tilings on tile selection and decoding time, which verify the benefit of tiling adaptation in various practical aspects. We then formulate the QoE optimization problem for adaptive tiling and bitrate streaming and discuss the design details of our adaptation algorithm, which can adapt to the performance of viewport prediction and the decoding capabilities of mobile clients in addition to the conventional influencing factors. Finally, the superiority of our proposed approach compared with the state-of-the-art methods is evaluated through extensive trace-driven simulations.