| Full text | |
| Author(s): |
Backes, Andre R.
;
Bruno, Odemir M.
;
Elmoataz, A
;
Lezoray, O
;
Nouboud, F
;
Mammass, D
;
Meunier, J
Total Authors: 7
|
| Document type: | Journal article |
| Source: | Lecture Notes in Computer Science; v. 6134, p. 3-pg., 2010-01-01. |
| Abstract | |
This paper presents a novel approach to shape characterization, where a shape skeleton is modelled as a dynamic graph, and its complexity is evaluated in a. dynamic evolution context. Descriptors achieved by using this approach show to be efficient in the characterization of different shape patterns with different variations in their structure (such as; occlusion; articulation and missing parts). Experiments using a generic set of shapes are presented as also a comparison with traditional shape analysis methods; such as Fourier descriptors, Curvature, Zernike moments and Bouligand-Minkowski. Although the reduced amount of information present in the shape skeleton; results show that the method is efficient for shape characterization tasks; overcoming the traditional approaches. (AU) | |