Shape analysis algorithm based on information theory

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.

• Type: Conference
• Year: 2003
• Where: ICIP
• Authors: Andreas Koschan, Besma Roui-Abidi, David L. Page, Mongi A. Abidi, Sreenivas R. Sukumar
• Keywords: Discrete Curves, ICIP 2003, Image Processing, Shape Complexity, Shape Curvature, Shape Information