Results 11 to 20 of about 24,126 (306)
Graph Regularization Methods in Soft Detector Fusion [PDF]
IEEE Access, 2023 This paper presents a theoretical derivation of two new graph-based regularization methods for fusing the individual results of multiple detectors (two-class classifiers).
Addisson Salazar +3 more
doaj +2 more sources
On the Multiplicative Regularization of Graph Laplacians on Closed and Open Structures With Applications to Spectral Partitioning [PDF]
IEEE Access, 2014 A new regularization technique for graph Laplacians arising from triangular meshes of closed and open structures is presented. The new technique is based on the analysis of graph Laplacian spectrally equivalent operators in terms of Sobolev norms and on ...
Rajendra Mitharwal +1 more
doaj +2 more sources
Journal of Electrical and Computer Engineering, 2019 This paper presents a novel Markov random field (MRF) and adaptive regularization embedded level set model for robust image segmentation and uses graph cuts optimization to numerically solve it.
Dengwei Wang
doaj +2 more sources
Remote Sensing, 2020 We investigated nearest-neighbor density-based clustering for hyperspectral image analysis. Four existing techniques were considered that rely on a K-nearest neighbor (KNN) graph to estimate local density and to propagate labels through algorithm ...
Claude Cariou +2 more
doaj +1 more source
Rethinking Graph Regularization for Graph Neural Networks
, 2021 The graph Laplacian regularization term is usually used in semi-supervised representation learning to provide graph structure information for a model f(X).
Yang, Han, Cheng, James, Ma, Kaili
core +1 more source
Degrees in Link Graphs of Regular Graphs
The Electronic Journal of Combinatorics, 2022 We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of $G$ has minimum degree at most $\lfloor{2d/3}\rfloor-1$, and if $G$ is sufficiently large in terms of $d$ then some ...
Benjamini, I, Haslegrave, J
openaire +3 more sources
The Electronic Journal of Combinatorics, 2015 An undirected simple graph $G=(V,E)$ is called antimagic if there exists an injective function $f:E\rightarrow\{1,\dots,|E|\}$ such that $\sum_{e\in E(u)} f(e)\neq\sum_{e\in E(v)} f(e)$ for any pair of different nodes $u,v\in V$. In this note we prove — with a slight modification of an argument of Cranston et al. — that $k$-regular graphs are antimagic
Kristóf Bérczi +2 more
openaire +3 more sources
Regular packings of regular graphs
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amauri Gutiérrez, Anna S. Lladó
openaire +2 more sources
Holomorphic subgraph reduction of higher-point modular graph forms
Journal of High Energy Physics, 2019 Modular graph forms are a class of modular covariant functions which appear in the genus-one contribution to the low-energy expansion of closed string scattering amplitudes.
Jan E. Gerken, Justin Kaidi
doaj +1 more source
Artist Similarity for Everyone: A Graph Neural Network Approach
Transactions of the International Society for Music Information Retrieval, 2022 Artist similarity plays an important role in organizing, understanding, and subsequently, facilitating discovery in large collections of music. In this paper, we present a hybrid approach to computing similarity between artists using graph neural ...
Filip Korzeniowski +2 more
doaj +1 more source