.png){kind=icon}
.png){kind=icon}
Return
Graph regularized sparse coding for 3D shape clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2015.10.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Feature descriptors have become an increasingly important tool in shape analysis. Features can be extracted and subsequently used to design robust signatures for shape retrieval, correspondence, classification and clustering. In this paper, we present a graph-theoretic framework for 3D shape clustering using the biharmonic distance map and graph regularized sparse coding. While this work focuses primarily on clustering, our approach is fairly general and can be used to tackle other 3D shape analysis problems. In order to seamlessly capture the similarity between feature descriptors, we perform shape clustering on mid-level features that are generated via graph regularized sparse coding. Extensive experiments are carried out on three standard 3D shape benchmarks to demonstrate the much better performance of the proposed clustering approach in comparison with recent state-of-the-art methods. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Clustering
Laplace-Beltrami
Biharmonic distance
Sparse coding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W