SearcharxivSearch

arXiv subjects

Lian Luo

Publications and source records attributed to Lian Luo.

5 recordsLinked to original sources

EHGCN: Hierarchical Euclidean-Hyperbolic Fusion via Motion-Aware GCN for Hybrid Event Stream Perception

Event cameras, characterized by microsecond temporal resolution and very High Dynamic Range (HDR), emit high-speed event streams for perception tasks. In recent advancements, Graph Neural Networks (GNNs)-based methods show great potential in event perception. However, they typically rely on straightforward pairwise node connectivity in Euclidean space where they struggle to capture long-range dependencies and faithfully characterize the inherent hierarchical structures of event streams. To this end, we propose EHGCN, a dual-space event perception approach that, to the best of our knowledge, is the first to jointly model event streams in Euclidean and hyperbolic spaces. By introducing hyperbolic geometry into event stream perception, EHGCN enables to naturally capture the anisotropic and hierarchical structures of non-uniform, motion-driven event streams. Specifically, we first introduce a distribution-aware event sifting method based on multi-scale voxel grids and Gaussian distribution modeling, retaining discriminative events while attenuating chaotic noise. Then, we present a Markov Random Field (MRF)-optimized motion-aware hyperedge generation scheme, which minimizes a motion consistency energy function to explicitly capture consistent global motion patterns within short time intervals, thereby eliminating cross-target spurious associations and providing critically topological priors while capturing long-range dependencies among events. Finally, we propose a Euclidean-hyperbolic GCN to fuse the retinal events densely aggregated and hierarchically modeled in local Euclidean and global hyperbolic spaces, respectively, to achieve a hybrid event perception. Extensive experimental results on event perception tasks, such as object detection and recognition, show the effectiveness of our approach. Our code will be released for public use at https://github.com/ev-lluo/EHGCN.

cs.CV

Connectivity keeping paths in $k$-connected bipartite graphs

In 2010, Mader [W. Mader, Connectivity keeping paths in $k$-connected graphs, J. Graph Theory 65 (2010) 61-69.] proved that every $k$-connected graph $G$ with minimum degree at least $\lfloor\frac{3k}{2}\rfloor+m-1$ contains a path $P$ of order $m$ such that $G-V(P)$ is still $k$-connected. In this paper, we consider similar problem for bipartite graphs, and prove that every $k$-connected bipartite graph $G$ with minimum degree at least $k+m$ contains a path $P$ of order $m$ such that $G-V(P)$ is still $k$-connected.

math.CO

An Adaptive XP-based approach to Agile Development

Software design is gradually becoming open, distributed, pervasive, and connected. It is a sad statistical fact that software projects are scientifically fragile and tend to fail more than other engineering fields. Agile development is a philosophy. And agile methods are processes that support the agile philosophy. XP places a strong emphasis on technical practices in addition to the more common teamwork and structural practices. In this paper, we elaborate how XP practices can be used to thinking, collaborating, releasing, planning, developing. And the state that make your team and organization more successful.

cs.SE

A New P2N Approach to Software Development Under the Clustering

In this computer era of rapid development, software development can be seen everywhere, but a lot of softwares are dead in modern development of software. Just as The Mythical Man-Month said, it exists a problem in the software development, and the problem is interflow.A lock of interflow can be said great calamity. Clustering is a environment to breed new life. In this thesis, we elaborate how P2N can be used to thinking, planning, developing, collaborating, releasing. And the approach that make your team and organization more perfect.

cs.SE

Hybrid Parallel Bidirectional Sieve based on SMP Cluster

In this article, hybrid parallel bidirectional sieve method is implemented by SMP Cluster, the individual computational units joined together by the communication network, are usually shared-memory systems with one or more multicore processor. To high-efficiency optimization, we propose average divide data into nodes, generating double-ended queues (deque) for sieve method that are able to exploit dual-cores simultaneously start sifting out primes from the head and tail.And each node create a FIFO queue as dynamic data buffer to ache temporary data from another nodes send to. The approach obtains huge speedup and efficiency on SMP Cluster.

cs.DC