Searcharxiv⌕ Search

arXiv subjects

Liang Xiao

Publications and source records attributed to Liang Xiao.

At least 73 records · Page 4Linked to original sources

UniWorld: Autonomous Driving Pre-training via World Models

In this paper, we draw inspiration from Alberto Elfes' pioneering work in 1989, where he introduced the concept of the occupancy grid as World Models for robots. We imbue the robot with a spatial-temporal world model, termed UniWorld, to perceive its surroundings and predict the future behavior of other participants. UniWorld involves initially predicting 4D geometric occupancy as the World Models for foundational stage and subsequently fine-tuning on downstream tasks. UniWorld can estimate missing information concerning the world state and predict plausible future states of the world. Besides, UniWorld's pre-training process is label-free, enabling the utilization of massive amounts of image-LiDAR pairs to build a Foundational Model.The proposed unified pre-training framework demonstrates promising results in key tasks such as motion prediction, multi-camera 3D object detection, and surrounding semantic scene completion. When compared to monocular pre-training methods on the nuScenes dataset, UniWorld shows a significant improvement of about 1.5% in IoU for motion prediction, 2.0% in mAP and 2.0% in NDS for multi-camera 3D object detection, as well as a 3% increase in mIoU for surrounding semantic scene completion. By adopting our unified pre-training method, a 25% reduction in 3D training annotation costs can be achieved, offering significant practical value for the implementation of real-world autonomous driving. Codes are publicly available at https://github.com/chaytonmin/UniWorld.

cs.CV↗

Breaking the $τ_{\rm T}-f$ degeneracy of the kinetic Sunyaev Zel'dovich cosmology in redshift space

The 'optical depth-linear growth rate' ($τ_{\rm T}-f$) degeneracy is a long-standing problem in the kinetic Sunyaev Zel'dovich (kSZ) cosmology. It can be spontaneously broken in redshift space, where the velocity field leaves its own distinct imprint on the galaxies' redshift space positions and provides valuable information of the linear growth rate. We validate this idea with the Fisher matrix and Monte Carlo Markov Chain techniques in this work, finding that the level of this degeneracy breaking is further enhanced on non-linear scales due to the non-linear evolution of the density and velocity fields, if we have a good prior knowledge of the non-linear bias of galaxies. This result emphasizes the importance of the redshift space analysis of the kSZ effect and its potential as a powerful cosmological probe, especially on non-linear scales. As a by-product, we develop a non-linear model of the redshift space density-weighted pairwise kSZ power spectrum. The fitted $f$ and $τ_{\rm T}$ values from this model are shown to be accurate within $1-2σ$ ranges of the fiducial ones when confronted to the mock galaxies mimicking a DESI+CMB-S4 survey combination, even on small scales of $k\sim 0.5h/{\rm Mpc}$.

astro-ph.CO↗

Block shuffling learning for Deepfake Detection

Deepfake detection methods based on convolutional neural networks (CNN) have demonstrated high accuracy. \textcolor{black}{However, these methods often suffer from decreased performance when faced with unknown forgery methods and common transformations such as resizing and blurring, resulting in deviations between training and testing domains.} This phenomenon, known as overfitting, poses a significant challenge. To address this issue, we propose a novel block shuffling regularization method. Firstly, our approach involves dividing the images into blocks and applying both intra-block and inter-block shuffling techniques. This process indirectly achieves weight-sharing across different dimensions. Secondly, we introduce an adversarial loss algorithm to mitigate the overfitting problem induced by the shuffling noise. Finally, we restore the spatial layout of the blocks to capture the semantic associations among them. Extensive experiments validate the effectiveness of our proposed method, which surpasses existing approaches in forgery face detection. Notably, our method exhibits excellent generalization capabilities, demonstrating robustness against cross-dataset evaluations and common image transformations. Especially our method can be easily integrated with various CNN models. Source code is available at \href{https://github.com/NoWindButRain/BlockShuffleLearning}{Github}.

cs.CV↗

Contrastive Label Disambiguation for Self-Supervised Terrain Traversability Learning in Off-Road Environments

Discriminating the traversability of terrains is a crucial task for autonomous driving in off-road environments. However, it is challenging due to the diverse, ambiguous, and platform-specific nature of off-road traversability. In this paper, we propose a novel self-supervised terrain traversability learning framework, utilizing a contrastive label disambiguation mechanism. Firstly, weakly labeled training samples with pseudo labels are automatically generated by projecting actual driving experiences onto the terrain models constructed in real time. Subsequently, a prototype-based contrastive representation learning method is designed to learn distinguishable embeddings, facilitating the self-supervised updating of those pseudo labels. As the iterative interaction between representation learning and pseudo label updating, the ambiguities in those pseudo labels are gradually eliminated, enabling the learning of platform-specific and task-specific traversability without any human-provided annotations. Experimental results on the RELLIS-3D dataset and our Gobi Desert driving dataset demonstrate the effectiveness of the proposed method.

cs.RO↗

Traversability Analysis for Autonomous Driving in Complex Environment: A LiDAR-based Terrain Modeling Approach

For autonomous driving, traversability analysis is one of the most basic and essential tasks. In this paper, we propose a novel LiDAR-based terrain modeling approach, which could output stable, complete and accurate terrain models and traversability analysis results. As terrain is an inherent property of the environment that does not change with different view angles, our approach adopts a multi-frame information fusion strategy for terrain modeling. Specifically, a normal distributions transform mapping approach is adopted to accurately model the terrain by fusing information from consecutive LiDAR frames. Then the spatial-temporal Bayesian generalized kernel inference and bilateral filtering are utilized to promote the stability and completeness of the results while simultaneously retaining the sharp terrain edges. Based on the terrain modeling results, the traversability of each region is obtained by performing geometric connectivity analysis between neighboring terrain regions. Experimental results show that the proposed method could run in real-time and outperforms state-of-the-art approaches.

cs.RO↗

AI-assisted reconstruction of cosmic velocity field from redshift-space spatial distribution of halos

The peculiar velocities of dark matter halos are crucial to study many issues in cosmology and galaxy evolution. In this study, by using the state-of-the-art deep learning technique, a UNet-based neural network, we propose to reconstruct the peculiar velocity field from the redshift-space distribution of dark matter halos. Through a point-to-point comparison and examination of various statistical properties, we demonstrate that, the reconstructed velocity field is in good agreement with the ground truth. The power spectra of various velocity field components, including velocity magnitude, divergence and vorticity, can be successfully recovered when $k\lesssim 1.1$ $h/\rm Mpc$ (the Nyquist frequency of the simulations) at about 80% accuracy. This approach is very promising and presents an alternative method to correct the redshift-space distortions using the measured 3D spatial information of halos. Additionally, for the reconstruction of the momentum field of halos, UNet achieves similar good results. Hence the applications in various aspects of cosmology are very broad, such as correcting redshift errors and improving measurements in the structure of the cosmic web, the kinetic Sunyaev-Zel'dovich effect, BAO reconstruction, etc.

astro-ph.CO↗

A local analogue of the ghost conjecture of Bergdall-Pollack

We formulate a local analogue of the ghost conjecture of Bergdall and Pollack, which essentially relies purely on the representation theory of GL_2(Q_p). We further study the combinatorial properties of the ghost series as well as its Newton polygon, in particular, giving a characterization of the vertices of the Newton polygon and proving an integrality result of the slopes. In a forthcoming sequel, we will prove this local ghost conjecture under some mild hypothesis and give arithmetic applications.

math.NT↗

Adversarial and Random Transformations for Robust Domain Adaptation and Generalization

Data augmentation has been widely used to improve generalization in training deep neural networks. Recent works show that using worst-case transformations or adversarial augmentation strategies can significantly improve the accuracy and robustness. However, due to the non-differentiable properties of image transformations, searching algorithms such as reinforcement learning or evolution strategy have to be applied, which are not computationally practical for large scale problems. In this work, we show that by simply applying consistency training with random data augmentation, state-of-the-art results on domain adaptation (DA) and generalization (DG) can be obtained. To further improve the accuracy and robustness with adversarial examples, we propose a differentiable adversarial data augmentation method based on spatial transformer networks (STN). The combined adversarial and random transformations based method outperforms the state-of-the-art on multiple DA and DG benchmark datasets. Besides, the proposed method shows desirable robustness to corruption, which is also validated on commonly used datasets.

cs.CV↗

Tomographic Alcock-Paczynski Method with Redshift Errors

The tomographic Alcock-Paczynski (AP) method is a promising method that uses the redshift evolution of the anisotropic clustering in redshift space to calibrate cosmology. It extends the applicable range of AP method to substantially nonlinear scales, yielding very tight cosmological constraints. For future stage-IV slitless spectroscopic surveys, the non-negligible redshift errors might reduce the advantage of the tomographic AP method by suppressing the resolution of the nonlinear structure along the line of sight. The present work studies how redshift errors propagate to cosmological parameters in the tomographic AP analysis. We use a formula $σ_z = σ(1+z)^α $ to model the redshift errors, with $σ$ varying from 0.001 to 0.006 and $α$ varying from 0.5 to 1.5. The redshift errors produce a signal of anisotropic clustering that is similar to a strong finger-of-god effect, which smears out both the AP signal and the contamination caused by the redshift space distortions (RSD). For the target precision of the Chinese Space Station Telescope optical survey ($σ\lesssim 0.002$), the decrement of constraining power on the dark energy equation of state is mild ($\lesssim 50\%$), and the suppression of RSD contamination leads to a smaller bias-to-signal ratio. Our results indicate that the tomographic AP method will remain a useful and complementary tool for analyses of future slitless spectroscopic surveys.

astro-ph.CO↗

ORFD: A Dataset and Benchmark for Off-Road Freespace Detection

Freespace detection is an essential component of autonomous driving technology and plays an important role in trajectory planning. In the last decade, deep learning-based free space detection methods have been proved feasible. However, these efforts were focused on urban road environments and few deep learning-based methods were specifically designed for off-road free space detection due to the lack of off-road benchmarks. In this paper, we present the ORFD dataset, which, to our knowledge, is the first off-road free space detection dataset. The dataset was collected in different scenes (woodland, farmland, grassland, and countryside), different weather conditions (sunny, rainy, foggy, and snowy), and different light conditions (bright light, daylight, twilight, darkness), which totally contains 12,198 LiDAR point cloud and RGB image pairs with the traversable area, non-traversable area and unreachable area annotated in detail. We propose a novel network named OFF-Net, which unifies Transformer architecture to aggregate local and global information, to meet the requirement of large receptive fields for free space detection tasks. We also propose the cross-attention to dynamically fuse LiDAR and RGB image information for accurate off-road free space detection. Dataset and code are publicly available athttps://github.com/chaytonmin/OFF-Net.

cs.CV↗

Model Inspired Autoencoder for Unsupervised Hyperspectral Image Super-Resolution

This paper focuses on hyperspectral image (HSI) super-resolution that aims to fuse a low-spatial-resolution HSI and a high-spatial-resolution multispectral image to form a high-spatial-resolution HSI (HR-HSI). Existing deep learning-based approaches are mostly supervised that rely on a large number of labeled training samples, which is unrealistic. The commonly used model-based approaches are unsupervised and flexible but rely on hand-craft priors. Inspired by the specific properties of model, we make the first attempt to design a model inspired deep network for HSI super-resolution in an unsupervised manner. This approach consists of an implicit autoencoder network built on the target HR-HSI that treats each pixel as an individual sample. The nonnegative matrix factorization (NMF) of the target HR-HSI is integrated into the autoencoder network, where the two NMF parts, spectral and spatial matrices, are treated as decoder parameters and hidden outputs respectively. In the encoding stage, we present a pixel-wise fusion model to estimate hidden outputs directly, and then reformulate and unfold the model's algorithm to form the encoder network. With the specific architecture, the proposed network is similar to a manifold prior-based model, and can be trained patch by patch rather than the entire image. Moreover, we propose an additional unsupervised network to estimate the point spread function and spectral response function. Experimental results conducted on both synthetic and real datasets demonstrate the effectiveness of the proposed approach.

eess.IV↗

On the Beilinson-Bloch-Kato conjecture for Rankin-Selberg motives

In this article, we study the Beilinson-Bloch-Kato conjecture for motives corresponding to the Rankin-Selberg product of conjugate self-dual automorphic representations, within the framework of the Gan-Gross-Prasad conjecture. We show that if the central critical value of the Rankin-Selberg $L$-function does not vanish, then the Bloch-Kato Selmer group with coefficients in a favorable field of the corresponding motive vanishes. We also show that if the class in the Bloch-Kato Selmer group constructed from certain diagonal cycle does not vanish, which is conjecturally equivalent to the nonvanishing of the central critical first derivative of the Rankin-Selberg $L$-function, then the Bloch-Kato Selmer group is of rank one.

math.NT↗

Deformation of rigid conjugate self-dual Galois representations

In this article, we study deformations of conjugate self-dual Galois representations. The study has two folds. First, we prove an R=T type theorem for a conjugate self-dual Galois representation with coefficients in a finite field, satisfying a certain property called rigid. Second, we study the rigidity property for the family of residue Galois representations attached to a symmetric power of an elliptic curve, as well as to a regular algebraic conjugate self-dual cuspidal representation.

math.NT↗

BDANet: Multiscale Convolutional Neural Network with Cross-directional Attention for Building Damage Assessment from Satellite Images

Fast and effective responses are required when a natural disaster (e.g., earthquake, hurricane, etc.) strikes. Building damage assessment from satellite imagery is critical before relief effort is deployed. With a pair of pre- and post-disaster satellite images, building damage assessment aims at predicting the extent of damage to buildings. With the powerful ability of feature representation, deep neural networks have been successfully applied to building damage assessment. Most existing works simply concatenate pre- and post-disaster images as input of a deep neural network without considering their correlations. In this paper, we propose a novel two-stage convolutional neural network for Building Damage Assessment, called BDANet. In the first stage, a U-Net is used to extract the locations of buildings. Then the network weights from the first stage are shared in the second stage for building damage assessment. In the second stage, a two-branch multi-scale U-Net is employed as backbone, where pre- and post-disaster images are fed into the network separately. A cross-directional attention module is proposed to explore the correlations between pre- and post-disaster images. Moreover, CutMix data augmentation is exploited to tackle the challenge of difficult classes. The proposed method achieves state-of-the-art performance on a large-scale dataset -- xBD. The code is available at https://github.com/ShaneShen/BDANet-Building-Damage-Assessment.

cs.CV↗

Trajectory Prediction for Autonomous Driving with Topometric Map

State-of-the-art autonomous driving systems rely on high definition (HD) maps for localization and navigation. However, building and maintaining HD maps is time-consuming and expensive. Furthermore, the HD maps assume structured environment such as the existence of major road and lanes, which are not present in rural areas. In this work, we propose an end-to-end transformer networks based approach for map-less autonomous driving. The proposed model takes raw LiDAR data and noisy topometric map as input and produces precise local trajectory for navigation. We demonstrate the effectiveness of our method in real-world driving data, including both urban and rural areas. The experimental results show that the proposed method outperforms state-of-the-art multimodal methods and is robust to the perturbations of the topometric map. The code of the proposed method is publicly available at \url{https://github.com/Jiaolong/trajectory-prediction}.

cs.CV↗

Attentional Graph Neural Network for Parking-slot Detection

Deep learning has recently demonstrated its promising performance for vision-based parking-slot detection. However, very few existing methods explicitly take into account learning the link information of the marking-points, resulting in complex post-processing and erroneous detection. In this paper, we propose an attentional graph neural network based parking-slot detection method, which refers the marking-points in an around-view image as graph-structured data and utilize graph neural network to aggregate the neighboring information between marking-points. Without any manually designed post-processing, the proposed method is end-to-end trainable. Extensive experiments have been conducted on public benchmark dataset, where the proposed method achieves state-of-the-art accuracy. Code is publicly available at \url{https://github.com/Jiaolong/gcn-parking-slot}.

cs.CV↗

Deep Reinforcement Learning Based Intelligent Reflecting Surface for Secure Wireless Communications

In this paper, we study an intelligent reflecting surface (IRS)-aided wireless secure communication system for physical layer security, where an IRS is deployed to adjust its surface reflecting elements to guarantee secure communication of multiple legitimate users in the presence of multiple eavesdroppers. Aiming to improve the system secrecy rate, a design problem for jointly optimizing the base station (BS)'s beamforming and the IRS's reflecting beamforming is formulated given the different quality of service (QoS) requirements and time-varying channel condition. As the system is highly dynamic and complex, and it is challenging to address the non-convex optimization problem, a novel deep reinforcement learning (DRL)-based secure beamforming approach is firstly proposed to achieve the optimal beamforming policy against eavesdroppers in dynamic environments. Furthermore, post-decision state (PDS) and prioritized experience replay (PER) schemes are utilized to enhance the learning efficiency and secrecy performance. Specifically, PDS is capable of tracing the environment dynamic characteristics and adjust the beamforming policy accordingly. Simulation results demonstrate that the proposed deep PDS-PER learning-based secure beamforming approach can significantly improve the system secrecy rate and QoS satisfaction probability in IRS-aided secure communication systems.

eess.SP↗

Privacy-Preserving Federated Learning for UAV-Enabled Networks: Learning-Based Joint Scheduling and Resource Management

Unmanned aerial vehicles (UAVs) are capable of serving as flying base stations (BSs) for supporting data collection, artificial intelligence (AI) model training, and wireless communications. However, due to the privacy concerns of devices and limited computation or communication resource of UAVs, it is impractical to send raw data of devices to UAV servers for model training. Moreover, due to the dynamic channel condition and heterogeneous computing capacity of devices in UAV-enabled networks, the reliability and efficiency of data sharing require to be further improved. In this paper, we develop an asynchronous federated learning (AFL) framework for multi-UAV-enabled networks, which can provide asynchronous distributed computing by enabling model training locally without transmitting raw sensitive data to UAV servers. The device selection strategy is also introduced into the AFL framework to keep the low-quality devices from affecting the learning efficiency and accuracy. Moreover, we propose an asynchronous advantage actor-critic (A3C) based joint device selection, UAVs placement, and resource management algorithm to enhance the federated convergence speed and accuracy. Simulation results demonstrate that our proposed framework and algorithm achieve higher learning accuracy and faster federated execution time compared to other existing solutions.

eess.SP↗