Results 161 to 170 of about 2,218,762 (336)

Maximizing the smallest eigenvalue of grounded Laplacian matrix

open access: yesJournal of Global Optimization
For a connected graph $\mathcal{G}=(V,E)$ with $n$ nodes, $m$ edges, and Laplacian matrix $\boldsymbol{\mathit{L}}$, a grounded Laplacian matrix $\boldsymbol{\mathit{L}}(S)$ of $\mathcal{G}$ is a $(n-k) \times (n-k)$ principal submatrix of $\boldsymbol{\mathit{L}}$, obtained from $\boldsymbol{\mathit{L}}$ by deleting $k$ rows and columns corresponding ...
Xiaotian Zhou   +3 more
openaire   +2 more sources

An object detection algorithm based on deep learning and salient feature fusion for roadside surveillance camera

open access: yesCAAI Transactions on Intelligence Technology, EarlyView.
Abstract In intelligent transportation systems, object detection for a surveillance video is one of the important functions. The performance of existing surveillance video object detection algorithms is affected by the conflict between the features of the objects, which leads to a decline in precision.
Yang He   +5 more
wiley   +1 more source

Learning Laplacian Matrix in Smooth Graph Signal Representations

open access: yesIEEE Transactions on Signal Processing, 2014
Xiaowen Dong   +3 more
semanticscholar   +1 more source

Graph Neural Networks Empowered Origin‐Destination Learning for Urban Traffic Prediction

open access: yesCAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Urban traffic prediction with high precision is always the unremitting pursuit of intelligent transportation systems and is instrumental in bringing smart cities into reality. The fundamental challenges for traffic prediction lie in the accurate modelling of spatial and temporal traffic dynamics.
Chuanting Zhang   +3 more
wiley   +1 more source

Distance matrix and Laplacian of a tree with attached graphs

open access: yesLinear Algebra and its Applications, 2005
AbstractA tree with attached graphs is a tree, together with graphs defined on its partite sets. We introduce the notion of incidence matrix, Laplacian and distance matrix for a tree with attached graphs. Formulas are obtained for the minors of the incidence matrix and the Laplacian, and for the inverse and the determinant of the distance matrix.
openaire   +2 more sources

Exploring High Dimensional Feature Space With Channel‐Spatial Nonlinear Transforms for Learned Image Compression

open access: yesCAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Nonlinear transforms have significantly advanced learned image compression (LIC), particularly using residual blocks. This transform enhances the nonlinear expression ability and obtain compact feature representation by enlarging the receptive field, which indicates how the convolution process extracts features in a high dimensional feature ...
Wen Tan   +4 more
wiley   +1 more source

On the neighbourhood degree sum-based Laplacian energy of graphs

open access: yesKuwait Journal of Science
A useful extension of the Laplacian matrix is proposed here and the corresponding modification of the Laplacian energy (LE) is presented. The neighbourhood degree sum-based Laplacian energy (LNE) is produced by means of the eigenvalues of the newly ...
doaj   +1 more source

Home - About - Disclaimer - Privacy