Optimized Image Retrieval System: Texture and Shape Based Approach
Optimized Image Retrieval System: Texture and Shape Based Approach
Key words: visual content, features extraction, Histogram, segmentation, similarity measures,
horizontal and vertical edge, energy, entropy, contrast, image database
INTRODUCTION
The innovatory internet and digital technologies produces the need to have a system to
organize abundantly available digital images for easy categorization and retrieval. Progress in
storage and image attainment technologies have enabled the creation of large image datasets.
In this scenario, it is obligatory to develop suitable systems to efficiently manage these
collections. The mostly used system for such problems is Content-Based Image Retrieval
(CBIR). The goal of CBIR systems is to support image retrieval based on certain parameters of
image like shape, color, texture. CBIR plays a important role in the application areas such as
multimedia database systems in recent years. The work focused on using low-level features
like color, texture, shape and spatial layout for image representation [1].
Content-based image retrieval, also known as query by image content and content-based visual
information retrieval is the application of computer vision to retrieval of image in the digital
format. Content-based means the search, based on the contents of the images, rather than
waiting for the human-input metadata such as indexing or keywords. As the amount of
collections of digital images increases, the difficulty finding a preferred image in the web
becomes a hard [2].
There are two approaches to image retrieval: Text-Based approach and Content- Based
approach. Today, the most common method of retrieval is textual descriptions and
R S. Publication, rspublicationhouse@gmail.com
Page 1
categorization of images. This approach also has some problems, because the mentalities of
people are different from one another so the differentiating criteria of images by the people will
be obviously different and it is leading to problems of retrieval again. CBIR is a way to get
around these problems [2].
CBIR systems search collection of images based on features that can be extracted from the
image files themselves without manual description. CBIR is originated from fields such as
statistics, pattern recognition, signal processing and Image Processing. It is a combination of
different areas of knowledge, such as pattern recognition, object matching, machine learning,
wavelet filtering etc. CBIR is devoted to understanding visual characteristics of images without
any text descriptions. It involves two steps:
Feature Extraction: In the first step the extraction of the visual content of image is
performed
Matching: In the second step matching of the images based on those visual content is
accomplished
Page 2
Page 3
Co-occurrence Matrix
Tamura Texture
Wavelet Transform
B. Shape Features:
Shape may be defined as the characteristic surface configuration of an object; an outline or
contour. It permits an object to be distinguished from its surroundings by its outline [8]. The
ability to retrieve by shape is perhaps the most obvious requirement at the primitive level.
Shape is a fairly well-defined concept and there is considerable evidence that natural objects
are primarily recognized by their shape [9].
A number of features characteristic of object shape (but independent of size or orientation) are
computed for every object identified within each stored image. Queries are then answered by
computing the same set of features for the query image, and retrieving those stored images
whose features most closely match those of the query.
Shape representations can be generally divided into two categories mathematically [10]:
Boundary-based, and
Region Based
Fourier Descriptors
R S. Publication, rspublicationhouse@gmail.com
Page 4
Region-based:
Superquadrics
Fourier Descriptors
Implicit Polynomials
Blum's skeletons
The most successful representations for shape categories are Fourier Descriptor and Moment
Invariants [10]:
The main idea of Fourier Descriptor is to use the Fourier transformed boundary as the
shape feature.
The main idea of Moment invariants is to use region-based moments, which are invariant
to transformations as the shape feature[12]
METHODOLOGY USED
In this method initially extract the primitive features of a query image and compare it to the
database images. The image features under consideration are texture and shape. Thus, using
matching and comparison algorithms, the texture and shape features of one image are
compared and matched to the corresponding features of another image. This comparison is
performed using characteristics such as energy, entropy and contrast texture features and
horizontal and vertical edge shape features of an image. In the end, these characteristics are
extracted one after another, so as to retrieve database images that are similar to the query. The
similarity between the characteristics of the features are calculated using algorithms one for
each specific feature for both extraction and matching.
The five features of texture and shape which have been used in the accomplishment of the
proposed solution from the problem statement of the work undertaken in this paper are:
1. Energy
2. Entropy
3. Contrast
4. Horizontal Edge
5. Vertical Edge
It will store the extracted values into an excel file in the form of matrix of order of n by 5
where n is the number of images in the image database. It will then compares the extracted
values of the query image as well as that of the images stored in excel file.
ALGORITHM DEVELOPED
The method to extract the similar images from the database based on texture features were
proposed earlier i.e. on the basis of energy, entropy and contrast is implemented using
algorithm i.e.
1. Insert the query image by selecting from the database.
R S. Publication, rspublicationhouse@gmail.com
Page 5
2. Convert the image from RGB to grey to use it by using the method
rgb2grey(imagename)
3. Calculate the total pixel of image by
Tp=xx*yy
4. Extract all the feature of image like
texture_img = rangefilt(gray_img);
texture_energy = sum(texture_img(:).^2)/tp;
texture_entropy = entropy(texture_img);
cmap_img = contrast(texture_img);
[x1 y1] = size(cmap_img);
cont_img = sum(cmap_img(:))/(x1*y1);
edge_hv = edge(gray_img,'sobel');
edge_X = edge(gray_img,'roberts');
hv_edge_dens = sum(edge_hv(:))/tp;
X_edge_dens = sum(edge_X(:))/tp;
cent_x = (x1/sum)/tp;
cent_y = (y1/sum)/tp;
5. Calculate the feature matrices and store it into a excel sheet
features = [mean_rh, mean_gh, mean_bh, sd_rh, sd_gh, sd_bh,...
texture_energy, texture_entropy, cont_img, hv_edge_dens, X_edge_dens, cent_x, cent_y];
data_val = xlsread('book1');
6. Now compare these feature matrices with already exist feature of the database images
If(feature are matched)
Show all the related images on the GUI window
Else
Report an error that match not found
7. Goto step 2 for every new process.
8. End of process
R S. Publication, rspublicationhouse@gmail.com
Page 6
Recall
0.6
0.1
0.9
R S. Publication, rspublicationhouse@gmail.com
Page 7
GRAPHICAL FORM
0.9
0.8
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0
TBIR analysis
SBIR analysis
T & SBIR
analysis
Precision
Recall
R S. Publication, rspublicationhouse@gmail.com
Page 8
Inserting an Image:
Similar images:
CONCLUSION
Content-based image retrieval (CBIR) is a well-known research area because of the explosion of
video and image data in digital form. The increased bandwidth availability to access the internet
R S. Publication, rspublicationhouse@gmail.com
Page 9
in the near future will allow the users to search for and browse through video and image
databases located at remote sites. Therefore, swift retrieval of images from large databases is an
important difficulty that needs to be addressed. The technology is already exist but not complete
to retrieve efficient and reliable results, so can be further expand with respect to demand, time
and research in this area.
A method for image processing and retrieval is based on texture and shape content of the
image i.e. Energy, Entropy Contrast, Vertical and Horizontal edge which is differ from the
existing methods for the query image processing and can be used for efficient retrieval purpose.
The result received using above approach and performance analysis of the images for texture and
shape based image retrieval technique given an average precision of 0.9 which is better than
other approaches used by various other researchers in this area. The results are good but can
further be improved upto 100% with the use of other features of images like color.
REFERENCE
[1] P.S.SUHASINI , Dr. K.SRI RAMA KRISHNA, Dr. I.V. MURALI KRISHNACBIR
USING COLOR HISTOGRAM PROCESSING Journal of Theoretical and Applied
Information Technology Vol6. No1. (pp 116 - 122)
[2]Neetu Sharma, Paresh Rawat and jaikaran SinghEfficient CBIR Using Color Histogram
Processing Signal & Image Processing : An International Journal(SIPIJ) Vol.2, No.1, March
2011
[3] Monika Sahu, Madhup Shrivastava, M.A. Rizvi IMAGE MINING: A NEW APPROACH
FOR IMAGE DATA MINING BASED ON TEXTURE ICCCT-2012 (International IEEE
conference at Allahabad).
[4] Thomas Seidl Hans-Peter Kriegel Efficient User-Adaptable Similarity Search in Large
Multimedia Databases http://www.vldb.org/conf/1997/P506.PDF
[5]http://km.doc.ic.ac.uk/pr-p.techasith-2002/Docs/OSE.doc
[6] Linda G. Shapiro, and George C. Stockman, Computer Vision, Prentice Hall, 2001..
[7] Texture, class notes for Computerized Image Analysis MN2, Centre for Image Analysis,
Uppsala, Sweden, Winter 2002, Found at: http://www.cb.uu.se/~ingela/Teaching/
imageanalysis/Texture2002.pdf
[8] Anil K. Jain and Aditya Vilaya Image retrieval using color and shape , May 1995
(Department of Computer Science Michigan University
[9] Lexico Publishing Group, LLC, shape, [Online Document], Available at:
Http://dictionary.reference.com/search?Q=shape
[10] Marinette Bouet, Ali Khenchaf, and Henri Briand, Shape Representation for Image
Retrieval, 1999, [Online Document], Available at:
http://www.kom.e-technik.tudarmstadt.de/acmmm99/ep/marinette/
[11] Barbeau Jerome, Vignes-Lebbe Regine, and Stamon Georges, A Signature based on
Delaunay Graph and Co-occurrence Matrix, Laboratoire Informatique et Systematique,
Universiyt of Paris, Paris, France, July 2002, Found at:
Http://www.math-info.univ-paris5.fr/sip-lab/barbeau/barbeau.pdf
[12] Monika Sahu, Madhup Shrivastava, M.A. Rizvi IMAGE BASED QUERY PROCESSING
SYSTEM USING EDGES IISN 2012
R S. Publication, rspublicationhouse@gmail.com
Page 10