32,308 research outputs found
Recommended from our members
An Open-Source Tool for Anisotropic Radiation Therapy Planning in Neuro-oncology Using DW-MRI Tractography.
There is evidence from histopathological studies that glioma tumor cells migrate preferentially along large white matter bundles. If the peritumoral white matter structures can be used to predict the likely trajectory of migrating tumor cells outside of the surgical margin, then this information could be used to inform the delineation of radiation therapy (RT) targets. In theory, an anisotropic expansion that takes large white matter bundle anatomy into account may maximize the chances of treating migrating cancer cells and minimize the amount of brain tissue exposed to high doses of ionizing radiation. Diffusion-weighted MRI (DW-MRI) can be used in combination with fiber tracking algorithms to model the trajectory of large white matter pathways using the direction and magnitude of water movement in tissue. The method presented here is a tool for translating a DW-MRI fiber tracking (tractography) dataset into a white matter path length (WMPL) map that assigns each voxel the shortest distance along a streamline back to a specified region of interest (ROI). We present an open-source WMPL tool, implemented in the package Diffusion Imaging in Python (DIPY), and code to convert the resulting WMPL map to anisotropic contours for RT in a commercial treatment planning system. This proof-of-concept lays the groundwork for future studies to evaluate the clinical value of incorporating tractography modeling into treatment planning
From axial to road-centre lines: a new representation for space syntax and a new model of route choice for transport network analysis
Axial analysis is one of the fundamental components of space syntax. The space syntax community has suggested that it picks up qualities of configurational relationships between spaces not illuminated by other representations. However, critics have questioned the absolute necessity of axial lines to space syntax, as well as the exact definition of axial lines. Why not another representation? In particular, why not road-centre lines, which are easily available in many countries for use within geographical information systems? Here I propose that a recently introduced method of analysis, angular segment analysis, can marry axial and road-centre line representations, and in doing so reflect a cognitive model of how route choice decisions may be made. I show that angular segment analysis can be applied generally to road-centre line segments or axial segments, through a simple length-
weighted normalisation procedure that makes values between the two maps comparable. I make comparative quantitative assessments for a real urban system, not just investigating angular analysis between axial and road-centre line networks, but also including more intuitive measures based on metric (or block) distances between locations. I show that the new angular segment analysis algorithm produces better correlation with observed vehicular flow than both standard axial analysis and metric distance measures. The results imply that there is no reason why space syntax inspired measures cannot be combined with transportation network analysis representations in order to create a new, cognitively coherent, model of movement in the city
Shortest path or anchor-based route choice: a large-scale empirical analysis of minicab routing in London
Understanding and modelling route choice behaviour is central to predicting the formation and propagation of urban road congestion. Yet within conventional literature disagreements persist around the nature of route choice behaviour, and how it should be modelled. In this paper, both the shortest path and anchor-based perspectives on route choice behaviour are explored through an empirical analysis of nearly 700,000 minicab routes across London, United Kingdom. In the first set of analyses, the degree of similarity between observed routes and possible shortest paths is established. Shortest paths demonstrate poor performance in predicting both observed route choice and characteristics. The second stage of analysis explores the influence of specific urban features, named anchors, in route choice. These analyses show that certain features attract more route choices than would be expected were individuals choosing route based on cost minimisation alone. Instead, the results indicate that major urban features form the basis of route choice planning – being selected disproportionately more often, and causing asymmetry in route choice volumes by direction of travel. At a finer scale, decisions made at minor road features are furthermore demonstrated to influence routing patterns. The results indicate a need to revisit the basis of how routes are modelled, shifting from the shortest path perspective to a mechanism structured around urban features. In concluding, the main trends are synthesised within an initial framework for route choice modelling, and presents potential extensions of this research
Cellular Automata Applications in Shortest Path Problem
Cellular Automata (CAs) are computational models that can capture the
essential features of systems in which global behavior emerges from the
collective effect of simple components, which interact locally. During the last
decades, CAs have been extensively used for mimicking several natural processes
and systems to find fine solutions in many complex hard to solve computer
science and engineering problems. Among them, the shortest path problem is one
of the most pronounced and highly studied problems that scientists have been
trying to tackle by using a plethora of methodologies and even unconventional
approaches. The proposed solutions are mainly justified by their ability to
provide a correct solution in a better time complexity than the renowned
Dijkstra's algorithm. Although there is a wide variety regarding the
algorithmic complexity of the algorithms suggested, spanning from simplistic
graph traversal algorithms to complex nature inspired and bio-mimicking
algorithms, in this chapter we focus on the successful application of CAs to
shortest path problem as found in various diverse disciplines like computer
science, swarm robotics, computer networks, decision science and biomimicking
of biological organisms' behaviour. In particular, an introduction on the first
CA-based algorithm tackling the shortest path problem is provided in detail.
After the short presentation of shortest path algorithms arriving from the
relaxization of the CAs principles, the application of the CA-based shortest
path definition on the coordinated motion of swarm robotics is also introduced.
Moreover, the CA based application of shortest path finding in computer
networks is presented in brief. Finally, a CA that models exactly the behavior
of a biological organism, namely the Physarum's behavior, finding the
minimum-length path between two points in a labyrinth is given.Comment: To appear in the book: Adamatzky, A (Ed.) Shortest path solvers. From
software to wetware. Springer, 201
- …