Topological models for boundary representation: a comparison with n-dimensional generalized maps
Computer-Aided Design - Beyond solid modelling
Detection of Interest Points for Image Indexation
VISUAL '99 Proceedings of the Third International Conference on Visual Information and Information Systems
A large database of graphs and its use for benchmarking graph isomorphism algorithms
Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
Applied Graph Theory in Computer Vision and Pattern Recognition (Studies in Computational Intelligence)
Protein classification by matching and clustering surface graphs
Pattern Recognition
IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Approximate graph edit distance computation by means of bipartite graph matching
Image and Vision Computing
A Polynomial Algorithm for Submap Isomorphism
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Polynomial algorithms for open plane graph and subgraph isomorphisms
Theoretical Computer Science
| Hi-index | 0.00 |
In order to use structural techniques from graph-based pattern recognition, a first necessary step consists in extracting a graph in an automatic way from an image. We propose to extract plane graphs, because of algorithmic properties these graphs have for isomorphism related problems. We also consider the problem of extracting semantically wellfounded graphs as a compression issue: we get simple graphs from which can be rebuilt images similar to the initial image. The technique we introduce consists in segmenting the original image, extracting interest pixels on the segmented image, then converting these pixels into pointels, which in turn can be related by region-based triangulation. We show the feasibility and interest of this approach in a series of experiments.