IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v15y2023i2p70-d1064160.html
   My bibliography  Save this article

Im2Graph: A Weakly Supervised Approach for Generating Holistic Scene Graphs from Regional Dependencies

Author

Listed:
  • Swarnendu Ghosh

    (Department of CSE (AIML), Institute of Engineering and Management, Kolkata 700091, WB, India
    Department of CSE, Jadavpur University, Kolkata 700032, WB, India)

  • Teresa Gonçalves

    (Department of Informatics, University of Évora, 7000-671 Évora, Portugal)

  • Nibaran Das

    (Department of CSE, Jadavpur University, Kolkata 700032, WB, India)

Abstract

Conceptual representations of images involving descriptions of entities and their relations are often represented using scene graphs. Such scene graphs can express relational concepts by using sets of triplets ⟨ s u b j e c t — p r e d i c a t e — o b j e c t ⟩ . Instead of building dedicated models for scene graph generation, our model tends to extract the latent relational information implicitly encoded in image captioning models. We explored dependency parsing to build grammatically sound parse trees from captions. We used detection algorithms for the region propositions to generate dense region-based concept graphs. These were optimally combined using the approximate sub-graph isomorphism to create holistic concept graphs for images. The major advantages of this approach are threefold. Firstly, the proposed graph generation module is completely rule-based and, hence, adheres to the principles of explainable artificial intelligence. Secondly, graph generation can be used as plug-and-play along with any region proposition and caption generation framework. Finally, our results showed that we could generate rich concept graphs without explicit graph-based supervision.

Suggested Citation

  • Swarnendu Ghosh & Teresa Gonçalves & Nibaran Das, 2023. "Im2Graph: A Weakly Supervised Approach for Generating Holistic Scene Graphs from Regional Dependencies," Future Internet, MDPI, vol. 15(2), pages 1-21, February.
  • Handle: RePEc:gam:jftint:v:15:y:2023:i:2:p:70-:d:1064160
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/15/2/70/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/15/2/70/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Nikita Andriyanov, 2022. "Application of Graph Structures in Computer Vision Tasks," Mathematics, MDPI, vol. 10(21), pages 1-14, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:15:y:2023:i:2:p:70-:d:1064160. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.