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 97 for “"Graph Laplacian"”.

  1. A discrete graph Laplacian for signal processing

    In this thesis we exploit diffusion processes on graphs to effect two fundamental problems of image processing: denoising and segmentation. We treat these two low-level vision problems on the pixel-wise level under a unified framework: a graph embedding. Using this framework opens us up to the …

    birmingham Download PDF for A discrete graph Laplacian for signal processing (opens in a new tab)

  2. Piecewise Planar Image Restoration via Gradient Graph Laplacian Regularizer

    … We formulate quadratic objectives regularized by Graph Laplacian Regularizer and Gradient Graph Laplacian Regularizer, tailored for these two applications. These objectives can be efficiently solved in linear time using a conjugate gradient solver and the alternating direction method of …

    york Repository record for Piecewise Planar Image Restoration via Gradient Graph Laplacian Regularizer (opens in a new tab)

  3. Interpretable Deep Image Denoiser by Unrolling Graph Laplacian Regularizer

    … (MAP) optimization problem regularized using a graph Laplacian prior. To guarantee a minimum level of performance, we initialize the network to a known (pseudo-)linear denoiser, which is mapped to a corresponding graph Laplacian matrix specifying the MAP problem, leveraging a previous linear …

    york Repository record for Interpretable Deep Image Denoiser by Unrolling Graph Laplacian Regularizer (opens in a new tab)

  4. Image super resolution via non-local normalized graph Laplacian regularization

    … implicitly via the so called normalized graph Laplacian operator. This operator applies a non-local kernel similarity measure due to choice of a non-local operator for weight assignment. The data fidelity term is modeled as a likelihood estimator that is scaled using a sharpening term …

    uoit Repository record for Image super resolution via non-local normalized graph Laplacian regularization (opens in a new tab)

  5. A Multigrid Solver for Graph Laplacian Linear Systems on Power-Law Graphs

    The Laplacian matrix, L, of a graph, G, contains degree and edge information of a given network. Solving a Laplacian linear system Lx = b provides information about flow through the network, and in specific cases, how that information orders the nodes in the network. I propose a novel way to solve …

    rice Repository record for A Multigrid Solver for Graph Laplacian Linear Systems on Power-Law Graphs (opens in a new tab)

  6. Joint Demosaicking / Rectification of Fisheye Camera Images using Multi-color Graph Laplacian Regulation

    … colors in the Bayer-patterned grid. A similarity graph is constructed based on the estimated gradients, and pixels are interpolated in the rectified grid directly via graph Laplacian regularization (GLR). To establish ground truth for objective testing, a large dataset containing pairs of …

    york Repository record for Joint Demosaicking / Rectification of Fisheye Camera Images using Multi-color Graph Laplacian Regulation (opens in a new tab)

  7. Learning Sparse Graph Laplacian with K Eigenvector Prior via Iterative GLASSO and Projection

    Learning a suitable graph is an important precursor to many graph signal processing (GSP) tasks, such as graph signal compression and denoising. Previous graph learning algorithms either make assumptions on graph connectivity (e.g., graph sparsity), or make individual edge weight assumptions such …

    york Repository record for Learning Sparse Graph Laplacian with K Eigenvector Prior via Iterative GLASSO and Projection (opens in a new tab)

  8. Chip-Firing on Signed Graphs

    Graphical chip-firing is a process where ‘chips’ are exchanged between vertices of a graph, the dynamics of which are governed by the graph Laplacian. Chip-firing is a well-developed field with applications to physics, computer science, and many areas of mathematics. Guzmán and Klivans introduced a …

    texas-state Repository record for Chip-Firing on Signed Graphs (opens in a new tab)

  9. Two Problems Involving Random Walks on Graphs: Random surfers, PageRank, and short-time asymptotics for the heat kernel

    … machine learning methods often rely on graphs to model data, prompting research on how theoretical properties of operators on graphs are leveraged in learning problems. In the first part of the thesis, we propose a framework for rigorously studying continuum limits of learning algorithms …

    umn Repository record for Two Problems Involving Random Walks on Graphs: Random surfers, PageRank, and short-time asymptotics for the heat kernel (opens in a new tab)

  10. Learning and Manifolds: Leveraging the Intrinsic Geometry

    … learning). First, building on the Laplacian Eigenmap and Diffusionmaps framework, we propose a new paradigm that offers a guarantee, under reasonable assumptions, that any manifold learning algorithm will preserve the geometry of a data set. Our approach is based on augmenting the …

    washington Repository record for Learning and Manifolds: Leveraging the Intrinsic Geometry (opens in a new tab)

  11. Combinatorial Laplacians on Complexes

    The combinatorial Laplacian extends the graph Laplacian to simplicial complexes by using the coboundary maps of the simplicial cochain complex. Its spectrum contains both topological and combinatorial information. This dissertation studies eigenvalue bounds for these operators, extends the …

    iupui Repository record for Combinatorial Laplacians on Complexes (opens in a new tab)

  12. Synthesis of Laplacian-like operators on cartesian grids with 3D applications for biomolecules

    … of the differential geometry de Rham-Hodge Laplacian have emerged as fast and concise topological and geometric shape descriptors for complex data sets. However, choosing the appropriate type of Laplace operator depends on the application and discretization scheme, especially in the context …

    msu Repository record for Synthesis of Laplacian-like operators on cartesian grids with 3D applications for biomolecules (opens in a new tab)

  13. Distributed Control and Optimisation of Complex Networks via their Laplacian Spectra

    … depending on the structure of the communication graph, and the synchronisation of coupled chaotic oscillators may be unachievable in one configuration, when it is achievable in another. As such, it is vital for agents within a complex networked system to be able to make estimates of the properties …

    bristol Repository record for Distributed Control and Optimisation of Complex Networks via their Laplacian Spectra (opens in a new tab) Download PDF for Distributed Control and Optimisation of Complex Networks via their Laplacian Spectra (opens in a new tab)

  14. Mathematical Formulations, Algorithms and Theory for Big Data Problems

    … for Solving Jigsaw Puzzles By The Connection Graph Laplacian We propose a novel mathematical framework to address the problem of automatically solving large jigsaw puzzles. The latter problem assumes a large image, which is cut into equal square pieces that are arbitrarily rotated and shuffled …

    umn Repository record for Mathematical Formulations, Algorithms and Theory for Big Data Problems (opens in a new tab)

  15. Variable Selection for High-Dimensional Longitudinal Omics Data with a Continuous or Misclassified Binary Outcome

    … in this dissertation: first-differencing and graph-Laplacian penalization using empirical absolute correlation. First-differencing longitudinal data, particularly when both the outcome and predictors are longitudinal with the same time points, reduces unwanted correlation and simplifies the …

    cornell Repository record for Variable Selection for High-Dimensional Longitudinal Omics Data with a Continuous or Misclassified Binary Outcome (opens in a new tab)

  16. Lattice Theory in Multi-Agent Systems

    … theory with a Laplace operator, analogous to the graph Laplacian and the graph connection Laplacian, acting on assignments of data to the nodes of a Tarski sheaf. The Hodge-Tarski theorem (the main theorem) relates the fixed point theory of this operator, called the Tarski Laplacian, in deference …

    penn Repository record for Lattice Theory in Multi-Agent Systems (opens in a new tab)

  17. The Laplacian Spectra of Random Geometric Graphs

    … characteristics. We focus on the spectrum of the graph Laplacian, which is the discretization of the continuous Laplace operator and naturally arises in diffusion and synchronization problems on networks. As a prototypical simple example of spatial networks, we study the ensemble-averaged spectra …

    houston Repository record for The Laplacian Spectra of Random Geometric Graphs (opens in a new tab)

  18. Consensus algorithms for networks of systems with second- and higher-order dynamics

    … controllers and require that the directed graph associated with the network contains a spanning tree and systems are stabilizable. We show that, in continuous-time, consensus with a guaranteed rate of convergence can always be achieved using linear state feedback. For networks of …

    purdue-thes Repository record for Consensus algorithms for networks of systems with second- and higher-order dynamics (opens in a new tab)

  19. Direct Computations of Spatially Resolved Viscoelastic Moduli of Biomolecular Condensates

    … In this study, we develop a modified graph Laplacian-based collective model to characterize viscoelastic heterogeneity within condensates based on results of lattice-based Metropolis Monte Carlo (MMC) simulations. By integrating random graph models and simulations of A1-LCD, a type of …

    wustl Repository record for Direct Computations of Spatially Resolved Viscoelastic Moduli of Biomolecular Condensates (opens in a new tab)

  20. Methods for network generation and spectral feature selection: especially on gene expression data

    … networks mainly leveraging the spectrum of the graph Laplacian, adjacency, and supra-adjacency matrices. We frame this work in the context of gene co-expression network analysis and proceed with a brief analysis of a small set of gene expression data for human subjects infected with the flu …

    colostate Repository record for Methods for network generation and spectral feature selection: especially on gene expression data (opens in a new tab)

Page 1 of 5