Results 31 to 40 of about 121,870 (266)
RECOGNITION OF HUMAN POSE FROM IMAGES BASED ON GRAPH SPECTRA [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2015 Recognition of human pose is an actual problem in computer vision. To increase the reliability of the recognition it is proposed to use structured information in the form of graphs.
A. A. Zakharov +2 more
doaj +1 more source
Generalized Fuzzy Torus and its Modular Properties [PDF]
, 2013 We consider a generalization of the basic fuzzy torus to a fuzzy torus with non-trivial modular parameter, based on a finite matrix algebra. We discuss the modular properties of this fuzzy torus, and compute the matrix Laplacian for a scalar field.
Schreivogl, Paul, Steinacker, Harold
core +5 more sources
Learning Laplacian Matrix in Smooth Graph Signal Representations [PDF]
IEEE Transactions on Signal Processing, 2016 The construction of a meaningful graph plays a crucial role in the success of many graph-based representations and algorithms for handling structured data, especially in the emerging field of graph signal processing. However, a meaningful graph is not always readily available from the data, nor easy to define depending on the application domain.
Dong, X +3 more
openaire +2 more sources
Spectra of Graphs Resulting from Various Graph Operations and Products: a Survey
Special Matrices, 2018 Let G be a graph on n vertices and A(G), L(G), and |L|(G) be the adjacency matrix, Laplacian matrix and signless Laplacian matrix of G, respectively. The paper is essentially a survey of known results about the spectra of the adjacency, Laplacian and ...
Barik S., Kalita D., Pati S., Sahoo G.
doaj +1 more source
NFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks [PDF]
, 2018 The graph Laplacian is a standard tool in data science, machine learning, and image processing. The corresponding matrix inherits the complex structure of the underlying network and is in certain applications densely populated.
Alfke, Dominik +3 more
core +2 more sources
Considering spatiotemporal evolutionary information in dynamic multi‐objective optimisation
CAAI Transactions on Intelligence Technology, EarlyView., 2023 Abstract Preserving population diversity and providing knowledge, which are two core tasks in the dynamic multi‐objective optimisation (DMO), are challenging since the sampling space is time‐ and space‐varying. Therefore, the spatiotemporal property of evolutionary information needs to be considered in the DMO.
Qinqin Fan +3 more
wiley +1 more source
Spectral threshold dominance, Brouwer's conjecture and maximality of Laplacian energy [PDF]
, 2015 The Laplacian energy of a graph is the sum of the distances of the eigenvalues of the Laplacian matrix of the graph to the graph's average degree. The maximum Laplacian energy over all graphs on $n$ nodes and $m$ edges is conjectured to be attained for ...
Helmberg, Christoph, Trevisan, Vilmar
core +3 more sources
An analog of Matrix Tree Theorem for signless Laplacians [PDF]
Linear Algebra and its Applications, 2019 A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We show a similar combinatorial interpretation for principal minors of signless Laplacian $Q$.
Keivan Hassani Monfared, Sudipta Mallik
openaire +3 more sources
Seidel Signless Laplacian Energy of Graphs [PDF]
Mathematics Interdisciplinary Research, 2017 Let S(G) be the Seidel matrix of a graph G of order n and let DS(G)=diag(n-1-2d1, n-1-2d2,..., n-1-2dn) be the diagonal matrix with d_i denoting the degree of a vertex v_i in G.
Harishchandra Ramane +3 more
doaj +1 more source
Forest matrices around the Laplacian matrix
Linear Algebra and its Applications, 2002 19 pages, presented at the Edinburgh (2001) Conference on Algebraic Graph ...
Chebotarev, Pavel, Agaev, Rafig
openaire +3 more sources