Reviewerly/exHarmony huggingface dataset:
Multi-view Feature Learning for the Over-penalty in Adversarial Domain Adaptation

Abstract Domain adaptation aims to transfer knowledge from the labeled source domain to an unlabeled target domain that follows a similar but different distribution. Recently, adversarial-based methods have achieved remarkable success due to the excellent performance of domain-invariant feature presentation learning. However, the adversarial methods learn the transferability at the expense of the discriminability in feature representation, leading to low generalization to the target domain. To this end, we propose a Multi-view Feature Learning method for the Overpenalty in Adversarial Domain Adaptation. Specifically, multi-view representation learning is proposed to enrich the discriminative information contained in domain-invariant feature representation, which will counter the over-penalty for discriminability in adversarial training. Besides, the class distribution in the intra-domain is proposed to replace that in the inter-domain to capture more discriminative information in the learning of transferrable features. Extensive experiments show that our method can improve the discriminability while maintaining transferability and exceeds the most advanced methods in the domain adaptation benchmark datasets.
Improving the efficiency of machine learning in simulating sedimentary heavy metal contamination by coupling preposing feature selection methods

Sediment cores were collected from Taihu Lake in China. The chronology was determined by radionuclide. Heavy metals and magnetic properties of each core slice were assessed, respectively. The concentrations of most heavy metals in sediments surged at 20 cm from the surface, accompanying the increase in the concentrations of single-domain magnetic particles. This may be resulted from the influence of anthropic activities on the lake's environment after the 1970s. Two feature selection methods, random forest (RF) and maximal information coefficient (MIC), were combined with support vector machine (SVM) model to simulate heavy metals, with the inclusion of selected magnetic and physicochemical parameters. Compared with the modeling results obtained with the full set of parameters, a reasonable simulation performance was obtained with RF and MIC. RF performed better than MIC by increasing the R2 of simulation models for Cd, Cr, Cu, Pb, and Sb. For heavy metals with high ecological risks (As, Cd, Cr, Hg, Pb, Sb), the correlation coefficients for observed and predicted data ranged from 0.73 to 0.97 with only 14–27% of the parameters selected by RF as input variables. The RF-RBF-SVM enabled heavy metal predictions based on the magnetic properties of the lake sediments.
Modeling Fine-grained Information via Knowledge-aware Hierarchical Graph for Zero-shot Entity Retrieval

Zero-shot entity retrieval, aiming to link mentions to candidate entities under the zero-shot setting, is vital for many tasks in Natural Language Processing. Most existing methods represent mentions/entities via the sentence embeddings of corresponding context from the Pre-trained Language Model. However, we argue that such coarse-grained sentence embeddings can not fully model the mentions/entities, especially when the attention scores towards mentions/entities are relatively low. In this work, we propose GER, a Graph enhanced Entity Retrieval framework, to capture more fine-grained information as complementary to sentence embeddings. We extract the knowledge units from the corresponding context and then construct a mention/entity centralized graph. Hence, we can learn the fine-grained information about mention/entity by aggregating information from these knowledge units. To avoid the graph bottleneck for the central mention/entity node, we construct a hierarchical graph and design a novel Hierarchical Graph Attention Network~(HGAN). Experimental results on popular benchmarks demonstrate that our proposed GER framework performs better than previous state-of-the-art models.
LFACon: Introducing Anglewise Attention to No-Reference Quality Assessment in Light Field Space

Light field imaging can capture both the intensity information and the direction information of light rays. It naturally enables a six-degrees-of-freedom viewing experience and deep user engagement in virtual reality. Compared to 2D image assessment, light field image quality assessment (LFIQA) needs to consider not only the image quality in the spatial domain but also the quality consistency in the angular domain. However, there is a lack of metrics to effectively reflect the angular consistency and thus the angular quality of a light field image (LFI). Furthermore, the existing LFIQA metrics suffer from high computational costs due to the excessive data volume of LFIs. In this paper, we propose a novel concept of “anglewise attention” by introducing a multihead self-attention mechanism to the angular domain of an LFl. This mechanism better reflects the LFI quality. In particular, we propose three new attention kernels, including anglewise self-attention, anglewise grid attention, and anglewise central attention. These attention kernels can realize angular self-attention, extract multiangled features globally or selectively, and reduce the computational cost of feature extraction. By effectively incorporating the proposed kernels, we further propose our light field attentional convolutional neural network (LFACon) as an LFIQA metric. Our experimental results show that the proposed LFACon metric significantly outperforms the state-of-the-art LFIQA metrics. For the majority of distortion types, LFACon attains the best performance with lower complexity and less computational time.
Domain Adaptive 3D Pose Augmentation for In-the-Wild Human Mesh Recovery

The ability to perceive 3D human bodies from a single image has a multitude of applications ranging from entertainment and robotics to neuroscience and healthcare. A fundamental challenge in human mesh recovery is in collecting the ground truth 3D mesh targets required for training, which requires burdensome motion capturing systems and is often limited to indoor laboratories. As a result, while progress is made on benchmark datasets collected in these restrictive settings, models fail to generalize to real-world "in-the-wild" scenarios due to distribution shifts. We propose Domain Adaptive 3D Pose Augmentation (DAPA), a data augmentation method that enhances the model's generalization ability in in-the-wild scenarios. DAPA combines the strength of methods based on synthetic datasets by getting direct supervision from the synthesized meshes, and domain adaptation methods by using ground truth 2D keypoints from the target dataset. We show quantitatively that finetuning with DAPA effectively improves results on benchmarks 3DPW [38]and AGORA[32]. We further demonstrate the utility of DAPA on a challenging dataset curated from videos of real-world parent-child interaction.
Ultra Low Latency Machine Learning for Scientific Edge Applications

In this paper, we present an FPGA design of an extremely low latency scientific machine learning application at the edge. Real-time prediction of errant high-energy particle beams at scientific facilities such as Spallation Neutron Source (SNS) is crucial to avoid damages to the equipment. Machine learning techniques are becoming increasingly effective to detect subtle signatures of the errant beams in the noisy sensor signals. However, to minimize potential damage done by errant beam, real-time errant beam detection has to be completed with extremely low latency, usually less than 1 microsecond. By stream processing the input features and employing out-of-order execution of decision nodes among the decision trees, we demonstrate that our highly efficient FPGA implementation can achieve 60 nanoseconds of computing latency for complex random forest models with 10,000 input features.
Hierarchical Interdisciplinary Topic Detection Model for Research Proposal Classification

The peer merit review of research proposals has been the major mechanism for deciding grant awards. However, research proposals have become increasingly interdisciplinary. It has been a longstanding challenge to assign interdisciplinary proposals to appropriate reviewers, so proposals are fairly evaluated. One of the critical steps in reviewer assignment is to generate accurate interdisciplinary topic labels for proposal-reviewer matching. Existing systems mainly collect topic labels manually generated by principal investigators. However, such human-reported labels can be non-accurate, incomplete, labor intensive, and time costly. What role can AI play in developing a fair and precise proposal reviewer assignment system? In this study, we collaborate with the National Science Foundation of China to address the task of automated interdisciplinary topic path detection. For this purpose, we develop a deep Hierarchical Interdisciplinary Research Proposal Classification Network (HIRPCN). Specifically, we first propose a hierarchical transformer to extract the textual semantic information of proposals. We then design an interdisciplinary graph and leverage GNNs for learning representations of each discipline in order to extract interdisciplinary knowledge. After extracting the semantic and interdisciplinary knowledge, we design a level-wise prediction component to fuse the two types of knowledge representations and detect interdisciplinary topic paths for each proposal. We conduct extensive experiments and expert evaluations on three real-world datasets to demonstrate the effectiveness of our proposed model.
Object Detection in Foggy Scenes by Embedding Depth and Reconstruction into Domain Adaptation

Most existing domain adaptation (DA) methods align the features based on the domain feature distributions and ignore aspects related to fog, background and target objects, rendering suboptimal performance. In our DA framework, we retain the depth and background information during the domain feature alignment. A consistency loss between the generated depth and fog transmission map is introduced to strengthen the retention of the depth information in the aligned features. To address false object features potentially generated during the DA process, we propose an encoder-decoder framework to reconstruct the fog-free background image. This reconstruction loss also reinforces the encoder, i.e., our DA backbone, to minimize false object features. Moreover, we involve our target data in training both our DA module and our detection module in a semi-supervised manner, so that our detection module is also exposed to the unlabeled target data, the type of data used in the testing stage. Using these ideas, our method significantly outperforms the state-of-the-art method (47.6 mAP against the 44.3 mAP on the Foggy Cityscapes dataset), and obtains the best performance on multiple real-image public datasets. Code is available at: https://github.com/VIML-CVDL/Object-Detection-in-Foggy-Scenes .
A Performance Enhancement of Deepfake Video Detection through the use of a Hybrid CNN Deep Learning Model

In the current era, many fake videos and images are created with the help of various software and new AI (Artificial Intelligence) technologies, which leave a few hints of manipulation. There are many unethical ways videos can be used to threaten, fight, or create panic among people. It is important to ensure that such methods are not used to create fake videos. An AI-based technique for the synthesis of human images is called Deep Fake. They are created by combining and superimposing existing videos onto the source videos. In this paper, a system is developed that uses a hybrid Convolutional Neural Network (CNN) consisting of InceptionResnet v2 and Xception to extract frame-level features. Experimental analysis is performed using the DFDC deep fake detection challenge on Kaggle. These deep learning-based methods are optimized to increase accuracy and decrease training time by using this dataset for training and testing. We achieved a precision of 0.985, a recall of 0.96, an f1-score of 0.98, and support of 0.968.
Fine-Grained Online Energy Management of Edge Data Centers Using Per-Core Power Gating and Dynamic Voltage and Frequency Scaling

It is important to minimize the energy consumption of large-scale, geographically distributed edge data centers (EDCs). While modern processing units (PUs) have energy-saving features like Dynamic Voltage and Frequency Scaling (DVFS) and Per-Core Power Gating (PCPG), optimization is still complex and requires a holistic approach. This article presents a new decentralized, three-timescale, online optimization approach that enables multicore micro data centers (MDCs) to optimize their per-PU power states, per-enabled-PU voltage-frequency levels and offloading schedules at three different timescales. The key idea is that we employ multi-timescale Lyapunov optimization to decouple the energy minimization between workload scheduling and result delivery at a small timescale and PU configuration at large timescales. Another important aspect is that we apply the primal decomposition to decouple the PU configuration between a per-enabled-PU voltage-frequency level at an intermediate timescale and a per-PU power state at a large timescale. Experiments demonstrate that the proposed approach improves energy efficiency significantly by up to 4.5 times in our considered lightly loaded situations where DVFS alone does not work effectively, compared to existing benchmarks.
The inference operation optimization of an improved LeNet-5 convolutional neural network and its FPGA hardware implementation

This paper proposes an improved LeNet-5 convolutional neural network (CNN) named MeLy-Net which is more suitable for implementing on the Field Programmable Gate Array (FPGA) by using quantization technique at the low power consumption. The parallel inference strategies of kernel layer and pooling layer operation in the MeLy-Net are discussed in detail. The high level synthesis (HLS) tool is used to form the accelerator Intellectual Property (IP), the PYNQ-Z2 development board with proceeding system (PS) and programming logic (PL) two parts is used to realize the complete deployment of the FPGA-based accelerator, and the ARM core on the PS side controls the MeLy-Net FPGA-based accelerator on the PL side through the AXI bus. The MNIST dataset tests show the 98.8% accuracy is achieved by the MeLy- Net. It can achieve high-speed handwriting digital image recognition of MNIST dataset under the low power consumption of 2.128W, and can finish 1000 images processing within only 1.8ms.
DRIFT spectroscopic determination of clay and organic matter in sediment by mixed soil-sediment calibration approach

Bioavailability and movement of pollutants through land and underground flows are strongly related to some of the sediment characteristics, such as clay minerals and organic matter. Therefore, the determination of clay and organic matter content in sediment is of great importance for environmental monitoring. Clay and organic matter in sediment were determined using diffuse reflectance infrared Fourier transform (DRIFT) spectroscopy in combination with multivariate analysis methods. Sediment from different depths was used in combination with the soil samples of different texture. Using multivariate methods and DRIFT spectra, sediments from different depths were successfully grouped according to similarity to different texture soils. Also, a quantitative analysis of clay and organic matter content was performed, where a new calibration approach was used in which sediment samples combined with soil samples were used for principal component regression (PCR) calibration. PCR models for the assessment of clay and organic matter were determined for a total of 57 sediment samples and 32 soil samples, and satisfactory determination coefficients were obtained for linear models (0.7136 for clay and 0.7062 for organic matter). The obtained RPD values for both models gave very satisfactory values of 1.9 for clay, i.e., 1.8 for organic matter.
Non-parametric Nearest Neighbor Classification Based on Global Variance Difference

Abstract As technology improves, how to extract information from vast datasets is becoming more urgent. As is well known, k-nearest neighbor classifiers are simple to implement and conceptually simple to implement. It is not without its shortcomings, however, as follows: (1) there is still a sensitivity to the choice of k -values even when representative attributes are not considered in each class; (2) in some cases, the proximity between test samples and nearest neighbor samples cannot be reflected accurately due to proximity measurements, etc. Here, we propose a non-parametric nearest neighbor classification method based on global variance differences. First, the difference in variance is calculated before and after adding the sample to be the subject, then the difference is divided by the variance before adding the sample to be tested, and the resulting quotient serves as the objective function. In the final step, the samples to be tested are classified into the class with the smallest objective function. Here, we discuss the theoretical aspects of this function. Using the Lagrange method, it can be shown that the objective function can be optimal when the sample centers of each class are averaged. Twelve real datasets from the University of California, Irvine are used to compare the proposed algorithm with competitors such as the Local mean k-nearest neighbor algorithm and the pseudo-nearest neighbor algorithm. According to a comprehensive experimental study, the average accuracy on 12 datasets is as high as 86.27 $$\%$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mo>%</mml:mo> </mml:math> , which is far higher than other algorithms. The experimental findings verify that the proposed algorithm produces results that are more dependable than other existing algorithms.
An Anti-Noise Fast Circle Detection Method Using Five-Quadrant Segmentation

Extracting circle information from images has always been a basic problem in computer vision. Common circle detection algorithms have some defects, such as poor noise resistance and slow computation speed. In this paper, we propose an anti-noise fast circle detection algorithm. In order to improve the anti-noise of the algorithm, we first perform curve thinning and connection on the image after edge extraction, then suppress noise interference by the irregularity of noise edges and extract circular arcs by directional filtering. In order to reduce the invalid fitting and speed up the running speed, we propose a circle fitting algorithm with five quadrants, and improve the efficiency of the algorithm by the idea of “divide and conquer”. We compare the algorithm with RCD, CACD, WANG and AS on two open datasets. The results show that we have the best performance under noise while keeping the speed of the algorithm.
Rapid and flexible calibration of DFPP using a dual-sight fusion target

The parameter calibration of a digital fringe projection profilometry (DFPP) system is a fundamental step and directly related to 3D measurement accuracy. However, existing solutions based on geometric calibration (GC) suffer from the weakness of limited operability and practicality. In this Letter, a novel, to the best of our knowledge, dual-sight fusion target is designed for flexible calibration. The novelty of this target is the ability to directly characterize control rays for ideal pixels of the projector, and to transform the rays into the camera coordinate system, which replaces the traditional phase-shifting algorithm and avoids the error from the nonlinear response of the system. Attributed to the excellent position resolution of a position-sensitive detector within the target, the geometric relationship between the projector and camera can be easily established by projecting only one diamond pattern. Experimental results demonstrated that the proposed method using only 20 captured images is capable of achieving comparable calibration accuracy to the traditional GC method (20 images versus 1080 images, 0.052 pixels versus 0.047 pixels), which is suitable for rapidly and accurately calibrating the DFPP system in the 3D shape measurement field.
Digital phase-shift method based on distance mapping for phase recovery of an ESPI fringe pattern

In view of the limitation of the traditional method to recover the phase of the single fringe pattern, we propose a digital phase-shift method based on distance mapping for phase recovery of an electronic speckle pattern interferometry fringe pattern. First, the direction of each pixel point and the centerline of the dark fringe are extracted. Secondly, the normal curve of the fringe is calculated according to the fringe orientation to obtain the fringe moving direction. Thirdly, the distance between each pixel point and the next pixel point in the same phase is calculated by a distance mapping method according to the adjacent centerlines; then the moving distance of the fringes is obtained. Next, combining the moving direction and moving distance, the fringe pattern after the digital phase shift is obtained by full-field interpolation. Finally, the full-field phase corresponding to the original fringe pattern is recovered by four-step phase shifting. The method can extract the fringe phase from a single fringe pattern through digital image processing technology. The experiments show that the proposed method can effectively improve the phase recovery accuracy of a single fringe pattern.
Targeting tumor heterogeneity: multiplex-detection-based multiple instance learning for whole slide image classification

Abstract Motivation Multiple instance learning (MIL) is a powerful technique to classify whole slide images (WSIs) for diagnostic pathology. The key challenge of MIL on WSI classification is to discover the critical instances that trigger the bag label. However, tumor heterogeneity significantly hinders the algorithm’s performance. Results Here, we propose a novel multiplex-detection-based multiple instance learning (MDMIL) which targets tumor heterogeneity by multiplex detection strategy and feature constraints among samples. Specifically, the internal query generated after the probability distribution analysis and the variational query optimized throughout the training process are utilized to detect potential instances in the form of internal and external assistance, respectively. The multiplex detection strategy significantly improves the instance-mining capacity of the deep neural network. Meanwhile, a memory-based contrastive loss is proposed to reach consistency on various phenotypes in the feature space. The novel network and loss function jointly achieve high robustness towards tumor heterogeneity. We conduct experiments on three computational pathology datasets, e.g. CAMELYON16, TCGA-NSCLC, and TCGA-RCC. Benchmarking experiments on the three datasets illustrate that our proposed MDMIL approach achieves superior performance over several existing state-of-the-art methods. Availability and implementation MDMIL is available for academic purposes at https://github.com/ZacharyWang-007/MDMIL.