Improving One-stage Visual Grounding by Recursive Sub-query Construction
원문 초록
We improve one-stage visual grounding by addressing current limitations on grounding long and complex queries. Existing one-stage methods encode the entire language query as a single sentence embedding vector, e.g., taking the embedding from BERT or the hidden state from LSTM. This single vector representation is prone to overlooking the detailed descriptions in the query. To address this query modeling deficiency, we propose a recursive sub-query construction framework, which reasons between image and query for multiple rounds and reduces the referring ambiguity step by step. We show our new one-stage method obtains 5.0%, 4.5%, 7.5%, 12.8% absolute improvements over the state-of-the-art one-stage baseline on ReferItGame, RefCOCO, RefCOCO+, and RefCOCOg, respectively. In particular, superior performances on longer and more complex queries validates the effectiveness of our query modeling.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Contrastive Prompting Enhances Sentence Embeddings in LLMs through Inference-Time Steering
Information Leakage of Sentence Embeddings via Generative Embedding Inversion Attacks
IPCGRL: Language-Instructed Reinforcement Learning for Procedural Level Generation
Intrinsic vs. Extrinsic Evaluation of Czech Sentence Embeddings: Semantic Relevance Doesn't Help with MT Evaluation
Factors affecting the in-context learning abilities of LLMs for dialogue state tracking
Mechanistic Decomposition of Sentence Representations
토론
이 논문과 연결된 포럼 글이 아직 없습니다.