Image Retrieval: Current Techniques, Promising Directions, and Open Issues
Image Retrieval: Current Techniques, Promising Directions, and Open Issues
Techniques, Promising
Directions, and Open Issues
Yong Rui, Thomas Huang and Shih-Fu
Chang
Published in the Journal of Visual
Communication and Image
Representation.
Presented by: Deepak Bote
Presentation Outline
History of Image
Retrieval
E.g.
Flowers in a
pond
<Its biological
name>
Limitations of text-based
approach
Outline
What is CBIR?
Sample Query
Sample CBIR
architecture
Outline
Feature Extraction
Semantic features
General features
Mean Color
Pixel
Histogram
Image
Corresponding
histogram
Color Layout
How it works:
Texture
Coarseness
Linelikeness
Contrast
Regularity
Directionality
Roughness
Segmentation issues
Presentation Outline
Problem of high
dimensions
Mean Color = RGB = 3 dimensional
vector
Color Histogram = 256 dimensions
Effective storage and speedy retrieval
needed
Traditional data-structures not sufficient
R-trees, SR-Trees etc
2-dimensional space
Point A
D2
D1
3-dimensional space
Now, imagine
An N-dimensional
box!!
We want to conduct a
nearest neighbor
query.
R-trees are designed
for speedy retrieval
of results for such
purposes
Designed by
Guttmann in 1984
Presentation Outline
IBMs QBIC
Virage
VisualSEEk
Feature selection in
ISearch
Presentation Outline
Open issues
Presentation Outline
Conclusion
Acknowledgements
References
THANK YOU!!!
Questions?