際際滷

際際滷Share a Scribd company logo
Majorppt
Majorppt
 he amount of pictorial data has been growing
enormously with the expansion of Web. From the
large number of images, it is very important for users
to retrieve required images via an efficient and
effective mechanism.
 Most of the images are retrieved by text based image
retrieval which is not very efficient. The images are
indexed by tags in TBIR. For retrieving image the text
entered by user matched with image tags.
 E.g. for searching a image one can miss the
important text then the output come is not very
desired and satisfactory for user.
 Support Vector machine(SVM) with Color
Histogram:-using train images where each
image associate with one of the given
categories.
 SVM with Optimal Histogram Bin SIZE(derived
variable):- Optimal bin size is obtained for
color histogram of each image. The optimal
bin size is used for finding similar images
within the category.
The optimized bin size for each image present
in the training database is calculated. The bin
size will be used as a feature
The feature vector consists of two features:-
 The extracted shape/texture features(SIFT).
 Optimal bin size.
 720 images are present in the database for
training.
 Algorithms applied on the images present in
the database.
 Descriptor features like color histogram,
SIFT, Bag of feature are used.
 There are total of 12 categories each
containing 60 images.
 Categories chosen are aero plane, bus,
flowers, car, bike etc.
 For testing purpose we have taken 210
images.
 The bow descriptors are extracted for images
of each category.
 The extracted descriptors are given to the
SVM as an input.
 The SVM predict the class of the images.
 Further within the category the similar
images are retrieved based on optimal bin
size.
Majorppt
Majorppt
 We find that the transformation from images
to features (or other descriptors) is many-to-
one and when the data set is relatively small,
there are no collisions.
 But as the size of the set increases unrelated
images are likely to be mapped into the same
features.
 We propose that generic CBIR will have to
wait both for algorithmic advances in image
understanding and advances in computer
hardware.
 In the meantime we suggest that efforts
should be focused on retrieval of images in
specific applications where it is feasible to
derive semantically meaningful features.

More Related Content

Majorppt

  • 3. he amount of pictorial data has been growing enormously with the expansion of Web. From the large number of images, it is very important for users to retrieve required images via an efficient and effective mechanism. Most of the images are retrieved by text based image retrieval which is not very efficient. The images are indexed by tags in TBIR. For retrieving image the text entered by user matched with image tags. E.g. for searching a image one can miss the important text then the output come is not very desired and satisfactory for user.
  • 4. Support Vector machine(SVM) with Color Histogram:-using train images where each image associate with one of the given categories. SVM with Optimal Histogram Bin SIZE(derived variable):- Optimal bin size is obtained for color histogram of each image. The optimal bin size is used for finding similar images within the category.
  • 5. The optimized bin size for each image present in the training database is calculated. The bin size will be used as a feature The feature vector consists of two features:- The extracted shape/texture features(SIFT). Optimal bin size.
  • 6. 720 images are present in the database for training. Algorithms applied on the images present in the database. Descriptor features like color histogram, SIFT, Bag of feature are used. There are total of 12 categories each containing 60 images. Categories chosen are aero plane, bus, flowers, car, bike etc.
  • 7. For testing purpose we have taken 210 images. The bow descriptors are extracted for images of each category. The extracted descriptors are given to the SVM as an input. The SVM predict the class of the images. Further within the category the similar images are retrieved based on optimal bin size.
  • 10. We find that the transformation from images to features (or other descriptors) is many-to- one and when the data set is relatively small, there are no collisions. But as the size of the set increases unrelated images are likely to be mapped into the same features.
  • 11. We propose that generic CBIR will have to wait both for algorithmic advances in image understanding and advances in computer hardware. In the meantime we suggest that efforts should be focused on retrieval of images in specific applications where it is feasible to derive semantically meaningful features.