4.6.1 Upper Echelons of Surfaces. 4.6.2 3 4 5.

Slides:



Advertisements
Similar presentations
Chapter 5: Tree Constructions
Advertisements

Topographic Maps.
WFM 6202: Remote Sensing and GIS in Water Management © Dr. Akm Saiful IslamDr. Akm Saiful Islam WFM 6202: Remote Sensing and GIS in Water Management Akm.
Image Segmentation Image segmentation (segmentace obrazu) –division or separation of the image into segments (connected regions) of similar properties.
By Megan and Slade. A topographic map is a map that shoes the surface features, or topography, of the Earth. Topographic maps show both natural features,
Quadtrees, Octrees and their Applications in Digital Image Processing
Reading Contour Lines “The Basics”.
CONTOUR LINES.
Earth Science – Unit 1.1 Reading Topographic Maps
Spatial Information Systems (SIS)
Key Q- How can a flat map show a 3D feature and its elevation?
Where is this? The cell.
Lesson Objectives 12/2/13 TLW, with 100% participation,
Section 3: Types of Maps Objectives
Topographic Maps.
Self Organizing Maps. This presentation is based on: SOM’s are invented by Teuvo Kohonen. They represent multidimensional.
TERMS, CONCEPTS and DATA TYPES IN GIS Orhan Gündüz.
Quadtrees, Octrees and their Applications in Digital Image Processing
Visual Querying By Color Perceptive Regions Alberto del Bimbo, M. Mugnaini, P. Pala, and F. Turco University of Florence, Italy Pattern Recognition, 1998.
CSE 222 Systems Programming Graph Theory Basics Dr. Jim Holten.
1. 2 General problem Retrieval of time-series similar to a given pattern.
Introduction to Mapping Sciences: Lecture #5 (Form and Structure) Form and Structure Describing primary and secondary spatial elements Explanation of spatial.
K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.
K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.
Multi-Scale Dual Morse Complexes for Representing Terrain Morphology E. Danovaro Free University of Bolzano, Italy L. De Floriani University of Genova,
Name: ___________________________ Period: _________ Date: _____________________________.
7.1. Mean Shift Segmentation Idea of mean shift:
Quadtrees, Octrees and their Applications in Digital Image Processing.
Extent and Mask Extent of original data Extent of analysis area Mask – areas of interest Remember all rasters are rectangles.
1 Spatial Data Models and Structure. 2 Part 1: Basic Geographic Concepts Real world -> Digital Environment –GIS data represent a simplified view of physical.
Mathematical Morphology Mathematical morphology (matematická morfologie) –A special image analysis discipline based on morphological transformations of.
1 12/2/2015 MATH 224 – Discrete Mathematics Formally a graph is just a collection of unordered or ordered pairs, where for example, if {a,b} G if a, b.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Duality between Pairs of Incident Cells Pairs of incident cells have a symmetry in their structure called duality Every occurrence of a primal object or.
Mathematical Morphology
Introduction to Optimization
Types Of Maps. Political Maps Show features humans have made (cities, states, provinces, etc.). Indicate state and national boundaries Label capital and.
Models of the Earth Section 3 Section 3: Types of Maps Preview Key Ideas Topographic Maps Topographic Maps and Contour Lines Index Contour, Contour Interval,
May 2003 SUT Color image segmentation – an innovative approach Amin Fazel May 2003 Sharif University of Technology Course Presentation base on a paper.
Digital Image Processing CCS331 Relationships of Pixel 1.
Spatial Scan Statistic for Geographical and Network Hotspot Detection C. Taillie and G. P. Patil Center for Statistical Ecology and Environmental Statistics.
DC G. P. Patil. This report is very disappointing. What kind of software are you using?
This report is very disappointing. What kind of software are you using?
Models of the Earth Section 3 Section 3: Types of Maps Preview Key Ideas Topographic Maps Topographic Maps and Contour Lines Index Contour, Contour Interval,
Spatially Constrained Clustering and Upper Level Set Scan Hotspot Detection in Surveillance GeoInformatics G.P.Patil, Penn State University Reza Modarres,
BackTracking CS255.
CSE 554 Lecture 1: Binary Pictures
E.Q: How do map makers represent elevations, relief and slope?
EPA Presentation March 13,2003 G. P. Patil
Computer Vision Lecture 13: Image Segmentation III
Chapter 15: Distributed Structures
Chapter 3 Section 3 Types of Maps Objectives
Graph theory Definitions Trees, cycles, directed graphs.
Lecture 18. Basics and types of Trees
Mean Shift Segmentation
Computer Vision Lecture 12: Image Segmentation II
A map is a flat, two-dimensional representation of space.
Digital Elevation Models and Hydrology
Data Queries Raster & Vector Data Models
6. Introduction to nonparametric clustering
3.3 Applications of Maximum Flow and Minimum Cut
REMOTE SENSING Multispectral Image Classification
Obj 1.5: Use and Interpret Maps
CS Digital Image Processing Lecture 5
Earth Science – Unit 1.1 Reading Topographic Maps
Graphs and Algorithms (2MMD30)
Albany New York (1) G. P. Patil
How to find these features on a map?
Chapter 5: Morse functions and function-induced persistence
Switching Lemmas and Proof Complexity
Presentation transcript:

4.6.1 Upper Echelons of Surfaces

4.6.2

3

4

5

6

7

8

9

10

4.6.11

Ingredients of an Echelon Analysis: – Tessellation of a geographic region: –Response value Z on each cell. Determines a tessellated (piece-wise constant) surface with Z as elevation. How does connectivity (number of connected components) of the tessellation change with elevation? Echelons Description -- 1 a c b k d e f g h i j a, b, c, … are cell labels

Think of the tessellated surface as a landform Initially the entire surface is under water As the water level recedes, more and more of the landform is exposed At each water level, cells are colored as follows: –Green for previously exposed cells (green = vegetated) –Yellow for newly exposed cells (yellow = sandy beach) –Blue for unexposed cells (blue = under water) For each newly exposed cell, one of three things happens: –New island emerges. Cell is a local maximum. Morse index=2. Connectivity increases. –Existing island increases in size. Cell is not a critical point. Connectivity unchanged. –Two (or more) islands are joined. Cell is a saddle point Morse index=1. Connectivity decreases. Echelons Description -- 2

a c b k d e f g h i j Echelons Illustrated -- 1 Echelon Tree a a a b,c b k d e f g h i j c Newly exposed island Island grows

Echelons Illustrated -- 2 Echelon Tree a a b,c b k d e f g h i j c Second island appears d a a b,c b k d e f g h i j c Both islands grow d e f,g New echelon

Echelons Illustrated -- 3 Echelon Tree a a b,c b k d e f g h i j c Islands join – saddle point d e f,g h New echelon a a b,c b d e f g h i j c Exposed land grows d e f,g h k i,j,k Three echelons

Echelons Illustrated -- 4 Each branch in echelon tree determines an echelon Each echelon consists of cells in the tessellation The echelons partition the region Each echelon determines a set of response values Z (and a corresponding set of values of the explanatory variables X, if any) Echelon Tree a a b,c b d e f g h i j c Echelon Partitioning d e f,g h k i,j,k Three echelons

Echelons Illustrated – 5 Higher Order Echelons Receding Waterline Previous Pictures Echelon Tree labeled with echelon orders (not 3) 2 3

Echelons Illustrated – 6 Echelon Order Defined Echelon Tree labeled with echelon orders (not 3) 2 3 Analogy with stream networks (Horton-Strahler order) Leaf branches have order 1 When two branches of orders p and q join, the new branch has order: Max(p, q) if p  q p + 1 if p = q

Echelons Illustrated – 7 Echelon Smoothing Need for smoothing echelon trees Alternative to direct smoothing of surface values In complicated echelon trees, root nodes may be most indicative of noise and become prime candidates for pruning (contraction would be a better term) Criteria for pruning: Echelon relief, Echelon basal area, others? What is the corresponding smoothed surface? Echelon Tree labeled with echelon orders (not 3) 2 3 Prune ?

Ingredients – Set S whose elements are called cells or sites –Filtration of S, i.e., increasing sequence of subsets: –Neighborhood system on S, i.e., an indexed family, of subsets of S such that: Members of N t are called neighbors of cell t Echelons Mathematical Definition -- 1

Role of the filtration –Determines the cells to be exposed as the water level drops to successively lower levels –When the water is at level n : Cells in S n-1 are previously exposed (green) Cells in S n – S n-1 are newly exposed (yellow) Cells in S – S n are unexposed (blue) Echelons Mathematical Definition -- 2

Ways to determine a filtration – Numerical data. Let be the distinct values of Z. Then S n consists of all cells for which Z is greater than or equal to z n –Ordinal data. Same as above, except Z has only ordinal significance. –Partial ordering on cells. S n consists of the cells in the top n levels of the Hasse Diagram. Echelons Mathematical Definition -- 3

Role of the neighborhood system – Determines the notion of connectivity among cells –Two exposed cells s, t are in the same connected component (i.e., same island) if there is a sequence of cells such that t i+1 is a neighbor of t i, i = 1,2,…,k-1. This means that Echelons Mathematical Definition -- 4

Ways to determine a neighborhood system –From a tessellation. Two cells are neighbors if they are adjacent. As usual, one must decide if their shared boundary should be 0-dimensional (finite set of points) or 1-dimensional. We generally require a 1- dimensional shared boundary. –From a graph. Two nodes in a graph are neighbors if there is an edge joining them. Actually, this is the universal example since any neighborhood system on S determines a graph structure on S, and conversely. Echelons Mathematical Definition -- 5

Filtration is determined by the response values Z, i.e., by the data. Neighborhood system is determined by the tessellation, i.e., by the spatial information. Echelons link the responses with the spatial information Echelons Mathematical Definition -- 6

Echelons focus on local maxima. Dual echelons focus on local minima Initially the entire landform is exposed As the water level rises, water bodies form Dual echelons study the connectivity of the water surface For each newly flooded cell, one of three things happens: –New lake emerges. Cell is a local minimum. Morse index=0. Connectivity of the water increases. –Existing lake increases in size. Cell is not a critical point. Connectivity unchanged. –Two (or more) lakes are joined. Cell is a saddle point Morse index=1. Connectivity decreases. Echelons Duality -- 1

Existing echelon software can be used for dual echelons: –Surface variable. Replace Z by –Z. –Filtration. Replace the filtration by the dual filtration where Echelons Duality -- 2

Spatial Complexity with Single Response Variable Echelons Approach Issues to be addressed: Echelon trees and maps Echelon profiles and other tree metrics Noise effects and filtering Comparing echelon trees and maps Echelon stochastics: surface simulation, tree simulation, tree metric distributions

Pre-Classification Change Detection Echelons Approach Change vector approach (cell by cell) with actual spectral data Change vector approach (cell by cell) with compressed (hyperclustered) spectral data Pattern-based approach (compressed data only): Compare segment pattern at time1 with segment pattern at time 2.

Spatial Complexity with Multiple Indicators: Echelons Approach Compare echelon features among indicators for consistency/inconsistency: –Order –Number of ancestors (distance from root of tree) Compression by treating features as pseudo- bands