Reviewerly/exHarmony huggingface dataset:
Elevation Angle Estimation in 2D Acoustic Images Using Pseudo Front View

A novel method to estimate the missing dimension in 2D acoustic images for 3D reconstruction is proposed in this paper. Acoustic cameras can acquire high resolution 2D images in underwater environment insusceptible to water turbidity and light condition. However, the formulation of acoustic images leads to the missing dimension problem. Estimating the unknown elevation angle dimension is a difficult task which has recently drawn the attention of researchers. The non-bijective characteristic between 3D points and 2D pixels increases the complexity of the problem. In this paper, a novel elevation angle estimation method is proposed. The method transfers the acoustic view to pseudo front view using a deep neural network. The proposed network can estimate the missing dimension and resolve the non-bijection problem of the 2D-3D correspondence. Because of the difficulty of acquiring depth information in underwater environments, the network is trained using simulated images. To mitigate the sim-real gap, a neural style transfer method is implemented to generate a realistic image dataset for training. Simulation experiments were carried out for evaluation and real data proved the feasibility of the proposed method.
Deep Learning-Based Hepatocellular Carcinoma Histopathology Image Classification: Accuracy Versus Training Dataset Size

Globally, liver cancer causes more than 700,000 deaths each year and is the second-leading cause of death from cancer.Hepatocellular carcinoma (HCC) is the most common type of liver cancer in adults and accounts for most deaths in cirrhosis patients.Patients with early-stage liver cancer can be treated by surgical intervention with a good prognosis; thus, early diagnosis, as confirmed by liver pathology examination, is necessary to combat HCC.Conventional manual pathology examination requires considerable time and labor, even with established expertise.It is widely accepted that intelligent classifiers may prove effective in the diagnosis process.In this study, we used a GoogLeNet (Inception-V1)-based binary classifier to classify HCC histopathology images.The classifier achieved 91.37% (±2.49) accuracy, 92.16% (±4.93) sensitivity, and 90.57% (±2.54) specificity in HCC classification.Although the classification accuracy of deep learning is reported to be positively correlated with the amount of training data, it is often uncertain how much training data are required for deep learning to achieve satisfactory performance in clinical diagnosis.Moreover, deep learning methods require annotated data to generate efficient models.However, annotated data are a relatively scarce resource and can be expensive to obtain.Hence, the relationship between classification accuracy and the number of liver histopathology images for training was investigated.An inverse power law function-based estimation model is proposed to evaluate the minimum number of annotated training images required for a desired diagnostic accuracy.
Characterizing and Modeling Distributed Training with Transient Cloud GPU Servers

Cloud GPU servers have become the de facto way for deep learning practitioners to train complex models on large-scale datasets. However, it is challenging to determine the appropriate cluster configuration-e.g., server type and number-for different training workloads while balancing the trade-offs in training time, cost, and model accuracy. Adding to the complexity is the potential to reduce the monetary cost by using cheaper, but revocable, transient GPU servers.In this work, we analyze distributed training performance under diverse cluster configurations using CM-DARE, a cloud-based measurement and training framework. Our empirical datasets include measurements from three GPU types, six geographic regions, twenty convolutional neural networks, and thousands of Google Cloud servers. We also demonstrate the feasibility of predicting training speed and overhead using regression-based models. Finally, we discuss potential use cases of our performance modeling such as detecting and mitigating performance bottlenecks.
Intertextual design: the hidden stories of Atari women

KEYWORDS: Gender equityresearch through designintertextualitycomputer sciencegamesHCI design approachcritical design
E<sup>2</sup>CNNs: Ensembles of Convolutional Neural Networks to Improve Robustness Against Memory Errors in Edge-Computing Devices

To reduce energy consumption, it is possible to operate embedded systems at sub-nominal conditions (e.g., reduced voltage, limited eDRAM refresh rate) that can introduce bit errors in their memories. These errors can affect the stored values of convolutional neural network (CNN) weights and activations, compromising their accuracy. In this article, we introduce Embedded Ensemble CNNs (E <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> CNNs), our architectural design methodology to conceive ensembles of convolutional neural networks to improve robustness against memory errors compared to a single-instance network. Ensembles of CNNs have been previously proposed to increase accuracy at the cost of replicating similar or different architectures. Unfortunately, state-of-the-art (SoA) ensembles do not suit well embedded systems, in which memory and processing constraints limit the number of deployable models. Our proposed architecture solves that limitation applying SoA compression methods to produce an ensemble with the same memory requirements of the original architecture, but with improved error robustness. Then, as part of our new E <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> CNNs design methodology, we propose a heuristic method to automate the design of the voter-based ensemble architecture that maximizes accuracy for the expected memory error rate while bounding the design effort. To evaluate the robustness of E <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> CNNs for different error types and densities, and their ability to achieve energy savings, we propose three error models that simulate the behavior of SRAM and eDRAM operating at sub-nominal conditions. Our results show that E <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> CNNs achieves energy savings of up to 80 percent for LeNet-5, 90 percent for AlexNet, 60 percent for GoogLeNet, 60 percent for MobileNet and 60 percent for an optimized industrial CNN, while minimizing the impact on accuracy. Furthermore, the memory size can be decreased up to 54 percent by reducing the number of members in the ensemble, with a more limited impact on the original accuracy than obtained through pruning alone.
A survey of mass partitions

Mass partition problems describe the partitions we can induce on a family of measures or finite sets of points in Euclidean spaces by dividing the ambient space into pieces. In this survey we describe recent progress in the area in addition to its connections to topology, discrete geometry, and computer science.
Vicinal and categorical domain adaptation

Unsupervised domain adaptation aims to learn a task classifier that performs well on the unlabeled target domain, by utilizing the labeled source domain. Inspiring results have been acquired by learning domain-invariant deep features via domain-adversarial training. However, its parallel design of task and domain classifiers limits the ability to achieve a finer category-level domain alignment. To promote categorical domain adaptation (CatDA), based on a joint category-domain classifier, we propose novel losses of adversarial training at both domain and category levels. Since the joint classifier can be regarded as a concatenation of individual task classifiers respectively for the two domains, our design principle is to enforce consistency of category predictions between the two task classifiers. Moreover, we propose a concept of vicinal domains whose instances are produced by a convex combination of pairs of instances respectively from the two domains. Intuitively, alignment of the possibly infinite number of vicinal domains enhances that of original domains. We propose novel adversarial losses for vicinal domain adaptation (VicDA) based on CatDA, leading to Vicinal and Categorical Domain Adaptation (ViCatDA). We also propose Target Discriminative Structure Recovery (TDSR) to recover the intrinsic target discrimination damaged by adversarial feature alignment. We also analyze the principles underlying the ability of our key designs to align the joint distributions. Extensive experiments on several benchmark datasets demonstrate that we achieve the new state of the art.
LiDAR guided Small obstacle Segmentation

Detecting small obstacles on the road is critical for autonomous driving. In this paper, we present a method to reliably detect such obstacles through a multi-modal framework of sparse LiDAR(VLP-16) and Monocular vision. LiDAR is employed to provide additional context in the form of confidence maps to monocular segmentation networks. We show significant performance gains when the context is fed as an additional input to monocular semantic segmentation frameworks. We further present a new semantic segmentation dataset to the community, comprising of over 3000 image frames with corresponding LiDAR observations. The images come with pixel-wise annotations of three classes off-road, road, and small obstacle. We stress that precise calibration between LiDAR and camera is crucial for this task and thus propose a novel Hausdorff distance based calibration refinement method over extrinsic parameters. As a first benchmark over this dataset, we report our results with 73 % instance detection up to a distance of 50 meters on challenging scenarios. Qualitatively by showcasing accurate segmentation of obstacles less than 15 cms at 50m depth and quantitatively through favourable comparisons vis a vis prior art, we vindicate the method's efficacy. Our project and dataset is hosted at https://small-obstacle-dataset.github.io/.
Self-Supervised Noisy Label Learning for Source-Free Unsupervised Domain Adaptation

It is a strong prerequisite to access source data freely in many existing unsupervised domain adaptation approaches. However, source data is agnostic in many practical scenarios due to the constraints of expensive data transmission and data privacy protection. Usually, the given source domain pre-trained model is expected to optimize with only unlabeled target data, which is termed as source-free unsupervised domain adaptation. In this paper, we solve this problem from the perspective of noisy label learning, since the given pre-trained model can pre-generate noisy label for unlabeled target data via directly network inference. Under this problem modeling, incorporating self-supervised learning, we propose a novel Self-Supervised Noisy Label Learning method, which can effectively fine-tune the pre-trained model with pre-generated label as well as selfgenerated label on the fly. Extensive experiments had been conducted to validate its effectiveness. Our method can easily achieve state-of-the-art results and surpass other methods by a very large margin. Code will be released.
Visually Meaningful Image Encryption Scheme Based on DWT and Schur Decomposition

A visually meaningful image encryption scheme with an asymmetric structure based on the discrete wavelet transform (DWT) and Schur decomposition is proposed in this study. First, the RSA algorithm is used to generate the initial values for the chaotic system to produce the random sequence. Then, both scrambling and diffusion operations are performed on the plain image to obtain the preencrypted image. Moreover, the Schur decomposition is applied on the preencrypted plain image to obtain the upper triangular and orthogonal matrices. Second, the cover image is scrambled followed by a DWT operation. Four subbands are then formed, namely, LL, HL, LH, and HH. Finally, the former upper triangular matrix and orthogonal matrix are embedded into subbands LH and HH produced by the cover image. After the application of the inverse DWT and inverse scrambling operation, the final visually meaningful cover image embedded with a secret plain image can be obtained. No one can identify any useful information about the plain image from the final embedded cover image, nor can anybody know that there is any hidden secret image. Experimental simulations show that the normalized correlation values between the original cover image and the final visually meaningful cover image are approximately 0.9997. Therefore, the proposed encryption scheme is imperceptible for secret image communications.
Impact of stain normalization and patch selection on the performance of convolutional neural networks in histological breast and prostate cancer classification

Recently, deep learning has rapidly become the methodology of choice in digital pathology image analysis. However, due to the current challenges of digital pathology (color stain variability, large images, etc.), specific pre-processing steps are required to train a reliable deep learning model. In this work, there are two main goals: i) present a fully automated pre-processing algorithm for a smart patch selection within histopathological images, and ii) evaluate the impact of the proposed strategy within a deep learning framework for the detection of prostate and breast cancer. The proposed algorithm is specifically designed to extract patches only on informative regions (i.e., high density of nuclei), most likely representative of where cancer can be detected. Our strategy was developed and tested on 1000 hematoxylin and eosin (H&E) stained images of prostate and breast tissue. By combining a stain normalization step and a segmentation-driven patch extraction, the proposed approach is capable of increasing the performance of a computer-aided diagnosis (CAD) system for the detection of prostate cancer (18.61% accuracy improvement) and breast cancer (17.72% accuracy improvement). We strongly believe that the integration of the proposed pre-processing steps within deep learning frameworks will allow the achievement of robust and reliable CAD systems. Being based on nuclei detection, this strategy can be easily extended to other glandular tissues (e.g., colon, thyroid, pancreas, etc.) or staining methods (e.g., PAS).
Designing for Heterogeneous Cross-Device Collaboration and Social Interaction in Virtual Reality

Collaboration in virtual reality (VR) across heterogeneous devices poses challenges for effectively supporting manipulation, navigation, and communication through different interfaces. We explored these in the design and development of a collaborative VR system that allows interaction through a mobile touchscreen device (Handheld User) and a head-mounted display (HMD User). In a qualitative evaluation, we further analyzed how these interfaces affect social roles and user interactions during collaboration. Our observations reveal that Handheld Users achieved presence in the virtual environment, despite the non-immersive interface, and assumed similar spatial positions in a conversational scenario as they would in the real world. In a collaborative building task, we found leadership roles not tied to immersion, but potentially influenced by users’ eye-level. Further, Handheld Users exhibited stronger movement patterns than HMD Users. Based on such behavioral patterns, we contribute a classification framework for Handheld Users that facilitates future analysis of interactions in shared virtual environments through handheld devices. Finally, we offer several design considerations for collaborative cross-device VR, which are based on our observations and exemplified in our presented system.
Interactive Sequential Basket Recommendation by Learning Basket Couplings and Positive/Negative Feedback

Sequential recommendation , such as next-basket recommender systems (NBRS), which model users’ sequential behaviors and the relevant context/session, has recently attracted much attention from the research community. Existing session-based NBRS involve session representation and inter-basket relations but ignore their hybrid couplings with the intra-basket items, often producing irrelevant or similar items in the next basket. In addition, they do not predict next-baskets (more than one next basket recommended). Interactive recommendation further involves user feedback on the recommended basket. The existing work on next-item recommendation involves positive feedback on selected items but ignores negative feedback on unselected ones. Here, we introduce a new setting— interactive sequential basket recommendation , which iteratively predicts next baskets by learning the intra-/inter-basket couplings between items and both positive and negative user feedback on recommended baskets. A hierarchical attentive encoder-decoder model (HAEM) continuously recommends next baskets one after another during sequential interactions with users after analyzing the item relations both within a basket and between adjacent sequential baskets (i.e., intra-/inter-basket couplings) and incorporating the user selection and unselection (i.e., positive/negative) feedback on the recommended baskets to refine NBRS. HAEM comprises a basket encoder and a sequence decoder to model intra-/inter-basket couplings and a prediction decoder to sequentially predict next-baskets by interactive feedback-based refinement. Empirical analysis shows that HAEM significantly outperforms the state-of-the-art baselines for NBRS and session-based recommenders for accurate and novel recommendation. We also show the effect of continuously refining sequential basket recommendation by including unselection feedback during interactive recommendation.
Underwater High-Precision 3D Reconstruction System Based on Rotating Scanning

This paper presents an underwater high-precision line laser three-dimensional (3D) scanning (LLS) system with rotary scanning mode, which is composed of a low illumination underwater camera and a green line laser projector. The underwater 3D data acquisition can be realized in the range of field of view of 50° (vertical) × 360° (horizontal). We compensate the refraction of the 3D reconstruction system to reduce the angle error caused by the refraction of light on different media surfaces and reduce the impact of refraction on the image quality. In order to verify the reconstruction effect of the 3D reconstruction system and the effectiveness of the refraction compensation algorithm, we conducted error experiments on a standard sphere. The results show that the system’s underwater reconstruction error is less than 0.6 mm within the working distance of 140 mm~2500 mm, which meets the design requirements. It can provide reference for the development of low-cost underwater 3D laser scanning system.
Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations

A core operator of evolutionary algorithms (EAs) is the mutation. Recently, much attention has been devoted to the study of mutation operators with dynamic and non-uniform mutation rates. Following up on this area of work, we propose a new mutation operator and analyze its performance on the $$(1+1)$$ Evolutionary Algorithm (EA). Our analyses show that this mutation operator competes with pre-existing ones, when used by the $$(1+1)$$ EA on classes of problems for which results on the other mutation operators are available. We show that the $$(1+1)$$ EA using our mutation operator finds a (1/3)-approximation ratio on any non-negative submodular function in polynomial time. We also consider the problem of maximizing a symmetric submodular function under a single matroid constraint and show that the $$(1+1)$$ EA using our operator finds a (1/3)-approximation within polynomial time. This performance matches that of combinatorial local search algorithms specifically designed to solve these problems and outperforms them with constant probability. Finally, we evaluate the performance of the $$(1+1)$$ EA using our operator experimentally by considering two applications: (a) the maximum directed cut problem on real-world graphs of different origins, with up to 6.6 million vertices and 56 million edges and (b) the symmetric mutual information problem using a four month period air pollution data set. In comparison with uniform mutation and a recently proposed dynamic scheme, our operator comes out on top on these instances.
Deep Mixture Density Network for Probabilistic Object Detection

Mistakes/uncertainties in object detection could lead to catastrophes when deploying robots in the real world. In this paper, we measure the uncertainties of object localization to minimize this kind of risk. Uncertainties emerge upon challenging cases like occlusion. The bounding box borders of an occluded object can have multiple plausible configurations. We propose a deep multivariate mixture of Gaussians model for probabilistic object detection. The covariances help to learn the relationship between the borders, and the mixture components potentially learn different configurations of an occluded part. Quantitatively, our model improves the AP of the baselines by 3.9% and 1.4% on CrowdHuman and MS-COCO respectively with almost no computational or memory overhead. Qualitatively, our model enjoys explainability since the resulting covariance matrices and the mixture components help measure uncertainties.
Examining the role of stress and information security policy design in information security compliance behaviour: An experimental study of in-task behaviour

Based on the transactional theory of stress, the study sets out to explore the relationship between occupational stress, information security policy (ISP) designs, and security behaviour. Results from an in-basket experiment reveal that stress elicited by time constraints leads to ISP non-compliance behaviour in the workplace. In addition, the results of the study show that punishment can buffer the effect of perceived stress on ISP non-compliance. While existing research on stress and ISP compliance focus on stress induced by security requirements, our study extends these findings by providing insights how stressful work environments and ISP designs shape ISP compliance behaviour.
Classification From Pairwise Similarities/Dissimilarities and Unlabeled Data via Empirical Risk Minimization

Abstract Pairwise similarities and dissimilarities between data points are often obtained more easily than full labels of data in real-world classification problems. To make use of such pairwise information, an empirical risk minimization approach has been proposed, where an unbiased estimator of the classification risk is computed from only pairwise similarities and unlabeled data. However, this approach has not yet been able to handle pairwise dissimilarities. Semisupervised clustering methods can incorporate both similarities and dissimilarities into their framework; however, they typically require strong geometrical assumptions on the data distribution such as the manifold assumption, which may cause severe performance deterioration. In this letter, we derive an unbiased estimator of the classification risk based on all of similarities and dissimilarities and unlabeled data. We theoretically establish an estimation error bound and experimentally demonstrate the practical usefulness of our empirical risk minimization method.