Results 71 to 80 of about 13,640 (282)
Advanced Intelligent Systems, EarlyView.Four decades of retinal vessel segmentation research (1982–2025) are synthesized, spanning classical image processing, machine learning, and deep learning paradigms. A meta‐analysis of 428 studies establishes a unified taxonomy and highlights performance trends, generalization capabilities, and clinical relevance.
Avinash Bansal +6 more
wiley +1 more source
Generalized Laplacian Regularized Framelet Graph Neural Networks
, 2023 This paper introduces a novel Framelet Graph approach based on p-Laplacian GNN. The proposed two models, named p-Laplacian undecimated framelet graph convolution (pL-UFG) and generalized p-Laplacian undecimated framelet graph convolution (pL-fUFG ...
Shao, Zhiqi +4 more
core
Certain Energies of Graphs for Dutch Windmill and Double-Wheel Graphs
Journal of Mathematics, 2022 Energy of a graph is defined as the sum of the absolute values of the eigenvalues of the adjacency matrix associated with the graph. In this research work, we find color energy, distance energy, Laplacian energy, and Seidel energy for the Dutch windmill ...
Jing Wu +4 more
doaj +1 more source
The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs
Theory and Applications of Graphs, 2023 The α-Hermitian adjacency matrix Hα of a mixed graph X has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number α.
Omar Alomari +2 more
doaj +1 more source
Haar-Laplacian for Directed Graphs
IEEE Transactions on Signal and Information Processing over NetworksThis paper introduces a novel Laplacian matrix aiming to enable the construction of spectral convolutional networks and to extend the signal processing applications for directed graphs. Our proposal is inspired by a Haar-like transformation and produces a Hermitian matrix which is not only in one-to-one relation with the adjacency matrix, preserving ...
Theodor-Adrian Badea, Bogdan Dumitrescu
openaire +2 more sources
Extremal Graph Realizations and Graph Laplacian Eigenvalues
SIAM Journal on Discrete Mathematics, 2023 For a regular polyhedron (or polygon) centered at the origin, the coordinates of the vertices are eigenvectors of the graph Laplacian for the skeleton of that polyhedron (or polygon) associated with the first (non-trivial) eigenvalue. In this paper, we generalize this relationship.
openaire +2 more sources
Advanced Intelligent Systems, EarlyView.This paper presents a high‐speed object pose estimation method that deconstructs objects into geometric components. Inspired by human cognitive generalization, it detects these primitives and infers the 6D pose from their stable spatial configuration.
Xuyang Li +6 more
wiley +1 more source
On Path Laplacian Eigenvalues and Path Laplacian Energy of Graphs
Journal of New Theory, 2018 We introduce the concept of Path Laplacian Matrix for a graph and explore the eigenvalues of this matrix. The eigenvalues of this matrix are called the path Laplacian eigenvalues of the graph.
Shridhar Chandrakant Patekar +1 more
doaj
What is a proper graph Laplacian? An operator-theoretic framework for graph diffusion
Special MatricesWe introduce an operator-theoretic definition of a proper graph Laplacian as any matrix associated with a given graph that can be expressed as the composition of a divergence and a gradient operator, with the gradient acting between graph-related spaces ...
Estrada Ernesto
doaj +1 more source
The First Zagreb Index, the Laplacian Spectral Radius, and Some Hamiltonian Properties of Graphs
MathematicsThe first Zagreb index of a graph G is defined as the sum of the squares of the degrees of all the vertices in G. The Laplacian spectral radius of a graph G is defined as the largest eigenvalue of the Laplacian matrix of the graph G.
Rao Li
doaj +1 more source