Search

Your search keyword '"LI, Haiyan"' showing total 8,085 results
Start Over Author "LI, Haiyan" Search Limiters Academic (Peer-Reviewed) Journals
8,085 results on '"LI, Haiyan"'

6. X Modality Assisting RGBT Object Tracking

Author

Ding, Zhaisheng, Li, Haiyan, Hou, Ruichao, Liu, Yanyu, Xie, Shidong, Zhou, Dongming, and Cao, Jinde

Subjects
Computer Science - Computer Vision and Pattern Recognition
Abstract

Learning robust multi-modal feature representations is critical for boosting tracking performance. To this end, we propose a novel X Modality Assisting Network (X-Net) to shed light on the impact of the fusion paradigm by decoupling the visual object tracking into three distinct levels, facilitating subsequent processing. Firstly, to tackle the feature learning hurdles stemming from significant differences between RGB and thermal modalities, a plug-and-play pixel-level generation module (PGM) is proposed based on self-knowledge distillation learning, which effectively generates X modality to bridge the gap between the dual patterns while reducing noise interference. Subsequently, to further achieve the optimal sample feature representation and facilitate cross-modal interactions, we propose a feature-level interaction module (FIM) that incorporates a mixed feature interaction transformer and a spatial-dimensional feature translation strategy. Ultimately, aiming at random drifting due to missing instance features, we propose a flexible online optimized strategy called the decision-level refinement module (DRM), which contains optical flow and refinement mechanisms. Experiments are conducted on three benchmarks to verify that the proposed X-Net outperforms state-of-the-art trackers.

Published
2023

34. On the Weisfeiler-Leman dimension of some polyhedral graphs

Author

Li, Haiyan, Ponomarenko, Ilia, and Zeman, Peter

Subjects
Mathematics - Combinatorics
Abstract

Let $m$ be a positive integer, $X$ a graph with vertex set $\Omega$, and ${\rm WL}_m(X)$ the coloring of the Cartesian $m$-power $\Omega^m$, obtained by the $m$-dimensional Weisfeiler-Leman algorithm. The ${\rm WL}$-dimension of the graph $X$ is defined to be the smallest $m$ for which the coloring ${\rm WL}_m(X)$ determines $X$ up to isomorphism. It is known that the ${\rm WL}$-dimension of any planar graph is $2$ or $3$, but no planar graph of ${\rm WL}$-dimension $3$ is known. We prove that the ${\rm WL}$-dimension of a polyhedral (i.e., $3$-connected planar) graph $X$ is at most $2$ if the color classes of the coloring ${\rm WL}_2(X)$ are the orbits of the componentwise action of the group ${\rm Aut}(X)$ on $\Omega^2$.

Published
2023

35. Intent-based UAV swarm network: management architecture, key technologies, and future vision

Author

LI Xuan, LI Haiyan, ZHANG Lu, ZHANG Yuhang, and ZHANG Haojie

Subjects
UAV swarm, intent-based network, intelligent strategy, Telecommunication, TK5101-6720, Technology
Abstract

As an integral part to the air, space and ground integrated network, unmanned aerial vehicle (UAV) swarms have shown broad application prospects in complex tasks such as emergency search and rescue, offensive and defensive confrontation, intelligence reconnaissance and surveillance. The advancements in unmanned technology, coupled with the increasingly rich applications of multi-UAV collaborative intelligence, have engendered new requisites for the information exchange capabilities within UAV swarm networks. Under the umbrella of intent-based network architecture, UAV swarms are capable of autonomously managing the network, thereby mitigating the intricacies inherent in network management. Introducing intent-driven network into UAV swarm systems urgently requires breakthroughs in smart autonomous network technology to enhance the adaptability of intelligent groups in high-dynamic and uncertain environments. A new perspective and method for the collaborative operation and intelligent decision-making of UAV swarms was provided. The architecture, key technologies, and prospects of intent-based UAV swarm networks management were reviewed. Through in-depth analysis and discussion, a solid theoretical foundation and technical reference were aimed to be provided for the future development of UAV swarms.

Published
2024
Full Text
View/download PDF

39. New sufficient degree conditions for an $r$-uniform hypergraph to be $k$-edge-connected

Author

Guo, Jiyun, Wang, Jun, Cai, Zhanyuan, and Li, Haiyan

Subjects
Mathematics - Combinatorics
Abstract

An $r$-uniform hypergraphic sequence (i.e., $r$-graphic sequence) $d=(d_1, d_2,\cdots,d_n)$ is said to be forcibly $k$-edge-connected if every realization of $d$ is $k$-edge-connected. In this paper, we obtain a strongest sufficient degree condition for $d$ to be $k$-edge-connected for all $k\ge 1$ and a strongest sufficient degree condition for $d$ to be super edge-connected. As a corollary, we give the minimum degree condition for $d$ to be maximally edge-connected. We also obtain another sufficient degree condition for $d$ to be $k$-edge-connected.

Published
2022

40. A Study on Tangible Interaction Design for Children Cooperative Learning

Author

Li, Haiyan, Jiang, Zhuoqing, Ruan, Zhonghe, Fan, Min, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, van Leeuwen, Jan, Series Editor, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Kobsa, Alfred, Series Editor, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Nierstrasz, Oscar, Series Editor, Pandu Rangan, C., Editorial Board Member, Sudan, Madhu, Series Editor, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Deshpande, R.D., Series Editor, Vardi, Moshe Y, Series Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Kurosu, Masaaki, editor, and Hashizume, Ayako, editor

Published
2024
Full Text
View/download PDF

42. On the existence of tripartite graphs and n-partite graphs

Author

Guo, Jiyun, Fu, Miao, Zhang, Yuqin, and Li, Haiyan

Subjects
Mathematics - Combinatorics
Abstract

The degree sequence of a graph is the sequence of the degrees of its vertices. If $\pi$ is a degree sequence of a graph $G$, then $G$ is a realization of $\pi$ and $G$ realizes $\pi$. Determining when a sequence of positive integers is realizable as a degree sequence of a simple graph has received much attention. One of the early results, by Erd\"{o}s and Gallai, characterized degree sequences of graphs. The result was strengthened by Hakimi and Havel. Another generalization is derived by Cai et al. Hoogeveen and Sierksma listed seven criteria and gave a uniform proof. In addition, Gale and Ryser independently established a characterization by using network flows. We extend Gale and Ryser's results from bipartite graphs to tripartite graphs and even $n$-partite graphs. As corollaries, we give a necessary condition and a sufficient condition for the triple $(\sigma_1, \sigma_2, \sigma_3)$ to be realizable by a tripartite graph, where $\sigma_1$, $\sigma_2$ and $\sigma_3$ are all non-increasing sequences of nonnegative integers. We also give a stronger necessary condition for $(\sigma_1, \sigma_2, \sigma_3)$ to be realizable by a tripartite graph.

Published
2022

Catalog

Books, media, physical & digital resources
See catalog results