A Modified Graph Representation for Room Layout Matching using Spectral Embedding

Abstract

Graph matching is efficient to retrieve similar layout from the huge size of architectural layout. Since floor plan matching using spectral embedding is popular and its computational time is only in seconds. However, the weakness of this method is the isomorphism of each floor plan that reduces accuracy in the matching process. In this paper, we propose a modified graph representation for room layout matching using spectral embedding. General graph representations of the floor plan assume the node as rooms and the edge as the connection between rooms. In addition, the spectral embedding aims to find the descriptor of each floor plan by ignoring the semantic of rooms. We also consider both room semantic that is the connection between the area outside and inside the room, and the structure of each layout. Moreover, we mathematically proved that adding an extra node can handle the isomorphism of a graph by eigenvalue testing. Our proposed method consists of three processes: i) floor plan extracting, ii) appended topology graph and iii) floor plan matching. The performance from our experiment shows that our proposed method can increase the matched accuracy from the conventional method for about 35.44 percent.