26-1-2016 Challenge the future Delft University of Technology Peter van Oosterom STW User Committee meeting, Oracle, Utrecht, 19 September 2012 Explanation.

Slides:



Advertisements
Similar presentations
February 19 th 2008 Developing a vario-scale IMGeo using the constrained tGAP structure MSc thesis presentation Arjen Hofman.
Advertisements

電腦視覺 Computer and Robot Vision I
Label placement Rules, techniques. Labels on a map Text, name of map features No fixed geographical position Labels of point features (0-dim), line features.
GIS UPDATE? ARE YOU TAKING NOTES? How will you remember what you did if you do not take notes. Lab 9 this week: Music Festival 3: Vector Analysis.
Geographic Information Systems Applications in Natural Resource Management Chapter 8 Combining and Splitting Landscape Features, and Merging GIS Databases.
ESRM 250 & CFR 520: Introduction to GIS © Phil Hurvitz, KEEP THIS TEXT BOX this slide includes some ESRI fonts. when you save this presentation,
1 Enviromatics Spatial database systems Spatial database systems Вонр. проф. д-р Александар Маркоски Технички факултет – Битола 2008 год.
Transaction.
Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.
Computing Stable and Compact Representation of Medial Axis Wenping Wang The University of Hong Kong.
Péter Borosán Rutgers University Doug DeCarlo Rutgers University Andrew Nealan Rutgers University Yotam Gingold George Mason University Ming Jin Rutgers.
The Vuel Concept: Towards a new way to manage Multiple Representations in Spatial Databases ISPRS / ICA Workshop Multi-Scale Representations of Spatial.
CS 128/ES Lecture 4b1 Spatial Data Formats.
CSE351/ IT351 Modeling And Simulation Choosing a Mesh Model Dr. Jim Holten.
Vlasios Voudouris, Jo Wood, Peter Fisher giCentre, Department of Information Science, City University, London, UK Collaborative geoVisualization: Object-Field.
1 On ‘Line graphs’ and Road Networks Peter Bogaert, Veerle Fack, Nico Van de Weghe, Philippe De Maeyer Ghent University.
Filling Arbitrary Holes in Finite Element Models 17 th International Meshing Roundtable 2008 Schilling, Bidmon, Sommer, and Ertl.
1XXII International Cartographic Conference, A Coruña, July 9-16th, 2005 Modelling Cartographic Relations for Categorical Maps Moritz Neun and Stefan Steiniger.
Learning to Extract Form Labels Nguyen et al.. The Challenge We want to retrieve and integrate online databases We want to retrieve and integrate online.
Chapter 3 2D AND 3D SPATIAL DATA REPRESENTATIONS 김 정 준.
Quality-driven Integration of Heterogeneous Information System by Felix Naumann, et al. (VLDB1999) 17 Feb 2006 Presented by Heasoo Hwang.
CS 128/ES Lecture 4b1 Spatial Data Formats.
Spatial Pyramid Pooling in Deep Convolutional
Quadtrees and Mesh Generation Student Lecture in course MATH/CSC 870 Philipp Richter Thursday, April 19 th, 2007.
Robust estimation Problem: we want to determine the displacement (u,v) between pairs of images. We are given 100 points with a correlation score computed.
GI Systems and Science January 23, Points to Cover  What is spatial data modeling?  Entity definition  Topology  Spatial data models Raster.
Data Structures and Image Segmentation Luc Brun L.E.R.I., Reims University, France and Walter Kropatsch Vienna Univ. of Technology, Austria.
Image Representation Gaussian pyramids Laplacian Pyramids
Spatial data models (types)
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Projective Texture Atlas for 3D Photography Jonas Sossai Júnior Luiz Velho IMPA.
NR 422: Topology Jim Graham Fall 2010 See: odatabase-topology.pdf.
Parcel Data Models for the Geodatabase
Applied Cartography and Introduction to GIS GEOG 2017 EL
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Geographic Information System GIS This project is implemented through the CENTRAL EUROPE Programme co-financed by the ERDF GIS Geographic Inf o rmation.
Glasgow 02/02/04 NN k networks for content-based image retrieval Daniel Heesch.
A Picture Is Worth A Thousand Words. DAY 7: EXCEL CHAPTER 4 Tazin Afrin September 10,
Applied Mathematics 1 Do we have to see everything - all the time? …or is it at all possible? Dr. ing. Rune Aasgaard.
URBDP 422 Urban and Regional Geo-Spatial Analysis Lecture 2: Spatial Data Models and Structures Lab Exercise 2: Topology January 9, 2014.
CP Summer School Modelling for Constraint Programming Barbara Smith 2. Implied Constraints, Optimization, Dominance Rules.
Challenge the future Delft University of Technology Martijn Meijers STW User Committee meeting, Utrecht, 19 September, 2012 Vario-scale (and.
1 Spatial Data Models and Structure. 2 Part 1: Basic Geographic Concepts Real world -> Digital Environment –GIS data represent a simplified view of physical.
2006 Mouse AHM Mapping 2D slices to 3D atlases - Application of the Digital Atlas Erh-Fang Lee Laboratory of NeuroImage UCLA.
INTRODUCTION TO GIS  Used to describe computer facilities which are used to handle data referenced to the spatial domain.  Has the ability to inter-
Topology Relationships between features: Supposed to prevent:
L10 – Map labeling algorithms NGEN06(TEK230) – Algorithms in Geographical Information Systems L10- Map labeling algorithms by: Sadegh Jamali (source: Lecture.
Chapter 4 Logical & Physical Database Design
INTERNATIONAL INSTITUTE FOR GEO-INFORMATION SCIENCE AND EARTH OBSERVATION Adding the Third Dimension to a Topographic Database Using Airborne Laser Scanner.
CENTENNIAL COLLEGE SCHOOL OF ENGINEERING & APPLIED SCIENCE VS 361 Introduction to GIS SPATIAL OPERATIONS COURSE NOTES 1.
CIS 825 Lecture 9. Minimum Spanning tree construction Each node is a subtree/fragment by itself. Select the minimum outgoing edge of the fragment Send.
Of 24 lecture 11: ontology – mediation, merging & aligning.
Data Storage & Editing GEOG370 Instructor: Christine Erlien.
Jeremy Iverson & Zhang Yun 1.  Chapter 6 Key Concepts ◦ Structures and access methods ◦ R-Tree  R*-Tree  Mobile Object Indexing  Questions 2.
3D LANDSCAPE MODELLING SANDER OUDE ELBERINK. FACULTY OF GEO-INFORMATION SCIENCE AND EARTH OBSERVATION Copyright Gerard Kuster.
Section Section 12.2: Prisms All prisms have two congruent and parallel faces, called bases, for which it is named. All other faces of a.
Graph clustering to detect network modules
Linking Ontologies to Spatial Databases
A Generalized Modeling Framework for Schema Versioning Support
Bounding Volume Hierarchies and Spatial Partitioning
INTRODUCTION TO GEOGRAPHICAL INFORMATION SYSTEM
Physical Structure of GDB
Geographical Information Systems
Bounding Volume Hierarchies and Spatial Partitioning
Mean Shift Segmentation
T. C. van Dijk1, J.-H. Haunert2, J. Oehrlein2 1University of Würzburg
Semi-Automated Cleanup Tools
Lecture 10: Data Representation (VIII)
DATA MANAGEMENT IN GIS SPATIAL (GEO) DATA MODELS
Geographic Information Systems
Presentation transcript:

Challenge the future Delft University of Technology Peter van Oosterom STW User Committee meeting, Oracle, Utrecht, 19 September 2012 Explanation of the STW/NWO project “Vario-scale geo-information”

2 Vario-scale Topographic map series and the art of map generalization Map fragments from different source scales enlarged to same ‘scale’ for content comparision

3 Vario-scale Multi-scale: a good option? Multi-scale databases: often multiple representation drawbacks: redundancy, fixed levels of detail  potential inconsistent Scaleless data structures: single representation with additional structure to access at any level of detail Often also spatial organization (clustering/indexing) Progressive transfer: keep sending more details (compare to raster formats: data pyramids, wavelets)

4 Vario-scale a b c d e f gi j l k h Step 0 Importance(u) = Area(u)*Class-Weight(u) Comp(u,v) = Length(Bnd(u,v)) * Class-Similarity(u,v)

5 Vario-scale a b c d e f gi j l h Step 1

6 Vario-scale a b c d e f gi j l h Step 1 blg

7 Vario-scale m b c f gi j l h Step 2

8 Vario-scale b c f gi j l h m Step 2 blg

9 Vario-scale m b c f n h Step 3

10 Vario-scale b c f h m n Step 3 blg

11 Vario-scale m o p Step 4

12 Vario-scale m p o Step 4 blg

13 Vario-scale q Step 5

14 Vario-scale q Step 5 blg

15 Vario-scale 5 (V)4 (U) 3 (Z)9 (U) 10 (U) 6 (W)2 (Y) 1 (X)7 (Y) 8 (Y) 11 (U) GAP face-tree

16 Vario-scale Resulting tGAP structure

17 Vario-scale Selection of faces overlap search region & Importance = Use tGAP structure

18 Vario-scale tGAP principles 1.Variable scale: ‘near infinite’ amount of levels 2.Base level with most detailed geometry/topology 3.Create links/structure on top

19 Vario-scale Generalized Area Partitioning-tree a ‘3D view’ Vermeij et al proposed topological GAP-tree: edges and faces (with importance range, consider as height)  scale/imp with 3D prisms

20 Vario-scale Support of non-area objects Support for non-area objects fits in tGAP structure: 1.Points: own table with importance range 2.Lines: same but now with reference to BLG-repr. 3.Also combine 2 less important lines in 1 (e.g. after removal of least important branch) This enables: the change from area to line (or point) representation at certain moment. Similar to normal GAP-structure when face is removed, but now it is also introduced in node or edge table (with link).

21 Vario-scale Other generalization operations Consider collapsing of areas in lines (or points) Compute skeleton (medial axis), connect to neighbors P0P0 P1P1 P2P2 P3P3

22 Vario-scale Result fits in tGAP structure (Ai & van Oosterom, SDH’02 more: Meijers, Savino, van Oosterom’12 in preparation) Weighted skeleton

23 Vario-scale tGAP example 1.Collapse road (split area, merge neighbours) 2.Delete forest (merge with farmland) 3.Simplify boundary (between water/farmland) 1 2 3

24 Vario-scale 2D+scale  3D integrated tGAP DAG to 3D structure Parent-child:  neighbour above-below

25 Vario-scale Delta scale  no change at all or local shock

26 Vario-scale Smooth tGAP Remove local shock  no horizontal faces Gradual changes  less vertical faces Resulting polyhedron  representation of single object for all its scales

27 Vario-scale Delta scale  delta map

28 Vario-scale Non-horizontal slice  mixed scale map

29 Vario-scale Non-flat slice  mixed scale map (fish-eye example) x y S=0 S=0.5 source: Harrie et al, 2002, ISPRS Archives 34(4):237–242

30 Vario-scale The highly challenging project goals Semantic aspect (incl. attributes) needs further attention Lower dimension primitives (lines, points) do also fit in the structure, but need further investigations Fast slicing, exploiting coherence between delta scale Include label placement in smooth-zoom Not per se object by object creation (but multiple objects in parallel) Sliver before disappearing Lot of implementing and testing needed (engineering)