Query Expansion for Content-Based Similarity Search Using Local and Global Features

Author:

Houle Michael E.1,Ma Xiguo2,Oria Vincent3,Sun Jichao3

Affiliation:

1. National Institute of Informatics, Tokyo, Japan

2. Google Mountain View, USA

3. New Jersey Institute of Technology, Newark, NJ, USA

Abstract

This article presents an efficient and totally unsupervised content-based similarity search method for multimedia data objects represented by high-dimensional feature vectors. The assumption is that the similarity measure is applicable to feature vectors of arbitrary length. During the offline process, different sets of features are selected by a generalized version of the Laplacian Score in an unsupervised way for individual data objects in the database. Online retrieval is performed by ranking the query object in the feature spaces of candidate objects. Those candidates for which the query object is ranked highly are selected as the query results. The ranking scheme is incorporated into an automated query expansion framework to further improve the semantic quality of the search result. Extensive experiments were conducted on several datasets to show the capability of the proposed method in boosting effectiveness without losing efficiency.

Funder

Kakenhi Kiban (A) Research

Kiban (B) Research

Japan Society for the Promotion of Science

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Hardware and Architecture

Reference43 articles.

1. K. Bache and M. Lichman. 2013. UCI Machine Learning Repository. Retrieved from http://archive.ics.uci.edu/ml. K. Bache and M. Lichman. 2013. UCI Machine Learning Repository. Retrieved from http://archive.ics.uci.edu/ml.

2. Claudio Carpineto and Giovanni Romano. 2012. A survey of automatic query expansion in information retrieval. ACM Comput. Surv. 44 1 (2012). 10.1145/2071389.2071390 Claudio Carpineto and Giovanni Romano. 2012. A survey of automatic query expansion in information retrieval. ACM Comput. Surv. 44 1 (2012). 10.1145/2071389.2071390

3. Total Recall: Automatic Query Expansion with a Generative Feature Model for Object Retrieval

4. Efficient k-nearest neighbor graph construction for generic similarity measures

5. Relevant Feature Selection for Audio-Visual Speech Recognition

Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. RbQE: An Efficient Method for Content-Based Medical Image Retrieval Based on Query Expansion;Journal of Digital Imaging;2023-01-26

2. Implementation of early and late fusion methods for content-based image retrieval;International Journal of ADVANCED AND APPLIED SCIENCES;2021-07

3. LTR-expand: query expansion model based on learning to rank association rules;Journal of Intelligent Information Systems;2020-03-21

4. A Discriminatively Learned CNN Embedding for Person Reidentification;ACM Transactions on Multimedia Computing, Communications, and Applications;2018-01-16

5. Intrinsic Degree: An Estimator of the Local Growth Rate in Graphs;Similarity Search and Applications;2018

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3