相关论文: Graph-Based Small Bowel Path Tracking with Cylindr…

Shortest paths problems are subject to extensive studies in classic distributed models such as the CONGEST or Congested Clique. These models dictate how nodes may communicate in order to determine shortest paths in a distributed input…

Let $G$ be a directed graph with $n$ vertices and $m$ edges, embedded on a surface $S$, possibly with boundary, with first Betti number $\beta$. We consider the complexity of finding closed directed walks in $G$ that are either contractible…

In this paper we study locally chordal graphs, i.e. graphs where every small-radius ball is chordal. We prove four characterizations of locally chordal graphs. Two are counterparts of the classic descriptions of chordal graphs via induced…

Optimal curve methods provide a fundamental framework for tubular centerline tracking. Point-wise approaches, such as minimal paths, are theoretically elegant but often suffer from shortcut and short-branch combination problems in complex…

Providing closed and well-connected boundaries of coronary artery is essential to assist cardiologists in the diagnosis of coronary artery disease (CAD). Recently, several deep learning-based methods have been proposed for boundary…

This note proposes a general control approach, called vector-field guided constraint-following control, to solve the dynamics control problem of geometric path-following for a class of uncertain mechanical systems. More specifically, it…

Our objective is to sample the node set of a large unknown graph via crawling, to accurately estimate a given metric of interest. We design a random walk on an appropriately defined weighted graph that achieves high efficiency by…

We introduce the notion of coarse bottlenecking in graphs and coarse skeletons of graphs and show how bottlenecking guarantees that a skeleton resembles (up to quasi-isometry) the original graph. We show how these tools can be used to…

Let $G$ be a directed graph on finitely many vertices and edges, and assign a positive weight to each edge on $G$. Fix vertices $u$ and $v$ and consider the set of paths that start at $u$ and end at $v$, self-intersecting in any number of…

Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex. We consider a variant of this classical problem in which the position of each…

A path system $\mathscr{P}$ in a graph $G=(V,E)$ is a collection of paths, with exactly one path between any two vertices in $V$. A path system is said to be consistent if it is closed under subpaths. We say that a path system $\mathscr{P}$…

This paper presents a method for improved analysis of objects with an axial symmetry using X-ray Computed Tomography (CT). Cylindrical coordinates about an axis fixed to the object form the most natural base to check certain characteristics…

Precise motion control of underactuated surface vessels is a crucial task in various maritime applications. In this work, we develop a nonlinear motion control strategy for surface vessels inspired by the pursuit guidance philosophy. Any…

The main goal of this article is to introduce new quantitative characteristics of cycles in finite simple connected graphs and to establish relations of these characteristics with the stretch and spanning tree congestion of graphs. The main…

We consider the problem of finding a Hamiltonian path with precedence constraints in the form of a partial order on the vertex set. This problem is known as Partially Ordered Hamiltonian Path Problem (POHPP). Here, we study the complexity…

In this research, we investigate the subject of path-finding. A pruned version of visibility graph based on Candidate Vertices is formulated, followed by a new visibility check technique. Such combination enables us to quickly identify the…

The efficient computation of shortest paths in complex networks is essential to face new challenges related to critical infrastructures such as a near real-time monitoring and control and the management of big size systems. In particular,…

The progress of image processing during recent years allows the measurement of pedestrian characteristics on a "microscopic" scale with low costs. However, density and flow are concepts of fluid mechanics defined for the limit of infinitely…

Path following controllers make the output of a control system approach and traverse a pre-specified path with no apriori time parametrization. In this paper we present a method for path following control design applicable to framed curves…

Finding small lesions is very challenging due to lack of noticeable features, severe class imbalance, as well as the size itself. One approach to improve small lesion segmentation is to reduce the region of interest and inspect it at a…