ﺑﺮﭼﺴﺐزﻧﯽ ﻣﻘﯿﺎس ﭘﺬﯾﺮ ﺗﺼﺎوﯾﺮ ﺑﺎ ﺧﻼﺻﻪﺳﺎزي ﻧﻤﻮﻧﻪ ﻫﺎ ﺑﻪ ﻧﻤﺎﯾﻨﺪهﻫﺎي ﺑﺮﭼﺴﺐدار

Scalable Image Annotation by Summarizing Training Samples into Labeled Prototypes

با افزايش روز‌افزون تصاوير، انديس‌گذاري و جستجوي سريع آنها در پايگاه داده‌هاي بزرگ، يك امر ضروري است. يكي از راه‌كارهاي مؤثر، نسبت‌دادن يك يا چند برچسب به هر تصوير با هدف توصيف محتواي درون آن است. با وجود كارايي روش‌هاي خودكار برچسب‌زني، يكي از چالش‌هاي اساسي آنها مقياس‌پذيري با افزايش تصاوير پايگاه داده است. در اين مقاله، با هدف حل اين چالش، ابتدا براساس توصيف‌گر بصري تصاوير كه از شبكه‌هاي يادگيري عميق استخراج مي‌شوند،‌ نمايندگان مناسبي به‌دست مي‌آيند. سپس، با استفاده از رويه انتشار برچسب بر روي گراف، برچسب­‌هاي معنايي از تصاوير آموزشي به نمايندگان منتشر مي‌شوند. با اين راه‌كار، به يك مجموعه نمايندگان برچسب‌دار دست خواهيم يافت كه مي‌توان عمل برچسب‌زني هر تصوير آزمون را بر اساس اين نمايندگان انجام داد. براي برچسب‌زني، يك رويكرد مبتني بر آستانه‌گذاري وفقي پيشنهاد شده است. با روش پيشنهادي، مي‌توان اندازه مجموعه‌داده آموزشي را به 22/6 درصد اندازه اوليه كاهش داد كه منجر به تسريع حداقل 4/2 برابري زمان برچسب‌زني خواهد شد. همچنين، كارايي برچسب­زني بر روي مجموعه‌داده‌­هاي مختلف برحسب سه معيار دقت، يادآوري و F1 در حد مطلوبي حفظ شده است.

By increasing the number of images, it is essential to provide fast search methods and intelligent filtering of images. To handle images in large datasets, some relevant tags are assigned to each image to for describing its content. Automatic Image Annotation (AIA) aims to automatically assign a group of keywords to an image based on visual content of the image. AIA frameworks have two main stages; Feature Extraction and Tag Assignment which are both important in order to reach a proper performance. In the first stage of our proposed method, we utilize deep models to obtain a visual representation of images. We apply different pre-trained architectures of Convolutional Neural Networks (CNN) to the input image including Vgg16, Dense169, and ResNet 101. After passing the image through the layers of CNN, we obtain a single feature vector from the layer before the last layer, resulting into a rich representation for the visual content of the image. One advantage of deep feature extractor is that it substitutes a single feature vector instead of multiple feature vectors and thus, there is no need for combining multiple features. In the second stage, some tags are assigned from training images to a test image which is called “Tag Assignment”. Our approach for image annotation belongs to the search-based methods which have high performance in spite of simple structure. Although it is even more time-consuming due to its method of comparing the test image to every training in order to find similar images. Despite the efficiency of automatic Image annotation methods, it is challenging to provide a scalable method for large-scale datasets. In this paper, to solve this challenge, we propose a novel approach to summarize training database (images and their relevant tags) into a small number of prototypes. To this end, we apply a clustering algorithm on the visual descriptors of training images to extract the visual part of prototypes. Since the number of clusters is much smaller than the number of images, a good level of summarization will be achieved using our approach. In the next step, we extract the labels of prototypes based on the labels of input images in the dataset. because of this, semantic labels are propagated from training images to the prototypes using a label propagation process on a graph. In this graph, there is one node for each input image and one node for each prototypes. This means that we have a graph with unio‎n of input images and prototypes. Then, to extract the edges of graph, the visual feature of each node on graph is coded using other nodes to obtain its K-nearest neighbors. This goal is achieved by using Locality-constraints Linear Coding algorithm. After construction the above graph, a label propagation algorithm is applied on the graph to extract the labels of prototypes. Based on this approach, we achieve a set of labeled prototypes which can be used for annotating every test image. To assign tags for an input image, we propose an adaptive thresholding method that finds the labels of a new image using a linear interpolation from the labels of learned prototypes. The proposed method can reduce the size of a training dataset to 22.6% of its original size. This issue will considerably reduce the annotation time such that, compared to the state-of-the-art search-based methods such as 2PKNN, the proposed method is at least 4.2 times faster than 2PKNN, while the performance of annotation process in terms of Precision, Recall and F1 will be maintained on different datasets.