MUST: An Effective and Scalable Framework for Multimodal Search of Target Modality
We investigate the problem of multimodal search of target modality, where the task involves enhancing a query in a specific target modality by integrating information from auxiliary modalities. The goal is to retrieve relevant objects whose contents in the target modality match the specified multimo...
Gespeichert in:
Hauptverfasser: | , , , , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We investigate the problem of multimodal search of target modality, where the
task involves enhancing a query in a specific target modality by integrating
information from auxiliary modalities. The goal is to retrieve relevant objects
whose contents in the target modality match the specified multimodal query. The
paper first introduces two baseline approaches that integrate techniques from
the Database, Information Retrieval, and Computer Vision communities. These
baselines either merge the results of separate vector searches for each
modality or perform a single-channel vector search by fusing all modalities.
However, both baselines have limitations in terms of efficiency and accuracy as
they fail to adequately consider the varying importance of fusing information
across modalities. To overcome these limitations, the paper proposes a novel
framework, called MUST. Our framework employs a hybrid fusion mechanism,
combining different modalities at multiple stages. Notably, we leverage vector
weight learning to determine the importance of each modality, thereby enhancing
the accuracy of joint similarity measurement. Additionally, the proposed
framework utilizes a fused proximity graph index, enabling efficient joint
search for multimodal queries. MUST offers several other advantageous
properties, including pluggable design to integrate any advanced embedding
techniques, user flexibility to customize weight preferences, and modularized
index construction. Extensive experiments on real-world datasets demonstrate
the superiority of MUST over the baselines in terms of both search accuracy and
efficiency. Our framework achieves over 10x faster search times while attaining
an average of 93% higher accuracy. Furthermore, MUST exhibits scalability to
datasets containing more than 10 million data elements. |
---|---|
DOI: | 10.48550/arxiv.2312.06397 |