Shape representation to apply a transform in order to represent an object in terms of the transform... result of the Medial Axis Transform: object points having at least two closest b
Trang 1Skeletonization and its
applications
Dept Image Processing & Computer Graphics
University of Szeged, Hungary
Trang 4Different shapes
Trang 5Different shapes
Trang 7It is formed by any connected set of points
examples of planar shapes
(L.F Costa, R Marcondes, 2001)
Trang 8The generic model of a
system
(G.W Awcock, R Thomas, 1996)
Trang 9Feature extraction –
(G.W Awcock, R Thomas, 1996)
Trang 11Shape representation
to apply a transform in order to represent
an object in terms of the transform
Trang 17 result of the Medial Axis Transform: object
points having at least two closest boundarypoints;
praire-fire analogy: the boundary is set on fireand skeleton is formed by the loci where thefire fronts meet and quench each other;
the locus of the centers of all the maximal
inscribed hyper-spheres
Trang 18Nearest boundary points
Trang 19Object = union of the inscribed
hyper-spheres
object boundary maximal inscribed disks centers
Trang 20The skeleton in 3D generally contains surface patches (2D segments).
Trang 21Skeleton → Original object
Trang 22Skeleton → Original object
Trang 23Skeleton → Original object
Trang 24Skeleton → Original object
Trang 25Skeleton → Original object
Trang 26Skeleton → Original object
Trang 27Skeleton → Original object
Trang 28Skeleton → Original object
Trang 29Skeleton → Original object
Trang 30Skeleton → Original object
Trang 31The same skeleton may belong to different elongated objects.
Trang 32Inner and outer skeleton
(inner) skeleton
outer skeleton (skeleton of the negative image)
Trang 33Stability
Trang 34Representing the topological
structure
Trang 35 represents
• the general form of an object,
• the topological structure of an object, and
• local object symmetries
invariant to
• translation,
• rotation, and
• (uniform) scale change
simplified and thin
Trang 37Skeletonization …
Trang 38Skeletonization …
… means skeleton extraction from elongated binary objects.
Trang 40of medial surfaces
Trang 41of medial surfaces
Trang 42of medial lines
Trang 43of medial lines
Trang 44Skeletal points in 2D – points in 3D centerlines
Trang 45Example of topological kernel
original image topological kernel
Trang 46Example of topological kernel
simply connected →
an isolated point multiply connected → closed curve
Trang 47Example of topological kernel
Trang 48Skeletonization techniques
distance transform
Voronoi diagram
thinning
Trang 49Skeletonization techniques
distance transform
Voronoi diagram
thinning
Trang 50Distance map B: non-binary array containing
the distance to the closest feature element
Trang 51Distance map
Trang 52Distance transform
input (binary) output (non-binary)
Trang 53Distance transform using city-block (or 4) distance
Trang 54Distance transform using chess-board (or 8) distance
Trang 56Linear-time distance mapping
forward scan backward scan
Trang 57Linear-time distance mapping
forward scan backward scan
best choice: d1=3, d2=4
Trang 58Distance-based skeletonization
1. Border points (as feature
elements) are extracted from theoriginal binary image
2 Distance transform is executed
(i.e., distance map is generated)
3 The ridges (local extremas) are
detected as skeletal points
Trang 59detecting border points
Trang 60distance mapping
Trang 61detecting ridges (local extremas)
Trang 62detecting ridges (local extremas)
Trang 63M.C Escher: Reptiles
Trang 64Skeletonization techniques
distance transform
Voronoi diagram
thinning
Trang 65Voronoi diagram
Input:
Set of points (generating poins)
Output:
the partition of the space into cells
so that each cell contains exactly
one generating point and the locus
of all points which are closer to this
generating point than to others
Trang 66, 1 (
) ,
( )
r
Trang 67Voronoi diagram in 3D
Voronoi diagram of 20 generating points
Trang 68Voronoi diagram in 3D
a cell (convex polyhedron) of that Voronoi diagram
Trang 69Incremental construction
O(n)
Trang 70Divide and conquer
O(n·logn)
left
diagram
right diagram
merging
Trang 71Voronoi diagram - skeleton
set of generating points = sampled boundary
Trang 72Voronoi diagram - skeleton
If the density of boundary points goes to infinity, then the corresponding Voronoi diagram converges to the skeleton.
Trang 73Voronoi skeleton
original 3D object Voronoi skeleton
M Styner (UNC, Chapel Hill)
Trang 74Skeletonization techniques
distance transform
Voronoi diagram
thinning
Trang 75„Thinning”
Trang 76modeling fire-front propagation
Trang 77Iterative object reduction
Trang 78Thinning algorithms
repeat
remove „deletable” border points
from the actual binary image
until no points are deleted
oneiterationstep
degrees of freedom:
– which points are regarded as „deletable” ?
– how to organize one iteration step?
Trang 79One iteration step
Trang 81Topology in 3D
”A topologist is a man who does not know the difference between a coffee cup and a doughnut.”
Trang 82Topology preservation in 3D
created merged destroyed
Trang 83Shape preservation
Trang 84Shape preservation
Trang 85Example of 2D thining
Trang 86Example of 3D thinning
original object centerline
Trang 87I prefer thinning since it …
allows direct centerline extraction in
Trang 88An 8-subiteration parallel 2D
repeat
for i = S, SE, E, SW, N, NW, W, NE do
simultaneous deletion of all points that
match the i-th thinning mask
SE S
NW
Trang 89An 8-subiteration parallel 2D
i=1 (deletion from direction S):
0 0
0
· 1
·
x 1
x
0 0
·
0 1
1
· 1
·
(„x”: at least one of them is 1, „·”: don’t cara)
i=2 (deletion from direction SE):
Trang 90An 8-subiteration parallel 2D
original object after one iteration final
Trang 92yes no
thinning
yes yes
Voronoi-based
no yes
distance-based
topological geometrical
method
Trang 94 „exotic” character recognition
recognition of handwritten text
Trang 95Exotic character recognition
K Ueda
characters of a Japanese signature
Trang 97Fingerprint verification
A Ross
features in fingerprints core
ridge ending ridge bifurcation
Trang 98A Ross
theprocess
Trang 99Palmprint verification
N Duta
matching extracted features
Trang 100Raster-to-vector conversion
scanned map
Katona E.
Trang 101„raw” vector image after skeletonization
Katona E.
Trang 102corrected vector image
Katona E.
Trang 103Applications in 3D
There are some frequently used 3D medical scanners (e.g., CT, MR,
SPECT, PET), therefore,
applications in medical image
processing are mentioned.
Trang 104There are a lots of tubularstructures (e.g., blood
vessels, airways) in thehuman body, therefore, centerline extraction is
fairly important
Trang 106E Sorantin et al.
(infra-renal aortic aneurysms)
Trang 107E Sorantin et al.
Airway
(trachealstenosis)
Trang 108E Sorantin et al.
Trang 109Virtual colonoscopy
A Villanova et al.
Trang 111Multi-detector Row Spiral CT
512 x 512 voxels
500 – 600 slices 0.65 x 0.65 x 0.6 mm 3
(almost isotropic)
Trang 112Lung segmentation
Trang 113Centerlines
Trang 114branch-points
Trang 115partitioning
Trang 116centerline labeling label propagation
Trang 117formal tree (in XML) labeled tree
Trang 118Quantitative indices for tree branches
• length (Euclidean distance between the
parent and the child branch points)
• volume (volume of all voxels belonging to the
branch)
• surface area (surface area of all boundary
voxels belonging to the branch)
• average diameter (assuming cylindric
segments)
Trang 119The entire process
segmented
tree
pruned centerlines
labeled
Trang 120Matching
Trang 121FRC TLC
Trang 122Anatomical labeling
Trang 123Bye