An Efficient Image Retrieval in DSR: IPASJ International Journal of Information Technology (IIJIT)

IPASJ International Journal of Information Technology (IIJIT)
Web Site: http://www.ipasj.org/IIJIT/IIJIT.htm

A Publisher for Research Motivation ........ Email:editoriijit@ipasj.org
Volume 6, Issue 7, July 2018 ISSN 2321-5976
An Efficient Image Retrieval in DSR

Pramila Devi 1, NirmalRaj 2
1
Student, Dept. Of Computer Science and Applications, Sri Chandrasekharendra Saraswathi Vishwa Mahavidhyalaya
2
Asst professor, Dept. Of Computer Science and Applications, Sri Chandrasekharendra Saraswathi Vishwa
Mahavidhyalaya
ABSTRACT
Digital images have many applications in different fields like medical imaging and diagnostics, weather forecasting, space
research, military etc. The number of images available and their wide variety increases with the ease of acquiring, storing and
sharing digital images due to the advances in technology. As a result, the significance of image retrieval algorithms and
systems has been considerably increased. Many researches on content-based image retrieval (CBIR) are being carried out. In
this paper, a fast image retrieval algorithm called feature levels is proposed. Feature levels algorithm works with the
classification of image features to different categories or levels, feature extraction in terms of levels and feature similarity
comparison of the query image with database images. The system retrieves images from the associated database. The database
is re-written after each level according to Database Revision (DR) algorithm.
Keywords: Digital images, Feature level, Database Revision (DR) algorithm
1. INTRODUCTION
In Internet there are huge amount of databases. The retrival of images can be done effectively by using the content of
the images like color, texture and shape. . This method is called content based image retrieval (CBIR). CBIR is an
difficult area of research.CBIR containns two steps: index and search. In ordering step substance of the picture are
separated and are put away as an element vector in the component database. In the looking advance, client question
picture include vector is built and contrasted and all element vectors in the database for similitude to recover the most
comparative pictures to the inquiry picture from the database.
Accessibility of the gigantic number of pictures because of the quick advancement and change of the web, picture
catch gadgets and PC equipment cause the issue of capacity and control of pictures. To conquer the issue of room and
control time, at exhibit all pictures are spoken to in packed arrangements like JPEG and MPEG.
The image features can be extracted through the compressed domain. To remove the low level highlights from the
packed pictures, first the pictures are decoded from the compacted area to the pixel space. The picture handling and
investigation techniques are get connected to imges in the pixel area. This type of procedure is wasteful in light of the
fact that it includes more calculations and expands the handling time.
2. RELATED WORK
All the images in the database are evaluated with reference to the features and a similarity matching is done. In
database revision method, after this similarity matching, all the images in the database are rearranged in the order of
their similarity with the query image. A cut-off in the number of images selected for further processing is also
established. Thus the database is now reduced to a number of n-images with high similarity level. Here, 100 images are
selected as the cut-off. The top k-images are then displayed to the user, k being any reasonable number manageable for
viewing and analyzing by the user. The user can interact with the system and add his/her level of satisfaction. The
images in the database are re-ranked based on the user-satisfaction level entered for each image. Images with lower
user-satisfaction value will be deleted from the database while images with higher satisfaction level will maintain its
position in database. Here, a user-satisfaction range from 0 to 1 is allowed. The process of DR continues as many times
as the user is satisfied with the displayed images. User-interactive system is essential for deleting the semantic gap
occurring in the retrieval process. DR eliminates semantic gap and modify the database by considering the user’s
opinion. Also, DR prevents the repeated appearance of irrelevant images by deleting them from the database.
Volume 6, Issue 7, July 2018 Page 63

Content Based Image Retrieval (CBIR) enables user to extract images based on query from a database containing
large amount of images. The issue is to design CBIR system to select the best features that represent in the database. ‘It
mainly concentrates on database classification and efficient image representation. Highlight extraction is done in view
of shading string coding and string correlation. CBIR approach expands precision for picture recovery [1].
CBIR is the most important topic nowadays when the data of digital images is highly increasing. Sketch based image
retrieval (SBIR) systems perform at a very low level on real life images, where background data may distort image
descriptors and retrieval results. A preprocessing step is added using integrated saliency detection. To build the
descriptor, orientation feature is extracted at salient Modified Harris for Edges and Corners (MHEC) key points using
an improved edge map, resulting in a Salient Orientation Histogram (SOH) [2].
A novel feature descriptor, local texton XOR patterns (LTxXORP) is proposed for content-based image retrieval. The
method collects the texton XOR pattern which gives the structure of the query image or database image. First, the RGB
(red, green, blue) color image is converted into HSV (hue, saturation and value) color space. Second, the V color space
is divided into overlapping subblocks of size 2 × 2 and textons are collected based on the shape of the textons. Then,
exclusive OR (XOR) operation is performed on the texton image between the center pixel and its surrounding
neighbors. Finally, the feature vector is constructed based on the LTxXORPs and HSV histograms. The results show
improvement for image retrieval [3].
3. METHODOLOGY
In order to have a fast image retrieval, feature extraction is classified into groups. Three levels of feature extraction
are employed here for the three categories of features and database of any size is reduced to 50 images with high feature
similarity in all the three levels of search. In the proposed system, the feature extraction is categorized into different
levels. After each level of feature extraction and similarity matching, the database is modified with an algorithm called
Database Revision (DR). The existing database is replaced after each feature search on the basis of the previous feature
search results. The following topics explain the proposed system. The System also presents the different levels of
feature extraction and the DR method. The database of any size will be reduced to 50 images with high feature
similarity in all the three levels of search. So that the image search and retrieval process is faster than existing system.
Figure 3 System Architecture
3.1 Proposed Algorithm

The effective content-based image retrieval (CBIR) needs efficient extraction of low level features like color, texture
and shapes for indexing and fast query image matching with indexed images for the retrieval of similar images.
Highlights are extricated from pictures in pixel and packed spaces. In any case, now the greater part of the current
pictures are in packed configurations like JPEG utilizing DCT (discrete cosine change).
In this paper we think about the issues of proficient extraction of highlights and the powerful coordinating of pictures
in the packed space. In our strategy the quantized histogram factual surface highlights are separated from the DCT
squares of the picture utilizing the noteworthy vitality of the DC and the initial three AC coefficients of the squares.

For the compelling coordinating of the picture with pictures, different separation measurements are utilized to gauge
likenesses utilizing surface highlights.
The investigation of the successful CBIR is performed based on different separation measurements in various number
of quantization receptacles. The proposed technique is tried by utilizing Corel picture database and the test comes about
demonstrate that our strategy has hearty picture recovery for different separation measurements with various histogram
quantization in a packed area.
Figure 4 Image Retrieval
3.2 System Development
3.2.1 Color
Color is a very important aspect of any image. It is the most easily noticeable characteristic in images. This is because
color feature possess higher human attention than any other image feature. Color feature is commonly used in all the
CBIR systems. Color features are generally divided into two groups: global color descriptors and local color descriptors.
The local color descriptors are advantageous compared to the global color descriptors as the pixel-level color
information is not represented by them. The local color descriptors represent the color of the image with respect to its
spatial location. In this paper, the local color features as well as some of the global color descriptors are utilized. Mean
and standard deviation are the global color features. Binary bitmap using block truncation coding and color histogram
are the local color descriptors. The HSV color space is used for the binary bitmap and global color descriptors and RGB
color space for the color histogram. The color histogram feature search works RGB images as follows. First, the image
is cropped to find the histogram of only the central portion of the image to concentrate on the localized color feature of
the object depicted in the image, discarding the surroundings. Then the color histogram of the cropped portion is
extracted. Color histogram represents the distribution of intensity of the color in the image.
3.2.2 Texture
Texture feature of an image is derived from a combination of pixels that reoccur several times in the image. The
significance of extracting the texture is that it differentiates between objects with same backgrounds. Gray level co-
occurrence matrix (GLCM) is used in this system to represent the texture feature. GLCM is a matrix. Each value of
GLCM shows the number of reoccurrences of two pixels and separated by a distance and at an angle in the image.
3.3.3 Shape
Another distinguishing feature of images is their shapes. Shape is an important descriptor. An important shape
feature is edge histogram descriptor (EHD). It represents the relative frequency of occurrence of the four types of edges,
vertical horizontal, diagonal and anti-diagonal, in the corresponding 4x4 sub-image blocks of the image. The

normalized representation of edges produces EHD. The shape search is carried out only for the 100 images that
qualified the level 1 and level 2 searches. This considerably increased the speed of retrieval without any compromise on
the results. The database is again revised to 50 top images based on similarity qualifying the shape search. Theses 50
images form the final database after the feature extraction.
3.3 System Requirement
The hardware system used is Pentium IV 2.4 GHz with a hard disk of 40 GB and a RAM of 512 MB. The software
system runs on Operating Systems like Windows 95/98/2000/XP/7/8 with a front end of Java Swing and tool used is
Net Beans 8.2 and technology used is Jdk1.8.
3.4 System Study
A practicality think about is an assessment of a proposition intended to decide the trouble in doing an assigned
undertaking. For the most part, a practicality think about goes before specialized advancement and undertaking
execution. A practicality think about takes a gander at the feasibility of a thought with an accentuation on recognizing
potential issues and endeavors to answer one fundamental inquiry: Will the thought work and would it be a good idea
for you to continue with it?
3.4.1 Technology and system feasibility

The appraisal depends on a diagram outline of framework prerequisites as far as Input, Processes, Output, Fields,
Programs, and Procedures. This can be measured as far as volumes of information, patterns, recurrence of refreshing,
and so forth to gauge whether the new framework will perform satisfactorily or not this implies practicality is the
investigation of the situated in plot.
3.4.2 Economic analysis
Economic analysis is the most frequently used method for evaluating the effectiveness of a new system. All the more
ordinarily known as cost/advantage examination, the methodology is to decide the advantages and investment funds
that are normal from an applicant framework and contrast them and expenses. In the event that advantages exceed
costs, at that point the choice is made to outline and execute the framework. A business person should precisely
measure the cost versus benefits before making a move.
3.4.3 Legal feasibility
Decides if the proposed framework clashes with lawful prerequisites.
3.4.4 Operational feasibility
Is a measure of how well a proposed framework takes care of the issues, and accepts points of interest of the open
doors recognized amid scope definition and how it fulfills the prerequisites distinguished in the necessities
investigation period of framework advancement.
3.4.5 Schedule feasibility
A venture will fall flat in the event that it takes too long to possibly be finished before it is valuable. Normally this
implies evaluating to what extent the framework will take to create, and on the off chance that it can be finished in a
given day and age utilizing a few strategies like payback period. Calendar practicality is a measure of how sensible the
undertaking timetable is. Given our specialized aptitude, are the task due dates sensible? A few tasks are started with
particular due dates. You have to decide if the due dates are required or alluring.
4. RESULTS AND DISCUSSION

Joining testing in the product testing model precedes framework testing and after the unit testing has been finished.
The way that joining testing works is by, getting the individual modules that have experienced the unit testing stage
and incorporating every module into a gathering. The joining testing stage will ensure when the modules are being
coordinated together that any issues, for instance blunders or bugs, caused because of the reconciliation of the modules
are disposed of. Joining testing does not manage the combination of the entire framework however manages the
incorporation of a procedure in the framework. In the mix testing stage there are three things that are made, to
guarantee that the mix of the modules is fruitful and that it runs effectively too, a test design, test cases and test

information is created to viably test that the joining is fruitful. Combination testing is best to be utilized as a part of an
iterative procedure as along these lines it will spare time over the long haul and will help when attempting to keep to a
financial plan. The motivation behind why an iterative procedure is the best for incorporation testing is just in light of
the fact that this considers more input from the customer, so if the customer is included with the venture a ton it will be
more outlandish regarding making a great deal of changes in the combination procedure, for instance test design. The
best reconciliation testing compose would be top-down as this is the quickest path for the joining procedure to be
finished. There is anyway one issue that may cause time delay in the joining procedure that is the when utilizing testing
information to test the procedure if issues or mistakes or revealed this should be reported, settled and re-done as such
this will cause a deferral in the time taken.
4.1 Integration Test Plan
A test design is basically arranging there is more data and focuses that can be incorporated into the test design by an
organization. Most test designs are endorsed and taken a shot at with the customer so they may arrange a few changes
later on, so a test design may need to incorporate more data and it is best to get this affirmed so no issues are
experienced later on.
4.2 Integration Test Cases
Experiments is made to ensure that the yield, of the incorporated modules are creating the normal yield and is
working precisely how it should function. This is essentially an approach to recognize any mistakes or bugs that may
have been made in the combination stage. The analyzer will then work through the program and report every one of the
information utilizing the experiment that was made, the experiment will test all sources of info and yields in the
coordinated modules.
4.3 Integration Test Data
Test information is basically information that is utilized as a part of request to test the real program or the
coordinated modules. Test information would ordinarily be utilized as a part of an experiment as this would be utilized
to check the data sources and expected yields.
4.4 Integration testing
4.4.1 Top-Down Testing
In this approach, top level integrated units are tested first, followed by step by step examination of lower level
modules.
4.4.2 Bottom-Up Testing
Contrary to the top-down approach, this method facilitates testing at the lower level first, and then taking it up the
hierarchy. It is generally practiced where bottom-up development process is followed.
4.4.3 Sandwich Testing
This approach is the hybrid of Top-Down Testing and Bottom-Up Testing.
4.4.4 Big Bang Testing
In this approach, most or all of the software modules are put together at once, and then tested. Even though Big Bang
testing saves a lot of time, the results recorded are not always accurate. This might result in complications and prevent
the developing team to achieve their testing goals.
4.4.5 Black Box Testing
The strategy of testing without having any information of the inside workings of the application is Black Box testing.
The analyzer is unaware of the framework design and does not approach the source code. Ordinarily, when playing
out a discovery test, an analyzer will associate with the framework's UI by giving sources of info and looking at yields
without knowing how and where the information sources are worked upon.
4.4.6 White box testing
White box testing is the point by point examination of interior rationale and structure of the code. White box testing
is likewise called glass testing or open box testing. Keeping in mind the end goal to perform white box testing on an

application, the analyzer needs to have learning of the inner working of the code. The analyzer needs a peer inside the
source code and discover which unit/piece of the code is carrying on improperly.
4.4.7 Grey Box testing
Dim Box testing is a system to test the application with constrained learning of the interior workings of an
application. In programming testing, the term the more you know the better conveys a great deal of weight when
testing an application. Acing the area of a framework dependably gives the analyzer an edge over somebody with
constrained space information. Not at all like discovery testing, where the analyzer just tests the application's UI, in
dim box testing, the analyzer approaches configuration records and the database. Having this learning, the analyzer
can better get ready test information and test situations when making the test arrangement.
Figure 5 Digital image searching
Figure 6 Image search results

Figure 7 Mosaic creation
5. CONCLUSION AND FUTURE SCOPE

The paper presents an improved system by introducing a new algorithm based on feature categorizing into levels.
Here, each image from all the image classes is compared. Both conventional and proposed methods are executed for
retrieval. The significance of feature levels based search is verified. It is much faster than conventional method and as
precise as the existing methods. The system is efficient and user-friendly because it gives good results without time
wastage. Future scope includes implementing the CBIR system considering more low-level image descriptors and
highly efficient deep learning neural network, which might prove to be very fast and precised one.
Acknowledgment
The authors would like to thank Prof. Dr. G. Jayaram Reddy, chancellor, Prof. Dr. Vishu Pothy, Vice Chancellor, Prof
Dr. G. Srinivasan, Registrar and Dr. S. Balaji ,Dean of Sri Chandrasekharendra Saraswathi Vishwa Mahavidhyalaya
University for their blessings. The authors also thank Dr. S. Rajalakshmi, HOD of Computer Science and applications,
Sri Chandrasekharendra Saraswathi Vishwa Mahavidhyalaya University for providing motivation, valuable suggestions
and directions for the successful completion of the dissertation.
References
[1] K. Jenni, S. Mandala, M.S. Sunar, M.S, “CBIR using color string comparison,”Procedia Computer Science,
50,pp. 374-379, 2015.
[2] A.Manno-Kovacs, “Content based image retrieval using salient orientation histograms,” In Proceedings of the
IEEE International Conference For Image Processing (ICIP), pp. 2480–2484, 2016.
[3] A.Bala, T. Kaur, “Local texton XOR patterns: a new feature descriptor for content based image retrieval”, Eng.
Sci. Technol. Int. J. 19(1), pp. 101–112 , 2016.
AUTHOR
Mrs. Pramila Devi pursed Master of Arts, Master of computer applications and Bachelor of Education. She is currently
working as a computer science teacher in MBN government girls higher secondary school.
Dr. T. Nirmalraj pursued Master of Science, Master of philosophy and Doctor of Philosophy. He is currently working
as a asst professor at Sri Chandrasekharendra Saraswathi Vishwa Mahavidhyalaya.

An Efficient Image Retrieval in DSR: IPASJ International Journal of Information Technology (IIJIT)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

An Efficient Image Retrieval in DSR: IPASJ International Journal of Information Technology (IIJIT)

Uploaded by

Copyright:

Available Formats

IPASJ International Journal of Information Technology (IIJIT)

Web Site: http://www.ipasj.org/IIJIT/IIJIT.htm

An Efficient Image Retrieval in DSR

Keywords: Digital images, Feature level, Database Revision (DR) algorithm

Volume 6, Issue 7, July 2018 Page 63

Figure 3 System Architecture

3.1 Proposed Algorithm

Volume 6, Issue 7, July 2018 Page 64

Figure 4 Image Retrieval

3.2 System Development

Volume 6, Issue 7, July 2018 Page 65

3.4.1 Technology and system feasibility

4. RESULTS AND DISCUSSION

Volume 6, Issue 7, July 2018 Page 66

Volume 6, Issue 7, July 2018 Page 67

Figure 5 Digital image searching

Figure 6 Image search results

Volume 6, Issue 7, July 2018 Page 68

Figure 7 Mosaic creation

5. CONCLUSION AND FUTURE SCOPE

Volume 6, Issue 7, July 2018 Page 69

You might also like