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 76 for “"graph optimization"”.
-
Interpretable graph distribution representation learning for graph optimization problems
Graph optimization problems (GOPs) are fundamental in both graph theory and artificial intelligence (AI), playing an important role in various real-world applications and motivating researchers to develop approaches to address them. With advancements in machine learning (ML), particularly deep …
-
Spatial Quantum Computation in Graph Optimization Problems in Transportation Applications
… of Quantum Computing (QC) to address spatial optimization problems in transportation systems. By leveraging the principles of quantum mechanics, this research aims to enhance the efficiency and effectiveness of transportation networks through QC-based solutions to challenges such as reducing …
-
Graph Optimization and Dual Quaternions for Spacecraft Autonomy During Close Proximity Operations
… this dissertation defense, we present the use of graph optimization and dual quaternion modeling and control techniques for enabling the next generation of spacecraft autonomy for future space missions during close proximity operations. Specifically, we investigate novel formulations of both …
-
A Weighted-Graph Optimization Approach for Automatic Location of Forest Road Networks
… greater computing power, and improvements in optimization techniques. Defining the objectives and deriving adequate objective functions are crucial steps in guiding the solution toward an ideal network, especially when individual goals may conflict. For example, whereas the conservationist …
-
Event graph optimization in RFI text documents using hierarchical reinforcement learning and human feedback
… RCA approaches, many of which are based on event graphs, tend to rely on predefined rules or statistical correlations, which may not fully capture the dynamic and evolving nature of construction-related issues. To address these challenges, this study proposes a novel approach that integrates human …
-
Multimodal Gaussian Splatting Framework with Accurate Image Relocalization for Robotic Inspection
… and 3DGS-based image relocalization with pose optimization. Robotic inspection systems rely on accurate localization to support automated monitoring of infrastructure such as buildings, tunnels, and bridges. However, existing approaches often rely on low-resolution and sparse point-cloud maps, …
-
Registro global de nuvens de pontos RGB-D em tempo real usando fluxo óptico e marcadores
… minimized by utilizing a marker and pose graph optimization. Experimental results gathered by processing several RGB-D datasets validatethe system proposed by this thesis in visual odometry and simultaneous localization and mapping (SLAM) applications.
-
Automatic Random Logic Layout Synthesis - a Module Generator Approach (Vlsi, Silicon Compilation, Design Automation, Cell Synthesis, Grid)
… synthesis problem. The emphasis is on the global optimization which requires that partitioning, placement and synthesis schemes consider the two-dimensional nature of the problem. Divide-and-conquer principle is used for partitioning the logic into small cells. The placement and wire assignment …
-
On the Unique Tree Representation of Graphs
This dissertation investigates classes of graphs which admit tree representations unique up to isomorphism. The definitions of these classes are based on local properties of P4's, A template structure theorem is given which illustrates the nature of the local properties. The template theorem is …
-
Combinatorial Optimization On Massive Datasets: Streaming, Distributed, And Massively Parallel Computation
… there is a rapidly growing need to solve various optimization tasks over such datasets. This in turn raises the following fundamental question: How well can we solve a large-scale optimization problem on massive datasets in a resource-efficient manner? The focus of this thesis is on answering this …
-
LEARNING POINT CLOUD REGISTRATION
… two point clouds by designing a learned view-graph optimization approach using recurrent graph neural networks.
-
FrameBreak: Dramatic Image Extrapolation by Guided Shift-Maps
… extrapolate the field of view of a photograph by learning from a roughly aligned, wide-angle guide image of the same scene category. Our method can extrapolate typical photos into complete panoramas. The extrapolation problem is formulated in the shift-map image synthesis framework. We …
-
Towards a Visual Simultaneous Localization and Mapping System for Computationally Constrained Systems
… This work also discusses a simple back-end pose-graph optimization approach using libg2o. The back end system improved the position estimation as well as detected loop closure events. These initial results show that computationally inexpensive feature detectors such as BRISK and ORB can be used …
-
World Model Online Evaluation
… yield better performance. In particular, Factor Graph Optimization with a Coordinated Turn motion model demonstrates the greatest potential, which may be attributed to the complex and dynamic behavior of objects in traffic environments. Furthermore, the findings suggest that future work exploring …
-
Windowed optimization for stereo visual odometry fusion
… when using 6 degrees of freedom poses through a graph optimization-based visual odometry fusion approach using the redundancy of captured information from the environment. Our approach uses two stereo images sets of a public dataset captured with a moving platform mounted on the top of a car to …
-
Power Distribution Network Analysis and Optimization in Digital VLSI Circuits
… flow consists of two main steps: analysis and optimization. During the analysis phase, the power and ground buses are broken down into multilevel hierarchical structures. Different algorithms are employed for the analysis at different hierarchies. In all the analyses, input-independent …
-
Quad Layout Generation and Symmetric Tilings of Closed Surfaces
… We approach the problem from a combinatorial graph optimization point of view. Mainly, finding a nice quad layout of a given surface is equivalent to solving a minimum weight perfect matching problem with additional quad guarantee constraints. The results are of high quality in terms of …
-
Learning strictly orthogonal p-order nonnegative Laplacian embedding via smoothed iterative reweighted method
Laplacian embedding is a powerful graph based method with its ability in spectral clustering to reveal the intrinsic geometry of data in the high dimensional space. Imposing the orthogonality and the nonnegativity constraints can avoid degenerate and negative solutions, respectively. These two …
Page 1 of 4