Erling Wei

Learn More
Spanning connectivity of graphs has been intensively investigated in the study of interconnection networks (Hsu and Lin, Graph Theory and Interconnection Networks, 2009). For a graph G and an integer s > 0 and for u, v ∈ V (G) with u = v, an (s; u, v)-path-system of G is a subgraph H consisting of s internally disjoint (u, v)-paths. A graph G is spanning(More)
Segmentation of pulmonary nodules in chest radiographs is a difficult task due to heavy noise and superposition of ribs, vessels, and other anatomical structures in lung field. In this paper, a polynomial fitting based ray-casting algorithm is proposed for pulmonary nodule segmentation in chest radiographs. Instead of directly detecting nodule edge points,(More)
  • 1