Target Graph Matching for Building Reconstruction
نویسنده
چکیده
We present a building reconstruction approach, which is based on a target graph matching algorithm to relate laser data with building models. Establishing this relation is important for adding building knowledge to the data. Our targets are topological representations of the most common roof structures which are stored in a database. Laser data is segmented into planar patches. Topological relations between segments, in terms of intersection lines and height jumps, are represented in a building roof graph. This graph is matched with the graphs from the database. Segments and intersection lines that do not fit to an existing target roof topology will be removed from the automated reconstruction approach. For the geometric reconstruction our approach is flexible to use information from data and/or model. For specific object parts it might be better to use model constraints as the data might not appropriately represent the object. As our approach combines data and model driven techniques, we speak of an object driven reconstruction approach. We present our algorithm using airborne laser scanner data with about 15 pts/m. Existing 2D map data with scale 1:1000 has been used for selection of building segments, for outlining flat building roofs and to reconstruct walls.
منابع مشابه
Building Reconstruction by Target Based Graph Matching on Incomplete Laser Data: Analysis and Limitations
With the increasing point densities provided by airborne laser scanner (ALS) data the requirements on derived products also increase. One major application of ALS data is to provide input for 3D city models. Modeling of roof faces, (3D) road and terrain surfaces can partially be done in an automated manner, although many such approaches are still in a development stage. Problems in automatic bu...
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملTarget recognition via 3D object reconstruction from image sequence and contour matching
This paper proposes an automatic target recognition (ATR) system based on the three-dimensional (3D) reconstruction of the target from an image sequence. The main contribution of this work is twofold: (1) we present a modi®ed voxel coloring reconstruction algorithm and (2) we employ the 3D reconstructed target model to generate the front and side target templates at zero depression angle to be ...
متن کاملBuilding Reconstruction: The Dilemma of Generic Versus Specific Models
Automatic building extraction from images is a particularly hard object recognition problem, because both the image data and the models to be reconstructed reveal a high complexity. Whereas models have to be generic in order to fit most of the observable different building shapes they also have to be building specific to discriminate buildings from other objects in the images. This situation de...
متن کامل