English

Bounding and Filling: A Fast and Flexible Framework for Image Captioning

Computer Vision and Pattern Recognition 2023-10-17 v1 Computation and Language

Abstract

Most image captioning models following an autoregressive manner suffer from significant inference latency. Several models adopted a non-autoregressive manner to speed up the process. However, the vanilla non-autoregressive manner results in subpar performance, since it generates all words simultaneously, which fails to capture the relationships between words in a description. The semi-autoregressive manner employs a partially parallel method to preserve performance, but it sacrifices inference speed. In this paper, we introduce a fast and flexible framework for image captioning called BoFiCap based on bounding and filling techniques. The BoFiCap model leverages the inherent characteristics of image captioning tasks to pre-define bounding boxes for image regions and their relationships. Subsequently, the BoFiCap model fills corresponding words in each box using two-generation manners. Leveraging the box hints, our filling process allows each word to better perceive other words. Additionally, our model offers flexible image description generation: 1) by employing different generation manners based on speed or performance requirements, 2) producing varied sentences based on user-specified boxes. Experimental evaluations on the MS-COCO benchmark dataset demonstrate that our framework in a non-autoregressive manner achieves the state-of-the-art on task-specific metric CIDEr (125.6) while speeding up 9.22x than the baseline model with an autoregressive manner; in a semi-autoregressive manner, our method reaches 128.4 on CIDEr while a 3.69x speedup. Our code and data is available at https://github.com/ChangxinWang/BoFiCap.

Keywords

Cite

@article{arxiv.2310.09876,
  title  = {Bounding and Filling: A Fast and Flexible Framework for Image Captioning},
  author = {Zheng Ma and Changxin Wang and Bo Huang and Zixuan Zhu and Jianbing Zhang},
  journal= {arXiv preprint arXiv:2310.09876},
  year   = {2023}
}

Comments

NLPCC2023 Best Paper

R2 v1 2026-06-28T12:51:07.579Z