Vous êtes sur la page 1sur 12

Journal of research in engineering and its applications

Vol.1 , Issue. 2, (2018), pp. 152-162

Image Retrieval Based On Re-Ranking For Fuzzy


Keyword Search In Cloud Environment
Sriti pragya 1 Abishek Pranav 2
Research Scholar, Chitkara Institute of Engineering &Technology, Himachal Pradesh, India 1

Assistant Professor, Noida Institute of Engineering and Technology, Noida,India2

Abstract
Cloud computing is quickly developing stage in the IT field. Distributed computing is Internet-based
figuring, whereby shared assets, programming and data, are given to PCs and gadgets on-request, similar to
the power matrix. In this paper address the issue of multi keyword search and fuzzy rank in the cloud
environment. Semantic search of keyword give exact result based on the user query and fuzzy rank for support
dynamic update. Overall proposed system provides the efficient result with better performance when
compared to existing system.

Key Words: Multi keyword search, fuzzy rank, top k retrieval, re-ranking

1.INTRODUCTION

cloud computing is the since quite a while ago imagined vision of figuring as an utility,
where cloud clients can remotely store their information into the cloud to appreciate the on-request
great applications and administrations from a common pool of configurable registering assets [1].
The advantages brought by this new monetary registering model incorporate, however are not
constrained to help of the weight for capacity administration, all inclusive information access with
autonomous geological areas, and shirking of capital use on equipment, programming, and work
force systems for upkeeps [1].

A lot of database advanced picture looking are the procedures of perusing, seeking and
recovering picture. The accumulations of pictures in the web are creating bigger and more unique.
Recovering pictures such expansive information accumulations is a more muddled. It is splendidly
conceivable to distinguish a coveted picture from a little accumulation perusing essentially by;
more successful strategies are required with accumulations containing a large number of things.
The picture is seeking, a client may give inquiry watchword, and the framework will performed
pictures "equivalent words" to the question catchphrase. The closeness utilized for seek criteria
could be shading dispersed in pictures, area, and state of pictures qualities. The issue of the picture
recovery are getting to be amplify amount perceived, the scan for arrangements an inexorably
dynamic region for innovative work [2].

Content based picture re-positioning recovering for universally useful picture databases is
a profoundly difficult issue in view of the huge size of the database, the trouble in understanding
pictures, both by individuals and PCs, in specialized condition the trouble of defining a question
and assessing the issue of results precisely. It gives comes about legitimately of question and issue
[3]. Various picture web indexes Content based picture re-positioning recovering have been
produced. The shared conviction for frameworks of internet searcher is to extricate a mark for each
picture depend on its pixel esteems and to Content based picture hunting recovering characterized
administer down looking at of this pictures. The mark fills in as a pictures portrayal in the "view"
of a framework. The parts of the mark are called highlights. One favorable position of a mark over
the first and precise pixel esteems is the attributes pressure of picture portrayal. Be that as it may,
these are more critical explanation behind utilizing the mark is to pick up an enhanced connection
between's pictures introduction and semantics [4] in really, the primary assignment of outlining a

1
Journal of research in engineering and its applications
Vol.1, Issue. 2, (2018), pp. 152-162

mark is to assembles the hole between pictures semantics and the pixel and its exact esteem
portrayal which is to be made a superior relationship with picture semantics.

Figure 1. Cloud computing Service

2. PROBLEM FORMULATION

2.1 System Model

Considerthree different entities for cloud service, as shown below in Fig. 2: the data
owner, the data user, and the cloud server. The data owner has a collection of data and images to be
outsourced to the cloud server in the encrypted form.To enable the searching capability over
encrypted documents or images for effective data utilization, the data owner, before outsourcing,
will first build an encrypted searchable index from original documents, and then outsource both the
index and the encrypted document collection to the cloud server. To improve the image retrieval
accuracy, the search result should be ranked by the cloud server according to some ranking criteria
for example matching is used to verify the query with user.

2.2 Threat Model

The cloud server is considered as “honest-but-curious” in our model, which is consistent


with related works on cloud security [9]. Specifically, the cloud server acts in an “honest” fashion
and correctly follows the designated protocol specification. However, it is “curious” to infer and
analyze data (including index) in its storage and message flows received during the protocol so as
to learn additional information. Based on what information the cloud server knows, we consider
threat models capabilities as follows: Known Ciphertext Model- the cloud server is hypothetical
onlyto know the encrypted dataset and searchable index, both of which are outsourced from the
data owner.

2
Journal of research in engineering and its applications
Vol.1, Issue. 2, (2018), pp. 152-162

Figure 2. System model for our scheme

2.3 Design Goals

To enable efficient, secure and Multikeyword ranked search over outsourced encrypted cloud data
under the aforementioned models, our system design should simultaneously achieve the following
design goals.

1. Dynamic Multi-Keyword Ranked Search: To design a search scheme over encrypted data
which provides not only effective multi-keyword query and accurate result ranking, but also
dynamic update on document collections.

2. Multi Keyword Semantic search -Test to express the connection amongst characteristics and
hunt however the qualities, While client looking through the information on cloud server it may be
conceivable that the client is uninformed of the correct words to seek, i.e. there is no resilience of
equivalent word substitution or syntactic variety which are the normal client seeking practices and
happen every now and again. To take care of this issue semantic based pursuit strategy is utilized.
To enhance the scan for data it is essential that web search tools can comprehend what the client
needs so they can answer dispassionately.

3. Fuzzy ranked search supporting dynamic update- It bolsters both multi-catchphrase inquiry
and bolster result positioning. Fluffy watchword look bolsters just single catchphrase seeks. These
plans doesn't recover the pertinent information to clients question consequently multi-watchword
positioned seek over encoded cloud information remains an extremely difficult issue.

4. Multi-data owner scheme- Challenge to avoid data loses due to Single Data owner and
multiple owners want to share data to the dynamic groups in the cloud environment. Groups can be
dynamic as they will be formed at the time when similar data need to share with users. So when
data for sharing will change, users groups will dynamically change. For providing security, they
combined group signature and broadcast encryption techniques are used.

5. Verification-Challenge to design a verifiable search scheme over encrypted Cloud data the
verifiable keyword search through a third-party audit server, and then makes a further step toward
specifying access privileges for the encrypted documents. To verify the correctness of search
results and achieve access privilege control over the same data when compared with other
schemes.

3
Journal of research in engineering and its applications
Vol.1, Issue. 2, (2018), pp. 152-162

3.RESEARCH METHODOLOGY

The proposed methodology is image is stored in the cloud storage server while user or
clients query to retrievethe image in efficient way. User sends the query keyword in the cloud and
ranking is based on fuzzy semantic relevance grid (FSRG) and after ranking images are shown that
can be retrieve the image using top k retrieve. After retrieved the images are again ranked that
mean re-ranking is take place, re-ranked images are matched with the user query and it will be
updated automatically in database then result pages shown to the user.

3.1 Ranking Based on FSRG

At the point when the client gives an inquiry, the record is counseled to get the pictures
most significant to the question. The pertinent pictures are then positioned by their level of
pertinence, significance and so on. The positioning should be possible in light of watchword
weight which is the client inquiry ask for with high limit esteem. FSRG is Fuzzy Semantic
Relevance Grid which depends on the catchphrase weight. In light of watchword weight the
significance pictures are recorded, and afterward recorded pictures are positioned in network with
the probabilities of catchphrase to that specific picture.

Likewise, it requires consistent client cooperation to give applicable and unimportant


pictures until the point that the client does not get the required picture. A significance input
calculation based fluffy semantic pertinence framework (FSRG), is developed to depict the
semantically importance between the pictures in the database. The weights in the FSRG are
balanced by client's input in every criticism and the FSRG are adjusted by adapting additional
time. The calculation does not require from the earlier learning of particular issue since it in view
of FSRM. It can accomplish great outcomes under the restricted input. In Existing framework re-
positioning utilizing inquiry development technique (QET) and pertinence criticism technique
(RFT) for recover the archives.

Fluffy Logic (FL) is utilized as a part of recovery framework since it is the idea of picture
information, and the idea of human recognition and thinking process. Thus, it can limit semantic
hole between abnormal state semantic and low level picture highlights. Likewise, it is vigorous to
the clamor and power change in the pictures. At long last, the clients are keen on comes about as
per likeness (closeness) as opposed to uniformity (precision).

3.2 Fuzzy Semantic Relevance Grid(FSRG)

Fluffy Semantic Relevance Grid depicts the semantic data of the picture by commenting
on watchwords or semantic names in the database we introduce a Fuzzy Semantic Relevance Grid
(FSRG) to associate the low-level highlights with the semantic ideas. The aftereffect of fluffy
significance seek is network based record an incentive for picture. The fluffy significance look is
the hunt that pursuit in the information records which depends on the different watchwords for
single picture (for instance apple pertinence catchphrases are appl, aple, apl, application, apple and
so on). The yield of FSGR is matrix esteem, after that Grid record esteem is put away in the cloud

4
Journal of research in engineering and its applications
Vol.1, Issue. 2, (2018), pp. 152-162

Cloud Server

Top K retrieval to
Ranking based retrieve the image
on FSRG

Search Query Re Ranking


Keyword over searched
result

User Query
image
Query matching

Update based on result of fuzzy ranked

Result page

Figure 2 Proposed work flow

Zadeh proposed the fluffy sets in 1965, and it is utilized to tackle the uncertain issue. A
fluffy set is a class of articles with a continuum of evaluations of participation. Fluffy sets
trademark a set 0, 1 grows to the interim [0, 1]. In this manner, we utilize the estimation of interim
[0, 1] speaks to "review of enrollment" of a question of the idea. The more the esteem near 1, the
more the protest has a place with the idea. The fluffy network is characterized as takes after:

A= (aij) m_n, and aijϵ[0, 1], (I = 1, 2, . . . ,m; j = 1, 2, . . . , n)


Due to the fluffy normal for the human's semantic information, it's difficult to name the
picture with the exact semantic or words. To connect the semantic hole, fluffy semantic importance
network is utilized as a part of this paper.
The network is characterized as:
Rijϵ [0, 1],R(i, j) = 1, and R(i, j) = R(j, I),
(I, j = 0, 1, . . . ,N − 1)

Where N is the quantity of picture database is the "immediate similitude" of picture. It


mirrors the closeness of picture thus FSRG is a fluffy comparable matrix as indicated by the
meaning of fluffy network.

5
Journal of research in engineering and its applications
Vol.1, Issue. 2, (2018), pp. 152-162

3.3 Algorithm for FSRG:

The detail of the calculation as took after:


Step 1: the introduction of FSRM, the comparability of picture and fulfills the accompanying
conditions:
1 ≤ R(i, j) ≤ 1(i, j = 1, 2 . . . N)
in the event that I = j, at that point R(i, j) = 1(i, j = 1, 2 . . . N)
R(i, j) = R(j, I) (I, j) = 1, 2 . . . N

Where N is the quantity of picture database. Since there are comparability among pictures of each
picture class, the underlying estimation of FSRM is 0.5(0.5 is the most fluffy incentive in the
vicinity of 0 and 1), and R(i, j) = 0.5 (I = j and I, j = 1, 2 . . . N);

Step 2: the picture recovery in view of the customary recovery strategy (the visual element),
restore the best (n < N) most likewise pictures;

Step 3: the client stamp the outcome pictures, the outcome sets is pertinence picture set I + ,
typical picture set I and unimportance picture set I − ;

Step 4: to start with, to the picture set I +, modifying weights of comparing FSRM concurring
equation 1 if pictures of a similar picture class, generally unaltered; at that point, to the picture I,
altering the weights of relating FSRM agreeing recipe 2 if pictures of a similar picture class; last, to
the picture I −, changing weights of relating FSRM agreeing equation 3 if pictures of a similar
picture class, generally unaltered;

R(i, j)new = R(i, j)old + α(1 − R(i, j)old) (1)


R(i, j)new = R(i, j)old + β(1 − R(i, j)old) (2)
R(i, j)new = R(i, j)old − δ(1 − R(i, j)old) (3)

Where,α, β, δ speak to the level of increment or decrease of weight, here α = 0.3, β = 0.1, δ = 0.6

Step 5: after the constrained preparing learning through the progression 2-4, the heaviness of each
of the picture class FSRM, it change the esteem all the more near reality semantic from the
underlying value(0.5), so there are comparable importance among the pictures of each picture
class. At that point alter the heaviness of FSRM as indicated by the learning utilize the calculation
to some extent 2.3, to enhance recovery comes about;

Step 6: go to step 2 to begin the following cycle as indicated by the client's example picture, after
the constrained criticism, go to step 5 to changing the heaviness of each picture class;

Step 7: restore the most comparable pictures concurring the weight esteem (the bigger the weight
the more comparative);

3.4 Re-Ranking based on sematic signature

The client gives a question watchword as information and set of pictures important to the
given inquiry catchphrase are recovered by the web index as indicated by put away word-picture
list record. The client chooses one question picture that matches with the client's pursuit intension
from the recovered picture pool. The picture re-positioning is finished by utilizing semantic marks.
The semantic space of the pictures to be re-positioned can be limited by utilizing the inquiry

6
Journal of research in engineering and its applications
Vol.1, Issue. 2, (2018), pp. 152-162

watchword. The picture chose by the client is taken as hunt picture and the semantic mark for this
picture is figured.

The semantic marks are the visual highlights of picture. The separation between the
pursuit picture semantic mark and the semantic mark of different pictures in semantic space are
ascertained utilizing the Euclidean separation. The separation of the hunt picture semantic mark to
a similar picture in semantic space is zero and the separations are least for those pictures which are
like the question picture. By utilizing this outcome we, get the re-positioned set of pictures.
Pictures are re-positioned by contrasting their semantic marks and semantic marks got from
semantic spaces got from inquiry catchphrase.

3.5 Semantic Signatures

Given M reference classes for catchphrase q and their preparation pictures naturally
recovered, a multi-class classifier on the visual highlights of pictures is prepared and it yields a M-
dimensional vector p, demonstrating the probabilities of another picture I having a place with
various reference classes. At that point p is utilized as semantic mark of I. The separation between
two pictures Ia and Ib are measured as the L1-remove between their semantic marks dad and pb ,
d (Ia , Ib ) =║ p a − p b ║1 .

4. SIMULATION RESULTS

The performance analysis of the proposed system should be efficient and overall
performance of the system i.e. accuracy, fuzzy semantic relevance grid, time complexity, re-
ranking using semantic signature, recall and precision of semantic search.

4.1 Time complexity


Time complexity is measured as how much time to take while system running and
perform the searching operations.The running time of a Keyword search is proportional to log n
and we say this is aO (log n) algorithm.

4.2 Fuzzy semantic relevance grid

Figure 3 FSRG

Figure 3 shows the fuzzy semantic relevance grid for meantime, min time, max time and
median time. Based on this time the keywords are searched in the cloud storage.

7
Journal of research in engineering and its applications
Vol.1, Issue. 2, (2018), pp. 152-162

4.3 Re-ranking using semantic signature

Figure 4 Re-ranking using semantic search

Figure 4 shows the re ranking technique for semantic search. For example we can search
keyword as “Cloud” the result displayed like cloud in sky, cloud computing, and cloud services,
like that. Semantic search give the exact result whatever client require.

4.4 Recall and precision of semantic search

If keyword is searched in the cloud they obtain high precision which indicate the good
purity of retrieved images that mean selected images are corrected. And the result is correct the
image which is selected.

Correct Not correct

Select TP FP

Not select FN TN

8
Journal of research in engineering and its applications
Vol.1, Issue. 2, (2018), pp. 152-162

Figure 5 Recall and Precision

Figure 5 shows the recall and precision of the semantic search for particular keyword.
Here blue color indicates recall and re color indicates precision.

4.5 Accuracy

Accuracy is calculate by overall performance of the system to search the particular


keyword the result will be the relevant images that can be re-ranked and it shows the accurate
result that can be matched with query request.

Figure 6 Accuracy

Figure 6 shows the accuracy level of different techniques with proposed technique. In
Existing system inquiry development technique (QET) and pertinence criticism technique (RFT) is
compared with proposed system techniques.

5. RELATED WORK

Kuo et al. [5] as of late enlarged each picture with applicable semantic highlights through
engendering over a visual chart and a literary diagram which were corresponded. Sharmanska et al.
enlarged this portrayal with extra measurements and permitted a smooth progress between zero-
shot learning, unsupervised preparing and directed preparing.

9
Journal of research in engineering and its applications
Vol.1, Issue. 2, (2018), pp. 152-162

Parikh and Grauman proposed relative credits to show the quality of a trait in a picture
concerning different pictures. Krishnapuram et al. [6] have proposed FIRST i.e. Fluffy picture
recovery framework which utilizes the fluffy set hypothesis to speak to a picture, similitude
measure and pertinence criticism. To begin with fuses these thoughts. In the first place make
utilization of traits, spatial relations and phonetic questions to deal with the excellent based
graphical representations. Fluffy properties social charts are utilized to speak to the pictures.

Yan et al [7] clarify the pseudo-significance criticism technique for picture re-positioning.
This strategy decreases the client's weight in pertinence input technique. In this technique consider
just best N pictures from the picture pool that acquired from content based picture look. Along
these lines, it decreases the no of pictures for input. Customary techniques for content-construct
picture recovery are situated in light of a vector demonstrate. These techniques speak to a picture
as an arrangement of highlights and the contrast between two pictures is measured through a
Euclidean separation between their component vectors.

In [8] Kovashka proposed the picture look procedure with relative trait input. In this
strategy client depicts which properties of model pictures ought to be balanced keeping in mind the
end goal to all the more intently coordinate his/her mental model of the pictures looked for. At
question time, the framework introduces an underlying arrangement of reference pictures, and the
client chooses among them to give relative property input. Utilizing this reference pictures it
refreshes the significance capacity and pictures in the pool get re-rank. These techniques
emphasize over and again until the point that the best positioned pictures are near the clients
required picture.

Cao et al. [9] grasped the first privacy-preserving multi-keyword ranked search scheme, in
which documents and queries are represented as vectors of dictionary size. With the “coordinate
matching”, the documents are ranked according to the number of matched query keywords.
However, Cao et al. scheme does not consider the importance of the different keywords, and thus is
not accurate enough. In addition, the search efficiency of the scheme is linear with the cardinality
of document collection

Boneh et al. [10] present the first searchable encryption construction, where anyone with
public key can write to the data stored on server but only authorized users with private key can
search. Public key solutions are usually very computationally expensive however. Furthermore, the
keyword privacy could not be protected in the public key setting since server could encrypt any
keyword with public key and then use the received trapdoor to evaluate this ciphertext.

6.CONCLUSION AND FUTURE WORK

These research work deals about the image retrieval in cloud computing also solve some
existing issues. Multi keyword search is the query given to the system that searches the image
which is relevance to the query given by the user. And also re-ranked the searched images through
semantic search which give exact result and finally provide the dynamically updating. The
proposed system providesimage re-ranking using semantic signature but the matching efficiency is
improved and efficient result. In future, to provide the security for Multikeyword search and also
provide privacy for the data user interacting in the cloud environment then the result should be
secure data sharing and provide accuracy and efficiency to the system.

10
Journal of research in engineering and its applications
Vol.1, Issue. 2, (2018), pp. 152-162

REFERENCES
[1] ] P. Mell and T. Grance, “The NIST Definition of Cloud Computing,”
http://csrc.nist.gov/publications/nistpubs/800-145/SP800-145.pdf, US Nat’l Inst. of Science and Technology,
2011.

[2] Aakib F. Bagwan, Bharti A.Gupta et al, “Web Based Image search Using Semantic Signature Re-ranking
Technique”International Journal on Recent and Innovation Trends in Computing and Communication ISSN:
2321-8169 Volume: 3 Issue: 1 Pg. 52 – 56

[3] J. Philbin, M. Isard, J. Sivic, and A. Zisserman,.” Descriptor Learning for Efficient Retrieval.” In Proc.
ECCV, 2010

[4] J. Cui, F. Wen, and X. Tang, “Real time google and live image search re-ranking,” in Proc. ACM
Multimedia, 2008

[5] Y. Kuo, W. Cheng, H. Lin, and W. Hsu, Unsupervised semantic feature discovery for image object retrieval
and tag refinement, IEEE Trans on Multimedia, vol.14, pp.10791090, 2012.

[6] Krishnapuram, R., Medasani, S., Jung, S. H., Choi, Y. S., & Balasubramaniam, R. (2004). Content-based
image retrieval based on a fuzzy approach. Knowledge and Data Engineering, IEEE Transactions on, 16(10),
1185-1199.

[7] R Yan, E Hauptmann and R Jin, Multimedia search with pseudo-relevance feedback, Proceeding of
International Conference on Image and Video Retrieval, 2003, 2728, 238-247.

[8] A Kovashka, D Parikh and K Grauman, Whittle Search: Image Search with Relative Attribute Feedback,
Proceeding of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), In CVPR, 2012.

[9] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy-preserving multi-keyword ranked search over
encrypted cloud data,” in Proc. IEEE INFOCOM, Apr. 2011, pp. 829–837.

[10] D. Boneh, G.D. Crescenzo, R. Ostrovsky, and G. Persiano, “Public Key Encryption with Keyword
Search,” Proc. Int’l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT), 2004.

[11] Sayali Baxi, S.V.Dabhade,” Re-ranking of Images using Semantic Signatures with Duplicate Images
Removal & K-means clustering “,International Journal Of Engineering And Computer Science ISSN:2319-
7242 Volume 3 Issue 5 may, 2014 Page No. 6122-6127

[12] Pawandeep Saini, Hardeep Singh,” Live Cloud based dynamic Fuzzy Semantic Relevance Matrix based
CBIR”, International Journal of Advanced Research in Computer Science, Volume 6, No. 5, May - June 2015

[13] Savvas A Chatzichristofis and Yiannis S Boutalis, FCTH: Fuzzy Color And Texture Histogram: A Low
LevelFeature for Accurate Image Retrieval, IEEE 9th International Workshop on Image Analysis for
MultimediaInteractive Services, 2008, 191-196

[14] J Cui, F Wen and X Tang, Real Time Google and Live Image Search Re-Ranking, Proceeding of 16th
ACMInternational Conference on Multimedia,Vancouver, British Columbia, Canada, 2008

[15] Z. Xia, X. Wang, X. Sun, and Q. Wang, “A secure and dynamic Multikeyword ranked Search scheme
over encrypted cloud data,” IEEE Trans. Parallel Distrib. Syst., vol. 27, no. 2, pp. 340–352, Feb. 2016, doi:
10.1109/TPDS.2015.2401003

[16] N. Rasiwasia, P. J. Moreno, and N. Vasconcelos.” Bridging the gap:Query by semantic example. IEEE
Trans.” on Multimedia, 2007.

11
Journal of research in engineering and its applications
Vol.1, Issue. 2, (2018), pp. 152-162

[17]Xiaogang Wang, Shi Qiu, Ke Liu and Xiaoou Tang, Web Image Re-Ranking Using Query- Specific
SemanticSignature, IEEE Transactions on Pattern Analysis and Machine Intelligence, 2014, 36 (4), 810-823.

[18] A Kovashka, D Parikh and K Grauman, Whittle Search: Image Search with Relative Attribute
Feedback,Proceeding of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), In CVPR,
2012.

12

Vous aimerez peut-être aussi