1. Trang chủ
  2. » Giáo án - Bài giảng

skeletonization and its application

123 262 0
Tài liệu đã được kiểm tra trùng lặp

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

THÔNG TIN TÀI LIỆU

Thông tin cơ bản

Tiêu đề Skeletonization and its Applications
Tác giả Kálmán Palágyi
Trường học University of Szeged
Chuyên ngành Image Processing & Computer Graphics
Thể loại Đề cương môn học
Thành phố Szeged
Định dạng
Số trang 123
Dung lượng 4,37 MB

Các công cụ chuyển đổi và chỉnh sửa cho tài liệu này

Nội dung

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 1

Skeletonization and its

applications

Dept Image Processing & Computer Graphics

University of Szeged, Hungary

Trang 4

Different shapes

Trang 5

Different shapes

Trang 7

It is formed by any connected set of points

examples of planar shapes

(L.F Costa, R Marcondes, 2001)

Trang 8

The generic model of a

system

(G.W Awcock, R Thomas, 1996)

Trang 9

Feature extraction –

(G.W Awcock, R Thomas, 1996)

Trang 11

Shape 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 18

Nearest boundary points

Trang 19

Object = union of the inscribed

hyper-spheres

object boundary maximal inscribed disks centers

Trang 20

The skeleton in 3D generally contains surface patches (2D segments).

Trang 21

Skeleton Original object

Trang 22

Skeleton Original object

Trang 23

Skeleton Original object

Trang 24

Skeleton Original object

Trang 25

Skeleton Original object

Trang 26

Skeleton Original object

Trang 27

Skeleton Original object

Trang 28

Skeleton Original object

Trang 29

Skeleton Original object

Trang 30

Skeleton Original object

Trang 31

The same skeleton may belong to different elongated objects.

Trang 32

Inner and outer skeleton

(inner) skeleton

outer skeleton (skeleton of the negative image)

Trang 33

Stability

Trang 34

Representing 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 37

Skeletonization …

Trang 38

Skeletonization …

… means skeleton extraction from elongated binary objects.

Trang 40

of medial surfaces

Trang 41

of medial surfaces

Trang 42

of medial lines

Trang 43

of medial lines

Trang 44

Skeletal points in 2D – points in 3D centerlines

Trang 45

Example of topological kernel

original image topological kernel

Trang 46

Example of topological kernel

simply connected →

an isolated point multiply connected → closed curve

Trang 47

Example of topological kernel

Trang 48

Skeletonization techniques

„ distance transform

„ Voronoi diagram

„ thinning

Trang 49

Skeletonization techniques

„ distance transform

„ Voronoi diagram

„ thinning

Trang 50

Distance map B: non-binary array containing

the distance to the closest feature element

Trang 51

Distance map

Trang 52

Distance transform

input (binary) output (non-binary)

Trang 53

Distance transform using city-block (or 4) distance

Trang 54

Distance transform using chess-board (or 8) distance

Trang 56

Linear-time distance mapping

forward scan backward scan

Trang 57

Linear-time distance mapping

forward scan backward scan

best choice: d1=3, d2=4

Trang 58

Distance-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 59

detecting border points

Trang 60

distance mapping

Trang 61

detecting ridges (local extremas)

Trang 62

detecting ridges (local extremas)

Trang 63

M.C Escher: Reptiles

Trang 64

Skeletonization techniques

„ distance transform

„ Voronoi diagram

„ thinning

Trang 65

Voronoi 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 67

Voronoi diagram in 3D

Voronoi diagram of 20 generating points

Trang 68

Voronoi diagram in 3D

a cell (convex polyhedron) of that Voronoi diagram

Trang 69

Incremental construction

O(n)

Trang 70

Divide and conquer

O(n·logn)

left

diagram

right diagram

merging

Trang 71

Voronoi diagram - skeleton

set of generating points = sampled boundary

Trang 72

Voronoi diagram - skeleton

If the density of boundary points goes to infinity, then the corresponding Voronoi diagram converges to the skeleton.

Trang 73

Voronoi skeleton

original 3D object Voronoi skeleton

M Styner (UNC, Chapel Hill)

Trang 74

Skeletonization techniques

„ distance transform

„ Voronoi diagram

„ thinning

Trang 75

„Thinning”

Trang 76

modeling fire-front propagation

Trang 77

Iterative object reduction

Trang 78

Thinning 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 79

One iteration step

Trang 81

Topology in 3D

”A topologist is a man who does not know the difference between a coffee cup and a doughnut.”

Trang 82

Topology preservation in 3D

created merged destroyed

Trang 83

Shape preservation

Trang 84

Shape preservation

Trang 85

Example of 2D thining

Trang 86

Example of 3D thinning

original object centerline

Trang 87

I prefer thinning since it …

„ allows direct centerline extraction in

Trang 88

An 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 89

An 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 90

An 8-subiteration parallel 2D

original object after one iteration final

Trang 92

yes no

thinning

yes yes

Voronoi-based

no yes

distance-based

topological geometrical

method

Trang 94

„ „exotic” character recognition

„ recognition of handwritten text

Trang 95

Exotic character recognition

K Ueda

characters of a Japanese signature

Trang 97

Fingerprint verification

A Ross

features in fingerprints core

ridge ending ridge bifurcation

Trang 98

A Ross

theprocess

Trang 99

Palmprint verification

N Duta

matching extracted features

Trang 100

Raster-to-vector conversion

scanned map

Katona E.

Trang 101

„raw” vector image after skeletonization

Katona E.

Trang 102

corrected vector image

Katona E.

Trang 103

Applications 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 104

There are a lots of tubularstructures (e.g., blood

vessels, airways) in thehuman body, therefore, centerline extraction is

fairly important

Trang 106

E Sorantin et al.

(infra-renal aortic aneurysms)

Trang 107

E Sorantin et al.

Airway

(trachealstenosis)

Trang 108

E Sorantin et al.

Trang 109

Virtual colonoscopy

A Villanova et al.

Trang 111

Multi-detector Row Spiral CT

512 x 512 voxels

500 – 600 slices 0.65 x 0.65 x 0.6 mm 3

(almost isotropic)

Trang 112

Lung segmentation

Trang 113

Centerlines

Trang 114

branch-points

Trang 115

partitioning

Trang 116

centerline labeling label propagation

Trang 117

formal tree (in XML) labeled tree

Trang 118

Quantitative 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 119

The entire process

segmented

tree

pruned centerlines

labeled

Trang 120

Matching

Trang 121

FRC TLC

Trang 122

Anatomical labeling

Trang 123

Bye

Ngày đăng: 24/04/2014, 13:28

TỪ KHÓA LIÊN QUAN

TÀI LIỆU CÙNG NGƯỜI DÙNG

TÀI LIỆU LIÊN QUAN