CONTENT-BASED IMAGE RETRIEVAL

THROUGH CLUSTERING.

Under the guidance

of
“Mr.”
Lecturer

Project by
1.P.D.GEORGE
M.Tech CSE
(DISTRIBUTED COMPUTING SYSTEM)
SRIMANAKULA VINAYAKAR ENGINEERING
COLLEGE
1
MOTIVATION

 We are drowning in data but starving for knowledge.

 Solution : Data Mining Techniques.

NOTE: Especially in medical data large data is present where as

knowledge discovery is very minimal, so the predictive
action is less and slow.

2
OBJECTIVE

In this project as the first phase Knowledge

Summarization is carried out through Clustering Techniques which is

stored

in Buffer/Database from where Content-Based Retrieval is done to carry out

predictive measure ( by Medical researches) for Medical Image Data.

3
SCOPE

 The conceptual database clustering strategy generates conceptual

image database clusters to reduce the search process.

 One of the new technique Markov Model Mediators (MMMs)

Mechanism is used for both database-level and cluster-level
knowledge discovery and summarization.

 The conceptual database clustering strategy is advantages over

physical database clustering.

 The above process can improve the system response time an as

well as Query performance for image database.

4
 PROBLEM STATEMENT

In this proposal, the main goal is Content-Based Image Retrieval (CBIR).

Here the performance enhancement is done through X-Means.

As a first phase, a very large collection of images of medical database (DB) of World
Wide Web is done as a collection.

Here, retrieval is not fast due to size of image.

So the process of indexing and storing it as Knowledge Summarization (KS) is done as

next level.

From KS Content-Based Retrieval can be performed from output unit.

5
LITERATURE SURVEY

General Image Retrieval:

 Extracting Color Features.

 Extracting Texture Features.
 Combining Color, Texture, Pixels and Position Features.

6
LITERATURE SURVEY (Cont…)

Retrieval Algorithms:

 Similarity Retrieval Algorithm for Image Databases

 GiST (Generalized Search Tree)

 R-Tree

7
 Similarity Retrieval Algorithm for Image Databases

Given a query image Q, this algorithm retrieves images that

contain Common similar regions with Q, where objects of Q may appear in
the target images in scaled, translated, or color shifted form.

This algorithm performs an image indexing phase in which images in the

database are indexed before images matching a given query image Q can be
retrieved Indexing of images is done only once at the beginning and when new
images are added to the database, while the steps for querying need to be
repeated for each query image.

8
 Similarity Retrieval Algorithm ( Cont…)

Steps involved in both indexing of images and querying for similar images are:

 Generating Signatures for Sliding Windows.

 Clustering the Sliding Windows.

 Region Matching.

 Image Matching

9
 GiST (Generalized Search Tree)

 In the beginning there was the B-tree.

 All database search trees since the B-tree have been variations on its theme.
 Recognizing this, a new kind of index called a Generalized Search Tree (GiST),
which provides the functionality of all these trees in a single package, was
developed.
 The GiST is an extensible data structure, which allows users to develop indices
over any kind of data, supporting any lookup over that data.
 This package unifies a number of popular search trees in one data structure (the
long list of potentials includes R-trees, B+-trees, hB-trees, TV-trees, Ch-Trees,
partial sum trees, ranked B+-trees, and many, many others), eliminating the
need to build multiple search trees for handling diverse applications.
 In addition to unifying all these structures, the GiST has one key
feature that previous trees lacked: both data and query extensibility
10
 R-Tree

Indexing methods (e.g. the B-Tree) are not well suited to handle
multidimensional data objects of non-zero size, a new efficient and dynamic,
index based structure was needed to handle this spatial data

In 1984, Antonin Guttman presented a structure called the R-Tree (Region tree).
Guttman gave the algorithms for searching, updating, deleting, etc and proved
the R-Tree to be very efficient.

11
R-Tree (Cont…)

 An R-Tree is similar to a B-Tree with index records in its leaf nodes

containing pointers to their data objects.

 The structure is designed so that, in the case of a spatial search only a small

amount of nodes has to be visited, thus it is efficient.

 Because we have a completely dynamic index, insertions and deletions can

be intermixed with searching. Since it is dynamic a non-periodic
reorganization becomes unnecessary.

12
LITERATURE SURVEY (Cont…)

Clustering Techniques :

 K-Means Method : For Content-Based Image Retrieval as the first

phase.
 X-Means : Enhanced version of K-Means Method.

13
DESIGN (CBIRC ARCHITECTURE)

DB1

DB level
DB level clustering
DB2
Knowledge Process
Summarization

DB3

Content
DBN Based
Retrieval

Output
Input Distributed DB

Figure: CBIRC High Level Architecture.

14
CBIRC ARCHITECTURE (cont…)

 In this proposal, the main goal is Content-Based Image Retrieval (CBIR).

 Hear the performance enhancement is done through X-Means.

 As a first phase, a very large collection of images of medical database (DB) of World
Wide Web is done as a collection.

 Hear, retrieval is not fast due to size of image.

 So the process of indexing and storing it as Knowledge Summarization (KS) is done as

next level.

 From KS Content-Based Retrieval can be performed from output unit.

15
 REFERENCES

1. Jiawei Han, Micheline Kamber, “Data Mining: Concepts and Techniques”, Morgan Kaufmann Publishers, 2001.
2. Arun K.Pujari, “Data Mining”, Universities Press (India) Ltd., 2001.
3. Margaret H.Dunham, “Data Mining: Introductory and Advanced Topics”, Pearson education, 2003.
4. Apostol Natsev, Rajeev Rastogi, and Kyuseok Shim, “WALRUS: A Similarity Retrieval Algorithm for Image
Databases”, IEEE Transactions on Knowledge and Data Engineering, Vol.16, no.3, March 2004.
6. Safar, M., Shahabi, C. and Sun, X. “Image Retrieval by Shape: A Comparative Study”, In Proceedings of IEEE
International Conference on Multimedia and Expo(ICME’00), 2000, 141-144.
8. Stehling, R. O., Nascimento, M. A., and Falcao, A. X. , “On Shapes of Colors for Content-based Image Retrieval”,
In ACM International Workshop on Multimedia Information Retrieval (ACM MIR’00), 2000, 171-174.
10. Ciaccia, P., Patella, M., and Zezula, P, “M-tree: An Efficient Access Method for Similarity Search in Metric
Spaces”, In Proceedings of the 23rd VLDB Conference, 1997, 426-435.
12. Shyu, M.-L., Chen, S.-C., Chen, M., and Zhang, C, “Affinity Relation Discovery in Image Database Clustering and
Content-based Retrieval”, Accepted for publication (short paper), ACM International Conference on Multimedia,
October 10-16, 2004.
15. Zhang, D. S. and Lu, G, “Generic Fourier Descriptors for Shape-based Image Retrieval”, In Proceedings of IEEE
International Conference on Multimedia and Expo (ICME’02), 1 (2002), 425-428.
17. www.gist.cs.berkeley.edu
18. www.db.deis.unibo.it/Mtree
19. www.R-tree - Wikipedia, the free encyclopedia

16
THANK YOU

17