Hypergraph clustering using a new Laplacian tensor with applications in image processing

DOI10.1137/19M1291601MaRDI QIDQ5143288zbMATH OpenOpenAlexFDO

Authors Jingya Chang, Yannan Chen, Liqun Qi, Hong Yan

Publication date 11 January 2021

Published in SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/19m1291601

zbMATH Keywords

optimizationStiefel manifoldimage processingtensor eigenvalueLaplacian tensorhypergraph clusteringhypergraph partitioning

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Programming involving graphs or networks (90C35) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Hypergraphs (05C65)

Recommendations

• The abstract Laplacian tensor of a hypergraph with applications in clustering
• The Fiedler vector of a Laplacian tensor for hypergraph partitioning
• A reductive approach to hypergraph clustering: an application to image segmentation
• The Laplacian tensor of a multi-hypergraph
• Hyper-Laplacian regularized multi-view subspace clustering with low-rank tensor constraint

Cites work

• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• A Graph Framework for Manifold-Valued Data
• A feasible method for optimization with orthogonality constraints
• A framework of constraint preserving update schemes for optimization on Stiefel manifold
• Computing eigenvalues of large scale sparse tensors arising from a hypergraph
• Contour and texture analysis for image segmentation
• Data mining. Concepts and techniques
• Eigenvalues of a real supersymmetric tensor
• On clusterings: good, bad and spectral
• On the p-Laplacian and -Laplacian on graphs with applications in image and data processing
• Perron-Frobenius theorem for nonnegative tensors
• Reducibility among combinatorial problems
• Stochastic simulation of patterns using distance-based pattern modeling
• Tensor analysis. Spectral theory and special tensors
• The Fiedler vector of a Laplacian tensor for hypergraph partitioning
• The Z-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
• Uniform hypergraph partitioning: provable tensor methods and sampling techniques
• \(k\)-plane clustering

Cited in

(16)

• A tensor optimization algorithm for computing Lagrangians of hypergraphs
• A reductive approach to hypergraph clustering: an application to image segmentation
• Phase transition detection in the community detection for hypergraph network via tensor method
• A family of gradient methods using Householder transformation with application to hypergraph partitioning
• The Fiedler vector of a Laplacian tensor for hypergraph partitioning
• A hyper-distance-based method for hypernetwork comparison
• Bilateral tensor low-rank representation for insufficient observed samples in multidimensional image clustering and recovery
• Generalizing p-Laplacian: spectral hypergraph theory and a partitioning algorithm
• Multilinear hyperquiver representations
• Even order uniform hypergraph via the Einstein product
• Tensor factorization-based method for tensor completion with spatio-temporal characterization
• The abstract Laplacian tensor of a hypergraph with applications in clustering
• Uniform hypergraph partitioning: provable tensor methods and sampling techniques
• Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs
• A simple approximation algorithm for k-correlation clustering on uniform hypergraphs
• Approximation algorithms on k-correlation clustering of uniform hypergraphs

This page was built for publication: Hypergraph clustering using a new Laplacian tensor with applications in image processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5143288)