RESEARCH ON EQUIVALNCE OF SPATIAL RELATIONS IN AUTOMATIC PROGRESSIVE CARTOGRAPHIC GENERALIZATION

Similar documents
BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

VISUALIZING SCHEMATIC MAPS THROUGH GENERALIZATION BASED ON ADAPTIVE REGULAR SQUARE GRID MODEL

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Querying by sketch geographical databases. Yu Han 1, a *

Load Balancing for Hex-Cell Interconnection Network

Cluster Analysis of Electrical Behavior

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

UB at GeoCLEF Department of Geography Abstract

Machine Learning: Algorithms and Applications

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

MATHEMATICS FORM ONE SCHEME OF WORK 2004

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1

AN ALGEBRAIC APPROACH TO CONSISTENCY CHECKING BETWEEN CLASS DIAGRAMS

An Optimal Algorithm for Prufer Codes *

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

USING GRAPHING SKILLS

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Loop Permutation. Loop Transformations for Parallelism & Locality. Legality of Loop Interchange. Loop Interchange (cont)

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Pose, Posture, Formation and Contortion in Kinematic Systems

A COMBINED AUTOMATED GENERALIZATION MODEL OF SPATIAL ACTIVE OBJECTS

Loop Transformations for Parallelism & Locality. Review. Scalar Expansion. Scalar Expansion: Motivation

The Study of Remote Sensing Image Classification Based on Support Vector Machine

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

A high precision collaborative vision measurement of gear chamfering profile

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A HOPFIED NEURAL NETWORK ALGORITHM FOR AUTOMATED NAME PLACEMENT FOR POINT FEATURE

Machine Learning 9. week

A Structural Approach to Model Generalisation of an Urban Street Network

Announcements. Supervised Learning

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

Petri Net Based Software Dependability Engineering

A Fuzzy Image Matching Algorithm with Linguistic Spatial Queries

Professional competences training path for an e-commerce major, based on the ISM method

Description of NTU Approach to NTCIR3 Multilingual Information Retrieval

Audio Content Classification Method Research Based on Two-step Strategy

Feature Reduction and Selection

New method of creation data for natural objects in MRDB based on new simplification algorithm

Related-Mode Attacks on CTR Encryption Mode

KNOWLEDGE-BASED TOPOLOGICAL RECONSTRUCTION FOR BUILDING FAÇADE SURFACE PATCHES

An Image Fusion Approach Based on Segmentation Region

Support Vector Machines

UNIT 2 : INEQUALITIES AND CONVEX SETS

Using Fuzzy Logic to Enhance the Large Size Remote Sensing Images

SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB

Research on Course Recommendation Based on Rough Set Xueli Ren1, a *and Yubiao Dai1, b

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST

Available online at Available online at Advanced in Control Engineering and Information Science

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Semantic Image Retrieval Using Region Based Inverted File

Classifier Selection Based on Data Complexity Measures *

A NOTE ON FUZZY CLOSURE OF A FUZZY SET

IMAGE FUSION BASED ON EXTENSIONS OF INDEPENDENT COMPONENT ANALYSIS

An Integrated Information Platform for Intelligent Transportation Systems Based on Ontology

PATTERN CLASSIFICATION APPROACHES TO MATCHING BUILDING POLYGONS AT MULTIPLE SCALES

Centroid Based on Branching Contour Matching for 3D Reconstruction using Beta-spline

SIFT Match Verification by Geometric Coding for Large-Scale Partial-Duplicate Web Image Search

Recommender System based on Higherorder Logic Data Representation

Hierarchical clustering for gene expression data analysis

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

Intra-Parametric Analysis of a Fuzzy MOLP

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Hierarchical Image Retrieval by Multi-Feature Fusion

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

b * -Open Sets in Bispaces

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

On Some Entertaining Applications of the Concept of Set in Computer Science Course

Study of Data Stream Clustering Based on Bio-inspired Model

Today Using Fourier-Motzkin elimination for code generation Using Fourier-Motzkin elimination for determining schedule constraints

Study on Fuzzy Models of Wind Turbine Power Curve

STING : A Statistical Information Grid Approach to Spatial Data Mining

Inverse-Polar Ray Projection for Recovering Projective Transformations

Design of Simulation Model on the Battlefield Environment ZHANG Jianli 1,a, ZHANG Lin 2,b *, JI Lijian 1,c, GUO Zhongwei 1,d

AUTOMATIC RECOGNITION OF TRAFFIC SIGNS IN NATURAL SCENE IMAGE BASED ON CENTRAL PROJECTION TRANSFORMATION

Face Recognition Method Based on Within-class Clustering SVM

A Geometric Approach for Multi-Degree Spline

AN EFFICIENT AND ROBUST GENETIC ALGORITHM APPROACH FOR AUTOMATED MAP LABELING

AN EFFICIENT GENETIC ALGORITHM AND ITS COMPARISON EXPERIMENT FOR AUTOMATIC MAP LABELING

Minimum Cost Optimization of Multicast Wireless Networks with Network Coding

An Improved Image Segmentation Algorithm Based on the Otsu Method

Distance based similarity measures of fuzzy sets

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK

Signature and Lexicon Pruning Techniques

Pruning Training Corpus to Speedup Text Classification 1

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

Local and Global Accessibility Evaluation with Tool Geometry

A Range Image Refinement Technique for Multi-view 3D Model Reconstruction

METHOD FOR DETECTING KEY NODES WHO OCCUPY STRUCTURAL HOLES IN SOCIAL NETWORK SITES

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

A new paradigm of fuzzy control point in space curve

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

User Authentication Based On Behavioral Mouse Dynamics Biometrics

Transcription:

RESEARCH ON EQUIVALNCE OF SPATIAL RELATIONS IN AUTOMATIC PROGRESSIVE CARTOGRAPHIC GENERALIZATION Guo Qngsheng Du Xaochu Wuhan Unversty Wuhan Unversty ABSTRCT: In automatc cartographc generalzaton, the most mportant problem whch must be resolved s to keep the valence of spatal relatons between spatal obects, these spatal relatons are dstance relaton, drectonal relaton, topologcal relatons and so on. Among all these spatal relatons, topologcal relaton s consdered as the relaton that can reflect the best spatal nformaton, so t should be the domnant relaton. Because of ths, t s mportant to keep the valence of topologcal relatons n the progress of automatc progressve cartographc generalzaton. In ths paper, the combnatonal reasonng method s used to represent topologcal relatons, and the valence of topologcal relatons n the process of cartographc generalzaton s dscussed. Besdes these, a method for topologcal relaton abstracton s presented. Combnng wth some rules to deal wth spatal relatons n cartographc generalzaton, valence evaluaton model of topologcal relatons n spatal scene s establshed. Keywords: Progressve cartographc generalzaton, Equvalence, Spatal reasonng, Spatal relaton 1 INTRODUCTION In automatc cartographc generalzaton, the most mportant problem whch must be resolved s to keep the valence of spatal relatons between spatal obects, these spatal relatons are dstance relaton, drectonal relaton, topologcal relatons and so on. Among all these spatal relatons, topologcal relaton s consdered as the relaton that can reflect the best spatal nformaton, so t should be the domnant relaton (Egenhofer and Mark, 1995). Because of ths, t s mportant to keep the valence of topologcal relatons n the progress of automatc progressve cartographc generalzaton. The evaluaton of valence of spatal relatons s very complcated, because the valence of topologcal relatons s nfluenced by many factors, such as the topologcal relaton representaton models, change of dmenson of spatal obects and so on. And some works have been done to dscuss ths problem (Egenhofer and Franzosa 1994, Egenhofer et. al. 1994, Abdelmoty and Jones 1997, Servgen, 2000, Bobzen and Morgenstern 2003). In ths paper, the combnatonal reasonng method s used to represent spatal topologcal relatons (Guo, 2000). Based on ths representaton, the valence of topologcal relatons n the process of cartographc generalzaton s dscussed. 2 COMBINATIONAL REASONING FOR TOPOLOGICAL RELATION Combnatonal reasonng method s manly used to represent topologcal relaton between spatal obects n vector space. The basc dea of ths method s to dvde spatal obects nto elementary cells, for example, n R 2, the elementary cells nclude a pont and a lne segment. By examnng topologcal relatons between these elementary cells and combnatoral reasonng n dfferent levels based on these relatons, topologcal relatons can be ganed (Guo, 2000). In vector space, a regon can be consdered as a close lne, so we need to examne only spatal topologcal relatons between two lnes. Topologcal relatons between a lne and a regon, and between two regons can be represented smlarly. In order to represent topologcal relatons between two lnear obects, one of these s consdered as reference lne, then, we can dstngush dfferent topologcal relatons by checkng nner topologcal relatons and boundary topologcal 1

relatons. There are fve knds of nner topologcal relatons between two lnes,.e., dsont, overlapped meetng, meetng, overlapped crossng and crossng, whch are descrbed n fgure1. overlapped meetng meetng overlapped crossng crossng Fgure1. Four knds of nner topologcal relatons between two lnes At the same tme, there are seven topologcal relatons between nodes of two lnes, see fgure2. Relaton name LLBB1 LLBB2 LLBB3 LLBB4 LLBB5 LLBB6 LLBB7 Fgure representaton Fgure2. Relatons between end ponts of two lnear obects If these basc topologcal relatons appear only one tme at most, there are 56 dfferent topologcal relatons between two lnes by combnatonal reasonng method. 3 EQUIVALENCE OF TOPOLOGICAL RELATION Generally, valency s strong constrant, a hundred percent smlarty s valency (Pava, 1998), however, here we dscuss generalzaton valence or abstracton valence, so the constrant could be loosened. Keepng topologcal relaton valency n spatal abstracton s the basc rrement. The valency s a cogntve valency, namely a smlarty. If the overlapped parts are very short, we can say that overlapped crossng s valent wth crossng n abstracton process, and overlapped meetng s valent wth meetng, see fgure3. Fgure3. Equvalence between nner parts of two lnear obects In order to smplfy topologcal relatons, sometmes we need deletng some nner topologcal relatons f they are nessental. There are three man deleton operatons, ncludng deletng meetng part, deletng one crossng part and deletng two crossng parts, see fgure4. Fgure4. Dfferent types of deleton operatons Accordng to these valent operatons, the valent graph of topologcal relatons could be gotten. Fgure5 s only an example. In the valent graph, real lnes represent valency shown n fgure3, and broken lnes represent valency after deleton operatons. 2

Fgure5. Equvalent graphs of topologcal relatons 4 GENERALIZAITON METHOD OF TOPOLOGICAL RELATION Though topologcal relaton s consdered as a qualtatve relaton, t s necessary to represent them wth some metrcs. In order to abstract spatal topologcal relatons, the metrc features of topologcal relaton must be represented n detals. When topologcal relatons between two spatal obects are complcated, t can be represented wth component sence. A component s an nner topologcal relaton between two lnes, and component sence s a set of all components, whch arrange n terms of certan order. Fgure6 s a component sence of two lnes. Fgure6. Component sence of two lnes Fgure7. Component correlaton regons Each component sence can be expressed wth a component character table. Table1 s the component table of fgure6, where, overlapped meetng, meetng, overlapped crossng and crossng s denoted by T 1, T 0, I 1 and I 0 respectvely. Table1. Component character table of fgure6 Component C 1 C 2 C 3 C 4 C 5 C 6 C 7 C 8 C 9 Type I 0 T 0 I 1 T 1 I 0 I 1 I 0 T 1 I 0 Start and end pont P 1 P 2 (P 31, P 32 ) (P 41, P 42 ) P 5 (P 61, P 62 ) P 7 (P 81, P 82 ) P 9 3

Besdes component sence, we must represent some metrc characters of these components, for example, the length of one-dmenson components, the ntervals between two adacent components, the area of component regon (the regon composed of two lne segments between two components, see fgure7). In topologcal relaton generalzaton, the abstracton operatons nclude deleton, amalgamaton and collapse operaton. The deleton operaton s shown n fgure4. And there are three dfferent amalgamaton operatons, see fgure8. The collapse operaton s the reducton of dmenson of component. Fgure8. Amalgamaton operatons of component In ths paper, a progressve generalzaton method s used to abstract topologcal relatons. The man steps are as follow: frstly, calculate the pertnent metrcs of each component, secondly, calculate the mportance of each component n terms of these metrcs, and determne the most nessental component(s), at last, accordng to mportance of components and shape feature, spatal topologcal relatons are abstracted by deleton, amalgamaton and collapse operatons. 5 EQUIVALENCY EVALUATION MODEL OF TOPOLOGICAL RELATIONS Generally, the progressve cartographc generalzaton methods could keep the generalzaton valency, however, an evaluaton model s needed to check ths valence. Assumng a spatal scene (SB) denotes a set of spatal obects whch has not been generalzed, and SA denotes a set of spatal obects after generalzaton. In SA, the number of spatal obects OA 1, OA 2,, OA m s m, and the topologcal relatons between these obects are denoted by r(oa, OA ) (1 < m= respectvely. Accordng to generalzaton method and valent rules, we can dentfy topologcal relatons generalzed, they are denoted by r (OA, OA ) (1 < m) respectvely. These topologcal relatons may be valent wth r(oa, OA ), or may be not. We can calculate the valency between them by followng formula: EQU ( r( OA ),r ( OA T 1 0,fr( OA )),fr( OA ) r ) r ( OA ( OA Then, the valency of topologcal relatons between SB and SA can be calculated: EQU ( SB,SA ) ACKNOWLEDGEMENT T m m 1 1 1 EQU T ( r( OA m( m 1) 2 ),r ( OA Guo Qngsheng and Du Xaochu are supported by Foundaton for key laboratory of Geo-Informatcs of State Bureau of Surveyng and Mappng. )) ) ) REFERENCE 1. Egenhofer Max J. and Mark D. Nave Geography, In: Spatal Informaton Theory-A Theoretcal Bass for GIS, Internatonal Conference, COSIT 95, Semmerng, Austra, Sprng- Verlag, Berln, pp. 1-15, 1995 2. Egenhofer Max J. and Robert D. Franzosa. On the valence of topologcal relatons, Internatonal Journal of Geographcal Informaton Systems, 1994, 8(6): 133-152 3. Egenhofer Max J., Clementn Elseo and Paolno D Felce. Evaluatng nconsstences among multple 4

representatons, Sxth Internatonal Symposum on Spatal Data Handng, Ednburgh, Scotland, September 1994, 901-920 4. Abdelmoty Ala I. and Jones Chrs B. Towards mantanng consstency of spatal databases, Proceedngs of the sxth nternatonal conference on nformaton and knowledge management, Las Vegas Nevada, Unted States, 1997, page. 293-300 5. Bobzen M. and Morgenstern D. Abstractng and formalzng model generalzaton, ICA ffth Workshop on Progress n Automated Map Generalzaton, Pars, Aprl 28-30, 2003 6. Sylve Servgen, Therry Ubeda, Alan Purcell and Robert Laurn. A methodology for spatal consstency mprovement of geographc databases, GeoInformatca, 2000, 4:1, 7-34 7. Joao Argemro de Carvalho Pava. Topologcal valence and smlarty n mult-representaton geographc database, Doctor Thess, Unversty of Mane, December 1998 8. Guo Qngsheng. Combnatoral representaton of spatal relatonshps on 2D vector map, Acta Geodaetca et Cartographca Snca, 2000, 29(2): 155-160 (n Chnese) 5