Search

Aiming at the current problem of insufficient extraction of small retinal blood vessels, we propose a retinal blood vessel segmentation algorithm that combines supervised learning and unsupervised learning algorithms. In this study, we use a multiscale matched filter with vessel enhancement capability and a U-Net model with a coding and decoding network structure. Three channels are used to extract vessel features separately, and finally, the segmentation results of the three channels are merged. The algorithm proposed in this paper has been verified and evaluated on the DRIVE, STARE, and CHASE_DB1 datasets. The experimental results show that the proposed algorithm can segment small blood vessels better than most other methods. We conclude that our algorithm has reached 0.8745, 0.8903, and 0.8916 on the three datasets in the sensitivity metric, respectively, which is nearly 0.1 higher than other existing methods. [ABSTRACT FROM AUTHOR]

Multimodal path queries over transportation networks are receiving increasing attention due to their widespread applications. A multimodal path query consists of finding multimodal journeys from source to destination in transportation networks, including unrestricted walking, driving, cycling, and schedule-based public transportation. Transportation networks are generally continent-sized. This characteristic highlights the need for parallel computing to accelerate multimodal path queries. Meanwhile, transportation networks are often fragmented and distributively stored on different machines. This situation calls for exploiting parallel computing power for these distributed systems. Therefore, in this paper, we study distributed multimodal path (DMP) queries over large transportation networks. We develop algorithms to explore parallel computation. When evaluating a DMP query $Q$ Q on a distributed multimodal graph $Gmult$ G m u l t , we show that the algorithms possess the following performance guarantees, irrespective of how $Gmult$ G m u l t is fragmented and distributed: (1) each machine is visited only once; (2) the total network traffic is determined by the size of $Q$ Q and the fragmentation of $Gmult$ G m u l t ; (3) the response time is decided by the largest fragment of $Gmult$ G m u l t ; and (4) the algorithm is parallel scalable. Using real-life and synthetic data, we experimentally verify that the algorithms are scalable on large graphs. [ABSTRACT FROM AUTHOR]