Abstract
The well-known method of spectral clustering for 3D shape datasets is revisited. The graph construction by NNLS (Nonnegative Least Squares) coding technique is at the core of our method. Using graph-based encoding techniques and well-known shape descriptors, a framework is presented here which is applied to 3D shape clustering. Provided a shape database, a graph is first constructed. Weights in the graph are calculated so as to approximate each shape as a sparse linear combination of the remaining dataset objects. This framework is further enhanced by using the multilayer graphs process combining NNLS with L2graph. The L2graph is a sparse similarity graph, which conveys complementary information to NNLS coding. A criterion for the complementary action of the two graphs in terms of graph distance is also presented. Experimental results conducted on SHREC10, SHREC11 and SCHREC15 datasets validate the excellent performance of our clustering framework.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.