Source author record

Ruonan Li

Ruonan Li appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

5works
2topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

5 published item(s)

preprint2026arXiv

Distill, Diffuse, and Semanticize (DDS): Annotation-Free 3D Scene Understanding Based on Multi-Granularity Distillation and Graph-Diffusion-Based Segmentation

3D semantic scene understanding is essential for digital twins, autonomous driving, smart agriculture, and embodied perception, yet dense point-wise annotation for point clouds remains expensive and difficult to scale. Existing annotation-free methods often face a trade-off between semantic recognition and structural efficiency: open-vocabulary and foundation-model-driven methods provide strong semantic priors, but often come with substantial computational costs, while structure-oriented methods based on superpoints, clustering, and graph reasoning are lightweight but often produce category-agnostic regions. We propose DDS, a resource-efficient structure-oriented framework for region-consistent and semanticized annotation-free 3D scene understanding. DDS preserves the lightweight superpoint-based organization paradigm while incorporating visual semantic cues from projected features and segmentation-derived masks. It first performs multi-granularity distillation to guide the 3D backbone at the point, mask-prototype, and inter-prototype levels, then applies graph diffusion over superpoints to propagate semantic information directly in 3D, producing coherent region representations without costly spectral decomposition or dense open-vocabulary 3D feature fields. Finally, DDS uses segmentation-cluster association to assign interpretable semantic names to category-agnostic 3D clusters. Experiments on real-world datasets show that DDS achieves the best performance among representative structure-oriented annotation-free baselines, improving oAcc, mAcc, and mIoU by up to 5.9%, 8.1%, and 2.4%, respectively. These results demonstrate that DDS improves region consistency and lightweight semantic recognition, providing a scalable and interpretable solution for annotation-free 3D scene understanding.

preprint2022arXiv

A revisit to Bang-Jensen-Gutin conjecture and Yeo's theorem

A path (cycle) is properly-colored if consecutive edges are of distinct colors. In 1997, Bang-Jensen and Gutin conjectured a necessary and sufficient condition for the existence of a Hamilton path in an edge-colored complete graph. This conjecture, confirmed by Feng, Giesen, Guo, Gutin, Jensen and Rafley in 2006, was laterly playing an important role in Lo's asymptotical proof of Bollobás-Erdős' conjecture on properly-colored Hamilton cycles. In 1997, Yeo obtained a structural characterization of edge-colored graphs that containing no properly colored cycles. This result is a fundamental tool in the study of edge-colored graphs. In this paper, we first give a much shorter proof of the Bang-Jensen-Gutin Conjecture by two novel absorbing lemmas. We also prove a new sufficient condition for the existence of a properly-colored cycle and then deduce Yeo's theorem from this result and a closure concept in edge-colored graphs.

preprint2020arXiv

Properly colored cycles in edge-colored complete graphs containing no monochromatic triangles: a vertex-pancyclic analogous result

A properly colored cycle (path) in an edge-colored graph is a cycle (path) with consecutive edges assigned distinct colors. A monochromatic triangle is a cycle of length $3$ with the edges assigned a same color. It is known that every edge-colored complete graph without containing monochromatic triangles always contains a properly colored Hamilton path. In this paper, we investigate the existence of properly colored cycles in edge-colored complete graphs when monochromatic triangles are forbidden. We obtain a vertex-pancyclic analogous result combined with a characterization of all the exceptions.

preprint2020arXiv

Rainbow triangles in arc-colored tournaments

Let $T_{n}$ be an arc-colored tournament of order $n$. The maximum monochromatic indegree $Δ^{-mon}(T_{n})$ (resp. outdegree $Δ^{+mon}(T_{n})$) of $T_{n}$ is the maximum number of in-arcs (resp. out-arcs) of a same color incident to a vertex of $T_{n}$. The irregularity $i(T_{n})$ of $T_{n}$ is the maximum difference between the indegree and outdegree of a vertex of $T_{n}$. A subdigraph $H$ of an arc-colored digraph $D$ is called rainbow if each pair of arcs in $H$ have distinct colors. In this paper, we show that each vertex $v$ in an arc-colored tournament $T_{n}$ with $Δ^{-mon}(T_n)\leqΔ^{+mon}(T_n)$ is contained in at least $\frac{δ(v)(n-δ(v)-i(T_n))}{2}-[Δ^{-mon}(T_{n})(n-1)+Δ^{+mon}(T_{n})d^+(v)]$ rainbow triangles, where $δ(v)=\min\{d^+(v), d^-(v)\}$. We also give some maximum monochromatic degree conditions for $T_{n}$ to contain rainbow triangles, and to contain rainbow triangles passing through a given vertex. Finally, we present some examples showing that some of the conditions in our results are best possible. Keywords: arc-colored tournament, rainbow triangle, maximum monochromatic indegree (outdegree), irregularity

preprint2016arXiv

Cyclability of $id$-cycles in graphs

Let $G$ be a graph on $n$ vertices and $C'=v_0v_1\cdots v_{p-1}v_0$ a vertex sequence of $G$ with $p\geq 3$ ($v_i\neq v_j$ for all $i,j=0,1,\ldots,p-1$, $i\neq j$). If for any successive vertices $v_i$, $v_{i+1}$ on $C'$, either $v_iv_{i+1}\in E(G)$ or both of the first implicit-degrees of $v_i$ and $v_{i+1}$ are at least $n/2$ (indices are taken modulo $p$), then $C'$ is called an $id$-cycle of $G$. In this paper, we prove that for every $id$-cycle $C'$, there exists a cycle $C$ in $G$ with $V(C')\subseteq V(C)$. This generalizes several early results on the Hamiltonicity and cyclability of graphs.