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 20 of 90 for “"graph cut"”.

  1. Shape Estimation Using Graph Cut

    … optimization problems which are solved using graph cut. Particularly, an approach called graph cuts based active contours (GCBAC) is proposed, and its applications to 2D object segmentation and three-dimensional (3D) object modeling are discussed. In the application of object segmentation, the …

    uiuc Repository record for Shape Estimation Using Graph Cut (opens in a new tab)

  2. Comparative analysis of deep learning and graph cut algorithms for cell image segmentation

    … segmentation algorithm based on the so-called graph cut that addresses the segmentation problem using an energy minimization scheme defined on a weighted graph. Second, we use modern techniques based on deep neural networks, namely U-Net and LSTM that have a time-consuming training and a …

    uoit Repository record for Comparative analysis of deep learning and graph cut algorithms for cell image segmentation (opens in a new tab)

  3. Interactive Part Selection for Mesh and Point Models Using Hierarchical Graph-cut Partitioning

    … methods with hierarchically accelerated graph-cut segmentation. Using graph-cut segmentation to determine optimal intuitive part boundaries enables easy part selection on complex geometries and allows for a simple, scribble-based interface that focuses on selecting within visible parts …

    byu Repository record for Interactive Part Selection for Mesh and Point Models Using Hierarchical Graph-cut Partitioning (opens in a new tab) Download PDF for Interactive Part Selection for Mesh and Point Models Using Hierarchical Graph-cut Partitioning (opens in a new tab)

  4. Approximation algorithms for a graph-cut problem with applications to a clustering problem in bioinformatics

    … study the clustering problem by modeling it as graph cut problems. Given an edge weighted graph, the goal is to partition the graph into a prescribed number of subsets obeying some capacity constraints, so as to maximize the total weight of the edges that are within a subset. Identification of a …

    lethbridge Repository record for Approximation algorithms for a graph-cut problem with applications to a clustering problem in bioinformatics (opens in a new tab)

  5. Left Ventricle Myocardium Segmentation from 3D Cardiac MR Images using Combined Probabilistic Atlas and Graph Cut-based Approaches

    … imaging modalities, including Computed Tomography (CT) Magnetic Resonance Imaging (MRI) and Ultrasound (US) are critical for the diagnosis and progress monitoring of many cardiac conditions, planning, visualization and delivery of therapy via minimally invasive intervention procedures, as …

    rit Repository record for Left Ventricle Myocardium Segmentation from 3D Cardiac MR Images using Combined Probabilistic Atlas and Graph Cut-based Approaches (opens in a new tab)

  6. Segmentace medicínských obrazových dat

    … v medicínských objemových datech pomocí metody graph cut. Zvolený přístup segmentace vyžaduje zavedení inicializačných bodů pro objekt a pozadí. Zaměřením této práce je implementace metody graph cut a vytvoření interaktivního segmentačního nástroje. Vlastnosti implementované metody jsou zkoumány …

    brno-tech Repository record for Segmentace medicínských obrazových dat (opens in a new tab)

  7. Image Vectorization

    … a new technique for creating an editable vector graphic from an object in a raster image. Object selection is performed interactively in subsecond time by calling graph cut with each mouse movement. A renderable mesh is then computed automatically for the selected object and each of its …

    byu Repository record for Image Vectorization (opens in a new tab) Download PDF for Image Vectorization (opens in a new tab)

  8. Live Surface

    … (sub-second) rates using a novel, Cascading Graph Cut (CGC). Live Surface consists of two phases. (1) Preprocessing for generation of a complete 3D watershed hierarchy followed by tracking of all catchment basin surfaces. (2) User interaction in which, with each mouse movement, the 3D object …

    byu Repository record for Live Surface (opens in a new tab) Download PDF for Live Surface (opens in a new tab)

  9. Geometric image segmentation via transform invariant rank cuts

    … algorithm, named as Transform Invariant Rank Cuts (TIRC). Based on salient 3D geometric information of natural scenes. The segmentation algorithm unities an emerging robust statistics technique called Robust PCA and its recent application in Transform Invariant Low-Rank Texture (TILT) …

    missouri Repository record for Geometric image segmentation via transform invariant rank cuts (opens in a new tab)

  10. Ensemble video object cut in highly dynamic scenes

    … AT AUTHOR'S REQUEST.] We consider video object cut as an ensemble of framelevel background-foreground object classifiers which fuses information across frames and refine their segmentation results in a collaborative and iterative manner. Our approach addresses the challenging issues of modeling …

    missouri Repository record for Ensemble video object cut in highly dynamic scenes (opens in a new tab)

  11. Assessment of Post-earthquake Building Damage Using High-resolution Satellite Images and LiDAR Data - a Case Study From Port-au-prince, Haiti

    … and LiDAR data from Port-au-Prince, Haiti. A graph-cut method is used for building detection due to its advantages compared to traditional methods such as the Hough transform. Results of two methods are compared to understand how much our proposed technique is effective. Afterwards, …

    unt Repository record for Assessment of Post-earthquake Building Damage Using High-resolution Satellite Images and LiDAR Data - a Case Study From Port-au-prince, Haiti (opens in a new tab)

  12. Segmentace polygonálního modelu

    … Preserving Harmonic Field. Metóda využíva graph-cut a je implementovaná vo forme webovej aplikácie. Aplikácia podporuje formáty .obj a .stl, umožňuje používateľovi načítať model, nekresliť po povrchu modelu náčrtky reprezentujúce popredie a pozadie, a spustiť segmentáciu. Po dokončení si …

    brno-tech Repository record for Segmentace polygonálního modelu (opens in a new tab)

  13. Enhancing surveillance video captured in inclement weather

    … state of the art probability formulations and graph-cut based optimization algorithms. A more accurate probability model, which incorporates the expected geometry of a surveillance camera, is shown to be compatible with the a-expansion algorithm and is used to improve the result of the depth …

    anu Repository record for Enhancing surveillance video captured in inclement weather (opens in a new tab)

  14. tracker independent drift detection and correction using segmented objects and features

    … selection of best performing parameters of Graph Cut object segmentation and of support vector machines using artificial immune system. In addition, this work proposes a framework for the evaluation and ranking of different trackers using easily interpretable performance measures, in a way …

    concordia Download PDF for tracker independent drift detection and correction using segmented objects and features (opens in a new tab)

  15. Algorithmic issues in visual object recognition

    … recognition using the computing capabilities of Graphics Processing Units (GPUs). First, we present an implementation of Graph Cut on GPUs, which achieves up to 4x speedup against compared to a CPU implementation. The Graph Cut algorithm has many applications related to visual object recognition …

    maryland Repository record for Algorithmic issues in visual object recognition (opens in a new tab)

  16. Approximation algorithms for new graph partitioning and facility location problems

    … These problems fall into two general areas: graph partitioning and facility location. The first problem that we introduce is the unbalanced graph cut problem. Here the goal is to find a graph cut, minimizing the size of one of the sides, while also respecting an upper bound on the number of …

    cornell Repository record for Approximation algorithms for new graph partitioning and facility location problems (opens in a new tab)

  17. STATISTICAL METHODS FOR POLICY EVALUATION AND POLICY LEARNING

    … correlation favors separation. This motivates a graph cut algorithm via spectral clustering, yielding gains in simulations and a ride-hailing simulator. For time-varying MDPs, we derive state-dependent policies from the semiparametric efficiency bound, with closed-form terminal allocation and …

    nus Repository record for STATISTICAL METHODS FOR POLICY EVALUATION AND POLICY LEARNING (opens in a new tab) Download file for STATISTICAL METHODS FOR POLICY EVALUATION AND POLICY LEARNING (opens in a new tab)

  18. Multi-resolution region-preserving segmentation for color images of natural scene

    … methods have shown a strong interest in graph based algorithm, and they have been quite successful in identifying significant regions and their boundaries. The cost functions used in these graph algorithms are usually based on low-level pixel-based image features such as position, …

    nus Repository record for Multi-resolution region-preserving segmentation for color images of natural scene (opens in a new tab) Download file for Multi-resolution region-preserving segmentation for color images of natural scene (opens in a new tab)

  19. Computational Methods for Segmentation of Multi-Modal Multi-Dimensional Cardiac Images

    … patterns in the heart via electrocardiography (ECG) signals, serve as good cardiac diagnosis indicators. Furthermore, high quality anatomical models of the heart can be used in planning and guidance of minimally invasive interventions under the assistance of image guidance. The most …

    rit Repository record for Computational Methods for Segmentation of Multi-Modal Multi-Dimensional Cardiac Images (opens in a new tab)

  20. On Algorithmic Fairness and Stochastic Models for Combinatorial Optimization and Unsupervised Machine Learning

    … are clustering problems and problems of finding cuts in graphs. The goal of the research presented in this dissertation is to introduce novel variants of the aforementioned problems, by generalizing their classic variants into two, not necessarily disjoint, directions. The first direction …

    maryland Repository record for On Algorithmic Fairness and Stochastic Models for Combinatorial Optimization and Unsupervised Machine Learning (opens in a new tab)

Page 1 of 5