ISBN: 978-15-086565-24

Date: 22.3.2015
INTERNATIONAL CONFERENCE ON EMERGING TRENDS IN ENGINEERING RESEARCH

Retrieval Of Exact Images By Voting,Clustering And

Indexing
K.Komathi,M.Latha.
Vels University,Pallavaram,Chennai,India.
mail2vkomathi@gmail.com,lathasrec@gmail.com

AbstractDay by day there is a very steep increase in digital media devices. So the number of photos shared on web is also
high. Among those shared photos only some of the images are uploaded with names properly. Many of them are untagged. To
overcome this, faces need to be annotated automatically. It is a challenging task to annotate an image by searching weakly
named images from internet based on detecting and recognizing the faces. Some approaches are used to name images. Those
approaches include Search-based face annotation (SBFA), which searches the available untagged images on the web (WWW).
SBFA approach aims to effectively assign names to noisy and incomplete facial images. Another approach to assign name is
unsupervised label refinement (ULR), which filters the names of facial images on the web. And further to improve the scalability, a clustering-based approximation algorithm is used.
Keywords Facial annotation, content-based image retrieval, machine learning, label refinement, web facial images, weakly labeled, search based face annotation, Non-tagged image.

I.INTRODUCTION
With the tremendous increase in the development of digital devices such as digicam and scanners [1], a photograph
taken by humans also increases. They share these photographs through social websites. But they are not shared with
names. It is a tedious task to organize the photographs by annotating those using commercial products [1].A new technique to retrieve images is done using content-based image retrieval (CBIR) [2]. Content-based image retrieval is the
method of retrieving images by using their content (QBIC) [2]. Content-based visual information retrieval (CBVIR) [2]
is the method to search images from large databases, thus solving image retrieval problem. The model-based face annotation technique has some limitations [3]. The major limitation is, it took more time to collect images from database and
also it requires more cost to do this. Then, it is more difficult for generalizing the technique when new data or new persons are added. Finally, achieves poor scalability when number of persons increases [4]. To overcome the above limitations, images uploaded on the web must be automatically annotated. Automatic facial annotation is important technique
which automatically gives name of relevant person. This technique has more benefits in many real world applications.
Many users upload their photos on social websites such as face book, twitter, etc. These photos are not annotated properly. Likewise, there are large numbers of untagged images on social websites. To annotate those images, Search Based
Facial Annotation paradigm is used [3]. Instead of using model-based face annotation approaches, we use search-based
face annotation (SBFA) paradigm [4].This paradigm uses content-based image retrieval (CBIR) technique [4] to automatically name the images. The SBFA framework is based on data and does not depend on models. The main objective of
SBFA is to assign names for a given query image correctly [4].From a database that contains only the untagged images,
we shortlist top K most images that are similar and then by getting votes on the names associated with those top K images, we annotate them[3], [4]. But the limitation with SBFA paradigm is to effectively use the advantage of shortlisted
images and their weak names. The effectiveness can be achieved by developing a search-based face annotation scheme.
Without any manual efforts, we pull out the names homogeneously from the strength less data using unsupervised label
refinement (URL) scheme. In order to improve the efficiency and to perform this for a large number of images, clustering-based approximation (CBA) algorithm is used [3], [4].
II.RELATED WORKS
Different researches have been performed on face annotation in searching non tagged facial images which are present
over internet. Human name is given as input query and we need to get consistent facial images as output. One group focuses on recognizing and verifying the faces, which exists in classical research problems in recognition of pattern. Next
group focuses on generic image annotation. In classical method, they use some object recognition techniques to identify
the similarities and relationship between image and the input text. For example, with a label similarity graph and random
walk principle [5], Wang et al. proposed to purify the results obtained by traditional technique. Similarly, with an iterative label propagation scheme [6], Pham et al.[6] recommended to name the untagged images that exists in video frames.
Another group focuses on annotating the faces of personal/ family/social photos. Personal photos contain personal
names, things that happen in society, geographical information and time when the photo is captured which are associated
with the images. For example, commercial products such as Apple iPhoto, Google Picasa, Microsoft EasyAlbum[7],
[8]and Facebook face auto tagging solution achieve a good naming results.

IAETSD 2015

http://www.iaetsd.in/proc-22.3.2015.html

ISBN: 978-15-086565-24
Date: 22.3.2015
INTERNATIONAL CONFERENCE ON EMERGING TRENDS IN ENGINEERING RESEARCH

Another group focuses in searching non-tagged facial images on the web to annotate them. Ozkan and Duygulu [9]
recommended a graph-based model to find the sub-graph with more density as a result for the input image. Berg et al.
[10] recommended a possibility model aggregated with clustering algorithm to measure the correlation between the images and the names associated with images. For the images and its corresponding caption in the same document, Guillaumin et al. [11] recommended to repeatedly rejuvenate the assignment based on a least cost matching algorithm.
Last group focuses on clarifying facial images, which aims to analyze inaccurate web images for identifying faces[10].
For a large and preliminary set, a consistency learning method [12] is applied for searching text-image in sequence or
simultaneously on the web.
III.CONTENT BASED IMAGE RETRIEVAL
"Content-based" means searching the figure based on their content instead of searching the image based on metadata
or descriptions associated with the image [2]. "Content" may be pixel, structure, contrast, or any other information that
appears on the image itself [2].

Figure 1. Reveals the flow of the proposed scheme of content based image retrieval
It consists of the following steps:
1. Collecting data;
2. Detecting and extracting the features of images;
3. Indexing the extracted features of images using high dimensions;
4. Filtering the images from database;
5. Retrieval of similar faces; and
6. Annotating the retrieved similar faces by majority voting using filtered names.
Before the analysis phase of a naming task, the first four steps are performed and at the time of analysis phase of a
naming task, the last two steps are performed [4]. The first process is the accumulation of data about facial images. Using
web search engine, images of the person are collected according to a name list from Google [4]. As a result, this step
contains facial images with some human names. These facial images do not contain the right human name. So they are
called as inaccurately named images. The second process is preprocessing facial images on web to obtain information
related to the face such as finding and arranging, region separation, and component illustration. Unsupervised face
alignment technique [13] is used for finding and adjustment of faces. The third step is tabulating the obtained components of the faces. This is done by locality sensitive hashing (LSH)[14], a very familiar and powerful high-dimensional
indexing technique to fetch the similar faces only. In the last three phases [4], first we fetch group of most similar faces
i.e. top k images from the previously tabulated facial database. By majority voting [4] approach, the facial image is defined with a name by combining the set of names associated with these top K images.

IAETSD 2015

http://www.iaetsd.in/proc-22.3.2015.html

ISBN: 978-15-086565-24
Date: 22.3.2015
INTERNATIONAL CONFERENCE ON EMERGING TRENDS IN ENGINEERING RESEARCH

IV.CLUSTERING BASED APPROXIMATION

The clustering approach can be done in two different levels [4]: one is at image-level, which separate all the n facial
images into a set of group, and the other is on name-level, which separate the m names into a set of group, then divide
the retrieval database into different groups. The number of facial images n is larger than the number of names m. So clustering on image-level takes more time than clustering on name-level. Thus, to achieve extensibility and performance
name level clustering scheme is used. After this, ULR [13] is applied to each group and then combine the entire outcome obtained into the final upgraded label matrix F.
A.CLUSTERING ALGORITHM WITH POSSIBILITY MODEL
Berg et al. [10] presents the combination of a possibility model with grouping algorithm. This presents the correlation
between the tagged images and the detected names in the same document. A simple clustering method will caption new
images and automatically links them with their name. To improve the performance, clustering process is combined with
possibility model. By combining clustering method and possibility model there will be accurate labeled set of faces.
This method works only on particular data set. We can apply it on free text on webpage using simple image representation and context model.
B.GRAPH BASED APPROACH
Ozkan and Duygulu [9] revealed a graph-based model to find the sub-graph with more density as related outcome. He
also revealed a method to collaborate names and faces of people given as query. In most situations the queried person
will have large number of similar images which differs in pose, direction, position. He illustrated the graph based method
to find the possible subset of faces with query person name.
Guillaumin et al. [11] imported an alternative method to implement the condition that a face is only characterized
once in an image. There are two scenarios of naming persons in database for finding face of person and assigning name
to all faces. To improve this there are two constraints: geometrical constraint and unique matching constraint [9] which
identifies similar points in subset of images. In future, it is extended to multi-person naming.
C. QUERY EXPANSION
T. Mensink and J.J. Verbeek [11]uses query expansion to improve the performance of name-based scheme. They are
excited in catching peoples figure on the web and also in naming new ones. The text base initial results are not perfect.
To improve such poor performance, they proposed query expansion technique [9]. They applied this idea on early suggested technique which purifies the basic outcome set using Gaussian mixture modeling and logistic discriminant model
[9]. The query expansion is improving the performance in both methods.
D. PURIFY WEB FACIAL IMAGES
The objective is to correct unclear web images for face identification functions [10], [12]. These works are suggested
as a basic preprocessing step in the entire system without using current techniques. T.L. Berg, A.C. Berg et al.[10]applied
a modified k means clustering approach to clean the unclear facial images.
Consistency learning proposed to create face model for popular person on the network as an uncertain signal of similarity and learn consistent face model from large and noisy training sets. At last key faces are selected by clustering to get
compact and rough representation. The effectiveness in increase is due to representing key face and removing duplicate
key face. They used the unsupervised machine learning techniques [13] and propose a graph-based label refinement [9]
algorithm to improve the label nature over the entire retrieval database.
Z. Wu, Q. Ke, J. Sun, and H.-Y. Shum [15] mainly focused the face retrieval problem, by using local and global features which propose an effective image representation. In future we need to design a supervised learning algorithm [11]to
automatically represent the image. This in turn will improve the visible word terminology for face. In order to tabulate,
special properties of the face is converted into visible words using a novel identity-based quantization [15] scheme to
analyze the local features. A very small hamming signature (40 bytes) is used to conceal the global feature for each face.
While retrieving, using the inverted index of visual words, images are retrieved. Then using the hamming signature, a
new multi-reference distance is calculated.

IAETSD 2015

http://www.iaetsd.in/proc-22.3.2015.html

ISBN: 978-15-086565-24
Date: 22.3.2015
INTERNATIONAL CONFERENCE ON EMERGING TRENDS IN ENGINEERING RESEARCH

E. RETRIEVAL BASED FACE ANNOTATION

D. Wang, S.C.H. Hoi, Y. He. And J. Zhu [4] revealed WLRLCC algorithm which aims in getting more features for the
top images from each query. Face annotation based on retrieving is used in searching a large amount of web facial images to automatically annotate a face. There are two challenges first is how effectively retrieves similar facial images.
Second is how to effectively perform annotation. They proposed weak label regularized local coordinate coding
(WLRLCC) technique and algorithm .This algorithm boosts the work of face annotation approach based on retrieval on a
large scale web facial image.
D. Wang, S.C.H. Hoi, and Y. He et al. [4] proposed a system by combining both transductive and inductive learning
technique to search images for annotating a face. They proposed Weak label Laplacian support vector machine (WLLapSVM) algorithm by adopting WLRLCC algorithm [4].
V.APPLICATIONS
Face annotation finds its application in the field of [3]:
Annotating images in social websites.
Extracting the exact image from public database.
Macro scale and micro scale annotation of face.
Wild landmark face annotation.
Online managing of photo albums.
VI.CONCLUSION
This paper presents face annotation techniques for web facial images. Now-a-days many new approaches are emerging
in the field of Auto Face Annotation. Many research issues have been highlighted and direction for future work has been
suggested. Many open issues have been highlighted by the researchers such as dealing with auto face annotation on large
scale databases by different technique. Future work will be on duplicate person name and different learning technique to
enhance labels quality.
REFERENCES
[1]

[2]
[3]
[4]
[5]
[6]

[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]

IAETSD 2015

L. Chen, Automated annotation of human faces in family albums, pp. 25, 2003.
J. Eakins, Content based image retrieval, 2014.
S. Pa. Rahul Jadhav, A survey on mining weakly labeled web images, IEEE Trans. Knowl. Data Eng., vol. 26, no. 1, pp.
166179, 2014.
D. Wang, S. C. H. Hoi, Y. He, and J. Zhu, Mining weakly labeled web facial images for search-based face annotation, IEEE
Trans. Knowl. Data Eng., vol. 26, no. 1, pp. 166179, 2014.
T. Pagerank, C. Ranking, and B. Order, 1. Introduction and Motivation 2. A Ranking for Every Page on the Web, pp. 117,
1998.
B. Heverlee, Naming persons in news video with label propagation Phi The Pham , Marie-Francine Moens Katholieke Universities Leuven Department of Computer Science Tinne Tuytelaars Katholieke Universities Leuven ESAT - PSI Kasteelpark
Arenberg 10, 2010.
J. Cui, F. Wen, R. Xiao, Y. Tian, and X. Tang, EasyAlbum: An interactive photo annotation system based on face clustering
and re-ranking , pp. 367376, 2007.
Y. Tian, W. Liu, R. Xiao, F. Wen, and X. Tang, A face annotation framework with partial clustering and interactive labeling,
2007 IEEE Conf. Comput. Vis. Pattern Recognit., pp. 18, Jun. 2007.
D. Ozkan and P. Duygulu, A graph based approach for naming faces in news photos, Proc. IEEE Comput. Soc. Conf. Comput. Vis. Pattern Recognit., vol. 2, pp. 14771482, 2006.
T. L. Berg, A. C. Berg, J. Edwards, M. Maire, R. White, Y. Teh, E. Learned-miller, and D. A. Forsyth, Names and faces in the
news.
M. Guillaumin, T. Mensink, J. Verbeek, C. Schmid, and C.S.Automatic, Automatic face naming with caption-based supervision, 2011.
J. Yagnik, H. Adam, and D. Bau, Large scale learning and recognition of faces in web videos, 2008 8th IEEE Int. Conf. Autom. Face Gesture Recognit., no. 1, pp. 17, Sep. 2008.
J. Zhu, K. U. Leuven, and S. C. H. Hoi, Unsupervised face alignment by robust nonrigid mapping, no. 1.
W. Dong, Z. Wang, W. Josephson, M. Charikar, and K. Li, Modeling LSH for performance tuning, Proceeding 17th ACM
Conf. Inf. Knowl. Min. - CIKM 08, p. 669, 2008.
Z. Wu, Q. Ke, J. Sun, and H. Y. Shum, Scalable face image retrieval with identity-based quantization and multireference reranking, IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 10, pp. 19912001, 2011.

http://www.iaetsd.in/proc-22.3.2015.html