Image Processing Reference
In-Depth Information
(4.7a) The subspace C, some sam-
ples from elephant category.
(4.7b) original query image,A
(4.7c) lower approximation in
terms of the universe X
the set
C
contains 100 elephant images
FIGURE 4.7: Obtaining lower approximation of a query image in terms of the universe
three color components as features
(4.8a) Subspace C, some sea shore samples (set X
contains 100 sea shore images)
(4.8b) (See color insert) Sample
seashore query image
(4.8c) (See color insert) Sample
lower approximation in terms of
the universe
(4.8d) lower approximation
in terms of the universe
X,including the query image
X, excluding the
query image
FIGURE 4.8: (Please see color insert for Figures 4.8b and c) Obtaining lower approximation
of a query image in terms of the universe and three color components as features
Then we define a partition topology on X, where the basis of the topology is the set of
Search WWH ::
Custom Search