Unscene3d: Unsupervised 3d instance segmentation for indoor scenes

D Rozenberszki, O Litany, A Dai - Proceedings of the IEEE …, 2024 - openaccess.thecvf.com
Abstract 3D instance segmentation is fundamental to geometric understanding of the world
around us. Existing methods for instance segmentation of 3D scenes rely on supervision …

Spectral clustering with linear embedding: A discrete clustering method for large-scale data

C Gao, W Chen, F Nie, W Yu, Z Wang - Pattern Recognition, 2024 - Elsevier
In recent decades, spectral clustering has found widespread applications in various real-
world scenarios, showcasing its effectiveness. Traditional spectral clustering typically follows …

A novel hypergraph convolution network for wafer defect patterns identification based on an unbalanced dataset

Y Xie, S Li, CT Wu, Z Lai, M Su - Journal of Intelligent Manufacturing, 2024 - Springer
In semiconductor industry, various wafer defect patterns represent different causes of
manufacturing failures. Identification of specific defect patterns is important to wafer …

Quantum‐inspired hybrid algorithm for image classification and segmentation: Q‐Means++ max‐cut method

SK Roy, B Rudra - International Journal of Imaging Systems …, 2024 - Wiley Online Library
Finding brain tumors is a crucial step in medical diagnosis that can have a big impact on
how patients turn out. Conventional detection techniques can be laborious and demand a lot …

New approach for learning structured graph with Laplacian rank constraint

Y Duan, F Nie, R Wang, X Li - Neurocomputing, 2024 - Elsevier
Many existing graph-clustering methods get results in a two-stage manner, including
constructing a graph from data and partitioning it. It always leads to sub-optimal …

Two Tricks to Improve Unsupervised Segmentation Learning

AE Sari, F Locatello, P Favar - arXiv preprint arXiv:2404.03392, 2024 - arxiv.org
We present two practical improvement techniques for unsupervised segmentation learning.
These techniques address limitations in the resolution and accuracy of predicted …

Ginzburg--Landau Functionals in the Large-Graph Limit

E Zhang, J Scott, Q Du, MA Porter - arXiv preprint arXiv:2408.00422, 2024 - arxiv.org
Ginzburg--Landau (GL) functionals on graphs, which are relaxations of graph-cut functionals
on graphs, have yielded a variety of insights in image segmentation and graph clustering. In …

Differentially Private Gomory-Hu Trees

A Aamand, JY Chen, M Dalirrooyfard, S Mitrović… - arXiv preprint arXiv …, 2024 - arxiv.org
Given an undirected, weighted $ n $-vertex graph $ G=(V, E, w) $, a Gomory-Hu tree $ T $ is
a weighted tree on $ V $ such that for any pair of distinct vertices $ s, t\in V $, the Min-$ s …

Understanding Accelerated Graph Clustering via Local Grouping

C Yang - 2024 7th International Conference on Information and …, 2024 - ieeexplore.ieee.org
Local grouping is a commonly used technique to scale application size in machine learning
domains, such as image segmentation, graph representation learning, and multidimensional …

Algorithms for 2-club cluster deletion problems using automated generation of branching rules

D Tsur - Theoretical Computer Science, 2024 - Elsevier
Abstract In the 2-Club Cluster Vertex Deletion (resp., 2-Club Cluster Edge Deletion) problem
the input is a graph G and an integer k, and the goal is to decide whether there is a set of at …