Reviewerly/exHarmony huggingface dataset:
IAN: The Individual Aggregation Network for Person Search

Person search in real-world scenarios is a new challenging computer version task with many meaningful applications. The challenge of this task mainly comes from: (1) unavailable bounding boxes for pedestrians and the model needs to search for the person over the whole gallery images; (2) huge variance of visual appearance of a particular person owing to varying poses, lighting conditions, and occlusions. To address these two critical issues in modern person search applications, we propose a novel Individual Aggregation Network (IAN) that can accurately localize persons by learning to minimize intra-person feature variations. IAN is built upon the state-of-the-art object detection framework, i.e., faster R-CNN, so that high-quality region proposals for pedestrians can be produced in an online manner. In addition, to relieve the negative effect caused by varying visual appearances of the same individual, IAN introduces a novel center loss that can increase the intra-class compactness of feature representations. The engaged center loss encourages persons with the same identity to have similar feature characteristics. Extensive experimental results on two benchmarks, i.e., CUHK-SYSU and PRW, well demonstrate the superiority of the proposed model. In particular, IAN achieves 77.23% mAP and 80.45% top-1 accuracy on CUHK-SYSU, which outperform the state-of-the-art by 1.7% and 1.85%, respectively.
Self-Supervised Domain Adaptation for Computer Vision Tasks

Recent progress of self-supervised visual representation learning has achieved remarkable success on many challenging computer vision benchmarks. However, whether these techniques can be used for domain adaptation has not been explored. In this work, we propose a generic method for self-supervised domain adaptation, using object recognition and semantic segmentation of urban scenes as use cases. Focusing on simple pretext/auxiliary tasks (e.g. image rotation prediction), we assess different learning strategies to improve domain adaptation effectiveness by self-supervision. Additionally, we propose two complementary strategies to further boost the domain adaptation accuracy on semantic segmentation within our method, consisting of prediction layer alignment and batch normalization calibration. The experimental results show adaptation levels comparable to most studied domain adaptation methods, thus, bringing self-supervision as a new alternative for reaching domain adaptation. The code is available at https://github.com/Jiaolong/self-supervised-da.
Kernel Modeling Super-Resolution on Real Low-Resolution Images

Deep convolutional neural networks (CNNs), trained on corresponding pairs of high-and low-resolution images, achieve state-of-the-art performance in single-image superresolution and surpass previous signal-processing based approaches.However, their performance is limited when applied to real photographs.The reason lies in their training data: low-resolution (LR) images are obtained by bicubic interpolation of the corresponding high-resolution (HR) images.The applied convolution kernel significantly differs from real-world camera-blur.Consequently, while current CNNs well super-resolve bicubic-downsampled LR images, they often fail on camera-captured LR images.To improve generalization and robustness of deep superresolution CNNs on real photographs, we present a kernel modeling super-resolution network (KMSR) that incorporates blur-kernel modeling in the training.Our proposed KMSR consists of two stages: we first build a pool of realistic blur-kernels with a generative adversarial network (GAN) and then we train a super-resolution network with HR and corresponding LR images constructed with the generated kernels.Our extensive experimental validations demonstrate the effectiveness of our single-image super-resolution approach on photographs with unknown blur-kernels.
Lifelong GAN: Continual Learning for Conditional Image Generation

Lifelong learning is challenging for deep neural networks due to their susceptibility to catastrophic forgetting. Catastrophic forgetting occurs when a trained network is not able to maintain its ability to accomplish previously learned tasks when it is trained to perform new tasks. We study the problem of lifelong learning for generative models, extending a trained network to new conditional generation tasks without forgetting previous tasks, while assuming access to the training data for the current task only. In contrast to state-of-the-art memory replay based approaches which are limited to label-conditioned image generation tasks, a more generic framework for continual learning of generative models under different conditional image generation settings is proposed in this paper. Lifelong GAN employs knowledge distillation to transfer learned knowledge from previous networks to the new network. This makes it possible to perform image-conditioned generation tasks in a lifelong learning setting. We validate Lifelong GAN for both image-conditioned and label-conditioned generation tasks, and provide qualitative and quantitative results to show the generality and effectiveness of our method.
Adoption of augmented reality in online retailing and consumers’ product attitude: A cognitive perspective

With the application of augmented reality (AR) technology by online retailers to improve online services, the impact of AR adoption on consumer behavior has attracted attention both in academic and in practical circles. Based on the cognitive perspective of information processing and from the two aspects of cognitive load and cognitive fluency, this study discusses the influence of AR adoption on online consumers' product attitudes. The results of the experimental study show that two AR characteristics—environmental embedding and simulated physical control—can reduce consumers’ cognitive load, enhance their cognitive fluency, and improve their product attitude. Furthermore, product type can moderate the influence of AR environmental embedding and simulated physical control on cognitive fluency.
B-Ride: Ride Sharing With Privacy-Preservation, Trust and Fair Payment Atop Public Blockchain

Ride-sharing is a service that enables drivers to share trips with other riders, contributing to appealing benefits of shared travel cost and reducing traffic congestion. However, the majority of existing ride-sharing services rely on a central third party to organize the service, which make them subject to a single point of failure and privacy disclosure concerns by both internal and external attackers. Moreover, they are vulnerable to distributed denial of service (DDoS) and Sybil attacks launched by malicious users and external attackers. Besides, high service fees are paid to the ride-sharing service provider. In this paper, we propose a decentralized ride-sharing service based on public Blockchain, named B-Ride. B-Ride enables drivers to offer ride-sharing services without relying on a trusted third party. Both riders and drivers can learn whether they can share rides while preserving their trip data, including pick-up/drop-off location, departure/arrival date and travel price. However, malicious users exploit the anonymity provided by the public blockchain to submit multiple ride requests or offers, while not committing to any of them, in order to find a better offer or to make the system unreliable. B-Ride solves this problem by introducing a time-locked deposit protocol for a ride-sharing by leveraging smart contract and zero-knowledge set membership proof. In a nutshell, both a driver and a rider have to show their good will and commitment by sending a deposit to the blockchain. Later, a driver has to prove to the blockchain on the agreed pick-up time that he/she arrived at the pick-up location on time. To preserve rider/driver privacy by hiding the exact pick-up location, the proof is performed using zero-knowledge set membership proof. Moreover, to ensure fair payment, a pay-as-you-drive methodology is introduced based on the elapsed distance of the driver and rider. In addition, we introduce a reputation model to rate drivers based on their past behaviour without involving any third-parties to allow riders to select them based on their history on the system. Finally, we implement our protocol and deploy it in a test net of Ethereum. The experimental results show the applicability of our protocol atop existing real-world blockchains.
Semantic Segmentation With Context Encoding and Multi-Path Decoding

Semantic image segmentation aims to classify every pixel of a scene image to one of many classes. It implicitly involves object recognition, localization, and boundary delineation. In this paper, we propose a segmentation network called CGBNet to enhance the paring results by context encoding and multi-path decoding. We first propose a context encoding module that generates context contrasted local feature to make use of the informative context and the discriminative local information. This context encoding module greatly improves the segmentation performance, especially for inconspicuous objects. Furthermore, we propose a scale-selection scheme to selectively fuse the parsing results from different-scales of features at every spatial position. It adaptively selects appropriate score maps from rich scales of features. To improve the parsing results of boundary, we further propose a boundary delineation module that encourages the location-specific very-low-level feature near the boundaries to take part in the final prediction and suppresses them far from the boundaries. Without bells and whistles, the proposed segmentation network achieves very competitive performance in terms of all three different evaluation metrics consistently on the four popular scene segmentation datasets, Pascal Context, SUN-RGBD, Sift Flow, and COCO Stuff.
Augmented reality in STEM education: a systematic review

This study aimed to systematically investigate the studies in which augmented reality (AR) was used to support Science, Technology, Engineering and Mathematic (STEM) education. In this framework, the general status of AR in STEM education was presented and its advantages and challenges were identified. The study investigated 42 articles published in journals indexed in SSCI database and deemed suitable for the purposes of this research. The obtained data were analyzed by two researchers using content analysis method. It was found that the studies in this field have become more significant and intensive in recent years and that these studies were generally carried out at schools (class, laboratory etc.) using marker-based AR applications. It was concluded that mostly K-12 students were used as samples and quantitative methods were selected. The advantages of AR-STEM studies were summarized and examined in detail in 4 sub-categories such as “contribution to learner, educational outcomes, interaction and other advantages”. On the other hand, some challenges were identified such as teacher resistance and technical problems.
InGAN: Capturing and Retargeting the “DNA” of a Natural Image

Generative Adversarial Networks (GANs) typically learn a distribution of images in a large image dataset, and are then able to generate new images from this distribution. However, each natural image has its own internal statistics, captured by its unique distribution of patches. In this paper we propose an "Internal GAN'' (InGAN) - an image-specific GAN - which trains on a single input image and learns its internal distribution of patches. It is then able to synthesize a plethora of new natural images of significantly different sizes, shapes and aspect-ratios - all with the same internal patch-distribution (same "DNA'') as the input image. In particular, despite large changes in global size/shape of the image, all elements inside the image maintain their local size/shape. InGAN is fully unsupervised, requiring no additional data other than the input image itself. Once trained on the input image, it can remap the input to any size or shape in a single feedforward pass, while preserving the same internal patch distribution. InGAN provides a unified framework for a variety of tasks, bridging the gap between textures and natural images.
D3D: Distilled 3D Networks for Video Action Recognition

State-of-the-art methods for action recognition commonly use two networks: the spatial stream, which takes RGB frames as input, and the temporal stream, which takes optical flow as input. In recent work, both streams are 3D Convolutional Neural Networks, which use spatiotemporal filters. These filters can respond to motion, and therefore should allow the network to learn motion representations, removing the need for optical flow. However, we still see significant benefits in performance by feeding optical flow into the temporal stream, indicating that the spatial stream is "missing" some of the signal that the temporal stream captures. In this work, we first investigate whether motion representations are indeed missing in the spatial stream, and show that there is significant room for improvement. Second, we demonstrate that these motion representations can be improved using distillation, that is, by tuning the spatial stream to mimic the temporal stream, effectively combining both models into a single stream. Finally, we show that our Distilled 3D Network (D3D) achieves performance on par with the two-stream approach, with no need to compute optical flow during inference.
Exploring Hate Speech Detection in Multimodal Publications

In this work we target the problem of hate speech detection in multimodal publications formed by a text and an image. We gather and annotate a large scale dataset from Twitter, MMHS150K, and propose different models that jointly analyze textual and visual information for hate speech detection, comparing them with unimodal detection. We provide quantitative and qualitative results and analyze the challenges of the proposed task. We find that, even though images are useful for the hate speech detection task, current multimodal models cannot outperform models analyzing only text. We discuss why and open the field and the dataset for further research.
PQ-RRT*: An improved path planning algorithm for mobile robots

During the last decade, sampling-based algorithms for path planning have gained considerable attention. The RRT*, a variant of RRT (rapidly-exploring random trees), is of particular concern to researchers due to its asymptotic optimality. However, the limits of the slow convergence rate of RRT* makes it inefficient for applications. For the purposes of overcoming these limitations, this paper proposes a novel algorithm, PQ-RRT*, which combines the strengths of P-RRT* (potential functions based RRT*) and Quick-RRT*. PQ-RRT* guarantees a fast convergence to an optimal solution and generates a better initial solution. The asymptotic optimality and fast convergence of the proposed algorithm are proved in this paper. Comparisons of PQ-RRT* with P-RRT* and Quick-RRT* in four benchmarks verify the effectiveness of the proposed algorithm.
Blockchain-Based Traceability and Visibility for Agricultural Products: A Decentralized Way of Ensuring Food Safety in India

The globalization of the food supply chain industry has significantly emerged today. Due to this, farm-to-fork food safety and quality certification have become very important. Increasing threats to food security and contamination have led to the enormous need for a revolutionary traceability system, an important mechanism for quality control that ensures sufficient food supply chain product safety. In this work, we proposed a blockchain-based solution that removes the need for a secure centralized structure, intermediaries, and exchanges of information, optimizes performance, and complies with a strong level of safety and integrity. Our approach completely relies on the use of smart contracts to monitor and manage all communications and transactions within the supply chain network among all of the stakeholders. Our approach verifies all of the transactions, which are recorded and stored in a centralized interplanetary file system database. It allows a secure and cost-effective supply chain system for the stakeholders. Thus, our proposed model gives a transparent, accurate, and traceable supply chain system. The proposed solution shows a throughput of 161 transactions per second with a convergence time of 4.82 s, and was found effective in the traceability of the agricultural products.
Multi-image compression-encryption scheme based on quaternion discrete fractional Hartley transform and improved pixel adaptive diffusion

A new multi-image encryption scheme based on quaternion discrete fractional Hartley transform (QDFrHT) and an improved pixel adaptive diffusion is proposed, which can simultaneously increase the encryption capacity and reduce the consumption of keys. In the proposed scheme, the QDFrHT is proposed to generalize the discrete fractional Hartley transform to quaternion transform domain and then applied to multi-image encryption. The original images are compressed into four fusion images by discrete cosine transform (DCT) and Zigzag operations and then the resulting four images are represented as quaternion algebra. Afterward, the quaternion signal is processed with the proposed QDFrHT and the double random phase encoding technique. To enhance the security of the algorithm, the plaintext-related pixel adaptive diffusion and the pixel scrambling operation based on chaotic systems are followed to obtain the final encryption image. Different from the traditional cryptosystem whose secret keys are dependent on the plaintext, the designed cryptosystem ensures the sensitivity of the cryptosystem to plaintext while the selection of the secret keys is independent on plaintext by introducing an improved diffusion mechanism. Numerical experiments verify the feasibility and the efficiency of the proposed multi-image compression and encryption scheme.
AI Customer Service: Task Complexity, Problem-Solving Ability, and Usage Intention

Artificial intelligence (AI) in the context of customer service, we define as a technology-enabled system for evaluating real-time service scenarios using data collected from digital and/or physical sources in order to provide personalised recommendations, alternatives, and solutions to customers’ enquiries or problems, even very complex ones. We examined, in a banking services context, whether consumers preferred AI or Human online customer service applications using an experimental design across three field-based experiments. The results show that, in the case of low-complexity tasks, consumers considered the problem-solving ability of AI to be greater than that of human customer service and were more likely to use AI while, conversely, for high-complexity tasks, they viewed human customer service as superior and were more likely to use it than AI. Moreover, we found that perceived problem-solving ability mediated the effects of customers’ service usage intentions (i.e., their preference for AI vs. Human) with task complexity serving as a boundary condition. Here we discuss our research and the results and conclude by offering practical suggestions for banks seeking to reach customers and engage with them more effectively by leveraging the distinctive features of AI customer service.
NMS by Representative Region: Towards Crowded Pedestrian Detection by Proposal Pairing

Although significant progress has been made in pedestrian detection recently, pedestrian detection in crowded scenes is still challenging. The heavy occlusion between pedestrians imposes great challenges to the standard Non-Maximum Suppression (NMS). A relative low threshold of intersection over union (IoU) leads to missing highly overlapped pedestrians, while a higher one brings in plenty of false positives. To avoid such a dilemma, this paper proposes a novel Representative Region NMS (R2NMS) approach leveraging the less occluded visible parts, effectively removing the redundant boxes without bringing in many false positives. To acquire the visible parts, a novel Paired-Box Model (PBM) is proposed to simultaneously predict the full and visible boxes of a pedestrian. The full and visible boxes constitute a pair serving as the sample unit of the model, thus guaranteeing a strong correspondence between the two boxes throughout the detection pipeline. Moreover, convenient feature integration of the two boxes is allowed for the better performance on both full and visible pedestrian detection tasks. Experiments on the challenging CrowdHuman and CityPersons benchmarks sufficiently validate the effectiveness of the proposed approach on pedestrian detection in the crowded situation.
MAST: A Memory-Augmented Self-Supervised Tracker

Recent interest in self-supervised dense tracking has yielded rapid progress, but performance still remains far from supervised methods. We propose a dense tracking model trained on videos without any annotations that surpasses previous self-supervised methods on existing benchmarks by a significant margin (+15%), and achieves performance comparable to supervised methods. In this paper, we first reassess the traditional choices used for self-supervised training and reconstruction loss by conducting thorough experiments that finally elucidate the optimal choices. Second, we further improve on existing methods by augmenting our architecture with a crucial memory component. Third, we benchmark on large-scale semi-supervised video object segmentation (aka. dense tracking), and propose a new metric: generalizability. Our first two contributions yield a self-supervised network that for the first time is competitive with supervised methods on standard evaluation metrics of dense tracking. When measuring generalizability, we show self-supervised approaches are actually superior to the majority of supervised methods. We believe this new generalizability metric can better capture the real-world use-cases for dense tracking, and will spur new interest in this research direction.
Fast Symmetric Diffeomorphic Image Registration with Convolutional Neural Networks

Diffeomorphic deformable image registration is crucial in many medical image studies, as it offers unique, special features including topology preservation and invertibility of the transformation. Recent deep learning-based deformable image registration methods achieve fast image registration by leveraging a convolutional neural network (CNN) to learn the spatial transformation from the synthetic ground truth or the similarity metric. However, these approaches often ignore the topology preservation of the transformation and the smoothness of the transformation which is enforced by a global smoothing energy function alone. Moreover, deep learning-based approaches often estimate the displacement field directly, which cannot guarantee the existence of the inverse transformation. In this paper, we present a novel, efficient unsupervised symmetric image registration method which maximizes the similarity between images within the space of diffeomorphic maps and estimates both forward and inverse transformations simultaneously. We evaluate our method on 3D image registration with a large scale brain image dataset. Our method achieves state-of-the-art registration accuracy and running time while maintaining desirable diffeomorphic properties.