Fourth Year Project - Presentation

Project Title:
Content Based Image Retrieval (CBIR)

Presenters:
 Rami Al Tayeche
 Ahmed Khalil
Supervisor:
 Professor Aysegul Cuhadar
Presentation - Outline

 Introduction
 What is CBIR?
 Applications of CBIR
 Our Approach
Colour
Texture
Shape
Where We Are
Conclusion
Questions and Answers
Introduction - What is CBIR?

 The term [CBIR] describes the process of

retrieving desired images from a large collection on
the basis of features (such as colour, texture and
shape) that can be automatically extracted from
the images themselves.
Introduction - Reasons for its

development
 In many current applications with large image
databases, traditional methods of image indexing
have proven to be insufficient.

For example;
Finger print scanning
cannot be done using a
keyword search.
Introduction - Applications

 Automatic face recognition systems

Introduction - Applications

 Medical Image Databases

Introduction - Applications

 Trademark Image Registration

Our Approach - Image Features

The image features that we will be focusing on, for

image retrieval are:
•Colour
•Texture
•Shape
Other primitive features not considered are:
•Spatial location
•Pixel intensity
Our Approach - Colour
Our Approach - Colour Histograms
Our Approach - Colour Maps
Our Approach - Minkowski Distance
Our Approach - Quadratic Distance
Our Approach - Similarity Matrix
Our Approach - Implementation

Matlab Code
Our Approach - Texture

What is Texture?
o Texture is that innate property of all surfaces that
describes visual patters, and that contain
important information about the structural
arrangement of the surface and its relationship to
the surrounding environment.
Our Approach - Texture

Examples:

Brick Finger print Clouds Rocks

Texture Texture Texture Texture
Our Approach - Texture Properties

Co-occurrence matrix:
o Based on the orientation and distance between
image pixels.
o From it we obtain statistics that represent:
•Coarseness
•Contrast
•Directionality Texture
•Linelikeness properties
•Regularity
•Roughness
Our Approach - Wavelet Texture

Wavelet Texture:
o Textures can be modeled as quasi-periodic patterns
with spatial/frequency representation.

The wavelet transform

transforms the image
into a multi-scale
representation with both
spatial and frequency
characteristics.
Our Approach - Tree Algorithm

Algorithm: Tree-Structured Wavelet Transform

1. Decompose the image into four sub-images

2. Calculate the energy of all decomposed images at
the same scale, using:
m n
1
E
MN
 X  i, j 
i 1 j 1

3. If the energy of a sub-image is significantly larger,

repeat from step 1.
Our Approach - Tree Algorithm
Our Approach - 1st Decomposition
Our Approach - 2nd Decomposition
Our Approach - Classification

Algorithm: Euclidean Distance Classification

1. Decompose query image.

2. Get the energies of the first dominant k channels.
3. For image i in the database obtain the k energies.
4. Calculate the Euclidean distance between the two
sets of energies, using:
k
Di    xk  yi ,k 
2

k 1

5. Increment i. Repeat from step 3.

Our Approach - Shape

What is Shape?
o Shape is the characteristic surface configuration
that outlines an object giving it a definite
distinctive form.
o Fairly well-defined concept.
Our Approach - Shape

Examples:
Our Approach - Shape Features

• Aspect ratio
• Circularity
• Moment invariants
• Sets of consecutive
boundary segments
Our Approach - Shape Extraction

Techniques under consideration:

o Fourier Descriptor
o Moment Invariants
o Directional Histograms
Where We Are
Image Database
Conclusion

o What is CBIR?
– The retrieval of images from a database
based on content features such as colour,
texture and shape.
o Reasons for its developments
– Insufficiency in certain applications
Conclusion

o Applications
– Finger print scanning systems
– Automatic face recognition systems
– Medical image databases
– Trademark image registration
Conclusion

o Our Approach
– Colour
– Texture
– Shape

o Where we are
– In the phase of understanding and
implementing shape.