Query expansion for content-based similarity search using local and global features

Michael E. Houle, Xiguo Ma, Vincent Oria, Jichao Sun

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


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.

Original languageEnglish (US)
Article number25
JournalACM Transactions on Multimedia Computing, Communications and Applications
Issue number3
StatePublished - Jun 2017

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Computer Networks and Communications


  • Content-based similarity search
  • Flexible aggregation
  • Query expansion
  • Subjective feature space
  • Unsupervised feature selection


Dive into the research topics of 'Query expansion for content-based similarity search using local and global features'. Together they form a unique fingerprint.

Cite this