Recognition of Polymorphic Patterns in Parameterized Graphs for 3D Building Reconstruction

@inproceedings{Englert1997RecognitionOP,
  title={Recognition of Polymorphic Patterns in Parameterized Graphs for 3D Building Reconstruction},
  author={Roman Englert and Armin B. Cremers and J{\"o}rg Seelmann-Eggebert},
  booktitle={GbRPR},
  year={1997}
}
An approach for the recognition of polymorphic patterns by subgraph isomorphism computation of parameterized graphs will be presented. Parameterized graphs (short: p-graphs) are extensions of undirected graphs by parameter vectors at the nodes and edges. We will define p-graphs and basic concepts of subgraph isomorphism computation for p-graphs. A bottom-up algorithm for p-subgraph isomorphism computation according to a given search graph and a template graph will be described. Since the… 
Improving reconstruction of man-made objects from sensor images by machine learning
TLDR
A new approach for the acquisition and analysis of background knowledge which is used for 3D reconstruction of man-made objects -- in this case buildings -- is presented and an upper bound complexity estimation of the computation of p-subisomorphims will be given.
Thirty Years Of Graph Matching In Pattern Recognition
TLDR
This paper will try to characterize the role that graphs play within the Pattern Recognition field, and presents two taxonomies that include almost all the graph matching algorithms proposed from the late seventies and describes the different classes of algorithms.
REDUCING COMPLEXITY OF 3 D OBJECT RECONSTRUCTION DUE TO SYMMETRY OF MODEL KNOWLEDGE
TLDR
The reduction of computational time for matching operations by using symmetrical properties of background knowledge for 3D object reconstruction from images is analyzed and the discussed complexity estimation bound will be improved by the consideration of mirror symmetry.
Image Structure from Monotonic Dual Graph Contraction
TLDR
The focus in this paper is on the description of the neighborhood and the hierarchy of the local extrema of height and the monotonic dual graph contraction process, which computes basic qualitative structure of an image or a landscape from the neighborhood structure of a sampled grid.
Acquisition of Complex Model Knowledge by Domain Theory-Controlled Generalization
TLDR
This paper presents an approach for the learning of complex model knowledge for 3D object reconstruction, and a sample set of three-dimensionally acquired buildings represented as graphs is generalized by the use of background knowledge.
Semi-automatic acquisition of symbolically-annotated 3D-models of office environments
TLDR
Describes a semi-automatic method for acquiring SA3D maps, maps that contain hierarchically structured 3D models of static, task relevant objects in the environment that is implemented and validated on an autonomous mobile robot.
Graph Matching Techniques for Computer Vision
TLDR
The aim of this chapter is to introduce the main graph matching techniques that have been used for computer vision, and to relate each application with the techniques that are most suited to it.
How and Why Pattern Recognition and Computer Vision Applications Use Graphs

References

SHOWING 1-10 OF 12 REFERENCES
P-subgraph Isomorphism Computation and Upper Bound Complexity Estimation
An approach for subgraph isomorphism computation of parameter-ized graphs will be presented. Parameterized graphs (short: p-graphs) are extensions of undirected graphs by parameter vectors at the
An Algorithm for Subgraph Isomorphism
TLDR
A new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search by means of a brute-force tree-search enumeration procedure and a parallel asynchronous logic-in-memory implementation of a vital part of the algorithm is described.
Improving reconstruction of man-made objects from sensor images by machine learning
TLDR
A new approach for the acquisition and analysis of background knowledge which is used for 3D reconstruction of man-made objects -- in this case buildings -- is presented and an upper bound complexity estimation of the computation of p-subisomorphims will be given.
Automatic Extraction of Man-Made Objects from Aerial and Space Images (II)
General Topics and Scene Reconstruction.- An Overview of DARPA's Research Program in Automatic Population of Geospatial Databases.- A Testbed for the Evaluation of Feature Extraction Techniques in a
Combinatorial Optimization: Algorithms and Complexity
This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient
Pattern classification and scene analysis
TLDR
The topics treated include Bayesian decision theory, supervised and unsupervised learning, nonparametric techniques, discriminant analysis, clustering, preprosessing of pictorial data, spatial filtering, shape description techniques, perspective transformations, projective invariants, linguistic procedures, and artificial intelligence techniques for scene analysis.
Inducing Integrity Constraints from Knowledge Bases
TLDR
Integrity constraints are important logical tools for the general organization of knowledge in expert systems and can speed up the query-response time significantly.
Graph theory
Pl umer. Models for Photogrammetric Building Reconstruction
  • Computers & Graphics
  • 1995
...
...