Searcharxiv⌕ Search

arXiv subjects

Chunxiang Wang

Publications and source records attributed to Chunxiang Wang.

At least 19 recordsLinked to original sources

The Common-Color Spectrum of Endpoint Set-Coloring Ramsey Numbers

The set-coloring Ramsey number $R(n;r,s,t)$ is the least $N$ such that every assignment of an $s$-element subset of $[r]=\{1,\ldots,r\}$ to each edge of $K_N$ contains a $K_n$ whose edge labels have at least $t$ common colors. Motivated by the work of Erdős and Szemerédi on $R(n;r,r-1,1)$, we write $R(n;r,r-1,t)=\exp\bigl(nf_{r,n}(t)\bigr)$ and study $f(t):=f_{r,n}(t)$ as $t$ ranges from $1$ to $r-1$. For fixed integers $r\ge2$ and $1\le t 0$ is an absolute constant. Comparisons between different numbers of colors show that the rates $\liminf_{n\to\infty}f_{r,n}(t)$ and $\limsup_{n\to\infty}f_{r,n}(t)$, defined for fixed $r$ and $t$, each have a limit as $r\to\infty$ and $\frac{t}{r}\toα\in(0,1)$ from above. The resulting two functions of $α$ are finite, positive, nondecreasing, and right-continuous. Writing $Δ_t=f(t+1)-f(t)$, we further prove that, as $r\to\infty$, uniformly for $n\ge r^2$, at least $\frac{(1-o(1))\log r}{\log\log r}$ indices $1\le t<\frac{r}{2}$ satisfy $Δ_t\ge\frac{1-o(1)}{2r}$. For $r,n\ge3$ and $2\le h\le r-1$, the final $h-1$ increments account for at least $1-\frac{1}{\left\lceil h/2\right\rceil}$ of the total increase $f(r-1)-f(1)$. For each fixed $r\ge4$, the last increment has a positive lower limit as $n\to\infty$. Moreover, for $r,n\ge3$, it exceeds the sum of all preceding increments whenever $r$ is even or $n=3$.

math.CO↗

Set-coloring Ramsey numbers with multiple intersections

For integers $r\ge s\ge t\ge1$, we introduce the Ramsey number $R(G;r,s,t)$, defined as the least $N$ such that every assignment of an $s$-element subset of $[r]$ to each edge of $K_N$ yields a copy of $G$ whose edges have at least $t$ colors in common. This generalizes the classical set-coloring Ramsey number $R(G;r,s)=R(G;r,s,1)$, studied since the work of Erdos, Hajnal, and Rado. We show that $t$ cannot in general be eliminated by reparametrization: infinitely many quadruples $(G;r,s,t)$ satisfy $R(G;r,s,t)\ne R(G;a,b)$ for every $a\ge b\ge1$. Writing $α=\binom{r}{t}/\binom{s}{t}$, the shadow inequality $R(G;r,s,t)\le R(G;\binom{r}{t},\binom{s}{t},1)$ and the recent proof of the Erdos--Sos conjecture imply $R(T_n;r,s,t)\le\lfloorα(n-2)\rfloor+2$ for every $n$-vertex tree $T_n$. For stars, we obtain packing bounds and exact values under suitable divisibility conditions. For paths and even cycles $G$ of order $n$, we improve the upper bound to $R(G;r,s,t)\le(α-γ+o(1))n$ as $n\to\infty$, for fixed $r>s\ge t\ge1$ and some $γ=γ(r,s,t)>0$. We also prove that, for fixed $s,t$, the tree bound is asymptotically sharp for paths as $r,n\to\infty$, and for even cycles when $n\to\infty$ first and then $r\to\infty$. For cliques $K_n$, we transfer known bounds of Conlon et al. for ordinary set-coloring Ramsey numbers to the general parameter $t$, obtaining two-sided exponential bounds. For each fixed $n\ge3$, we identify an explicit piecewise-linear function $Φ_n$ that determines a growth threshold. If $s/r\toσ$ and $t/r\toτ$ as $r\to\infty$, with $0<τ\leσ<1$, then $R(K_n;r,s,t)=O(1)$ when $τ<Φ_n(σ)$, whereas $R(K_n;r,s,t)\ge\exp(cr)$ for some $c>0$ when $τ>Φ_n(σ)$.

math.CO↗

Minimum net-saturated graphs of even order

Let \(F\) be the net, consisting of a triangle with one distinct degree-one vertex attached to each of its vertices. A graph is \(F\)-saturated if it contains no copy of \(F\), but adding any missing edge creates one. Zhao, You and Zhang determined the minimum number of edges and conjectured that the minimum graph is unique at every sufficiently large even order. We prove that for every even \(n\ge12\), there are exactly four minimum \(n\)-vertex \(F\)-saturated graphs up to isomorphism, each with \(3n/2\) edges. Three additional families therefore disprove their even-order uniqueness conjecture. Two have no universal vertex, that is, no vertex adjacent to every other vertex. We also construct a ten-vertex minimum graph with fifteen edges outside the four families, proving that the threshold twelve is optimal. The key structural step forces a pendant triangle, meaning a triangle with two vertices of degree two, in every even-order minimum graph above order ten. We classify the graphs containing such a triangle and bound the order of all remaining extremal configurations by ten.

math.CO↗

Saturation in three-uniform Berge hypergraphs: the five-star spectrum and the $K_4$ saturation number

For a graph \(G\), a hypergraph is Berge-\(G\)-saturated if it contains no Berge copy of \(G\), but adding any missing hyperedge creates one. We determine the complete saturation spectrum of three-uniform Berge five-stars for every order. For \(n\ge7\), every integer from \(\lceil4n/3\rceil-3\) to \(2n-5\) occurs; the additional values depend only on \(n\) modulo five. The structural ingredient is a sharp bound on the remainder after deleting all complete five-vertex components: for an \(n\)-vertex, \(m\)-edge Berge-five-star-saturated hypergraph, this remainder has at most \(15(2n-m)/7\) vertices. We characterize all equality cases. We also prove that every three-uniform Berge-\(K_4\)-saturated hypergraph on \(n\ge7\) vertices has at least \(n\) edges. Together with known constructions, this determines its saturation number for every order and settles the conjecture of Chen, He, and Xie; the new lower bound covers the previously unresolved orders \(9\le n\le95\). Both arguments use the distinct representatives forced by saturation to obtain local incidence constraints. For five-stars these constraints bound the size of the remainder and characterize equality. For \(K_4\), they reduce a putative counterexample to a configuration on at most eight vertices; incidence estimates and a sharp bound on the vertices covered by short cycles in a bipartite graph exclude all remaining cases.

math.CO↗

TC-ADA: One-Shot Active Domain Adaptation for Semantic Segmentation

Manual dense annotation remains a major obstacle to deploying semantic segmentation models in new driving environments. Active domain adaptation (ADA) seeks label-efficient transfer by annotating only a selected portion of the target domain. Existing ADA methods commonly implement this process through multiple rounds of acquisition, annotation, and retraining. We study a practical one-shot image-level setting that selects and densely annotates a fixed target subset in a single round, followed by uninterrupted adaptation. Within this setting, we develop Target-Calibrated Active Domain Adaptation (TC-ADA) as a joint design of complete-image acquisition and target-calibrated adaptation. Stage~1 uses visual representations from a vision foundation model (VFM) together with semantic predictions from a fixed unsupervised domain adaptation model to select representative and informative target images without target annotations. Stage~2 jointly uses labeled source data, labeled target data, and the remaining unlabeled target data, while calibrating source and target supervision under limited target labels. Extensive experiments across five synthetic-to-real and real-to-real driving transfers show consistent improvements over representative ADA baselines. With only 23 to 46 labeled target images on four transfers and 140 on Mapillary, TC-ADA stays within 1.9 mean intersection over union (mIoU) points of target-only full supervision. Code will be available at https://github.com/ywher/TC-ADA.

cs.CV↗

Maximum and Minimum Spectral Radii in an Exceptional Family for Edge-Disjoint Spanning Trees

For a connected graph $G$, let $τ(G)$ denote the maximum number of pairwise edge-disjoint spanning trees, and let $ρ(G)$ be its adjacency spectral radius. For integers $n\ge1$, $k\ge2$, and $k\leδ\le2k-1$, let $\mathcal{G}_{n,δ}$ be the class of connected $n$-vertex graphs with minimum degree $δ$, and let $\mathcal{L}_{\mathcal{H}}^{2}(n,k,δ)\subseteq\mathcal{G}_{n,δ}$ be the exceptional family introduced by Chang, Li, and Zhang. For sufficiently large $n$, the sharp adjacency-spectral threshold for $τ(G)\ge k$ is determined by maximizing $ρ(G)$ over this family. Set $h=δ-k$. For each fixed admissible pair $(k,δ)$ and all sufficiently large $n$, we determine the maximum and minimum adjacency spectral radii in $\mathcal{L}_{\mathcal{H}}^{2}(n,k,δ)$. In the core--placement representation, let $M$ be the missing-edge graph of the bounded core. For $h\ge2$, the unique maximizer, up to isomorphism, satisfies $M\cong K_{1,h}\cup(h+1)K_1$, with the exceptional edges nested on the large-clique side. Hence the matching configuration proposed in Conjecture~2 of Chang--Li--Zhang is not extremal. For every $h\ge1$, the unique minimizer satisfies $M\cong hK_2\cup2K_1$, with the $2h$ exceptional edges having distinct endpoints on the large-clique side. We also settle the cases $h=0,1$ and all equality cases. The proof combines an exact core--placement parametrization with a uniform Schur-complement resolvent expansion. The first candidate-dependent coefficient is affine in $\sum_{x\in V(M)}d_M(x)^2$, while the first placement-sensitive coefficient is a squared-load functional. Equitable quotient matrices yield the two extremal radii, and the maximizing graph gives the sharp global adjacency-spectral threshold.

math.CO↗

LOGOS: LiDAR-Only Gaussian Elevation Splatting for Unified Tiny Obstacle Segmentation

Robust obstacle segmentation is essential for the safety of intelligent robots, where LiDAR-based perception systems play a fundamental role in the robot-environment interaction. While extensive LiDAR-based approaches have demonstrated high performance on common obstacles in urban scenarios, their results on tiny obstacles such as curbs, gravel, and potholes remain unsatisfactory due to the significant similarity between tiny obstacles and inherent road undulations. Moreover, their segmentation accuracy even deteriorates sharply when the LiDAR scans suffer from degradation in challenging off-road scenes. To overcome these bottlenecks, we propose LOGOS, a LiDAR-only unified tiny obstacle segmentation system, which models the road surface as a continuous mixture of 2D Gaussian primitives and distinguishes tiny obstacles via high-presicion elevation estimation. Unlike existing Gaussian splatting methods that rely on iterative RGB training, LOGOS is a backpropagation-free LiDAR-only approach. It directly estimates Gaussian parameters via a freespace-aware initialization by incrementally pruning non-road primitives using smoothness constraints. Subsequently, pointwise signed distances are computed via a novel normal-aware elevation splatting function, ensuring robustness to both flat and sloped terrains. We evaluate LOGOS on a highly heterogeneous benchmark of point cloud frames collected from urban mobility scenarios and mining haulage off-road environments. These data are practically acquired using different LiDAR sensors and exhibit large variations in point density, terrain roughness, and obstacle types. Experiments on the road and off-road scenes demonstrate that LOGOS significantly outperforms other state-of-the-art methods, particularly in degraded point cloud regions and challenging off-road scenarios, while maintaining real-time efficiency.

cs.RO↗

Generating Roadside LiDAR Datasets from Vehicle-Side Datasets via Novel View Synthesis

Intelligent Transportation Systems (ITS) require reliable environmental perception to support safe and efficient transportation. With the rapid development of Vehicle-to-everything (V2X), roadside perception has become an effective means to extend sensing coverage and improve traffic safety. However, the scarcity of large-scale annotated roadside LiDAR datasets poses a major challenge for training high-performance roadside perception models. In this paper, we introduce Vehicle-to-Roadside LiDAR Synthesis (VRS), a data synthesis framework that generates labeled roadside LiDAR datasets from vehicle-side datasets via LiDAR novel view synthesis. To mitigate the vehicle-to-roadside domain gap, VRS employs vehicle point cloud completion to compensate for missing geometry in vehicle-side observations, and introduces an occupancy-based visibility constraint to handle large viewpoint changes during cross-view rendering. The proposed framework enables flexible multi-view rendering for scalable roadside data generation. Extensive experiments on roadside 3D object detection demonstrate that the synthesized data effectively complements real roadside data, mitigates the limitations of limited real-world roadside data, and improves generalization to unseen roadside viewpoints.

cs.RO↗

AMFD: Distillation via Adaptive Multimodal Fusion for Multispectral Pedestrian Detection

Multispectral pedestrian detection has been shown to be effective in improving performance within complex illumination scenarios. However, prevalent double-stream networks in multispectral detection employ two separate feature extraction branches for multi-modal data, leading to nearly double the inference time compared to single-stream networks utilizing only one feature extraction branch. This increased inference time has hindered the widespread employment of multispectral pedestrian detection in embedded devices for autonomous systems. To address this limitation, various knowledge distillation methods have been proposed. However, traditional distillation methods focus only on the fusion features and ignore the large amount of information in the original multi-modal features, thereby restricting the student network's performance. To tackle the challenge, we introduce the Adaptive Modal Fusion Distillation (AMFD) framework, which can fully utilize the original modal features of the teacher network. Specifically, a Modal Extraction Alignment (MEA) module is utilized to derive learning weights for student networks, integrating focal and global attention mechanisms. This methodology enables the student network to acquire optimal fusion strategies independent from that of teacher network without necessitating an additional feature fusion module. Furthermore, we present the SMOD dataset, a well-aligned challenging multispectral dataset for detection. Extensive experiments on the challenging KAIST, LLVIP and SMOD datasets are conducted to validate the effectiveness of AMFD. The results demonstrate that our method outperforms existing state-of-the-art methods in both reducing log-average Miss Rate and improving mean Average Precision. The code is available at https://github.com/bigD233/AMFD.git.

cs.CV↗

RadarXFormer: Robust Object Detection via Cross-Dimension Fusion of 4D Radar Spectra and Images for Autonomous Driving

Reliable perception is essential for autonomous driving systems to operate safely under diverse real-world traffic conditions. However, camera- and LiDAR-based perception systems suffer from performance degradation under adverse weather and lighting conditions, limiting their robustness and large-scale deployment in intelligent transportation systems. Radar-vision fusion provides a promising alternative by combining the environmental robustness and cost efficiency of millimeter-wave (mmWave) radar with the rich semantic information captured by cameras. Nevertheless, conventional 3D radar measurements lack height resolution and remain highly sparse, while emerging 4D mmWave radar introduces elevation information but also brings challenges such as signal noise and large data volume. To address these issues, this paper proposes RadarXFormer, a 3D object detection framework that enables efficient cross-modal fusion between 4D radar spectra and RGB images. Instead of relying on sparse radar point clouds, RadarXFormer directly leverages raw radar spectra and constructs an efficient 3D representation that reduces data volume while preserving complete 3D spatial information. The "X" highlights the proposed cross-dimension (3D-2D) fusion mechanism, in which multi-scale 3D spherical radar feature cubes are fused with complementary 2D image feature maps. Experiments on the K-Radar dataset demonstrate improved detection accuracy and robustness under challenging conditions while maintaining real-time inference capability.

cs.CV↗

Which LiDAR scanning pattern is better for roadside perception: Repetitive or Non-repetitive?

LiDAR-based roadside perception is a cornerstone of advanced Intelligent Transportation Systems (ITS). While considerable research has addressed optimal LiDAR placement for infrastructure, the profound impact of differing LiDAR scanning patterns on perceptual performance remains comparatively under-investigated. The inherent nature of various scanning modes - such as traditional repetitive (mechanical/solid-state) versus emerging non-repetitive (e.g. prism-based) systems - leads to distinct point cloud distributions at varying distances, critically dictating the efficacy of object detection and overall environmental understanding. To systematically investigate these differences in infrastructure-based contexts, we introduce the "InfraLiDARs' Benchmark," a novel dataset meticulously collected in the CARLA simulation environment using concurrently operating infrastructure-based LiDARs exhibiting both scanning paradigms. Leveraging this benchmark, we conduct a comprehensive statistical analysis of the respective LiDAR scanning abilities and evaluate the impact of these distinct patterns on the performance of various leading 3D object detection algorithms. Our findings reveal that non-repetitive scanning LiDAR and the 128-line repetitive LiDAR were found to exhibit comparable detection performance across various scenarios. Despite non-repetitive LiDAR's limited perception range, it's a cost-effective option considering its low price. Ultimately, this study provides insights for setting up roadside perception system with optimal LiDAR scanning patterns and compatible algorithms for diverse roadside applications, and publicly releases the "InfraLiDARs' Benchmark" dataset to foster further research.

cs.CV↗

Bench-RNR: Dataset for Benchmarking Repetitive and Non-repetitive Scanning LiDAR for Infrastructure-based Vehicle Localization

Vehicle localization using roadside LiDARs can provide centimeter-level accuracy for cloud-controlled vehicles while simultaneously serving multiple vehicles, enhanc-ing safety and efficiency. While most existing studies rely on repetitive scanning LiDARs, non-repetitive scanning LiDAR offers advantages such as eliminating blind zones and being more cost-effective. However, its application in roadside perception and localization remains limited. To address this, we present a dataset for infrastructure-based vehicle localization, with data collected from both repetitive and non-repetitive scanning LiDARs, in order to benchmark the performance of different LiDAR scanning patterns. The dataset contains 5,445 frames of point clouds across eight vehicle trajectory sequences, with diverse trajectory types. Our experiments establish base-lines for infrastructure-based vehicle localization and compare the performance of these methods using both non-repetitive and repetitive scanning LiDARs. This work offers valuable insights for selecting the most suitable LiDAR scanning pattern for infrastruc-ture-based vehicle localization. Our dataset is a signifi-cant contribution to the scientific community, supporting advancements in infrastructure-based perception and vehicle localization. The dataset and source code are publicly available at: https://github.com/sjtu-cyberc3/BenchRNR.

cs.RO↗

A Comparative Study of Halo Mass Estimates from Group Catalogs and Lensing Signals

We compare halo mass estimates from three galaxy group catalogs (redMaPPer, Yang21, and Zou21) with those derived from gravitational lensing measurements. Each catalog employs distinct methodologies, including mass-richness relations, abundance matching, and luminosity-based calibration. A linear correlation is observed between catalog-estimated and lensing-derived masses. The redMaPPer catalog shows the best agreement, especially for lower-redshift groups, with minor deviations in higher-redshift bins. Yang21 is the only catalog containing low mass groups, which gives a reasonably good mass estimation, except for the lowest mass bin. Cross-matched groups between redMaPPer and Yang21 reveal the former catalog provides more accurate mass estimation, while the Yang21 makes under-estimation of halo mass for those sharing the central galaxy with redMaPPer and over-estimation of halo mass for those with different center determination with redMaPPer and for the unique Yang21 groups. These findings emphasize the importance of redshift-dependent calibration and refined group definitions for accurate mass estimation.

astro-ph.CO↗

Weather-Magician: Reconstruction and Rendering Framework for 4D Weather Synthesis In Real Time

For tasks such as urban digital twins, VR/AR/game scene design, or creating synthetic films, the traditional industrial approach often involves manually modeling scenes and using various rendering engines to complete the rendering process. This approach typically requires high labor costs and hardware demands, and can result in poor quality when replicating complex real-world scenes. A more efficient approach is to use data from captured real-world scenes, then apply reconstruction and rendering algorithms to quickly recreate the authentic scene. However, current algorithms are unable to effectively reconstruct and render real-world weather effects. To address this, we propose a framework based on gaussian splatting, that can reconstruct real scenes and render them under synthesized 4D weather effects. Our work can simulate various common weather effects by applying Gaussians modeling and rendering techniques. It supports continuous dynamic weather changes and can easily control the details of the effects. Additionally, our work has low hardware requirements and achieves real-time rendering performance. The result demos can be accessed on our project homepage: weathermagician.github.io

cs.CV↗

From Imitation to Exploration: End-to-end Autonomous Driving based on World Model

In recent years, end-to-end autonomous driving architectures have gained increasing attention due to their advantage in avoiding error accumulation. Most existing end-to-end autonomous driving methods are based on Imitation Learning (IL), which can quickly derive driving strategies by mimicking expert behaviors. However, IL often struggles to handle scenarios outside the training dataset, especially in high-dynamic and interaction-intensive traffic environments. In contrast, Reinforcement Learning (RL)-based driving models can optimize driving decisions through interaction with the environment, improving adaptability and robustness. To leverage the strengths of both IL and RL, we propose RAMBLE, an end-to-end world model-based RL method for driving decision-making. RAMBLE extracts environmental context information from RGB images and LiDAR data through an asymmetrical variational autoencoder. A transformer-based architecture is then used to capture the dynamic transitions of traffic participants. Next, an actor-critic structure reinforcement learning algorithm is applied to derive driving strategies based on the latent features of the current state and dynamics. To accelerate policy convergence and ensure stable training, we introduce a training scheme that initializes the policy network using IL, and employs KL loss and soft update mechanisms to smoothly transition the model from IL to RL. RAMBLE achieves state-of-the-art performance in route completion rate on the CARLA Leaderboard 1.0 and completes all 38 scenarios on the CARLA Leaderboard 2.0, demonstrating its effectiveness in handling complex and dynamic traffic scenarios. The model will be open-sourced upon paper acceptance at https://github.com/SCP-CN-001/ramble to support further research and development in autonomous driving.

cs.AI↗

HOPE: A Reinforcement Learning-based Hybrid Policy Path Planner for Diverse Parking Scenarios

Automated parking stands as a highly anticipated application of autonomous driving technology. However, existing path planning methodologies fall short of addressing this need due to their incapability to handle the diverse and complex parking scenarios in reality. While non-learning methods provide reliable planning results, they are vulnerable to intricate occasions, whereas learning-based ones are good at exploration but unstable in converging to feasible solutions. To leverage the strengths of both approaches, we introduce Hybrid pOlicy Path plannEr (HOPE). This novel solution integrates a reinforcement learning agent with Reeds-Shepp curves, enabling effective planning across diverse scenarios. HOPE guides the exploration of the reinforcement learning agent by applying an action mask mechanism and employs a transformer to integrate the perceived environmental information with the mask. To facilitate the training and evaluation of the proposed planner, we propose a criterion for categorizing the difficulty level of parking scenarios based on space and obstacle distribution. Experimental results demonstrate that our approach outperforms typical rule-based algorithms and traditional reinforcement learning methods, showing higher planning success rates and generalization across various scenarios. We also conduct real-world experiments to verify the practicability of HOPE. The code for our solution is openly available on https://github.com/jiamiya/HOPE.

cs.RO↗

Depth-aware Fusion Method based on Image and 4D Radar Spectrum for 3D Object Detection

Safety and reliability are crucial for the public acceptance of autonomous driving. To ensure accurate and reliable environmental perception, intelligent vehicles must exhibit accuracy and robustness in various environments. Millimeter-wave radar, known for its high penetration capability, can operate effectively in adverse weather conditions such as rain, snow, and fog. Traditional 3D millimeter-wave radars can only provide range, Doppler, and azimuth information for objects. Although the recent emergence of 4D millimeter-wave radars has added elevation resolution, the radar point clouds remain sparse due to Constant False Alarm Rate (CFAR) operations. In contrast, cameras offer rich semantic details but are sensitive to lighting and weather conditions. Hence, this paper leverages these two highly complementary and cost-effective sensors, 4D millimeter-wave radar and camera. By integrating 4D radar spectra with depth-aware camera images and employing attention mechanisms, we fuse texture-rich images with depth-rich radar data in the Bird's Eye View (BEV) perspective, enhancing 3D object detection. Additionally, we propose using GAN-based networks to generate depth images from radar spectra in the absence of depth sensors, further improving detection accuracy.

cs.CV↗

Cross-Modal Visual Relocalization in Prior LiDAR Maps Utilizing Intensity Textures

Cross-modal localization has drawn increasing attention in recent years, while the visual relocalization in prior LiDAR maps is less studied. Related methods usually suffer from inconsistency between the 2D texture and 3D geometry, neglecting the intensity features in the LiDAR point cloud. In this paper, we propose a cross-modal visual relocalization system in prior LiDAR maps utilizing intensity textures, which consists of three main modules: map projection, coarse retrieval, and fine relocalization. In the map projection module, we construct the database of intensity channel map images leveraging the dense characteristic of panoramic projection. The coarse retrieval module retrieves the top-K most similar map images to the query image from the database, and retains the top-K' results by covisibility clustering. The fine relocalization module applies a two-stage 2D-3D association and a covisibility inlier selection method to obtain robust correspondences for 6DoF pose estimation. The experimental results on our self-collected datasets demonstrate the effectiveness in both place recognition and pose estimation tasks.

cs.CV↗