Semantic Image Collection Summarization With Frequent Subgraph Mining

被引:3
|
作者
Pasini, Andrea [1 ]
Giobergia, Flavio [1 ]
Pastor, Eliana [1 ]
Baralis, Elena [1 ]
机构
[1] Politecn Torino, Dept Control & Comp Engn, I-10129 Turin, Italy
关键词
Frequent subgraph mining; image collection summarization; panoptic segmentation; scene graphs;
D O I
10.1109/ACCESS.2022.3229654
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Applications such as providing a preview of personal albums (e.g., Google Photos) or suggesting thematic collections based on user interests (e.g., Pinterest) require a semantically-enriched image representation, which should be more informative with respect to simple low-level visual features and image tags. To this aim, we propose an image collection summarization technique based on frequent subgraph mining. We represent images with a novel type of scene graphs including fine-grained relationship types between objects. These scene graphs are automatically derived by our method. The resulting summary consists of a set of frequent subgraphs describing the underlying patterns of the image dataset. Our results are interpretable and provide more powerful semantic information with respect to previous techniques, in which the summary is a subset of the collection in terms of images or image patches. The experimental evaluation shows that the proposed technique yields non-redundant summaries, with a high diversity of the discovered patterns.
引用
收藏
页码:131747 / 131764
页数:18
相关论文
共 50 条
  • [21] Frequent subgraph mining in outerplanar graphs
    Horvath, Tamas
    Ramon, Jan
    Wrobel, Stefan
    DATA MINING AND KNOWLEDGE DISCOVERY, 2010, 21 (03) : 472 - 508
  • [22] MARGIN: Maximal frequent subgraph mining
    Thomas, Lini T.
    Valluri, Satyanarayana R.
    Karlapalem, Kamalakar
    ICDM 2006: SIXTH INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2006, : 1097 - +
  • [23] Enhancing Recommender Systems with Semantic User Profiling through Frequent Subgraph Mining on Knowledge Graphs
    Jung, Haemin
    Park, Heesung
    Lee, Kwangyon
    APPLIED SCIENCES-BASEL, 2023, 13 (18):
  • [24] Grasping frequent subgraph mining for bioinformatics applications
    Aida Mrzic
    Pieter Meysman
    Wout Bittremieux
    Pieter Moris
    Boris Cule
    Bart Goethals
    Kris Laukens
    BioData Mining, 11
  • [25] A New Framework of Frequent Uncertain Subgraph Mining
    Moussaoui, Mohamed
    Zaghdoud, Montaceur
    Akaichi, Jalel
    KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS (KES-2018), 2018, 126 : 413 - 422
  • [26] Discriminative frequent subgraph mining with optimality guarantees
    Thoma M.
    Cheng H.
    Gretton A.
    Han J.
    Kriegel H.-P.
    Smola A.
    Song L.
    Yu P.S.
    Yan X.
    Borgwardt K.M.
    Statistical Analysis and Data Mining, 2010, 3 (05): : 302 - 318
  • [27] A new algorithm for mining maximal frequent subgraph
    Wang, Zhisong
    Chai, Ran
    Journal of Computational Information Systems, 2010, 6 (02): : 469 - 476
  • [28] Efficient Frequent Subgraph Mining in Transactional Databases
    Welke, Pascal
    2020 IEEE 7TH INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS (DSAA 2020), 2020, : 307 - 314
  • [29] Mining Frequent Subgraph by Incidence Matrix Normalization
    Wu, Jia
    Chen, Ling
    JOURNAL OF COMPUTERS, 2008, 3 (10) : 109 - 115
  • [30] A Distributed Approach to Weighted Frequent Subgraph Mining
    Babu, Nisha
    John, Ansamma
    IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGICAL TRENDS IN COMPUTING, COMMUNICATIONS AND ELECTRICAL ENGINEERING (ICETT), 2016,