Improving image tags by exploiting web search results

Automatic image tagging automatically assigns image with semantic keywords called tags, which significantly facilitates image search and organization. Most of present image tagging approaches are constrained by the training model learned from the training dataset, and moreover they have no exploitation on other type of web resource (e.g., web text documents). In this paper, we proposed a search based image tagging algorithm (CTSTag), in which the result tags are derived from web search result. Specifically, it assigns the query image with a more comprehensive tag set derived from both web images and web text documents. First, a content-based image search technology is used to retrieve a set of visually similar images which are ranked by the semantic consistency values. Then, a set of relevant tags are derived from these top ranked images as the initial tag set. Second, a text-based search is used to retrieve other relevant web resources by using the initial tag set as the query. After the denoising process, the initial tag set is expanded with other tags mined from the text-based search result. Then, an probability flow measure method is proposed to estimate the probabilities of the expanded tags. Finally, all the tags are refined using the Random Walk with Restart (RWR) method and the top ones are assigned to the query images. Experiments on NUS-WIDE dataset show not only the performance of the proposed algorithm but also the advantage of image retrieval and organization based on the result tags.     

Refining search results using a mining framework

Today’s major search engines return ranked search results that match the keywords the user specifies. There have been many proposals to rank the search results such that they match the user’s intentions and needs more closely. Despite good advances during the past decade, this problem still requires considerable research, as the number of search results has become ever larger. We define the collection of each search result and all the Web pages that are linked to the result as a search-result drilldown. We hypothesize that by mining and analyzing the top terms in the search-result drilldown of search results, it may be possible to make each search result more meaningful to the user, so that the user may select the desired search results with higher confidence. In this paper, we describe this technique, and show the results of preliminary validation work that we have done.     

Improving search results with data mining in a thematic search engine

The problem of obtaining relevant results in web searching has been tackled with several approaches. Although very effective techniques are currently used by the most popular search engines when no a priori knowledge on the user's desires beside the search keywords is available, in different settings it is conceivable to design search methods that operate on a thematic database of web pages that refer to a common body of knowledge or to specific sets of users. We have considered such premises to design and develop a search method that deploys data mining and optimization techniques to provide a more significant and restricted set of pages as the final result of a user search. We adopt a vectorization method based on search context and user profile to apply clustering techniques that are then refined by a specially designed genetic algorithm. In this paper we describe the method, its implementation, the algorithms applied, and discuss some experiments that has been run on test sets of web pages.     

Integrating bilingual search results for automatic junk image filtering

Keyword-based image search engines are now very popular for accessing large amounts of Web images on the Internet. Most existing keyword-based image search engines may return large amounts of junk images (which are irrelevant to the given query word), because the text terms that are loosely associated with the Web images are also used for image indexing. The objective of the proposed work is to effectively filter out the junk images from image search results. Therefore, bilingual image search results for the same keyword-based query are integrated to identify the clusters of the junk images and the clusters of the relevant images. Within relevant image clusters, the results are further refined by removing the duplications under a coarse-to-fine structure. Experiments for a large number of bilingual keyword-based queries (5,000 query words) are simultaneously performed on two keyword-based image search engines (Google Images in English and Baidu Images in Chinese), and our experimental results have shown that integrating bilingual image search results can filter out the junk images effectively.     

Interactive browsing via diversified visual summarization for image search results

Presenting and browsing image search results play key roles in helping users to find desired images from search results. Most existing commercial image search engines present them, dependent on a ranked list. However, such a scheme suffers from at least two drawbacks: inconvenience for consumers to get an overview of the whole result, and high computation cost to find desired images from the list. In this paper, we introduce a novel search result summarization approach and exploit this approach to further propose an interactive browsing scheme. The main contribution of this paper includes: (1) a dynamic absorbing random walk to find diversified representatives for image search result summarization; (2) a local scaled visual similarity evaluation scheme between two images through inspecting the relation between each image and other images; and (3) an interactive browsing scheme, based on a tree structure for organizing the images obtained from the summarization approach, to enable users to intuitively and conveniently browse the image search results. Quantitative experimental results and user study demonstrate the effectiveness of the proposed summarization and browsing approaches.     

Web search enhancement by mining user actions

Search engines are among the most popular as well as useful services on the web. There is a need, however, to cater to the preferences of the users when supplying the search results to them. We propose to maintain the search profile of each user, on the basis of which the search results would be determined. This requires the integration of techniques for measuring search quality, learning from the user feedback and biased rank aggregation, etc. For the purpose of measuring web search quality, the “user satisfaction” is gauged by the sequence in which he picks up the results, the time he spends at those documents and whether or not he prints, saves, bookmarks, e-mails to someone or copies-and-pastes a portion of that document. For rank aggregation, we adopt and evaluate the classical fuzzy rank ordering techniques for web applications, and also propose a few novel techniques that outshine the existing techniques. A “user satisfaction” guided web search procedure is also put forward. Learning from the user feedback proceeds in such a way that there is an improvement in the ranking of the documents that are consistently preferred by the users. As an integration of our work, we propose a personalized web search system.     

Document image decoding by heuristic search

This correspondence describes an approach to reducing the computational cost of document image decoding by viewing it as a heuristic search problem. The kernel of the approach is a modified dynamic programming (DP) algorithm, called the iterated complete path (ICP) algorithm, that is intended for use with separable source models. A set of heuristic functions are presented for decoding formatted text with ICP. Speedups of 3-25 over DP have been observed when decoding text columns and telephone yellow pages using ICP and the proposed heuristics     

Design and implementation of a web mining system for organizing search engine results

We present the design and implementation of a web mining system that creates a hierarchical clustering of web documents retrieved by commercial web search engines. The cluster hierarchy is produced by a novel method called the Cluster Hierarchy Construction Algorithm (CHCA) and it can be used to explore the topics of interest related to the search query and their relationships. We discuss important design issues for our system, including stemming and dimensionality reduction, as well as some implementation details. We show examples of system results, compare them with results from similar systems, and analyze the responses to a survey of the system's users. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 607–625, 2005.     

基于Web日志的个性化搜索引擎模型的发现*

个性化搜索是指同样的关键字对不同的人返回其感兴趣的搜索结果。对于不同的用户个体,同样的关键字可能有不同含义,如关键字“apple”被爱好音乐的人士理解为Apple iPod,但也会被健康饮食的人士理解为apple fruit。每次用户搜索关键字的过程,都会被记录在网站服务器的后台日志中。通过若干挖掘算法,将Web原始日志信息进行用户识别,会话分组后,提取单一用户多次会话中的搜索关键字关联规则,为实现个性化搜索引擎提供参考。     

Mental image search by boolean composition of region categories

Existing content-based image retrieval paradigms almost never address the problem of starting the search, when the user has no starting example image but rather a mental image. We propose a new image retrieval system to allow the user to perform mental image search by formulating boolean composition of region categories. The query interface is a region photometric thesaurus which can be viewed as a visual summary of salient regions available in the database. It is generated from the unsupervised clustering of regions with similar visual content into categories. In this thesaurus, the user simply selects the types of regions which should and should not be present in the mental image (boolean composition). The natural use of inverted tables on the region category labels enables powerful boolean search and very fast retrieval in large image databases. The process of query and search of images relates to that of documents with Google. The indexing scheme is fully unsupervised and the query mode requires minimal user interaction (no example image to provide, no sketch to draw). We demonstrate the feasibility of such a framework to reach the user mental target image with two applications: a photo-agency scenario on Corel Photostock and a TV news scenario. Perspectives will be proposed for this simple and innovative framework, which should motivate further development in various research areas.

Efficient KNN search by linear projection of image clusters

K‐nearest neighbors (KNN) search in a high‐dimensional vector space is an important paradigm for a variety of applications. Despite the continuous efforts in the past years, algorithms to find the exact KNN answer set at high dimensions are outperformed by a linear scan method. In this paper, we propose a technique to find the exact KNN image objects to a given query object. First, the proposed technique clusters the images using a self‐organizing map algorithm and then it projects the found clusters into points in a linear space based on the distances between each cluster and a selected reference point. These projected points are then organized in a simple, compact, and yet fast index structure called array‐index. Unlike most indexes that support KNN search, the array‐index requires a storage space that is linear in the number of projected points. The experiments show that the proposed technique is more efficient and robust to dimensionality as compared to other well‐known techniques because of its simplicity and compactness. © 2011 Wiley Periodicals, Inc.     

On image search result aggregation

In text retrieval, search result aggregation has been demonstrated how it has outperformed the retrieval results by single retrieval models. In general, search result aggregation for a specific query is based on combining different search results, which are produced by using different feature representations and/or different retrieval models. Particularly, several well-known combination methods, such as Borda count and CombSUM, have been proposed in the literature. However, in image retrieval the semantic gap problem limits the performances of current image retrieval systems. Since very few studies focus on search result aggregation in image retrieval, the aim of this paper is to assess the retrieval performances of different search result aggregation strategies and combination methods. Specifically, five different feature representations, five different distance functions as the retrieval models, and five different combination methods are used. Our experimental results based on Caltech 101, Caltech 256, and NUS-WIDE-LITE show that search result aggregation can definitely outperform single search results. In addition, among three aggregation strategies the one by combining five search results based on each best feature representation by their best distance function can provide the highest rate of precision rate.     

Mobile multi-view object image search

High user interaction capability of mobile devices can help improve the accuracy of mobile visual search systems. At query time, it is possible to capture multiple views of an object from different viewing angles and at different scales with the mobile device camera to obtain richer information about the object compared to a single view and hence return more accurate results. Motivated by this, we propose a new multi-view visual query model on multi-view object image databases for mobile visual search. Multi-view images of objects acquired by the mobile clients are processed and local features are sent to a server, which combines the query image representations with early/late fusion methods and returns the query results. We performed a comprehensive analysis of early and late fusion approaches using various similarity functions, on an existing single view and a new multi-view object image database. The experimental results show that multi-view search provides significantly better retrieval accuracy compared to traditional single view search.     

Using manual and automated annotations to search images by semantic similarity

Finding semantically similar images is a problem that relies on image annotations manually assigned by amateurs or professionals, or automatically computed by some algorithm using low-level image features. These image annotations create a keyword space where a dissimilarity function quantifies the semantic relationship among images. In this setting, the objective of this paper is two-fold. First, we compare amateur to professional user annotations and propose a model of manual annotation errors, more specifically, an asymmetric binary model. Second, we examine different aspects of search by semantic similarity. More specifically, we study the accuracy of manual annotations versus automatic annotations, the influence of manual annotations with different accuracies as a result of incorrect annotations, and revisit the influence of the keyword space dimensionality. To assess these aspects we conducted experiments on a professional image dataset (Corel) and two amateur image datasets (one with 25,000 Flickr images and a second with 269,648 Flickr images) with a large number of keywords, with different similarity functions and with both manual and automatic annotation methods. We find that Amateur-level manual annotations offers better performance for top ranked results in all datasets (MP@20). However, for full rank measures (MAP) in the real datasets (Flickr) retrieval by semantic similarity with automatic annotations is similar or better than amateur-level manual annotations.     

Improving image mining through Geoprocessing

Geoprocessing Information Systems (GIS) deal with structured information concerned some geographical localization. So one uses three-dimensional image representation systems in a huge database, where it is possible to insert many data about some interest domain, say, agriculture, economics, industry, demographics and so on. Images are powerful information sources that can soundly support decision making processes. An image can be seen as a set of elements with spatial localization and color. To interpret an image includes deriving clusters and relations between such elements. This article proposes an integration of Geoprocessing and Image Mining to support image based decisions in several domains such as healthcare.     

利用SIFT特征的非对称匹配图像拼接盲检测

复制粘贴伪造图像鉴定检测图像中的疑似相似区域。传统的逐像素或逐块的鉴定方式耗时冗长。提出一种利用SIFT(尺度不变特征转换)特征的非对称搜索的复制粘贴伪造图像盲检测算法,算法利用图像SIFT特征初步定位复制粘贴伪造疑似区域,利用非对称特征搜索方式进行方向性的特征匹配,准确定位复制粘贴伪造区域。实验结果表明,本文算法能够准确检测复制粘贴伪造区域,检测结果不受高斯、椒盐等噪声的影响,检测效率比传统算法提高了1～2个数量级。     

Preference-oriented mining techniques for location-based store search

With the development of wireless telecommunication technologies, a number of studies have been done on the issues of location-based services due to wide applications. Among them, one of the active topics is the location-based search. Most of previous studies focused on the search of nearby stores, such as restaurants, hotels, or shopping malls, based on the user’s location. However, such search results may not satisfy the users well for their preferences. In this paper, we propose a novel data mining-based approach, named preference-oriented location-based search (POLS), to efficiently search for k nearby stores that are most preferred by the user based on the user’s location, preference, and query time. In POLS, we propose two preference learning algorithms to automatically learn user’s preference. In addition, we propose a ranking algorithm to rank the nearby stores based on user’s location, preference, and query time. To the best of our knowledge, this is the first work on taking temporal location-based search with automatic user preference learning into account simultaneously. Through experimental evaluations on the real dataset, the proposed approach is shown to deliver excellent performance.