arXiv subjects

Yingjie Xu

Publications and source records attributed to Yingjie Xu.

31 records · Page 2Linked to original sources

arXiv2025

BuildSTG: A Multi-building Energy Load Forecasting Method using Spatio-Temporal Graph Neural Network

Due to the extensive availability of operation data, data-driven methods show strong capabilities in predicting building energy loads. Buildings with similar features often share energy patterns, reflected by spatial dependencies in their operational data, which conventional prediction methods struggle to capture. To overcome this, we propose a multi-building prediction approach using spatio-temporal graph neural networks, comprising graph representation, graph learning, and interpretation. First, a graph is built based on building characteristics and environmental factors. Next, a multi-level graph convolutional architecture with attention is developed for energy prediction. Lastly, a method interpreting the optimized graph structure is introduced. Experiments on the Building Data Genome Project 2 dataset confirm superior performance over baselines such as XGBoost, SVR, FCNN, GRU, and Naive, highlighting the method's robustness, generalization, and interpretability in capturing meaningful building similarities and spatial relationships.

cs.LG↗

arXiv2025

Advancing high-fidelity 3D and Texture Generation with 2.5D latents

Despite the availability of large-scale 3D datasets and advancements in 3D generative models, the complexity and uneven quality of 3D geometry and texture data continue to hinder the performance of 3D generation techniques. In most existing approaches, 3D geometry and texture are generated in separate stages using different models and non-unified representations, frequently leading to unsatisfactory coherence between geometry and texture. To address these challenges, we propose a novel framework for joint generation of 3D geometry and texture. Specifically, we focus in generate a versatile 2.5D representations that can be seamlessly transformed between 2D and 3D. Our approach begins by integrating multiview RGB, normal, and coordinate images into a unified representation, termed as 2.5D latents. Next, we adapt pre-trained 2D foundation models for high-fidelity 2.5D generation, utilizing both text and image conditions. Finally, we introduce a lightweight 2.5D-to-3D refiner-decoder framework that efficiently generates detailed 3D representations from 2.5D images. Extensive experiments demonstrate that our model not only excels in generating high-quality 3D objects with coherent structure and color from text and image inputs but also significantly outperforms existing methods in geometry-conditioned texture generation.

cs.CV↗

arXiv2025

Sparse Arrays Enable Near-Field Constant-Distance Focusing with Reduced Focal Shift

In near-field beam focusing for finite-sized arrays, focal shift is a non-negligible issue. The actual focal point often appears closer to the array than the predefined focal distance, significantly degrading the focusing performance of finite aperture arrays. Moreover, when the focus point is scanned across different locations, the degradation becomes even more pronounced, leading not only to positional deviation but also to substantial energy loss. To address this issue, we revisit the problem from the perspective of communication degrees of freedom. We demonstrate that a properly designed sparse array with optimized element spacing can effectively mitigate focal shift while enabling stable control of the focusing height during beam scanning. Simulation results based on dipole antennas with different polarizations and patch antennas validate our findings. Notably, with optimized inter-element distances, the energy distribution across focal points becomes nearly uniform, and highly accurate focusing positions are achieved.

eess.SP↗

arXiv2025

Interacting Object-Enabled Clustering and Characterization of Distributed MIMO Channels

Distributed multiple-input multiple-output (MIMO), also known as cell-free massive MIMO, emerges as a promising technology for sixth-generation (6G) systems to support uniform coverage and reliable communication. For the design and optimization of such systems, measurement-based investigations of real-world distributed MIMO channels are essential. In this paper, we present an indoor channel measurement campaign, featuring eight distributed antenna arrays with 128 elements in total. Multi-link channels are measured at 50 positions along a 12-meter user route. A clustering algorithm enabled by interacting objects is proposed to identify clusters in the measured channels. The algorithm jointly clusters the multipath components for all links, effectively capturing the dynamic contributions of common clusters to different links. In addition, a Kalman filter-based tracking framework is introduced for cluster prediction, tracking, and updating along the user movement. Using the clustering and tracking results, cluster-level characterization of the measured channels is performed. First, the number of clusters and their visibility at both link ends are analyzed. Next, a maximum-likelihood estimator is utilized to determine the entire cluster visibility region length. Finally, key cluster-level properties, including the common cluster ratio, cluster power, shadowing, spread, among others, are statistically investigated. The results provide valuable insights into cluster behavior in typical multi-link channels, necessary for accurate modeling of distributed MIMO channels.

eess.SP↗

arXiv2025

Kiss3DGen: Repurposing Image Diffusion Models for 3D Asset Generation

Diffusion models have achieved great success in generating 2D images. However, the quality and generalizability of 3D content generation remain limited. State-of-the-art methods often require large-scale 3D assets for training, which are challenging to collect. In this work, we introduce Kiss3DGen (Keep It Simple and Straightforward in 3D Generation), an efficient framework for generating, editing, and enhancing 3D objects by repurposing a well-trained 2D image diffusion model for 3D generation. Specifically, we fine-tune a diffusion model to generate ''3D Bundle Image'', a tiled representation composed of multi-view images and their corresponding normal maps. The normal maps are then used to reconstruct a 3D mesh, and the multi-view images provide texture mapping, resulting in a complete 3D model. This simple method effectively transforms the 3D generation problem into a 2D image generation task, maximizing the utilization of knowledge in pretrained diffusion models. Furthermore, we demonstrate that our Kiss3DGen model is compatible with various diffusion model techniques, enabling advanced features such as 3D editing, mesh and texture enhancement, etc. Through extensive experiments, we demonstrate the effectiveness of our approach, showcasing its ability to produce high-quality 3D models efficiently.

cs.GR↗

arXiv2025

ARIC: An Activity Recognition Dataset in Classroom Surveillance Images

The application of activity recognition in the ``AI + Education" field is gaining increasing attention. However, current work mainly focuses on the recognition of activities in manually captured videos and a limited number of activity types, with little attention given to recognizing activities in surveillance images from real classrooms. Activity recognition in classroom surveillance images faces multiple challenges, such as class imbalance and high activity similarity. To address this gap, we constructed a novel multimodal dataset focused on classroom surveillance image activity recognition called ARIC (Activity Recognition In Classroom). The ARIC dataset has advantages of multiple perspectives, 32 activity categories, three modalities, and real-world classroom scenarios. In addition to the general activity recognition tasks, we also provide settings for continual learning and few-shot continual learning. We hope that the ARIC dataset can act as a facilitator for future analysis and research for open teaching scenarios. You can download preliminary data from https://ivipclab.github.io/publication_ARIC/ARIC.

cs.CV↗

arXiv2025

FuzzRisk: Online Collision Risk Estimation for Autonomous Vehicles based on Depth-Aware Object Detection via Fuzzy Inference

This paper presents a novel monitoring framework that infers the level of collision risk for autonomous vehicles (AVs) based on their object detection performance. The framework takes two sets of predictions from different algorithms and associates their inconsistencies with the collision risk via fuzzy inference. The first set of predictions is obtained by retrieving safety-critical 2.5D objects from a depth map, and the second set comes from the ordinary AV's 3D object detector. We experimentally validate that, based on Intersection-over-Union (IoU) and a depth discrepancy measure, the inconsistencies between the two sets of predictions strongly correlate to the error of the 3D object detector against ground truths. This correlation allows us to construct a fuzzy inference system and map the inconsistency measures to an AV collision risk indicator. In particular, we optimize the fuzzy inference system towards an existing offline metric that matches AV collision rates well. Lastly, we validate our monitor's capability to produce relevant risk estimates with the large-scale nuScenes dataset and demonstrate that it can safeguard an AV in closed-loop simulations.

cs.RO↗

arXiv2024

Spatial separation of closely-spaced users in measured distributed massive MIMO channels

Aiming for the sixth generation (6G) wireless communications, distributed massive multiple-input multiple-output (MIMO) systems hold significant potential for spatial multiplexing. In order to evaluate the ability of a distributed massive MIMO system to spatially separate closely spaced users, this paper presents an indoor channel measurement campaign. The measurements are carried out at a carrier frequency of 5.6 GHz with a bandwidth of 400 MHz, employing distributed antenna arrays with a total of 128 elements. Multiple scalar metrics are selected to evaluate spatial separability in line-of-sight, non line-of-sight, and mixed conditions. Firstly, through studying the singular value spread, it is shown that in line-of-sight conditions, better user orthogonality is achieved with a distributed MIMO setup compared to a co-located MIMO array. Furthermore, the dirty-paper coding (DPC) capacity and zero forcing (ZF) precoding sum-rate capacities are investigated across varying numbers of antennas and their topologies. The results show that in all three conditions, the less complex ZF precoder can be applied in distributed massive MIMO systems while still achieving a large fraction of the DPC capacity. Additionally, in line-of-sight conditions, both sum-rate capacities and user fairness benefit from more antennas and a more distributed antenna topology. However, in the given NLoS condition, the improvement in spatial separability through distributed antenna topologies is limited.

eess.SP↗

arXiv2024

Learning with Unreliability: Fast Few-shot Voxel Radiance Fields with Relative Geometric Consistency

We propose a voxel-based optimization framework, ReVoRF, for few-shot radiance fields that strategically address the unreliability in pseudo novel view synthesis. Our method pivots on the insight that relative depth relationships within neighboring regions are more reliable than the absolute color values in disoccluded areas. Consequently, we devise a bilateral geometric consistency loss that carefully navigates the trade-off between color fidelity and geometric accuracy in the context of depth consistency for uncertain regions. Moreover, we present a reliability-guided learning strategy to discern and utilize the variable quality across synthesized views, complemented by a reliability-aware voxel smoothing algorithm that smoothens the transition between reliable and unreliable data patches. Our approach allows for a more nuanced use of all available data, promoting enhanced learning from regions previously considered unsuitable for high-quality reconstruction. Extensive experiments across diverse datasets reveal that our approach attains significant gains in efficiency and accuracy, delivering rendering speeds of 3 FPS, 7 mins to train a $360^\circ$ scene, and a 5\% improvement in PSNR over existing few-shot methods. Code is available at https://github.com/HKCLynn/ReVoRF.

cs.CV↗

arXiv2023

An Auto-Parallelizer for Distributed Computing in Haskell

One of the main challenges in distributed computing is building interfaces and APIs that allow programmers with limited background in distributed systems to write scalable, performant, and fault-tolerant applications on large clusters. In this demonstration, we designed and implemented a Haskell auto-parallelizer with a simple yet powerful interface by taking advantage of the default purity of Haskell functions. Finally, we benchmarked our implementation on a set of examples to illustrate the potential for future work in this direction.

cs.DC↗

arXiv2023

Identifying Different Student Clusters in Functional Programming Assignments: From Quick Learners to Struggling Students

Instructors and students alike are often focused on the grade in programming assignments as a key measure of how well a student is mastering the material and whether a student is struggling. This can be, however, misleading. Especially when students have access to auto-graders, their grades may be heavily skewed. In this paper, we analyze student assignment submission data collected from a functional programming course taught at McGill university incorporating a wide range of features. In addition to the grade, we consider activity time data, time spent, and the number of static errors. This allows us to identify four clusters of students: "Quick-learning", "Hardworking", "Satisficing", and "Struggling" through cluster algorithms. We then analyze how work habits, working duration, the range of errors, and the ability to fix errors impact different clusters of students. This structured analysis provides valuable insights for instructors to actively help different types of students and emphasize different aspects of their overall course design. It also provides insights for students themselves to understand which aspects they still struggle with and allows them to seek clarification and adjust their work habits.

cs.CY↗

arXiv2022

Fiber bundle topology optimization for surface flows

This paper presents a topology optimization approach for the surface flows on variable design domains. Via this approach, the matching between the pattern of a surface flow and the 2-manifold used to define the pattern can be optimized, where the 2-manifold is implicitly defined on another fixed 2-manifold named as the base manifold. The fiber bundle topology optimization approach is developed based on the description of the topological structure of the surface flow by using the differential geometry concept of the fiber bundle. The material distribution method is used to achieve the evolution of the pattern of the surface flow. The evolution of the implicit 2-manifold is realized via a homeomorphous map. The design variable of the pattern of the surface flow and that of the implicit 2-manifold are regularized by two sequentially implemented surface-PDE filters. The two surface-PDE filters are coupled, because they are defined on the implicit 2-manifold and base manifold, respectively. The surface Navier-Stokes equations, defined on the implicit 2-manifold, are used to describe the surface flow. The fiber bundle topology optimization problem is analyzed using the continuous adjoint method implemented on the first-order Sobolev space. Several numerical examples have been provided to demonstrate this approach, where the combination of the viscous dissipation and pressure drop is used as the design objective.

math.OC↗

arXiv2021

A 3D Non-stationary MmWave Channel Model for Vacuum Tube Ultra-High-Speed Train Channels

As a potential development direction of future transportation, the vacuum tube ultra-high-speed train (UHST) wireless communication systems have newly different channel characteristics from existing high-speed train (HST) scenarios. In this paper, a three-dimensional non-stationary millimeter wave (mmWave) geometry-based stochastic model (GBSM) is proposed to investigate the channel characteristics of UHST channels in vacuum tube scenarios, taking into account the waveguide effect and the impact of tube wall roughness on channel. Then, based on the proposed model, some important time-variant channel statistical properties are studied and compared with those in existing HST and tunnel channels. The results obtained show that the multipath effect in vacuum tube scenarios will be more obvious than tunnel scenarios but less than existing HST scenarios, which will provide some insights for future research on vacuum tube UHST wireless communications.

eess.SP↗