Share Email Print

Optical Engineering

Reeb graph computation through spectral clustering
Author(s): Teng Ma; Zhuangzhi Wu; Pei Luo; Lu Feng
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The Reeb graph provides a structure that encodes the topology of a shape, and it has been gaining in popularity in shape analysis and understanding. We introduce a spectral clustering method to compute the Reeb graph. Given a 3-D model embedded in the Euclidean space, we define the Morse function according to the connected components of the 3-D model in a spectral space. The spectral clustering formulation gives rise to a consistent Reeb graph over pose changes of the same object with meaningful subparts and yields a hierarchical computation of the Reeb graph. We prove that this method is theoretically reasonable, and experimental results show its efficiency.

Paper Details

Date Published: 8 February 2012
PDF: 10 pages
Opt. Eng. 51(1) 017209 doi: 10.1117/1.OE.51.1.017209
Published in: Optical Engineering Volume 51, Issue 1
Show Author Affiliations
Teng Ma, BeiHang Univ. (China)
Zhuangzhi Wu, BeiHang Univ. (China)
Pei Luo, BeiHang Univ. (China)
Lu Feng, BeiHang Univ. (China)

© SPIE. Terms of Use
Back to Top