Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 16 of 16 for “"minimal path"”.

  1. Tracking and detection of cracks using minimal path techniques

    … research in the thesis investigates the use of minimal path techniques to track and detect cracks, modeled as curves, in critical infrastructure like pavements and bridges. We developed a novel minimal path algorithm to detect curves with complex topology that may have both closed cycles and …

    gatech Repository record for Tracking and detection of cracks using minimal path techniques (opens in a new tab)

  2. 3D livewire and live-vessel : minimal path methods for interactive medical image segmentation

    … by many factors including subject diversity, pathology, noise corruption, and poor image resolution. Traditionally, manual tracing by experts was done. While considered accurate, this process is time consuming and tedious, especially when performed slice-by-slice on three-dimensional (3D) …

    ubc Repository record for 3D livewire and live-vessel : minimal path methods for interactive medical image segmentation (opens in a new tab) Download PDF for 3D livewire and live-vessel : minimal path methods for interactive medical image segmentation (opens in a new tab)

  3. An Algorithm for the Machine Calculation of Minimal Paths

    … technique for obtaining machine solutions to minimal path problems. It is shown that this technique is applicable not only to the common case of finding geodesics on parameterized surfaces in R3, but also to the general case of finding minimal functionals on hypersurfaces in Rn associated with …

    etsu Repository record for An Algorithm for the Machine Calculation of Minimal Paths (opens in a new tab) Download PDF for An Algorithm for the Machine Calculation of Minimal Paths (opens in a new tab)

  4. Fault tree reliability analysis of the Naval Postgraduate School mini-satellite (ORION)

    … for ORION is constructed and used to identify minimal cut sets and minimal path sets. The cuts sets and path sets are, in turn, used to calculate an estimate of ORION's reliability to perform a three year mission. The reliability model was constructed in a Lotus 1-2-3 spreadsheet to enable the …

    nps Repository record for Fault tree reliability analysis of the Naval Postgraduate School mini-satellite (ORION) (opens in a new tab)

  5. A fast and accurate automated pavement crack detection algorithm

    … a fast and accurate crack detection algorithm. A minimal path based approach has been used to develop the crack detection algorithm. The technical approach consists of the following major steps: 1) Image preprocessing to remove isolated noise; 2) Preliminary crack segmentation to minimize false …

    gatech Repository record for A fast and accurate automated pavement crack detection algorithm (opens in a new tab)

  6. Compression of 4D medical image and spatial segmentation using deformable models

    … critical diagnostic information. In our proposed minimal path deformable model based approach, the initialization for the segmentation process is significantly simplified into a single starting point and precise and robust segmentation is achieved. Extracting complex vasculature from 3D magnetic …

    nus Repository record for Compression of 4D medical image and spatial segmentation using deformable models (opens in a new tab) Download file for Compression of 4D medical image and spatial segmentation using deformable models (opens in a new tab)

  7. A crack detection and diagnosis methodology for automated pavement condition evaluation

    … For crack detection, the active contour based minimal path procedure has demonstrated better performance than other existing algorithms; however, it mathematically requires one or more prior input points for each crack curve and cannot be fully automated, which introduces tedious and subjective …

    gatech Repository record for A crack detection and diagnosis methodology for automated pavement condition evaluation (opens in a new tab)

  8. Fly-Over: A Light-Weight Distributed Router Power-Gating Mechanism for Energy-Efficient Interconnects

    … proposed routing algorithm provides best-effort minimal path routing without the necessity for global network information. We evaluate our scheme using both unicast and multicast synthetic workloads as well as real workloads from PARSEC 2.1 benchmark suite. The results show that FLOV can achieve …

    tamu Repository record for Fly-Over: A Light-Weight Distributed Router Power-Gating Mechanism for Energy-Efficient Interconnects (opens in a new tab)

  9. Topological characterization of simplex agreement

    … graphbasierte Varianten, darunter Shortest-Path Agreement und Minimal-Path Agreement, und zeigen, dass eine Verschärfung der Validitätsbedingung die Aufgabe strikt schwieriger lösbar machen kann. Insbesondere zeigen wir anhand eines geeigneten Graphen, dass sich die Aufgaben des …

    humboldt-diss Repository record for Topological characterization of simplex agreement (opens in a new tab)

  10. Higgs and Heavy Meson Lattice Spectroscopy

    … is extracted using free-form smearing. A new "minimal-path" implementation is introduced which maintains the usefulness of the original free-form smearing method and reduces its computational time dramatically. First lattice results of assorted radially and orbitally excited bottomonium and …

    york Repository record for Higgs and Heavy Meson Lattice Spectroscopy (opens in a new tab)

  11. Application of shortest path algorithms to find paths of minimum radiation dose

    Presented here is the use of two path-optimization algorithms, Dijkstra's Algorithm, and the Bellman-Ford Algorithm, to find paths through radiologically contaminated environments such that the accumulated dose is minimal. Such paths will be very useful for personnel whose job requires them to …

    uiuc Repository record for Application of shortest path algorithms to find paths of minimum radiation dose (opens in a new tab)

  12. Multi-Objective Routing for Distributed Controllers

    … redundant topology where there is more than one minimal path between any source and destination as long as they do not share the same row or column in the grid. For the static, all-to-one traffic pattern used by a central controller, the number of minimal routing tables grows as O(N!N2). This …

    south-carolina Repository record for Multi-Objective Routing for Distributed Controllers (opens in a new tab)

  13. first passage percolation: exceptional events and asymptotic behavior of invasion restricted geodesics

    … vertices of a graph and study the weight of the minimal path between distant vertices. If F is the distribution function of \tau_v, there are different regimes: if F(0) is small, this weight typically grows like a linear function of the distance, and when F(0) is large, the weight is typically of …

    gatech Repository record for first passage percolation: exceptional events and asymptotic behavior of invasion restricted geodesics (opens in a new tab)

  14. Model-based Evaluation: from Dependability Theory to Security

    … mainly addresses binary systems, by extending minimal path sets, minimal cut sets, and reliability analysis based on both random events and random variables. The second group addresses multi-state security systems with multiple performance measures, by extending Multi-state Systems (MSSs) …

    waterloo Repository record for Model-based Evaluation: from Dependability Theory to Security (opens in a new tab)

  15. Visibility-Based Pursuit-Evasion In The Plane

    … is an algorithm that computes the optimal (minimal path length) pursuer trajectory for a single pursuer. The second contribution is an algorithm that generates a joint motion strategy for multiple pursuers. Motivated by the result of the second contribution, the third result is a …

    south-carolina Repository record for Visibility-Based Pursuit-Evasion In The Plane (opens in a new tab)

  16. Pavement Crack Segmentation with Dense Local Geometry Features and Boundary Enhancement Loss

    The objective of this study is to advance automated pavement crack segmentation by addressing two major bottlenecks that hinder the performance of convolution neural networks (CNNs) on this task, which are the robustness against diverse scenarios of real-world pavement data and the poor …

    gatech Repository record for Pavement Crack Segmentation with Dense Local Geometry Features and Boundary Enhancement Loss (opens in a new tab)