Reviewerly/exHarmony huggingface dataset:
Hang-Time HAR: A Benchmark Dataset for Basketball Activity Recognition Using Wrist-Worn Inertial Sensors

We present a benchmark dataset for evaluating physical human activity recognition methods from wrist-worn sensors, for the specific setting of basketball training, drills, and games. Basketball activities lend themselves well for measurement by wrist-worn inertial sensors, and systems that are able to detect such sport-relevant activities could be used in applications of game analysis, guided training, and personal physical activity tracking. The dataset was recorded from two teams in separate countries (USA and Germany) with a total of 24 players who wore an inertial sensor on their wrist, during both a repetitive basketball training session and a game. Particular features of this dataset include an inherent variance through cultural differences in game rules and styles as the data was recorded in two countries, as well as different sport skill levels since the participants were heterogeneous in terms of prior basketball experience. We illustrate the dataset’s features in several time-series analyses and report on a baseline classification performance study with two state-of-the-art deep learning architectures.
On Grounded Planning for Embodied Tasks with Language Models

Language models (LMs) have demonstrated their capability in possessing commonsense knowledge of the physical world, a crucial aspect of performing tasks in everyday life. However, it remains unclear whether they have the capacity to generate grounded, executable plans for embodied tasks. This is a challenging task as LMs lack the ability to perceive the environment through vision and feedback from the physical environment. In this paper, we address this important research question and present the first investigation into the topic. Our novel problem formulation, named G-PlanET, inputs a high-level goal and a data table about objects in a specific environment, and then outputs a step-by-step actionable plan for a robotic agent to follow. To facilitate the study, we establish an evaluation protocol and design a dedicated metric, KAS, to assess the quality of the plans. Our experiments demonstrate that the use of tables for encoding the environment and an iterative decoding strategy can significantly enhance the LMs' ability in grounded planning. Our analysis also reveals interesting and non-trivial findings.
Adaptive Hierarchy-Branch Fusion for Online Knowledge Distillation

Online Knowledge Distillation (OKD) is designed to alleviate the dilemma that the high-capacity pre-trained teacher model is not available. However, the existing methods mostly focus on improving the ensemble prediction accuracy from multiple students (a.k.a. branches), which often overlook the homogenization problem that makes student model saturate quickly and hurts the performance. We assume that the intrinsic bottleneck of the homogenization problem comes from the identical branch architecture and coarse ensemble strategy. We propose a novel Adaptive Hierarchy-Branch Fusion framework for Online Knowledge Distillation, termed AHBF-OKD, which designs hierarchical branches and adaptive hierarchy-branch fusion module to boost the model diversity and aggregate complementary knowledge. Specifically, we first introduce hierarchical branch architectures to construct diverse peers by increasing the depth of branches monotonously on the basis of target branch. To effectively transfer knowledge from the most complex branch to the simplest target branch, we propose an adaptive hierarchy-branch fusion module to create hierarchical teacher assistants recursively, which regards the target branch as the smallest teacher assistant. During the training, the teacher assistant from the previous hierarchy is explicitly distilled by the teacher assistant and the branch from the current hierarchy. Thus, the important scores to different branches are effectively and adaptively allocated to reduce the branch homogenization. Extensive experiments demonstrate the effectiveness of AHBF-OKD on different datasets, including CIFAR-10/100 and ImageNet 2012. For example, on ImageNet 2012, the distilled ResNet-18 achieves Top-1 error of 29.28\%, which significantly outperforms the state-of-the-art methods. The source code is available at https://github.com/linruigong965/AHBF.
Discriminability and Transferability Estimation: A Bayesian Source Importance Estimation Approach for Multi-Source-Free Domain Adaptation

Source free domain adaptation (SFDA) transfers a single-source model to the unlabeled target domain without accessing the source data. With the intelligence development of various fields, a zoo of source models is more commonly available, arising in a new setting called multi-source-free domain adaptation (MSFDA). We find that the critical inborn challenge of MSFDA is how to estimate the importance (contribution) of each source model. In this paper, we shed new Bayesian light on the fact that the posterior probability of source importance connects to discriminability and transferability. We propose Discriminability And Transferability Estimation (DATE), a universal solution for source importance estimation. Specifically, a proxy discriminability perception module equips with habitat uncertainty and density to evaluate each sample's surrounding environment. A source-similarity transferability perception module quantifies the data distribution similarity and encourages the transferability to be reasonably distributed with a domain diversity loss. Extensive experiments show that DATE can precisely and objectively estimate the source importance and outperform prior arts by non-trivial margins. Moreover, experiments demonstrate that DATE can take the most popular SFDA networks as backbones and make them become advanced MSFDA solutions.
KerPrint: Local-Global Knowledge Graph Enhanced Diagnosis Prediction for Retrospective and Prospective Interpretations

While recent developments of deep learning models have led to record-breaking achievements in many areas, the lack of sufficient interpretation remains a problem for many specific applications, such as the diagnosis prediction task in healthcare. The previous knowledge graph(KG) enhanced approaches mainly focus on learning clinically meaningful representations, the importance of medical concepts, and even the knowledge paths from inputs to labels. However, it is infeasible to interpret the diagnosis prediction, which needs to consider different medical concepts, various medical relationships, and the time-effectiveness of knowledge triples in different patient contexts. More importantly, the retrospective and prospective interpretations of disease processes are valuable to clinicians for the patients' confounding diseases. We propose KerPrint, a novel KG enhanced approach for retrospective and prospective interpretations to tackle these problems. Specifically, we propose a time-aware KG attention method to solve the problem of knowledge decay over time for trustworthy retrospective interpretation. We also propose a novel element-wise attention method to select candidate global knowledge using comprehensive representations from the local KG for prospective interpretation. We validate the effectiveness of our KerPrint through an extensive experimental study on a real-world dataset and a public dataset. The results show that our proposed approach not only achieves significant improvement over knowledge-enhanced methods but also gives the interpretability of diagnosis prediction in both retrospective and prospective views.
Deep neural networks for rank-consistent ordinal regression based on conditional probabilities

In recent times, deep neural networks achieved outstanding predictive performance on various classification and pattern recognition tasks. However, many real-world prediction problems have ordinal response variables, and this ordering information is ignored by conventional classification losses such as the multi-category cross-entropy. Ordinal regression methods for deep neural networks address this. One such method is the CORAL method, which is based on an earlier binary label extension framework and achieves rank consistency among its output layer tasks by imposing a weight-sharing constraint. However, while earlier experiments showed that CORAL’s rank consistency is beneficial for performance, it is limited by a weight-sharing constraint in a neural network’s fully connected output layer, which may restrict the expressiveness and capacity of a network trained using CORAL. We propose a new method for rank-consistent ordinal regression without this limitation. Our rank-consistent ordinal regression framework (CORN) achieves rank consistency by a novel training scheme. This training scheme uses conditional training sets to obtain the unconditional rank probabilities through applying the chain rule for conditional probability distributions. Experiments on various datasets demonstrate the efficacy of the proposed method to utilize the ordinal target information, and the absence of the weight-sharing restriction improves the performance substantially compared to the CORAL reference approach. Additionally, the suggested CORN method is not tied to any specific architecture and can be utilized with any deep neural network classifier to train it for ordinal regression tasks.
YOLO-based segmented dataset for drone vs. bird detection for deep and machine learning algorithms

The use of unmanned aerial vehicles (UAVs) has been rapidly increasing in both professional and recreational settings, leading to concerns about the safety and security of people and facilities. One area of research that has emerged in response to this concern is the development of detection systems for UAVs. However, many existing systems have limitations, such as detection failures or false detection of other aerial objects, including birds. To address this issue, the development of a standard dataset that provides images of both drones and birds is essential for training accurate and effective detection models. In this context, we present a dataset consisting of images of drones and birds operating in various environments. This dataset will serve as a valuable resource for researchers and developers working on UAV detection and classification systems. The dataset was created using Roboflow software, which enabled us to efficiently edit and manipulate the images using AI-assisted bounding boxes, polygons, and instance segmentation. The software supports a wide range of input and output formats, making it easy to import and export the dataset in different machine learning frameworks. To ensure the highest possible accuracy, we manually segmented each image from edge to edge, providing the YOLO model with detailed and accurate information for training. The dataset includes both training and testing sets, allowing for the evaluation of model performance and accuracy. Our dataset offers several advantages over existing datasets, including the inclusion of both drones and birds, which are commonly misclassified by detection systems. Additionally, the images in our dataset were collected in diverse environments, providing a wide range of scenarios for model training and testing. The presented dataset provides a valuable resource for researchers and developers working on UAV detection and classification systems. The inclusion of both drones and birds, as well as the diverse range of environments and scenarios, makes this dataset a unique and essential tool for training accurate and effective models. We hope that this dataset will contribute to the advancement of UAV detection and classification systems, improving safety and security in both professional and recreational settings.
Robust Object Recognition with Deep Learning on a Variety of Datasets

For many intelligent applications, object recognition is a critical issue.Developing an effective feature extraction method is one of the most difficult issues in object recognition.For this process, a variety of algorithms were developed, including self-organizing maps (SOMs), support vector machines (SVM), principal component analysis (PCA), and modern deep learning techniques, particularly convolutional neural networks (CNNs).In CNNs, the two layers that most significantly contribute to the network bottleneck are the convolution layer and the fully connected layer.While the later layer is memory-intensive, the convolution one is computationally expensive.So, optimizing these two layers is crucial for executing efficient convolution operations.The primary objective of this paper is a detailed discussion of two approaches for optimizing the CNNs architecture.In the first approach, CNNs were enhanced using the self-organizing maps (SOMs) topology space in the convolution layer and the KNN classifier instead of the conventional fully connected layer.The second approach employed the KNN classifier in the fully connected layer and used an improved SOMs technique called "cyclic convolution SOMs" rather than convolution structures to process CNNs more quickly.The efficiency of the proposed approaches has been evaluated on four wide benchmark datasets: AHDBase for Arabic digits, MNIST for English digits, CMU-PIE for faces, and CIFAR-10 for objects.The experiment using these datasets provided the following findings in comparison to other approaches (e.g., standard CNN, CSOMs, LSTMs, SVM, SOMs, PCA, and cyclic SOM): the first approach produced results of 97.7%, 98.2%, 98.51%, and 93.8%; the second approach produced results of 96.57%, 95.4%, 97%, and 89.23%.Our results indicate that when applied to a variety of datasets, the proposed methods offer promising outcomes with higher accuracy than the existing ones.
Knowledge management capability and organizational performance: a moderated mediation model of environmental dynamism and opportunity recognition

Purpose Knowledge management in any organization is important in enhancing the organization’s performance. This study aims to explore the influence of knowledge management capability on organizational performance with the mediation role of opportunity recognition and the moderation effect of environmental dynamism. Design/methodology/approach This study used an effective and well-developed survey to collect data from 387 managers working in different service organizations in the Kingdom of Saudi Arabia. Further, SmartPLS software was used for data analysis. Findings The outcomes confirm that knowledge management capability is directly and indirectly (via opportunity recognition) related to organizational performance. Environmental dynamism moderates the linkage between knowledge management capability and opportunity recognition, as well as between opportunity recognition and organizational performance. Research limitations/implications This study provides a valuable and novel managerial and theoretical approach for management to improve firm performance with the help of knowledge management capabilities, opportunity recognition, and environmental dynamism. The findings of this paper can be implemented not only in the service sector but also in the production sector. Future studies can use this conceptual framework in different countries with the current data. Moreover, other analytical approaches can be used to check the variability of these findings. Originality/value This study contributes to connecting research gaps in the literature and advancing insights into how knowledge management capabilities affect organizational performance. The study explores the mediating role of opportunity recognition and environmental dynamics as moderators between knowledge management capability and opportunity recognition and between opportunity recognition and organizational performance.
Identification of a Large Number of Spin-Wave Eigenmodes Excited by Parametric Pumping in Yttrium Iron Garnet Microdisks

We present the parametric excitation of spin-wave modes in yttrium iron garnet (YIG) microdisks via parallel pumping. Their spectroscopy is performed using magnetic resonance force microscopy (MRFM), while their spatial profiles are determined by microfocus Brillouin light scattering (BLS). We observe that almost all the fundamental eigenmodes of an in-plane magnetized YIG microdisk, calculated using a micromagnetic eigenmode solver, can be excited using the parallel pumping scheme, as opposed to the transverse one. A comparison between the MRFM and BLS data on the one hand, and the simulations on the other hand, provides the complete spectroscopic labeling of over 40 parametrically excited modes. Our findings could be promising for spin-wave-based computation schemes, in which the amplitudes of a large number of spin-wave modes have to be controlled.
Flora: Dual-Frequency LOss-Compensated ReAl-Time Monocular 3D Video Reconstruction

In this work, we propose a real-time monocular 3D video reconstruction approach named Flora for reconstructing delicate and complete 3D scenes from RGB video sequences in an end-to-end manner. Specifically, we introduce a novel method with two main contributions. Firstly, the proposed feature aggregation module retains both color and reliability in a dual-frequency form. Secondly, the loss compensation module solves missing structure by correcting losses for falsely pruned voxels. The dual-frequency feature aggregation module enhances reconstruction quality in both precision and recall, and the loss compensation module benefits the recall. Notably, both proposed contributions achieve great results with negligible inferencing overhead. Our state-of-the-art experimental results on real-world datasets demonstrate Flora's leading performance in both effectiveness and efficiency. The code is available at https://github.com/NoOneUST/Flora.
Store and Fetch Immediately: Everything Is All You Need for Space-Time Video Super-resolution

Existing space-time video super-resolution (ST-VSR) methods fail to achieve high-quality reconstruction since they fail to fully explore the spatial-temporal correlations, long-range components in particular. Although the recurrent structure for ST-VSR adopts bidirectional propagation to aggregate information from the entire video, collecting the temporal information between the past and future via one-stage representations inevitably loses the long-range relations. To alleviate the limitation, this paper proposes an immediate storeand-fetch network to promote long-range correlation learning, where the stored information from the past and future can be refetched to help the representation of the current frame. Specifically, the proposed network consists of two modules: a backward recurrent module (BRM) and a forward recurrent module (FRM). The former first performs backward inference from future to past, while storing future super-resolution (SR) information for each frame. Following that, the latter performs forward inference from past to future to super-resolve all frames, while storing past SR information for each frame. Since FRM inherits SR information from BRM, therefore, spatial and temporal information from the entire video sequence is immediately stored and fetched, which allows drastic improvement for ST-VSR. Extensive experiments both on ST-VSR and space video super-resolution (S-VSR) as well as time video super-resolution (T-VSR) have demonstrated the effectiveness of our proposed method over other state-of-the-art methods on public datasets. Code is available https://github.com/hhhhhumengshun/SFI-STVR
Towards Real-Time Panoptic Narrative Grounding by an End-to-End Grounding Network

Panoptic Narrative Grounding (PNG) is an emerging cross-modal grounding task, which locates the target regions of an image corresponding to the text description. Existing approaches for PNG are mainly based on a two-stage paradigm, which is computationally expensive. In this paper, we propose a one-stage network for real-time PNG, termed End-to-End Panoptic Narrative Grounding network (EPNG), which directly generates masks for referents. Specifically, we propose two innovative designs, i.e., Locality-Perceptive Attention (LPA) and a bidirectional Semantic Alignment Loss (SAL), to properly handle the many-to-many relationship between textual expressions and visual objects. LPA embeds the local spatial priors into attention modeling, i.e., a pixel may belong to multiple masks at different scales, thereby improving segmentation. To help understand the complex semantic relationships, SAL proposes a bidirectional contrastive objective to regularize the semantic consistency inter modalities. Extensive experiments on the PNG benchmark dataset demonstrate the effectiveness and efficiency of our method. Compared to the single-stage baseline, our method achieves a significant improvement of up to 9.4% accuracy. More importantly, our EPNG is 10 times faster than the two-stage model. Meanwhile, the generalization ability of EPNG is also validated by zero-shot experiments on other grounding tasks. The source codes and trained models for all our experiments are publicly available at https://github.com/Mr-Neko/EPNG.git.
Learning to Learn Better for Video Object Segmentation

Recently, the joint learning framework (JOINT) integrates matching based transductive reasoning and online inductive learning to achieve accurate and robust semi-supervised video object segmentation (SVOS). However, using the mask embedding as the label to guide the generation of target features in the two branches may result in inadequate target representation and degrade the performance. Besides, how to reasonably fuse the target features in the two different branches rather than simply adding them together to avoid the adverse effect of one dominant branch has not been investigated. In this paper, we propose a novel framework that emphasizes Learning to Learn Better (LLB) target features for SVOS, termed LLB, where we design the discriminative label generation module (DLGM) and the adaptive fusion module to address these issues. Technically, the DLGM takes the background-filtered frame instead of the target mask as input and adopts a lightweight encoder to generate the target features, which serves as the label of the online few-shot learner and the value of the decoder in the transformer to guide the two branches to learn more discriminative target representation. The adaptive fusion module maintains a learnable gate for each branch, which reweighs the element-wise feature representation and allows an adaptive amount of target information in each branch flowing to the fused target feature, thus preventing one branch from being dominant and making the target feature more robust to distractor. Extensive experiments on public benchmarks show that our proposed LLB method achieves state-of-the-art performance.