PofoliaShared via Pofolia

ACM Transactions on Multimedia Computing Communications and Applications· 2026Q1

Multimodal LLM-based Query Paraphrasing for Video Search

Jiaxin Wu, Chong‐Wah Ngo, Wing-Kwong Chan, Sheng-hua Zhong et al.

Short summary

This paper introduces a multimodal LLM approach to paraphrase video search queries, transforming them into simpler terms and decomposing complex ones to overcome out-of-vocabulary issues and improve retrieval accuracy.

AI-generated from the title and abstract; the full text is not read.

Key points

  • Leverages multimodal LLMs (T2T, T2I, I2T) to paraphrase video search queries.
  • Addresses out-of-vocabulary problems by rephrasing abstract concepts into simpler terms.
  • Decomposes complex queries into sub-queries to handle logical and spatial constraints.
  • Introduces a consistency-based verification strategy to mitigate LLM hallucination.
  • Demonstrates improved ad-hoc and known-item video search performance on TRECVid datasets.

AI-generated from the title and abstract; the full text is not read.

Abstract

Text-to-video retrieval answers user queries through searches based on concepts and embeddings. However, due to limitations in the size of the concept bank and the amount of training data, answering queries in the wild is not always effective because of the out-of-vocabulary problem. Furthermore, neither concept-based nor embedding-based search can perform reasoning to consolidate search results for complex queries that include logical and spatial constraints. To address these challenges, we leverage large language models (LLMs) to paraphrase queries using text-to-text (T2T), text-to-image (T2I), and image-to-text (I2T) transformations. These transformations rephrase abstract concepts into simpler terms to mitigate the out-of-vocabulary problem. Additionally, complex relationships within a query can be decomposed into simpler sub-queries, improving retrieval performance by effectively fusing the search results of these sub-queries. To mitigate the issue of LLM hallucination, this paper also proposes a novel consistency-based verification strategy to filter out factually incorrect paraphrased queries. Extensive experiments are conducted for ad-hoc video search and known-item search on the TRECVid datasets. We provide empirical insights into how traditionally difficult-to-answer queries can be effectively resolved through query paraphrasing.

The authors' abstract, as published at the source. ACM Transactions on Multimedia Computing Communications and Applications, 2026 · DOI ↗

TakeawaysPremium
Ask the paperFree account

Continue with a free account

Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.

Continue free on the web

Sign in with Google or Apple; no card needed. You come back to this paper.

On your phone:

Field: Information Systems

Information SystemsComputer Science