Abstract
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We base our algorithm on shape curvature, and thus we compute shape information as the entropy of curvature. We present definitions to estimate curvature for both discrete curves and surfaces and then formulate our theory of shape information from these definitions. We demonstrate our algorithm with experimental results.
Original language | English |
---|---|
Pages | 229-232 |
Number of pages | 4 |
State | Published - 2003 |
Event | Proceedings: 2003 International Conference on Image Processing, ICIP-2003 - Barcelona, Spain Duration: Sep 14 2003 → Sep 17 2003 |
Conference
Conference | Proceedings: 2003 International Conference on Image Processing, ICIP-2003 |
---|---|
Country/Territory | Spain |
City | Barcelona |
Period | 09/14/03 → 09/17/03 |