activity
20172023
most citedSpikformer: When Spiking Neural Network Meets Transformer

105 citations · 126 across the 22 of their papers we have counts for

collaborators
Showing 2019Show all

7 papers · 1 filter

cs.DS2019

Online Hashing with Efficient Updating of Binary Codes

Zhenyu Weng, Yuesheng Zhu

Online hashing methods are efficient in learning the hash functions from the streaming data. However, when the hash functions change, the binary codes for the database have to be r…

cs.CV2019

Efficient Querying from Weighted Binary Codes

Zhenyu Weng, Yuesheng Zhu

Binary codes are widely used to represent the data due to their small storage and efficient computation. However, there exists an ambiguity problem that lots of binary codes share…

cs.LG2019★ 2 cited

Sparse-Dense Subspace Clustering

Shuai Yang, Wenqi Zhu, Yuesheng Zhu

Subspace clustering refers to the problem of clustering high-dimensional data into a union of low-dimensional subspaces. Current subspace clustering approaches are usually based on…

cs.LG2019★ 3 cited

Residual Encoder-Decoder Network for Deep Subspace Clustering

Shuai Yang, Wenqi Zhu, Yuesheng Zhu

Subspace clustering aims to cluster unlabeled data that lies in a union of low-dimensional linear subspaces. Deep subspace clustering approaches based on auto-encoders have become…

cs.LG2019

Three-Stage Subspace Clustering Framework with Graph-Based Transformation and Optimization

Shuai Yang, Wenqi Zhu, Yuesheng Zhu

Subspace clustering (SC) refers to the problem of clustering high-dimensional data into a union of low-dimensional subspaces. Based on spectral clustering, state-of-the-art approac…

cs.LG2019★ 5 cited

Restricted Connection Orthogonal Matching Pursuit For Sparse Subspace Clustering

Wenqi Zhu, Yuesheng Zhu, Li Zhong +1

Sparse Subspace Clustering (SSC) is one of the most popular methods for clustering data points into their underlying subspaces. However, SSC may suffer from heavy computational bur…

cs.LG2019★ 2 cited

A Novel Efficient Approach with Data-Adaptive Capability for OMP-based Sparse Subspace Clustering

Jiaqiyu Zhan, Zhiqiang Bai, Yuesheng Zhu

Orthogonal Matching Pursuit (OMP) plays an important role in data science and its applications such as sparse subspace clustering and image processing. However, the existing OMP-ba…