Searcharxiv⌕ Search

arXiv subjects

Rui Li

Publications and source records attributed to Rui Li.

At least 415 records · Page 23Linked to original sources

Slice Imputation: Intermediate Slice Interpolation for Anisotropic 3D Medical Image Segmentation

We introduce a novel frame-interpolation-based method for slice imputation to improve segmentation accuracy for anisotropic 3D medical images, in which the number of slices and their corresponding segmentation labels can be increased between two consecutive slices in anisotropic 3D medical volumes. Unlike previous inter-slice imputation methods, which only focus on the smoothness in the axial direction, this study aims to improve the smoothness of the interpolated 3D medical volumes in all three directions: axial, sagittal, and coronal. The proposed multitask inter-slice imputation method, in particular, incorporates a smoothness loss function to evaluate the smoothness of the interpolated 3D medical volumes in the through-plane direction (sagittal and coronal). It not only improves the resolution of the interpolated 3D medical volumes in the through-plane direction but also transforms them into isotropic representations, which leads to better segmentation performances. Experiments on whole tumor segmentation in the brain, liver tumor segmentation, and prostate segmentation indicate that our method outperforms the competing slice imputation methods on both computed tomography and magnetic resonance images volumes in most cases.

eess.IV↗

Neural Adaptive SCEne Tracing

Neural rendering with implicit neural networks has recently emerged as an attractive proposition for scene reconstruction, achieving excellent quality albeit at high computational cost. While the most recent generation of such methods has made progress on the rendering (inference) times, very little progress has been made on improving the reconstruction (training) times. In this work, we present Neural Adaptive Scene Tracing (NAScenT), the first neural rendering method based on directly training a hybrid explicit-implicit neural representation. NAScenT uses a hierarchical octree representation with one neural network per leaf node and combines this representation with a two-stage sampling process that concentrates ray samples where they matter most near object surfaces. As a result, NAScenT is capable of reconstructing challenging scenes including both large, sparsely populated volumes like UAV captured outdoor environments, as well as small scenes with high geometric complexity. NAScenT outperforms existing neural rendering approaches in terms of both quality and training time.

cs.CV↗

TransMUSE: Transferable Traffic Prediction in MUlti-Service EdgeNetworks

The Covid-19 pandemic has forced the workforce to switch to working from home, which has put significant burdens on the management of broadband networks and called for intelligent service-by-service resource optimization at the network edge. In this context, network traffic prediction is crucial for operators to provide reliable connectivity across large geographic regions. Although recent advances in neural network design have demonstrated potential to effectively tackle forecasting, in this work we reveal based on real-world measurements that network traffic across different regions differs widely. As a result, models trained on historical traffic data observed in one region can hardly serve in making accurate predictions in other areas. Training bespoke models for different regions is tempting, but that approach bears significant measurement overhead, is computationally expensive, and does not scale. Therefore, in this paper we propose TransMUSE, a novel deep learning framework that clusters similar services, groups edge-nodes into cohorts by traffic feature similarity, and employs a Transformer-based Multi-service Traffic Prediction Network (TMTPN), which can be directly transferred within a cohort without any customization. We demonstrate that TransMUSE exhibits imperceptible performance degradation in terms of mean absolute error (MAE) when forecasting traffic, compared with settings where a model is trained for each individual edge node. Moreover, our proposed TMTPN architecture outperforms the state-of-the-art, achieving up to 43.21% lower MAE in the multi-service traffic prediction task. To the best of our knowledge, this is the first work that jointly employs model transfer and multi-service traffic prediction to reduce measurement overhead, while providing fine-grained accurate demand forecasts for edge services provisioning.

cs.NI↗

Shape and Reflectance Reconstruction in Uncontrolled Environments by Differentiable Rendering

Simultaneous reconstruction of geometry and reflectance properties in uncontrolled environments remains a challenging problem. In this paper, we propose an efficient method to reconstruct the scene's 3D geometry and reflectance from multi-view photography using conventional hand-held cameras. Our method automatically builds a virtual scene in a differentiable rendering system that roughly matches the real world's scene parameters, optimized by minimizing photometric objectives alternatingly and stochastically. With the optimal scene parameters evaluated, photo-realistic novel views for various viewing angles and distances can then be generated by our approach. We present the results of captured scenes with complex geometry and various reflection types. Our method also shows superior performance compared to state-of-the-art alternatives in novel view synthesis visually and quantitatively.

cs.CV↗

Unet-TTS: Improving Unseen Speaker and Style Transfer in One-shot Voice Cloning

One-shot voice cloning aims to transform speaker voice and speaking style in speech synthesized from a text-to-speech (TTS) system, where only a shot recording from the target reference speech can be used. Out-of-domain transfer is still a challenging task, and one important aspect that impacts the accuracy and similarity of synthetic speech is the conditional representations carrying speaker or style cues extracted from the limited references. In this paper, we present a novel one-shot voice cloning algorithm called Unet-TTS that has good generalization ability for unseen speakers and styles. Based on a skip-connected U-net structure, the new model can efficiently discover speaker-level and utterance-level spectral feature details from the reference audio, enabling accurate inference of complex acoustic characteristics as well as imitation of speaking styles into the synthetic speech. According to both subjective and objective evaluations of similarity, the new model outperforms both speaker embedding and unsupervised style modeling (GST) approaches on an unseen emotional corpus.

cs.SD↗

NeAT: Neural Adaptive Tomography

In this paper, we present Neural Adaptive Tomography (NeAT), the first adaptive, hierarchical neural rendering pipeline for multi-view inverse rendering. Through a combination of neural features with an adaptive explicit representation, we achieve reconstruction times far superior to existing neural inverse rendering methods. The adaptive explicit representation improves efficiency by facilitating empty space culling and concentrating samples in complex regions, while the neural features act as a neural regularizer for the 3D reconstruction. The NeAT framework is designed specifically for the tomographic setting, which consists only of semi-transparent volumetric scenes instead of opaque objects. In this setting, NeAT outperforms the quality of existing optimization-based tomography solvers while being substantially faster.

cs.CV↗

Dilated Continuous Random Field for Semantic Segmentation

Mean field approximation methodology has laid the foundation of modern Continuous Random Field (CRF) based solutions for the refinement of semantic segmentation. In this paper, we propose to relax the hard constraint of mean field approximation - minimizing the energy term of each node from probabilistic graphical model, by a global optimization with the proposed dilated sparse convolution module (DSConv). In addition, adaptive global average-pooling and adaptive global max-pooling are implemented as replacements of fully connected layers. In order to integrate DSConv, we design an end-to-end, time-efficient DilatedCRF pipeline. The unary energy term is derived either from pre-softmax and post-softmax features, or the predicted affordance map using a conventional classifier, making it easier to implement DilatedCRF for varieties of classifiers. We also present superior experimental results of proposed approach on the suction dataset comparing to other CRF-based approaches.

cs.CV↗

Motion-Focused Contrastive Learning of Video Representations

Motion, as the most distinct phenomenon in a video to involve the changes over time, has been unique and critical to the development of video representation learning. In this paper, we ask the question: how important is the motion particularly for self-supervised video representation learning. To this end, we compose a duet of exploiting the motion for data augmentation and feature learning in the regime of contrastive learning. Specifically, we present a Motion-focused Contrastive Learning (MCL) method that regards such duet as the foundation. On one hand, MCL capitalizes on optical flow of each frame in a video to temporally and spatially sample the tubelets (i.e., sequences of associated frame patches across time) as data augmentations. On the other hand, MCL further aligns gradient maps of the convolutional layers to optical flow maps from spatial, temporal and spatio-temporal perspectives, in order to ground motion information in feature learning. Extensive experiments conducted on R(2+1)D backbone demonstrate the effectiveness of our MCL. On UCF101, the linear classifier trained on the representations learnt by MCL achieves 81.91% top-1 accuracy, outperforming ImageNet supervised pre-training by 6.78%. On Kinetics-400, MCL achieves 66.62% top-1 accuracy under the linear protocol. Code is available at https://github.com/YihengZhang-CV/MCL-Motion-Focused-Contrastive-Learning.

cs.CV↗

Optimal model for fewer-qubit CNOT gates with Rydberg atoms

Fewer-qubit quantum logic gate, serving as a basic unit for constructing universal multiqubit gates, has been widely applied in quantum computing and quantum information. However, traditional constructions for fewer-qubit gates often utilize a multi-pulse protocol which inevitably suffers from serious intrinsic errors during the gate execution. In this article, we report an optimal model about universal two- and three-qubit CNOT gates mediated by excitation to Rydberg states with easily-accessible van der Waals interactions. This gate depends on a global optimization to implement amplitude and phase modulated pulses via genetic algorithm, which can facilitate the gate operation with fewer optical pulses. Compared to conventional multi-pulse piecewise schemes, our gate can be realized by simultaneous excitation of atoms to the Rydberg states, saving the time for multi-pulse switching at different spatial locations. Our numerical simulations show that a single-pulse two(three)-qubit CNOT gate is possibly achieved with a fidelity of 99.23$\%$(90.39$\%$) for two qubits separated by 7.10 $μ$m when the fluctuation of Rydberg interactions is excluded. Our work is promising for achieving fast and convenient multiqubit quantum computing in the study of neutral-atom quantum technology.

quant-ph↗

Heterogeneity-aware Twitter Bot Detection with Relational Graph Transformers

Twitter bot detection has become an important and challenging task to combat misinformation and protect the integrity of the online discourse. State-of-the-art approaches generally leverage the topological structure of the Twittersphere, while they neglect the heterogeneity of relations and influence among users. In this paper, we propose a novel bot detection framework to alleviate this problem, which leverages the topological structure of user-formed heterogeneous graphs and models varying influence intensity between users. Specifically, we construct a heterogeneous information network with users as nodes and diversified relations as edges. We then propose relational graph transformers to model heterogeneous influence between users and learn node representations. Finally, we use semantic attention networks to aggregate messages across users and relations and conduct heterogeneity-aware Twitter bot detection. Extensive experiments demonstrate that our proposal outperforms state-of-the-art methods on a comprehensive Twitter bot detection benchmark. Additional studies also bear out the effectiveness of our proposed relational graph transformers, semantic attention networks and the graph-based approach in general.

cs.SI↗

Spin mapping of intralayer antiferromagnetism and spin-flop transition in monolayer CrTe$_2$

Intrinsic antiferromagnetism in van der Waals (vdW) monolayer (ML) crystals enriches the understanding regarding two-dimensional (2D) magnetic orders and holds special virtues over ferromagnetism in spintronic applications. However, the studies on intrinsic antiferromagnetism are sparse, owing to the lack of net magnetisation. In this study, by combining spin-polarised scanning tunnelling microscopy and first-principles calculations, we investigate the magnetism of vdW ML CrTe2, which has been successfully grown through molecular beam epitaxy. Surprisingly, we observe a stable antiferromagnetic (AFM) order at the atomic scale in the ML crystal, whose bulk is a strong ferromagnet, and correlate its imaged zigzag spin texture with the atomic lattice structure. The AFM order exhibits an intriguing noncollinear spin-flop transition under magnetic fields, consistent with its calculated moderate magnetic anisotropy. The findings of this study demonstrate the intricacy of 2D vdW magnetic materials and pave the way for their in-depth studies.

cond-mat.mtrl-sci↗

A Channel Coding Benchmark for Meta-Learning

Meta-learning provides a popular and effective family of methods for data-efficient learning of new tasks. However, several important issues in meta-learning have proven hard to study thus far. For example, performance degrades in real-world settings where meta-learners must learn from a wide and potentially multi-modal distribution of training tasks; and when distribution shift exists between meta-train and meta-test task distributions. These issues are typically hard to study since the shape of task distributions, and shift between them are not straightforward to measure or control in standard benchmarks. We propose the channel coding problem as a benchmark for meta-learning. Channel coding is an important practical application where task distributions naturally arise, and fast adaptation to new tasks is practically valuable. We use our MetaCC benchmark to study several aspects of meta-learning, including the impact of task distribution breadth and shift, which can be controlled in the coding problem. Going forward, MetaCC provides a tool for the community to study the capabilities and limitations of meta-learning, and to drive research on practically robust and effective meta-learners.

cs.LG↗

Evolution of superconductivity and charge order in pressurized RbV$_3$Sb$_5$

The kagome metals $A$V$_3$Sb$_5$ ($A=$ K, Rb, Cs) under ambient pressure exhibit an unusual charge order, from which superconductivity emerges. In this work, by applying hydrostatic pressure using a liquid pressure medium and carrying out electrical resistance measurements for RbV$_3$Sb$_5$, we find the charge order becomes suppressed under a modest pressure $p_{\rm c}$ ($1.4<p_{\rm c}<1.6$ GPa), while the superconducting transition temperature $T_{\rm c}$ is maximized. $T_{\rm c}$ is then gradually weakened with further increase of pressure and reaches a minimum around 14.3 GPa, before exhibiting another maximum around 22.8 GPa, signifying the presence of a second superconducting dome. Distinct normal state resistance anomalies are found to be associated with the second superconducting dome, similar to KV$_3$Sb$_5$. Our findings point to qualitatively similar temperature-pressure phase diagrams in KV$_3$Sb$_5$ and RbV$_3$Sb$_5$, and suggest a close link between the second superconducting dome and the high-pressure resistance anomalies.

cond-mat.supr-con↗

Scale-aware Neural Network for Semantic Segmentation of Multi-resolution Remote Sensing Images

Assigning geospatial objects with specific categories at the pixel level is a fundamental task in remote sensing image analysis. Along with rapid development in sensor technologies, remotely sensed images can be captured at multiple spatial resolutions (MSR) with information content manifested at different scales. Extracting information from these MSR images represents huge opportunities for enhanced feature representation and characterisation. However, MSR images suffer from two critical issues: 1) increased scale variation of geo-objects and 2) loss of detailed information at coarse spatial resolutions. To bridge these gaps, in this paper, we propose a novel scale-aware neural network (SaNet) for semantic segmentation of MSR remotely sensed imagery. SaNet deploys a densely connected feature network (DCFFM) module to capture high-quality multi-scale context, such that the scale variation is handled properly and the quality of segmentation is increased for both large and small objects. A spatial feature recalibration (SFRM) module is further incorporated into the network to learn intact semantic content with enhanced spatial relationships, where the negative effects of information loss are removed. The combination of DCFFM and SFRM allows SaNet to learn scale-aware feature representation, which outperforms the existing multi-scale feature representation. Extensive experiments on three semantic segmentation datasets demonstrated the effectiveness of the proposed SaNet in cross-resolution segmentation.

cs.CV↗

Inferring galaxy dark halo properties from visible matter with Machine Learning

Next-generation surveys will provide photometric and spectroscopic data of millions to billions of galaxies with unprecedented precision. This offers a unique chance to improve our understanding of the galaxy evolution and the unresolved nature of dark matter (DM). At galaxy scales, the density distribution of DM is strongly affected by the astrophysical feedback processes, which are difficult to fully account for in classical techniques to derive mass models. In this work, we explore the capability of supervised learning algorithms to predict the DM content of galaxies from luminous observational-like parameters, using the public catalog of the TNG100 simulation. In particular, we use Photometric, Structural and Kinematic parameters to predict the total DM mass, DM half-mass radius, DM mass inside one and two stellar half-mass radii. We adopt the coefficient of determination, $R^2$, as a reference metric to evaluate the accuracy of these predictions. We find that the Photometric features alone are able to predict the total DM mass with fair accuracy, while Structural and Photometric features together are more effective to determine the DM inside the stellar half mass radius, and the DM within twice the stellar half mass radius. However, using all observational quantities together (Photometry, Structural and Kinematics) incredibly improves the overall accuracy for all DM quantities. This first test shows that Machine Learning tools are promising approaches to derive predictions of the DM in real galaxies. The next steps will be to improve observational realism of the training sets, by closely select samples which accurately reproduce the typical observed luminous scaling relations. The trained pipelines will be suitable for real galaxy data collected from the next-generation surveys like Rubin/LSST, Euclid, CSST, 4MOST, DESI, to derive, e.g., the properties of their central DM fractions.

astro-ph.GA↗

Half-infinite sampling and its FT

In the digital world, signals are discrete and finite. The Fourier representation of discrete and finite signals is FT convolution of the finite sampling function and the continuous signal. Conventionally, finite sampling is treated as a segment of infinite sampling. Though this approach perfectly solves the difference between finite and infinite sampling, it has caused much trouble for signal processing. Mathematically, there is a kind of sampling between finite and infinite sampling, and we name this kind of sampling as half-infinite sampling. Theoretically, finite sampling can also be treated as a segment of half-infinite sampling. Because we can derive the Fourier representation of discrete and finite signals from half-infinite sampling, the FTs of several half-infinite samplings are studied. The results show that the FT of half-infinite sampling is more concise than that of infinite sampling. A numerical experiment verified the theoretical derivations successfully, during which step sampling was proposed. Besides, several interesting equations were built.

eess.SP↗

Superconductivity modulated by structural phase transitions in pressurized vanadium-based kagome metals

The interplay of superconductivity with electronic and structural instabilities on the kagome lattice provides a fertile ground for the emergence of unusual phenomena. The vanadium-based kagome metals $A$V$_3$Sb$_5$ ($A=$ K, Rb, Cs) exhibit superconductivity on an almost ideal kagome lattice, with the superconducting transition temperature $T_{\rm c}$ forming two domes upon pressure-tuning. The first dome arises from the competition between superconductivity and a charge-density-wave, whereas the origin for the second dome remains unclear. Herein, we show that the appearance of the second superconducting dome in KV$_3$Sb$_5$ and RbV$_3$Sb$_5$ is associated with transitions from hexagonal $P6$/$mmm$ to monoclinic $P2$/$m$ structures, evidenced by splitting of structural peaks from synchrotron powder X-ray diffraction experiments and imaginary phonon frequencies in first-principles calculations. In KV$_3$Sb$_5$, transition to an orthorhombic $Pmmm$ structure is further observed for pressure $p\gtrsim20$ GPa, and is correlated with the strong suppression of $T_{\rm c}$ in the second superconducting dome. Our findings indicate distortions of the crystal structure modulates superconductivity in $A$V$_3$Sb$_5$ under pressure, providing a platform to study the emergence of superconductivity in the presence of multiple structural instabilities.

cond-mat.supr-con↗

Achieving safe minimum circle circumnavigation around multiple targets: a dynamic compensation approach

Minimum circle circumnavigation is proposed in this paper, which is of special value in target monitoring, capturing and/or attacking. In this paper, a safe minimum circle circumnavigation of multiple targets based on bearing measurements is studied. In contrast with the traditional circumnavigation problem, with the new pattern, one agent is able to enclose multiple targets along a minimum circle with the desired enclosing distance and tangential speed. To achieve the minimum circle circumnavigation, an algorithm including dynamic compensators and a control protocol is proposed, by which collision is avoided between the agent and the multiple targets during the whole moving process. Moreover, the control protocol developed for a single agent is further extended to the scenarios of multiple agents by adding a coordination mechanism into the tangential velocity term, which drives the agents to distribute evenly on each expected circular orbit with the same radius or different radius. Simulations results illustrate the effectiveness of the proposed methods.

cs.MA↗