Professional Documents
Culture Documents
Thi Giac May Tinh Vo Quang Hoang Khang Xla Baigiang 04
Thi Giac May Tinh Vo Quang Hoang Khang Xla Baigiang 04
.c
ng
co
Chương 4:
an
CÁC CẤU TRÚC DỮ LIỆU ng
th
o
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
Các mức biểu diễn dữ liệu hình ảnh
om
1.
.c
2. Traditional data structures
ng
co
3. Hierarchical data structures
an
th
o ng
du
u
cu
2
CuuDuongThanCong.com https://fb.com/tailieudientucntt
Mô tả được các mức biểu diễn hình ảnh.
om
.c
Giải thích được lý do sử dụng các cấu trúc dữ liệu/mã
ng
để biểu diễn ảnh.
co
Nhận diện được mục đích sử dụng của các cấu
an
th
trúc/mã: ng
Chain
o
du
Run-length
u
cu
Topology
Hierarchical
3
CuuDuongThanCong.com https://fb.com/tailieudientucntt
• Iconic image: mức biểu diễn thấp nhất, ma trận số
om
.c
nguyên chứa giá trị về độ sáng của các pixel.
ng
• Segmented image: các pixel thuộc về một vùng của
co
an
cùng một đối tượng.
th
ng
• Geometric representations: hình dạng 2D, 3D.
o
du
CuuDuongThanCong.com https://fb.com/tailieudientucntt
• Ma trận - Matrices
om
.c
• Mã xích – Chain Codes
ng
• Mã loạt dài - Run Length Codes
co
an
• Đồ thị - Graphs
th
ng
• Relational databases
o
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
• Cấu trúc dữ liệu phổ biến nhất đại diện cho một
om
hình ảnh ở mức thấp (low-level)
.c
ng
100 116 126 129
co
100 116 126 129
an
103 106 113 119
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
• Vùng ảnh (phân đoạn) được biểu diễn bởi đường biên
.c
của vùng.
ng
co
• Chain code: đại diện cho một đường biên bằng chuỗi
an
kết nối các đoạn đường thẳng có độ dài và hướng.
th
ng
• Có thể dùng 4-neighbor hoặc 8-neighbor
o
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
co
an
th
o ng
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
co
an
th
o ng
du
u
cu
om
.c
(hàng, cột bắt đầu, cột kết thúc)
ng
co
an
th
o ng
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
• Mô tả ảnh bởi tập các phần tử và mối quan hệ giữa
om
.c
chúng:
ng
co
• đồ thị vùng liền kề
an
• relational structures
th
o ng
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
co
an
th
o ng
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
0
om
1
.c
ng
co
an
5
th
ng 2
3 4
6
o
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
0 • node: vùng
.c
• arcs: các vùng lân cận
ng
1
co
an
th
ng
5
2 0
o
du
3 4
6
u
cu
1 2
6 3 5 4
CuuDuongThanCong.com https://fb.com/tailieudientucntt
1
om
.c
ng
5
2
co
3 6 4
an
th
ng
Object Name Density (x,y) Inside
o
du
1 Background 8 (1,1)
u
om
.c
– M-pyramids (matrix-pyramids)
ng
co
– T-pyramids (tree-pyramids)
an
th
o ng
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
• A sequence of images {ML, ML-1, …, M0}
om
.c
ng
co
an
th
o ng
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
• ML represents the original image
om
.c
• Mi-1 is derived from Mi by reducing the resolution by a factor of 2
ng
co
an
th
o ng
du
u
cu
om
một lúc
.c
ng
co
an
th
o ng
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
• Cho phép phân tích ảnh ở các độ phân giải khác nhau
om
cùng một lúc
.c
ng
20 x 20 Level 0
co
21 x 21 Level 1
an
22 x 22 Level 2
th
2L-2 x 2L-2
ng Level L-2 (ML-2)
o
du
2L x 2L
Level L
(ML)
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
• T-pyramid biểu diễn đầy đủ CTDL dạng cây theo
.c
phương pháp tiếp cận “bottom-up“.
ng
co
• Quadtrees là một modify của T-pyramid.
an
•
th
Mỗi node của Tree có 4 con. ng
o
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
• Begin with the original 2L x 2L image…
om
.c
ng
Level 0
co
an
th
o ng
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
• Begin with the original 2L x 2L image… and divide it
om
into 4 quadrants each of dimension 2L-1 x 2L-1
.c
ng
Level 0
co
an
0 1
th
0 1 2 3
o ng
du
u
cu
2 3
CuuDuongThanCong.com https://fb.com/tailieudientucntt
• Tiếp tục chia nhỏ các nút nếu chưa thỏa mãn tiêu chí
om
đồng nhất.
.c
ng
Level 0
co
8 9
an
0
th
0 2 3
ng
10 11
o
Level 2
du
8 9 10 11
u
cu
2 3
CuuDuongThanCong.com https://fb.com/tailieudientucntt
• Lặp lại cho đến khi thỏa mãn tiêu chí đồng nhất
om
.c
ng
Level 0
co
36 37
9
an
38 39
0
th
48 49
ng 0 2 3
10
50 51
o
Level 2
du
9 10
u
cu
2 3 Level 3
36 37 38 39 48 49 50 51
CuuDuongThanCong.com https://fb.com/tailieudientucntt
• A binary image
om
.c
ng
Level 0
co
an
th
o ng
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
Level 0
co
an
1
th
1 2
o ng
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
Level 0
co
5
an
1
th
1 2
ng
6 7
o
du
5 6 7 16 17 18 19
16 17
u
cu
2
18 19
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
Level 0
co
20 21
5
an
22 23
1
th
1 2
ng
6 7
o
du
5 6 7 16 17 18 19
16 17
u
cu
2 Level 3
20 21 22 23
18 19
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
và g.
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( ) )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b ) )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b b ) )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b b w ) )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b b w w ) )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b b w w ) b )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b b w w ) b w )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b b w w ) b w g( ) )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b b w w ) b w g( b ) )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b b w w ) b w g( b b ) )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b b w w ) b w g( b b w ) )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b b w w ) b w g( b b w g( ) ) )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b b w w ) b w g( b b w g( b ) ) )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b b w w ) b w g( b b w g( b b ) ) )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b b w w ) b w g( b b w g( b b w ) ) )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
om
.c
ng
1 2
co
an
5 6 7 16 17 18 19
th
o ng
20 21 22 23
du
u
cu
Code: g( g( b b w w ) b w g( b b w g( b b w w ) ) )
CuuDuongThanCong.com https://fb.com/tailieudientucntt
Level of image data representation
om
Data structures together with algorithms are used to devise solutions to
.c
computational tasks.
ng
Data structures for vision may be loosely classified as
co
* Iconic
an
* Segmented
th
* Geometric ng
* Relational
o
*Boundaries between these layers may not be well defined.
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
Traditional image data structures
om
The matrix (2D array) is the most common data structure used for low-
.c
level representations, implemented as an array.
ng
Matrices hold image data explicitly. Spatial characteristics are implicitly
available.
co
Binary images are represented by binary matrices; multispectral images
an
are represented by binary matrices; Hierarchical image structures are
th
represented by matrices of different dimensions;
ng
The co-occurrence matrix is an example of global information derived
o
from an image matrix; it is useful in describing texture.
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
Traditional image data structures cont.
om
Chains may be used to describe pixel paths, especially borders.
.c
Chain codes are useful for recognition based on syntactic approaches.
ng
Run length codes are useful for simple image compression.
co
Graph structures may be used to describe regions and their adjacency.
These may be derived from a region map, a matrix of the same size as
an
the image.
th
Relational structures may be used to describe semantic relationships
ng
between image regions.
o
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
Hierarchical data structures
om
Hierarchical structures can be used to extract large-scale features, which may be
used to initialize analysis. They can provide significant computational efficiency.
.c
M-pyramids and T-pyramids provide data structures to describe multiple image
ng
resolutions.
co
Quadtrees are a variety of T-pyramid in which selected areas of an image are
an
stored at higher resolution than others, permitting selective extraction of detail.
th
Many algorithms for manipulation of quadtrees are available. Quadtrees are
prone to great variation from small image differences.
ng
Leaf codes provide a more efficient form of quadtree.
o
du
window.
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt