Object Recognition in Floor Plans by Graphs of White Connected Components

被引:0
|
作者
Barducci, Alessio [1 ]
Marinai, Simone [1 ]
机构
[1] Univ Florence, DSI, I-50121 Florence, Italy
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we describe the object location module of a complete floor plan understanding system. The approach relies on a Region Adjacency Graph (RAG) whose nodes correspond to connected components of the background. Two types of node attributes are proposed and are used to locate and recognize objects similar to the models or to generalize the recognition to different shapes. The tests are made on two benchmark datasets and on one collection of floor plans downloaded from Internet and containing heterogeneous images.
引用
收藏
页码:298 / 301
页数:4
相关论文
共 50 条
  • [41] A study of connectivity on dynamic graphs: computing persistent connected components
    Mathilde Vernet
    Yoann Pigné
    Éric Sanlaville
    4OR, 2023, 21 : 205 - 233
  • [42] A study of connectivity on dynamic graphs: computing persistent connected components
    Vernet, Mathilde
    Pigne, Yoann
    Sanlaville, Eric
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2023, 21 (02): : 205 - 233
  • [43] Anti-Ramsey Numbers of Graphs with Small Connected Components
    Shoni Gilboa
    Yehuda Roditty
    Graphs and Combinatorics, 2016, 32 : 649 - 662
  • [44] A Distributed Algorithm for Identifying Strongly Connected Components on Incremental Graphs
    Srinivasan, S.
    Khanda, A.
    Srinivasan, S.
    Pandey, A.
    Das, S. K.
    Bhowmick, S.
    Norris, B.
    2023 IEEE 35TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING, SBAC-PAD, 2023, : 109 - 118
  • [45] Fast Connected Components Computation in Large Graphs by Vertex Pruning
    Lulli, Alessandro
    Carlini, Emanuele
    Dazzi, Patrizio
    Lucchese, Claudio
    Ricci, Laura
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2017, 28 (03) : 760 - 773
  • [46] Enumerating k-Vertex Connected Components in Large Graphs
    Wen, Dong
    Qin, Lu
    Zhang, Ying
    Chang, Lijun
    Chen, Ling
    2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2019), 2019, : 52 - 63
  • [47] Connected Components in Random Graphs with Given Expected Degree Sequences
    Fan Chung
    Linyuan Lu
    Annals of Combinatorics, 2002, 6 (2) : 125 - 145
  • [48] On computing the 2-vertex-connected components of directed graphs
    Jaberi, Raed
    DISCRETE APPLIED MATHEMATICS, 2016, 204 : 164 - 172
  • [49] MapReduce Preprocess of Big Graphs for Rapid Connected Components Detection
    Abdolazimi, Reyhaneh
    Heidari, Maryam
    Esmaeilzadeh, Armin
    Naderi, Hassan
    2022 IEEE 12TH ANNUAL COMPUTING AND COMMUNICATION WORKSHOP AND CONFERENCE (CCWC), 2022, : 112 - 118
  • [50] Anti-Ramsey Numbers of Graphs with Small Connected Components
    Gilboa, Shoni
    Roditty, Yehuda
    GRAPHS AND COMBINATORICS, 2016, 32 (02) : 649 - 662