arXiv subjects

Jun Li

Publications and source records attributed to Jun Li.

At least 469 records · Page 26Linked to original sources

arXiv2023

Creative Birds: Self-Supervised Single-View 3D Style Transfer

In this paper, we propose a novel method for single-view 3D style transfer that generates a unique 3D object with both shape and texture transfer. Our focus lies primarily on birds, a popular subject in 3D reconstruction, for which no existing single-view 3D transfer methods have been developed.The method we propose seeks to generate a 3D mesh shape and texture of a bird from two single-view images. To achieve this, we introduce a novel shape transfer generator that comprises a dual residual gated network (DRGNet), and a multi-layer perceptron (MLP). DRGNet extracts the features of source and target images using a shared coordinate gate unit, while the MLP generates spatial coordinates for building a 3D mesh. We also introduce a semantic UV texture transfer module that implements textural style transfer using semantic UV segmentation, which ensures consistency in the semantic meaning of the transferred regions. This module can be widely adapted to many existing approaches. Finally, our method constructs a novel 3D bird using a differentiable renderer. Experimental results on the CUB dataset verify that our method achieves state-of-the-art performance on the single-view 3D style transfer task. Code is available in https://github.com/wrk226/creative_birds.

cs.CV↗

arXiv2023

RIS-Aided Spatial Scattering Modulation for mmWave MIMO Transmissions

This paper investigates the reconfigurable intelligent surface (RIS) assisted spatial scattering modulation (SSM) scheme for millimeter-wave (mmWave) multiple-input multiple-output (MIMO) systems, in which line-of-sight (LoS) and non-line-of-sight (NLoS) paths are respectively considered in the transmitter-RIS and RIS-receiver channels. Based on the maximum likelihood detector, the conditional pairwise error probability (CPEP) expression for the RIS-SSM scheme is derived under the two cases of received beam correct and demodulation error. Furthermore, we derive the closed-form expressions of the unconditional pairwise error probability (UPEP) by employing two different methods: the probability density function and the moment-generating function expressions with a descending order of scatterer gains. To provide more useful insights, we derive the asymptotic UPEP and the diversity gain of the RIS-SSM scheme in the high SNR region. Depending on UPEP and the corresponding Euclidean distance, we get the union upper bound of the average bit error probability (ABEP). A new framework for ergodic capacity analysis is also provided to acquire the proposed system's effective capacity. Finally, all derivation results are validated via extensive Monte Carlo simulations, revealing that the proposed RIS-SSM scheme outperforms the benchmarks in terms of reliability.

cs.IT↗

arXiv2023

Performance of RIS-Assisted Full-Duplex Space Shift Keying With Imperfect Self-Interference Cancellation

In this paper, we consider a full-duplex (FD) space shift keying (SSK) communication system, where information exchange between two users is assisted only by a reconfigurable intelligent surface (RIS). In particular, the impact of loop interference (LI) between the transmit and receive antennas as well as residual self-interference (SI) from the RIS is considered. Based on the maximum likelihood detector, we derive the conditional pairwise error probability and the numerical integration expression for the unconditional pairwise error probability (UPEP). Since it is difficult to find a closed-form solution, we perform accurate estimation by the Gauss-Chebyshev quadrature (GCQ) method. To gain more useful insights, we derive an expression for UPEP in the high signal-to-noise ratio region and further give the average bit error probability (ABEP) expression. Monte Carlo simulations were performed to validate the derived results. It is found that SI and LI have severe impacts on system performance. Fortunately, these two disturbances can be well counteracted by increasing the number of RIS units.

cs.IT↗

arXiv2023

Bayesian Linear Regression with Cauchy Prior and Its Application in Sparse MIMO Radar

In this paper, a sparse signal recovery algorithm using Bayesian linear regression with Cauchy prior (BLRC) is proposed. Utilizing an approximate expectation maximization(AEM) scheme, a systematic hyper-parameter updating strategy is developed to make BLRC practical in highly dynamic scenarios. Remarkably, with a more compact latent space, BLRC not only possesses essential features of the well-known sparse Bayesian learning (SBL) and iterative reweighted l2 (IR-l2) algorithms but also outperforms them. Using sparse array (SPA) and coprime array (CPA), numerical analyses are first performed to show the superior performance of BLRC under various noise levels, array sizes, and sparsity levels. Applications of BLRC to sparse multiple-input and multiple-output (MIMO) radar array signal processing are then carried out to show that the proposed BLRC can efficiently produce high-resolution images of the targets.

eess.SP↗

arXiv2023

General vs. Long-Tailed Age Estimation: An Approach to Kill Two Birds with One Stone

Facial age estimation has received a lot of attention for its diverse application scenarios. Most existing studies treat each sample equally and aim to reduce the average estimation error for the entire dataset, which can be summarized as General Age Estimation. However, due to the long-tailed distribution prevalent in the dataset, treating all samples equally will inevitably bias the model toward the head classes (usually the adult with a majority of samples). Driven by this, some works suggest that each class should be treated equally to improve performance in tail classes (with a minority of samples), which can be summarized as Long-tailed Age Estimation. However, Long-tailed Age Estimation usually faces a performance trade-off, i.e., achieving improvement in tail classes by sacrificing the head classes. In this paper, our goal is to design a unified framework to perform well on both tasks, killing two birds with one stone. To this end, we propose a simple, effective, and flexible training paradigm named GLAE, which is two-fold. Our GLAE provides a surprising improvement on Morph II, reaching the lowest MAE and CMAE of 1.14 and 1.27 years, respectively. Compared to the previous best method, MAE dropped by up to 34%, which is an unprecedented improvement, and for the first time, MAE is close to 1 year old. Extensive experiments on other age benchmark datasets, including CACD, MIVIA, and Chalearn LAP 2015, also indicate that GLAE outperforms the state-of-the-art approaches significantly.

cs.CV↗

arXiv2023

Mobility-Aware Joint User Scheduling and Resource Allocation for Low Latency Federated Learning

As an efficient distributed machine learning approach, Federated learning (FL) can obtain a shared model by iterative local model training at the user side and global model aggregating at the central server side, thereby protecting privacy of users. Mobile users in FL systems typically communicate with base stations (BSs) via wireless channels, where training performance could be degraded due to unreliable access caused by user mobility. However, existing work only investigates a static scenario or random initialization of user locations, which fail to capture mobility in real-world networks. To tackle this issue, we propose a practical model for user mobility in FL across multiple BSs, and develop a user scheduling and resource allocation method to minimize the training delay with constrained communication resources. Specifically, we first formulate an optimization problem with user mobility that jointly considers user selection, BS assignment to users, and bandwidth allocation to minimize the latency in each communication round. This optimization problem turned out to be NP-hard and we proposed a delay-aware greedy search algorithm (DAGSA) to solve it. Simulation results show that the proposed algorithm achieves better performance than the state-of-the-art baselines and a certain level of user mobility could improve training performance.

cs.DC↗

arXiv2023

Reconfigurable Intelligent Surface Assisted Free Space Optical Information and Power Transfer

Free space optical (FSO) transmission has emerged as a key candidate technology for 6G to expand new spectrum and improve network capacity due to its advantages of large bandwidth, low electromagnetic interference, and high energy efficiency. Resonant beam operating in the infrared band utilizes spatially separated laser cavities to enable safe and mobile high-power energy and high-rate information transmission but is limited by line-of-sight (LOS) channel. In this paper, we propose a reconfigurable intelligent surface (RIS) assisted resonant beam simultaneous wireless information and power transfer (SWIPT) system and establish an optical field propagation model to analyze the channel state information (CSI), in which LOS obstruction can be detected sensitively and non-line-of-sight (NLOS) transmission can be realized by changing the phased of resonant beam in RIS. Numerical results demonstrate that, apart from the transmission distance, the NLOS performance depends on both the horizontal and vertical positions of RIS. The maximum NLOS energy efficiency can achieve 55% within a transfer distance of 10m, a translation distance of $\pm$4mm, and rotation angle of $\pm$50°.

cs.PF↗

arXiv2023

Legal Decision-making for Highway Automated Driving

Compliance with traffic laws is a fundamental requirement for human drivers on the road, and autonomous vehicles must adhere to traffic laws as well. However, current autonomous vehicles prioritize safety and collision avoidance primarily in their decision-making and planning, which will lead to misunderstandings and distrust from human drivers and may even result in accidents in mixed traffic flow. Therefore, ensuring the compliance of the autonomous driving decision-making system is essential for ensuring the safety of autonomous driving and promoting the widespread adoption of autonomous driving technology. To this end, the paper proposes a trigger-based layered compliance decision-making framework. This framework utilizes the decision intent at the highest level as a signal to activate an online violation monitor that identifies the type of violation committed by the vehicle. Then, a four-layer architecture for compliance decision-making is employed to generate compliantly trajectories. Using this system, autonomous vehicles can detect and correct potential violations in real-time, thereby enhancing safety and building public confidence in autonomous driving technology. Finally, the proposed method is evaluated on the DJI AD4CHE highway dataset under four typical highway scenarios: speed limit, following distance, overtaking, and lane-changing. The results indicate that the proposed method increases the vehicle's overall compliance rate from 13.85% to 84.46%, while reducing the proportion of active violations to 0%, demonstrating its effectiveness.

cs.RO↗

arXiv2023

Focusing on Relevant Responses for Multi-modal Rumor Detection

In the absence of an authoritative statement about a rumor, people may expose the truth behind such rumor through their responses on social media. Most rumor detection methods aggregate the information of all the responses and have made great progress. However, due to the different backgrounds of users, the responses have different relevance for discovering th suspicious points hidden in a rumor claim. The methods that focus on all the responding tweets would dilute the effect of the critical ones. Moreover, for a multi-modal rumor claim, the focus of a user may be on several words in the text or an object in the image, so the different modalities should be considered to select the relevant responses and verify the claim. In this paper, we propose a novel multi-modal rumor detection model, termed Focal Reasoning Model (FoRM), to filter out the irrelevant responses and further conduct fine-grained reasoning with the multi-modal claim and corresponding responses. Concretely, there are two main components in our FoRM: the coarse-grained selection and the fine-grained reasoning. The coarse-grained selection component leverages the post-level features of the responses to verify the claim and learns a relevant score of each response. Based on the relevant scores, the most relevant responses are reserved as the critical ones to the further reasoning. In the fine-grained reasoning component, we design a relation attention module to explore the fine-grained relations, i.e., token-to-token and token-to-object relations, between the reserved responses and the multi-modal claim for finding out the valuable clues. Extensive experiments have been conducted on two real-world datasets, and the results demonstrate that our proposed model outperforms all the baselines.

cs.SI↗

arXiv2023

Practical quantum simulation of small-scale non-Hermitian dynamics

Non-Hermitian quantum systems have recently attracted considerable attention due to their exotic properties. Though many experimental realizations of non-Hermitian systems have been reported, the non-Hermiticity usually resorts to the hard-to-control environments and cannot last for too long times. An alternative approach is to use quantum simulation with the closed system, whereas how to simulate non-Hermitian Hamiltonian dynamics remains a great challenge. To tackle this problem, we propose a protocol which combines a dilation method with the variational quantum algorithm. The dilation method is used to transform a non-Hermitian Hamiltonian into a Hermitian one through an exquisite quantum circuit, while the variational quantum algorithm is for efficiently approximating the complex entangled gates in this circuit. As a demonstration, we apply our protocol to simulate the dynamics of an Ising chain with nonlocal non-Hermitian perturbations, which is an important model to study quantum phase transition at nonzero temperatures. The numerical simulation results are highly consistent with the theoretical predictions, revealing the effectiveness of our protocol. The presented protocol paves the way for practically simulating small-scale non-Hermitian dynamics.

quant-ph↗

arXiv2023

EfficientSRFace: An Efficient Network with Super-Resolution Enhancement for Accurate Face Detection

In face detection, low-resolution faces, such as numerous small faces of a human group in a crowded scene, are common in dense face prediction tasks. They usually contain limited visual clues and make small faces less distinguishable from the other small objects, which poses great challenge to accurate face detection. Although deep convolutional neural network has significantly promoted the research on face detection recently, current deep face detectors rarely take into account low-resolution faces and are still vulnerable to the real-world scenarios where massive amount of low-resolution faces exist. Consequently, they usually achieve degraded performance for low-resolution face detection. In order to alleviate this problem, we develop an efficient detector termed EfficientSRFace by introducing a feature-level super-resolution reconstruction network for enhancing the feature representation capability of the model. This module plays an auxiliary role in the training process, and can be removed during the inference without increasing the inference time. Extensive experiments on public benchmarking datasets, such as FDDB and WIDER Face, show that the embedded image super-resolution module can significantly improve the detection accuracy at the cost of a small amount of additional parameters and computational overhead, while helping our model achieve competitive performance compared with the state-of-the-arts methods.

cs.CV↗

arXiv2023

Stability of the symplectomorphism group of rational surfaces

We apply Zhang's almost Kähler Nakai-Moishezon theorem and Li-Zhang's comparison of $J$-symplectic cones to establish a stability result for the symplectomorphism group of a rational $4$-manifold $M$ with Euler number up to $12$. As a corollary, we also derive a stability result for the space of embedded symplectic balls in $M$. A noteworthy feature of our approach is that we systematically explore various spaces and groups associated to a symplectic cohomology class $u$ rather than with a single symplectic form $ω$. To this end, we prove a weaker version of the tamed $J$-inflation procedures of D. McDuff and O. Buse that fixes a gap in their original formulations.

math.SG↗

arXiv2023

Symplectic isotopy on non-minimal ruled surfaces

We prove the stability of $Symp(X,ω)\cap Diff_0(X)$ for a one-point blow-up of irrational ruled surfaces and study their topological colimit. Non-trivial generators of $π_0[Symp(X,ω)\cap Diff_0(X)]$ that differ from Lagrangian Dehn twists are detected.

math.SG↗

arXiv2023

Degenerate Topological Edge States in Multimer Chains

We propose and experimentally realize a class of quasi-one-dimensional topological lattices whose unit cells are constructed by coupled multiple identical resonators, with uniform hopping and inversion symmetry. In the presence of path-induced effective zero hopping within the unit cells, the systems are characterized by complete multimerization with degenerate $-1$ energy edge states for open boundary condition. Su-Schrieffer-Heeger subspaces with fully dimerized limits corresponding to pairs of nontrivial flat bands are derived from the Hilbert spaces. In particular, topological bound states in the continuum (BICs) are inherently present in even multimer chains, manifested by embedding the topological bound states into a continuous band assured by bulk-boundary correspondence. Moreover, we experimentally demonstrate the degenerate topological edge states and topological BICs in inductor-capacitor circuits.

cond-mat.mes-hall↗

arXiv2023

No driver, No Regulation? --Online Legal Driving Behavior Monitoring for Self-driving Vehicles

Defined traffic laws must be respected by all vehicles. However, it is essential to know which behaviors violate the current laws, especially when a responsibility issue is involved in an accident. This brings challenges of digitizing human-driver-oriented traffic laws and monitoring vehicles' behaviors continuously. To address these challenges, this paper aims to digitize traffic law comprehensively and provide an application for online monitoring of legal driving behavior for autonomous vehicles. This paper introduces a layered trigger domain-based traffic law digitization architecture with digitization-classified discussions and detailed atomic propositions for online monitoring. The principal laws on a highway and at an intersection are taken as examples, and the corresponding logic and atomic propositions are introduced in detail. Finally, the digitized traffic laws are verified on the Chinese highway and intersection datasets, and defined thresholds are further discussed according to the driving behaviors in the considered dataset. This study can help manufacturers and the government in defining specifications and laws and can also be used as a useful reference in traffic laws compliance decision-making. Source code is available on https://github.com/SOTIF-AVLab/DOTL.

eess.SY↗

arXiv2023

Failure Detection for Motion Prediction of Autonomous Driving: An Uncertainty Perspective

Motion prediction is essential for safe and efficient autonomous driving. However, the inexplicability and uncertainty of complex artificial intelligence models may lead to unpredictable failures of the motion prediction module, which may mislead the system to make unsafe decisions. Therefore, it is necessary to develop methods to guarantee reliable autonomous driving, where failure detection is a potential direction. Uncertainty estimates can be used to quantify the degree of confidence a model has in its predictions and may be valuable for failure detection. We propose a framework of failure detection for motion prediction from the uncertainty perspective, considering both motion uncertainty and model uncertainty, and formulate various uncertainty scores according to different prediction stages. The proposed approach is evaluated based on different motion prediction algorithms, uncertainty estimation methods, uncertainty scores, etc., and the results show that uncertainty is promising for failure detection for motion prediction but should be used with caution.

cs.RO↗

arXiv2023

Adaptive Distributed Filtering of DDoS Traffic on the Internet

Despite the proliferation of traffic filtering capabilities throughout the Internet, attackers continue to launch distributed denial-of-service (DDoS) attacks to successfully overwhelm the victims with DDoS traffic. In this paper, we introduce a distributed filtering system that leverages nodes distributed along the paths of DDoS traffic to filter the DDoS traffic. In particular, we focus on adaptive distributed filtering, a new direction in filtering DDoS traffic. In our design, a subscriber to the distributed filtering service can act on behalf of a DDoS victim and generate filtering rules that not only adapt to the most suitable and effective filtering granularity (e.g., IP source address and a port number vs. an individual IP address vs. IP prefixes at different lengths), but also adapt to the preferences of the subscriber (e.g., maximum coverage of DDoS traffic vs. minimum collateral damage from dropping legitimate traffic vs. minimum number of rules). We design an efficient algorithm that can generate rules adaptive toward filtering granularities and objectives, which can further help determine where to deploy generated rules for the best efficacy. We evaluated our system through both large-scale simulations based on real-world DDoS attack traces and pilot studies. Our evaluations confirm that our algorithm can generate rules that adapt to every distinct filtering objective and achieve optimal results. We studied the success rate and distribution of rule deployment under different Internet-scale rule deployment profiles, and found a small number of autonomous systems can contribute disproportionately to the defense. Our pilot studies also show our adaptive distributed filtering system can effectively defend against real-world DDoS attack traces in real time.

cs.NI↗

arXiv2023

Self-Aware Trajectory Prediction for Safe Autonomous Driving

Trajectory prediction is one of the key components of the autonomous driving software stack. Accurate prediction for the future movement of surrounding traffic participants is an important prerequisite for ensuring the driving efficiency and safety of intelligent vehicles. Trajectory prediction algorithms based on artificial intelligence have been widely studied and applied in recent years and have achieved remarkable results. However, complex artificial intelligence models are uncertain and difficult to explain, so they may face unintended failures when applied in the real world. In this paper, a self-aware trajectory prediction method is proposed. By introducing a self-awareness module and a two-stage training process, the original trajectory prediction module's performance is estimated online, to facilitate the system to deal with the possible scenario of insufficient prediction function in time, and create conditions for the realization of safe and reliable autonomous driving. Comprehensive experiments and analysis are performed, and the proposed method performed well in terms of self-awareness, memory footprint, and real-time performance, showing that it may serve as a promising paradigm for safe autonomous driving.

cs.RO↗