Reeb graph computation through spectral clustering

Ma, Teng; Wu, Zhuangzhi; Luo, Pei; Feng, Lu

doi:doi:10.1117/1.OE.51.1.017209

GENERAL INFORMATION

You are not logged in Logged Out Log In

Optical Engineering / Volume 51 / Issue 1 / Machine Vision, Pattern Recognition

Previous Article | Next Article

Reeb graph computation through spectral clustering

Opt. Eng. 51, 017209 (Feb 08, 2012); http://dx.doi.org/10.1117/1.OE.51.1.017209

Alerts
- Alert Me When Cited
- Alert Me When Corrected
Tools
Share
- Email Abstract
- Connotea
- CiteULike
- del.icio.us
- BibSonomy
- Tweet this Article
- Add to Facebook

Abstract

References (38)

Teng Ma, Zhuangzhi Wu, Pei Luo, and Lu Feng

BeiHang UniversitySchool of Computer Science and Engineering37 Xue Yuan Road, HaiDian DistrictBeijing 100191 China

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.

History

Received Sep 01, 2011
Accepted Nov 28, 2011
Revised Nov 10, 2011
Published online Feb 08, 2012

Digital Object Identifier

http://dx.doi.org/10.1117/1.OE.51.1.017209

Citation

Teng Ma, Zhuangzhi Wu, Pei Luo and Lu Feng, "Reeb graph computation through spectral clustering", Opt. Eng. 51, 017209 (Feb 08, 2012); http://dx.doi.org/10.1117/1.OE.51.1.017209