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 31 for “"Graph cut"”.
-
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 …
-
Stereo vision based on compressed feature correlation and graph cut
… from the computational fluids community into graph cut from the computer vision community. The proposed methodology consists of two independent modules. The first module is named Compressed Feature Correlation which is originated from Particle Image Velocimetry (PIV). The algorithm uses an …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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, …
-
Urban scene parsing via low-rank texture patches
… out the patches with an energy-minimizing graph cut. The output is then further parameterized to provide useful data to existing 3-D reconstruction methods. The pipeline was evaluated on challenging test images from Microsoft Bing Maps oblique aerial photography and produced an 80% recall …
-
Projection methods for clustering and semi-supervised classification
… on a different approach to clustering based on graph cuts. The minimum normalised graph cut objective has gained considerable attention as relaxations of the objective have been developed, which make them solvable for reasonably well sized problems. This has been adopted by the highly popular …
-
Texture measures for segmentation
… image patch textons are best for colour images. Graph cut segmentation is best for pixel labelling problems and edge detection with regular borders. Non-maxima suppression is best for edge detection with irregular borders. Factors affecting the performance of the algorithms are investigated.
-
Machine Vision for Road Pavement Applications Bitumen Coverage and Grain Size Estimation
… of the typical stone and bitumen color and a graph-cut algorithm we get result that seems to be close to the real degree of bitumen coverage. In the second paper we instead look at the problem with darker stones. In this case we cannot see a clear color difference between the stones and the …
-
Morphometric measurements of the retinal vasculature in ultra-wide scanning laser ophthalmoscopy as biomarkers for cardiovascular disease
… classification and a novel formulation for a graph cut approach to partition consistently the retinal vasculature that was modelled as an undirected graph. Once all the vessels were labelled, a tree representation was adopted for each vessel and its branches to fully automate the process of …
-
0-1 graph partitioning and image segmentation
Graph partitioning is the grouping of all the nodes in a graph into two or more partitions based on certain criteria. Graph cut techniques are used to partition a graph. The Minimum Cut method gives imbalanced partitions. To overcome the imbalanced partitioning, the Normalized Cut method is used. …
-
Optimization problems in network connectivity
… a cactus representation of all the minimum cuts in an undirected graph. -- Cut Sparsification. A cut sparsifier of an undirected graph is a sparse graph on the same set of vertices that preserves its cut values up to small errors. We give new combinatorial and algorithmic results for …
-
Efficient inference and learning for computer vision labelling problems
… functions can be solved exactly with efficient graph cut methods. The third part of the thesis addresses the problem of learning the parameters of the energy function. Although several methods have been proposed to learn the model parameters from training data, they suffer from various …
-
Graphical Methods for Image Compositing and Completion
… I propose methods that are based on graph theory to address the open problems in the literature of image and video compositing, and scene completion. For a visually plausible compositing, it is first required to separate the object to be composed from the background it was initially …
-
Conic optimization of electric power systems
… First, we formulate a new type of NP-hard graph cut arising from undirected multicommodity flow networks. An eigenvalue bound in the form of the Cheeger inequality is proven, which serves as a starting point for deriving semidefinite relaxations. We next apply a lift-and-project type …
-
Descriptive complexity of constraint problems
… problems can be expressed. Examples include graph colouring problems, Boolean satisfaction, graph cut problems, systems of equations, and many more. One typically distinguishes between constraint satisfaction problems (CSPs), which model strictly decision problems, and so-called valued …
Page 1 of 2