Search arXivSearch

arXiv · 2501.15726

Vision-Aided Channel Prediction Based on Image Segmentation at Street Intersection Scenarios

Abstract

Intelligent vehicular communication with vehicle road collaboration capability is a key technology enabled by 6G, and the integration of various visual sensors on vehicles and infrastructures plays a crucial role. Moreover, accurate channel prediction is foundational to realizing intelligent vehicular communication. Traditional methods are still limited by the inability to balance accuracy and operability based on substantial spectrum resource consumption and highly refined description of environment. Therefore, leveraging out-of-band information introduced by visual sensors provides a new solution and is increasingly applied across various communication tasks. In this paper, we propose a computer vision (CV)-based prediction model for vehicular communications, realizing accurate channel characterization prediction including path loss, Rice K-factor and delay spread based on image segmentation. First, we conduct extensive vehicle-to-infrastructure measurement campaigns, collecting channel and visual data from various street intersection scenarios. The image-channel dataset is generated after a series of data post-processing steps. Image data consists of individual segmentation of target user using YOLOv8 network. Subsequently, established dataset is used to train and test prediction network ResNet-32, where segmented images serve as input of network, and various channel characteristics are treated as labels or target outputs of network. Finally, self-validation and cross-validation experiments are performed. The results indicate that models trained with segmented images achieve high prediction accuracy and remarkable generalization performance across different streets and target users. The model proposed in this paper offers novel solutions for achieving intelligent channel prediction in vehicular communications.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xuejian Zhang, Ruisi He, Mi Yang, Ziyi Qi, Zhengyu Zhang, Bo Ai, Zhangdui Zhong. 2025-01-27. Vision-Aided Channel Prediction Based on Image Segmentation at Street Intersection Scenarios. https://doi.org/10.1109/tccn.2025.3602837

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Information mechanics: conservation and assimilation

Inference and learning are cast as optimisation, yet invariant constraints governing uncertainty reduction remain unclear. This work presents information mechanics (infomechanics), a first-principles framework that describes informational structure in two canonical state coordinates. From Bayes' pointwise identity, minimal requirements of additivity, symmetry, and finite-resolution robustness select two robust additive projections, yielding conservation identities for entropy and Fisher information, governing global uncertainty and local geometry. Their residual defines the non-additive, coordinate-scale-invariant information potential $Φ$, separating the entropic baseline from residual geometric complexity. $Φ$ vanishes uniquely for isotropic Gaussians, decreases under Gaussian coarse-graining, and in finite-resolution multimodal landscapes asymptotically approaches the logarithm of the effective number of local optima. Extending the formalism to the Markov chain linking hidden states, observations, and internal representations yields assimilation inequalities constraining faithful external-state inference. Small bidirectional information potentials constrain representations towards near-linear relations with hidden causes. Together, these results identify invariant constraints underlying inference, learning, and computation across biological and artificial systems, irrespective of implementation.

cs.IT

When Relaxation Does Not Help: RLDCs with Small Soundness Yield LDCs

Locally decodable codes (LDCs) are error-correcting codes that allow recovery of any single message symbol by probing only a small number of positions from the (possibly corrupted) codeword. Relaxed locally decodable codes (RLDCs) further allow the decoder to output a special failure symbol $\bot$ on a corrupted codeword. While known constructions of RLDCs achieve much better parameters than standard LDCs, it is intriguing to understand the relationship between LDCs and RLDCs. On the one hand, separation results (i.e., the existence of $q$-query RLDCs that are not $q$-query LDCs) are known for $q=3$ (Gur, Minzer, Weissenberg, and Zheng, STOC 2026) and $q \geq 15$ (Grigorescu, Kumar, Manohar, and Mon, STOC 2026). On the other hand, prior work (Block, Blocki, Cheng, Grigorescu, Li, Zheng, and Zhu, CCC 2023) shows that any $2$-query RLDC also gives a $2$-query LDC, and Grigorescu, Kumar, Manohar, and Mon (STOC 2026) show that any \emph{linear} $3$-query RLDC is also a linear $3$-query LDC. Furthermore, Grigorescu, Kumar, Manohar, and Mon (STOC 2026) show that when the soundness error of a \emph{linear} $q$-query RLDC with perfect completeness is below some threshold $s(q)$, the code must also be a linear $q$-query LDC with comparable parameters. In this work, we extend the main result of Grigorescu, Kumar, Manohar, and Mon (STOC 2026) by removing the linearity requirement in the nonadaptive setting. Specifically, we show that every nonadaptive $(q,δ,1,s)$-RLDC over a finite alphabet $Σ$ with $s<|Σ|^{-q}$ yields a $q$-query LDC with comparable decoding radius and error. Our results also extend to the setting of locally correctable codes (LCCs) and relaxed locally correctable codes (RLCCs). From this, we also obtain lower bounds for nonadaptive RLDCs from known LDC lower bounds.

cs.IT

Formalizing building-up constructions of self-dual codes through isotropic lines in Lean

The purpose of this paper is two-fold. First, we show that, after a specified form isometry, the two-coordinate reduction in the binary Hilbert-symbol realization of Chinburg and Zhang is inverse to Kim's building-up construction, up to permutation equivalence. Second, for $q\equiv1\pmod4$, we develop a $q$-ary analogue of this reduction-and-extension mechanism. The identity $c^2=-1$ yields the isotropic line governing the split construction. For every fixed ordered pairing of the coordinates, we obtain a universal rank-$r$ boxed normal form, where $r$ is the dimension of the intersection with the product of these isotropic lines. Applications include optimal self-dual $[6,3,4]$ and $[8,4,4]$ codes over $\mathbb F_{5}$, optimal self-dual $[8,4,5]$ and $[10,5,6]$ codes over $\mathbb F_{13}$, and a self-dual $[12,6,6]$ code over $\mathbb F_{13}$. We also give an exact repeated boxed realization of self-dual $[18,9,8]$ and $[20,10,10]$ codes over $\mathbb F_{13}$, in which the split-boxed parent and its building-up child occur in one complete generator matrix. The algebraic core is formalized in Lean 4.

cs.IT