International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 4 Issue: 11 292 294

_______________________________________________________________________________________________
A Search Based Face Annotation (SBFA) Algorithm for Annotating Frail
Labeled Images
J.Aswani,M.Tech Dr. A Mary Sowjanya,Assistant Professor
Dept. of Computer Science and Systems Engineering Dept. of Computer Science and Systems Engineering
Andhra University College Of Engineering Andhra University College Of Engineering
Visakhapatnam, Andhra Pradesh, India Visakhapatnam, Andhra Pradesh, India
juvva.aswani@gmail.com Sowmaa@yahoo.com

AbstractData mining is the method of extracting valuable data from an over-sized information supply. Currently a days web has gained
additional attention of users with its wealthy interfaces and surplus quantity of knowledge on the market on web. This has earned plenty of
users interest in extracting plenty of helpful data but its still restricted with a number of the resources extraction like frail labeled facial
pictures. This paper mainly investigates a novel framework of search-based face annotation by mining frail tagged facial pictures that are freely
available on the web. One major limitation is how effectively we can perform annotation by exploiting the list of most similar facial pictures and
their weak labels that are usually vague and incomplete. To resolve this drawback, we have a tendency to propose a unsupervised label
refinement (ULR) approach for refining the labels of web facial pictures. A clustering-based approximation algorithmic rule which might
improve the quantifiable significantly is implemented. In this paper we've enforced a replacement search supported image search i.e. Image is
taken as input instead of text keyword and also the output is additionally retrieved within the sorted list of image, If the input image is matched
with any of the of pictures in image sound unit. Also ranking is given to images based on user views.

Keywords- Face annotation, frailed images, web mining, face detection, indexing, image search.
__________________________________________________*****_________________________________________________

I. INTRODUCTION refinement (URL) scheme by hiking machine learning

Now a days popularity of various digital cameras
and the rapid growth of social media for internet-based photo
sharing, recent years have witnessed an explosion of the
number of digital photos captured and stored by users. In most
cases photos shared by users on the web are facial images.
Some facial images are label with names, but many of them
are not labeled properly. This motivated to an important
technique that is annotate facial images automatically. This
can be useful to many applications on web and online photo-
sharing sites can automatically labels user uploaded photos to
provide online photo search
A novel search-based annotation for giving label to facial
image by mining the web, where a huge number of weakly
labeled facial images are available freely in internet .The novel
SBFA aims to the automated face annotation task by taking
the advantage of content-based image retrieval (CBIR)
techniques in mining the huge amount of frailed facial images
on the internet. The SBFA framework is model-free and data-
driven. The main motive of NSBFA is to assign correct name
labels to a given facial image query. For given a novel facial
image for annotation, first we have to retrieve a short list of
top K most same facial image pixels from a weakly labeled
facial image database, and then annotate the facial image by
the labels associated with the top K facial images of same
pixel value.
One challenge faced by novel SBFA algorithm is how
to effectively exploit the short list of candidate facial images
and their weak labels for the face name annotation task. To
overcome this, we use a search-based face annotation scheme.
In intense, we recommend a novel unsupervised label
IJRITCC | November 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
techniques to adorn the labels purely from the weakly labeled
data without having any effort of human. We also propose a
clustering- based approximation (CBA) algorithm to improve
the efficiency. We can also provide facility to search by giving
input in the form of image. In extend to this based on user
views ranking is given to images.
II. METHODOLOGY
A. Exisisting System
In the Existing system, object recognition techniques is
used to train classification models from human-tagged
training images or attempt to show the correlation between
annotated keywords and images. Given limited training data,
semi-supervised learning methods have been used for image
annotation in classical classification models.
Limitations
1. Local binary system cant find clear images.
2. Weakly appeared images are difficult to identify
in the existing system.
3. There were no previous methods to match the
images by giving image as an input in the
system.
4. Always may not produce accurate results.
B. Problem Statement
We implement a promising search based face annotation
scheme by mining large amount of weakly labeled facial
images freely available on the internet. We propose a ULR
scheme for enhancing label quality via low-rank learning and
approach graph-based. ASIC encryption/ decryption process
would remain unchanged in the proposed system.
292
International Journal on Recent and Innovation Trends in Computing and Communication
Volume: 4 Issue: 11
_______________________________________________________________________________________________
We have 3 important modules in this process:
1. Content-Based Image Search
In this module we are giving the input query as image and
get group images as output. Query by image content (QBIC)
method is used and it is the application of computer vision to
the image retrieval.
2. Face Annotation:
The classical image annotation approaches usually apply
some extant object recognition techniques to train
classification models on human-labeled training images or
attempt to infer the correlation/ probabilities between images
and annotated keywords
3. Face Annotation Performance On Database:
The experiment aims to verify the annotation performance
of the proposed NSBFA over a database. The test database is
unchanged, If we upload new facial images in the database
those are also displayed facial retrieval result for each query
image.
III. ALGORITHMS
A. SBFA (Search Based Face Annotation)
In SBFA algorithm, whenever an image is uploaded then
K similar images are extracted and annotation is performed.
Flow of SBFA
Collecting facial image data
Facial face detection and feature extraction
Indexing for facial features
Refine weakly labelled data using URL
Face retrieval
Fig: Flow of SBFA
Algorithm:
Step1: Collect Weakly Labeled Images Q= {q1, q2, q3}
Where Q is input query images like q1, q2, q3
Step2: List of names for Annotation = {n1, n2, n3}
Where N is names list for Annotation
Step3: Dataset R=Dataset
IJRITCC | November 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
ISSN: 2321-8169
292 294
Step4: No. of iteration to find optimized image T= {t1, t2,
t3..} Where T is no. of iteration
Step5: Total no of Human names m= {m1, m2, m3}
Where m is total no of human names
Step6: Extracted Facial Image feature XIR
Output
1: Annoted Image X*=Annoted Image
2: Feature Dimensions d= {d1, d2, d3.} Whered is no.
of feature dimensions.
B. Clustering-Based Approximation
The number of variables in the extracted facial image feature
are n * m.
Where
n= number of facial images in the retrieval database.
m= number of distinct names.
In this paper clustering strategy could be applied in two
different phases:
1. One is on image-level, which can be used to
separate all the n facial images into a group of
clusters.
2. Second one is on name-level, which can be used to
First separate the m names into a group of clusters,
after that split the retrieval database into different
subsets according to the name-label clusters.
In this paper k-NN clustering technique is used for clustering
the facial images.
The k-Nearest Neighbors algorithm (k-NN) is used
for classification and regression. In K-NN, the input consists
of the k closest training data.
In k-NN classification, the output is a class member. An object
is classified by a popular voting of its neighbors. If k = 1, then
the object is assigned to the class of that one nearest neighbor.
The property value is the object in k-NN regression. This
value is the average of the value of its k nearest neighbors.
K-NN is a lazy learning, where the function is approximated
locally and all valuation is deferred before classification.
Both for regression and classification, it can be useful to
impute weight to the contributions of the neighbors, lest the
nearest neighbors contribute greater to the average than the
more distant ones.
The nearer objects are taken from a set of objects for which
the object property or class value is known. This can be
thought of as the training set for the algorithm.
CONCLUSION
In this paper a search-based face annotation
framework focused on tackling the critical problem of
enhancing mining large amount of weakly labelled facial
images freely available on the web are refined by using a
293
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 4 Issue: 11 292 294
_______________________________________________________________________________________________
novel ULR algorithm via a graph-based and ranking for
images is given by using low-rank learning approach. To
further improve the scalability, we also implemented a
clustering-based approximation solution. To improve the
quantifiability, cluster rule is additionally enforced, that with
success accelerated the improvement task while not
introducing any performance degradation. Finally the
projected system concludes that potency of the system is
higher than different face annotation ways.

REFERENCES
[1] J. Zhu, S.C.H. Hoi, and M.R. Lyu, Face Annotation Using
Transductive Kernel Fisher Discriminant, IEEE Trans.
Multimedia, vol. 10, no. 1, pp. 86-96, Jan. 2008.
[2] D. Wang, S.C.H. Hoi, and Y. He, Mining Weakly Labeled
Web Facial Images for Search-Based Face Annotation,
Proc. 34th Intl ACM SIGIR Conf. Research and
Development in Information Retrieval (SIGIR), 2011
[3] A.W.M. Smeulders, M. Worring, S. Santini, A. Gupta, and
R. Jain, Content-Based Image Retrieval at the End of the
Early Years, IEEE Trans. Pattern Analysis and Machine
Intelligence, vol. 22, no. 12, pp. 1349-1380, Dec. 2000.
[4] S.C.H. Hoi, R. Jin, J. Zhu, and M.R. Lyu, Semi-
Supervised SVM Batch Mode Active Learning with
Applications to Image Retrieval, ACM Trans. Information
Systems, vol. 27, pp. 1-29, 2009.
[5] X.-J. Wang, L. Zhang, F. Jing, and W.-Y. Ma,
AnnoSearch: Image Auto-Annotation by Search, Proc.
IEEE CS Conf. Computer Vision and Pattern Recognition
(CVPR), pp. 14831490, 2006.
[6] J.Y. Choi, W.D. Neve, K.N. Plataniotis, and Y.M. Ro,
Collaborative Face Recognition for Improved Face
Annotation in Personal Photo Collections Shared on Online
Social Networks, IEEE Trans. Multimedia, vol. 13, no. 1,
pp. 14-28, Feb. 2011

294
IJRITCC | November 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________