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 7 of 7 for “"Adjacency Graph"”.

  1. Parallel and scalable neural image segmentation for connectome graph extraction

    … parallel algorithms for constructing a regional adjacency graph from labeled pixels and agglomerating an over-segmentation to obtain the final segmentation. The agglomeration process in particular is challenging to parallelize because most graph-based segmentation libraries entail very complex …

    mit Repository record for Parallel and scalable neural image segmentation for connectome graph extraction (opens in a new tab)

  2. A knowledge based manufacturing advisor for CAD

    … methodology presented in this research is a graph based technique that uses an attributed mid-surface adjacency graph as the basis for feature recognition. Feature recognition algorithms have been developed for a range of common moulding features. Two evaluation techniques are presented that …

    cranfield Repository record for A knowledge based manufacturing advisor for CAD (opens in a new tab)

  3. Vision-Based Rendering: Using Computational Stereo to Actualize IBR View Synthesis

    Computer graphics imagery (CGI) has enabled many useful applications in training, defense, and entertainment. One such application, CGI simulation, is a real-time system that allows users to navigate through and interact with a virtual rendition of an existing environment. Creating such systems is …

    byu Repository record for Vision-Based Rendering: Using Computational Stereo to Actualize IBR View Synthesis (opens in a new tab)

  4. Segmentation of color images for interactive 3D object retrieval

    … color images, split and merge methods based on adjacency graph image representations, a color zooming approach relying on the whitening transformation, combination of several information sources using Bayesian Belief Networks, and the detection of relevant image locations by means of a …

    aachen Repository record for Segmentation of color images for interactive 3D object retrieval (opens in a new tab)

  5. Polynomial systems : graphical structure, geometry, and applications

    … both of these tasks. By taking advantage of the graphical and geometrical structure of the problem, our methods can achieve higher efficiency, and we can also prove better guarantees. Various problems in areas such as robotics, power systems, computer vision, cryptography, and chemical reaction …

    mit Repository record for Polynomial systems : graphical structure, geometry, and applications (opens in a new tab)

  6. Extraction of 3D Object Representations from a Single Range Image

    … are grouped into objects according to their adjacency relations and the absence or presence of occlusion between them. The initial vertex estimates are improved significantly through a global optimization procedure. Finally, models of the 3D objects are represented using the boundary …

    vt Repository record for Extraction of 3D Object Representations from a Single Range Image (opens in a new tab)

  7. Long-range interatomic interactions: Oscillatory tails and hyperfine perturbations

    … x 64)-matrix. Our treatment, which profits from adjacency graphs, allows us to do the hyperfine-resolved calculation. We examine the evolution of the energy levels in the hyperfine subspaces. We notice that there is a possibility of level crossings in higher dimensional quantum mechanical …

    must-thes Repository record for Long-range interatomic interactions: Oscillatory tails and hyperfine perturbations (opens in a new tab)