Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Annotation Propagation in Large Image Databases via Dense Image Correspondence

Annotation Propagation in Large Image Databases via Dense Image Correspondence

Thumbnail Image
Download
Name

ECCV12-annotation.pdf

Description
Accepted version
Size

6.66 MB

Format

Adobe PDF

Checksum (MD5)

7a1a0495483b260b8908983329ecbf5e

sword-2019-05-28T15:23:56.original.xml (130 B)
Original SWORD entry document
Author(s)
Rubinstein, Michael
•
Liu, Ce
•
Freeman, William T.
Date Issued
2012
Publisher
Springer Nature
Citation
Rubinstein, Michael, Liu, Ce and Freeman, William T. 2012. "Annotation Propagation in Large Image Databases via Dense Image Correspondence."
Version
Author's final manuscript
Abstract
Our goal is to automatically annotate many images with a set of word tags and a pixel-wise map showing where each word tag occurs. Most previous approaches rely on a corpus of training images where each pixel is labeled. However, for large image databases, pixel labels are expensive to obtain and are often unavailable. Furthermore, when classifying multiple images, each image is typically solved for independently, which often results in inconsistent annotations across similar images. In this work, we incorporate dense image correspondence into the annotation model, allowing us to make do with significantly less labeled data and to resolve ambiguities by propagating inferred annotations from images with strong local visual evidence to images with weaker local evidence. We establish a large graphical model spanning all labeled and unlabeled images, then solve it to infer annotations, enforcing consistent annotations over similar visual patterns. Our model is optimized by efficient belief propagation algorithms embedded in an expectation-maximization (EM) scheme. Extensive experiments are conducted to evaluate the performance on several standard large-scale image datasets, showing that the proposed framework outperforms state-of-the-art methods. © 2012 Springer-Verlag.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/137567
DOI of Published Version
https://doi.org/10.1007/978-3-642-33712-3_7
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.