You are on page 1of 22

Multiscale skeleton

A graph-based approach for multiscale shape analysis

Voronoi Diagram
Put simply, it's a diagram created by taking pairs of points that are close
together and drawing a line that is equidistant between them and perpendicular
to the line connecting them. That is, all points on the lines in the diagram are
equidistant to the nearest two (or more) source points. - [B]

The shape S is homogeneously covered with dry grass.
Setting fire to the border of S
the locus where the fire fronts meet and quench
its medial (= local symmetry) axis or skeleton[1].
The discrete analogue is let each boundary point pi P initiate a
concentric fire front.
The locus where the fronts meet is then nothing but the Voronoi
diagram (VD) of P [2].

Esqueleto multi-escala
Unfortunately, the MAT according to its original definition tends to
overemphasize boundary details.
Due to this property, the task to determine the correct correspondences
between medial axis components at distinct levels of detail becomes a
very difficult problem[2].
A multiresolution representation of the medial axis can be obtained by
first smoothing the shape and then by computing the MAT for each shape
instance [3].

Esqueleto Multi-escala

Curvatura multi-escala

B-Splines [4]

de Fourier [A]

Fractal Dimension and

Multiscale Fractal Dimension [D]
Fractal Dimension
estimate the complexity of an object
complexity is straight related to the irregularity pattern presented and
the amount of the space shape occupies.
Multiscale Fractal Dimension
Estimating a curve that represents the changes in complexity shape as
we change the visualization scale.
Different of Fractal Dimension, which is a numeric value, this
approach produces a curve which performs a more accurate shape

Contour Salience [E] and EDT [1.1]

A distance transform, also known as distance map or distance field, is a

derived representation of a digital image.

compact-ability and separability

The compact-ability of a descriptor indicates its invariance to the object
variations within a same class, while the separability indicates its
discriminatory ability between objects that belong to distinct classes.
In other words, a descriptor is considered good when it creates compact
clusters far away from each other, for all classes in the corresponding
feature space. This condition should be sufficient for the success of any
suitable classification method.



partitioning an image based on seed pixels
each seed define a influence zone composed of pixels whose
distance to that seed is minimum
propagate the distance values from each seed until the influence
zones of the seeds collide
maps an image into a graph
computes a shortest-path forest
outputs an annotated image
represents the associated forest.

How to [C]:
think the image as a graph,
pixels are the nodes of the graph
arcs are defined by an adjacency relation between pixels.
A path in the graph is a sequence of adjacent pixels.
The distance as the length of the shortest-path.

How to [C]:
Such a distance is found by minimizing a suitable path-function, pf.
The choice of the adjacency relation and the path-function depends on
the nature of the problem.
For example, two pixels p and q are said adjacent if d(p, q) R; (1)
where d(p, q) is the Euclidean distance between p and q and R is a
positive number

How to [C]:


A graph-based approach for multiscale

shape analysis

A graph-based approach for multiscale

shape analysis

A graph-based approach for multiscale

shape analysis

A graph-based approach for multiscale

shape analysis

1. H. Blum, A transformation for extracting new descriptors of shape, in
Models for the Perception of Speech and Visual Form (W. Wathen-Dunn,
ed.), Cambridge MA: MIT Press, 1967
2. R. L. Ogniewicz, Skeleton-Space: a Multiscale Shape Description
Combining Region and Boundary Information, in Proc. CVPR94,
Seattle, WA, June 1994, pp. 746751
3. A. R. Dill, M. D. Levine, and P. B. Noble, Multiple resolution
skeletons, IEEE Transactions on Pattern Recognition and Machine
Intelligence, vol. 9, no. 4, pp. 495504, 1987
4. Roberto Marcondes Cesar Junior, Luciano Da Fontoura Costa, Towards
effective planar shape representation with multiscale digital curvature
analysis based on signal processing techniques, Pattern Recognition,
Volume 29, Issue 9, September 1996, Pages 1559-1569

A. Yerin Yoo, Tutorial on Fourier Theory, 2001
B. Voronoi Diagram, wikipedia - https://en.wikipedia.
org/wiki/Voronoi_diagram - acessado em 16 de junho de 2015 s 15:20
C. A.X. Falco , L. da Fontoura Costa, B.S. da Cunha, Multiscale skeletons
by image foresting transform and its application to neuromorphometry,
Pattern Recognition 35 (2002) 15711582
D. Andr Ricardo Backes, Odemir Martinez Bruno, Fractal and Multi-Scale
Fractal Dimension analysis: a comparative study of Bouligand-Minkowski
method, INFOCOMP, v. 7, p. 74-83, 2008

1. R. da S. Torres, A.X. Falco, L. da F. Costa, A graph-based approach for
multiscale shape analysis, Pattern Recognition 37 (2004) 1163 1174