Presentation on theme: "Towards a generalized map algebra: principles and data types Gilberto Câmara Danilo Palomo Ricardo Cartaxo Olga Oliveira."— Presentation transcript:
Towards a generalized map algebra: principles and data types Gilberto Câmara Danilo Palomo Ricardo Cartaxo Olga Oliveira
2 Map Algebra Is an algebraic framework for performing operations on data stored in a geographical information system (GIS). Allows the user to model different problems and to obtain new information from the existing data set. A simple example: How to identify all areas without vegetation with slope greater than 15% as high risk. U slope vegetatio n
3 Tomlins Map Algebra  Data type A Map in raster representation Operations LocalFocalZonal Source: Tomlin (1990) n(p) = touchz(p) = inside spatial gl gf n(p) gz z(p)
4 New applications Calculate the deforestation along the rivers and roads
5 Questions What is the theoretical foundation for map algebra? Could this theoretical foundation provide support for more generic map algebra? How can we define an extended map algebra suitable for both raster and vector representations?
6 Response We take the existing spatial predicates as a basis for defining a more generic map algebra. Motivation To allow the user to model a greater number of different problems and to obtain a greater number of new information from the existing data set.
7 Introduction and motivation The generalized map algebra Compare with the Tomlins proposal Examples Conclusions Outline
8 The generalized map algebra Data type A map in raster or vector representation FunctionSignature getregions map list_region contains map region bool overlaps map region bool insert map region attr_domain map retrieve map region attr_domain new map add map region map remove map region map The map data type
9 Axioms (getregions (m)) == G (the extent of the map) contains (m, r) == true iff r G insert(m,r,val) == error iff contains (m,r) == false retrieve (m,r) == error iff contains (m,r) == false retrieve (insert (m, r, val), r) == value add (m,r) == error iff ((contains (m, r) == true) or (overlaps (m,r) == true)) remove (m,r) == error iff (contains (m,r) == false) remove ((add (m, r), r) == add ((remove (m, r), r)
10 Nonspatial operation Are the equivalent to Tomlins local operations
17 Motivation The generalized map algebra Comparison with the Tomlins proposal Examples Conclusions Outline
18 Comparison with Tomlins map algebra Focal operation Zonal operation composition output and reference touch composition inside No equivalence composition disjoint / equal west / north /...
19 Motivation The generalized map algebra Comparison with the Tomlins proposal Examples Conclusions Outline
20 lsum := sum (defor touch lsum lsum := sum (defor touch lsum)lsum := sum (defor touch lsum); Find the local sum of regions in a deforestation map Example of spatial operation defor lsum touch 1980 sum:= 230
21 reserves defor Example of spatial operation deforRes := sum (defor inside reserves sum 470 deforRes := sum (defor inside reserves) deforRes := sum (defor inside reserves); Find the sum of deforestation in the native reservations inside deforRes :=
22 roadDesm := mean (defor intersects road roadDesm := mean (defor intersects road) defRoad := mean (defor intersects road); Example of spatial operation road defRoad defor intersects mean 195 := Calculate the mean of the deforestation along the road
23 Motivation The generalized map algebra Comparison with the Tomlins proposal Examples Conclusions Outline
24 Conclusions Our map algebra enables operations that are not directly expressible by Tomlin`s proposal. One of the important result is to show that Tomlins Map Algebra can be seen as an application of spatial predicates to coverages. Further generalizations of the proposed algebra are possible by involving the full set of spatial predicates. The next step in our work is to design, implement and validate a language that supports the proposed map algebra for spatial databases.
25 Referências CÂMARA, G. Modelos, Linguagens e Arquiteturas para Bancos de Dados Geográficos.São José dos Campos, SP: Instituto Nacional de Pesquisas Espaciais (INPE), 1995.Ph.D., 1995. CÂMARA, G.; SOUZA, R.; PEDROSA, B.; VINHAS, L.; MONTEIRO, A. M.; PAIVA, J.; CARVALHO, M. T.; GATTASS, M. TerraLib: Technology in Support of GIS Innovation. In: II Brazilian Symposium on Geoinformatics, GeoInfo2000. São Paulo, 2000. p. CROSIER, S.; ENVIRONMENTAL SYSTEMS RESEARCH INSTITUTE (REDLANDS CALIF.). ArcGIS 9. Getting started with ArcGIS. Redlands, CA: ESRI, 2004. iii, 265 p. p. EASTMAN, J.R. IDRISI, Manual do Usuário. EGENHOFER, M., 1991. Reasoning about Binary Topological Relations. In: GÜNTHER, O.; SCHEK, H.-J., eds., Advances in Spatial DatabasesSecond Symposium, SSD '91: Lecture Notes in Computer Science, v. 525: New York, NY, Springer-Verlag, p. 143-160. EGENHOFER, M.; FRANZOSA, R. Point-Set Topological Spatial Relations. International Journal of Geographical Information Systems, v. 5, n.2, p. 161-174, 1991. EGENHOFER, M.; HERRING, J. Categorizing Binary Topological Relationships Between Regions, Lines, and Points in Geographic Databases. Orono, ME: Department of Surveying Engineering, University of Maine, 1991. ESRI. ARCGIS Manual: GRID. Redlands, CA, 2000. PULLAR, D. MapScript: A Map Algebra Programming Language Incorporating Neighborhood Analysis. GeoInformatica, v. 5, n.2, p. 145-163, 2001. TOMLIN, C. D. Geographic Information Systems and Cartographic Modeling. Englewood Cliffs, NJ: Prentice-Hall, 1990. WINTER, S.; FRANK, A. Topology in Raster and Vector Representaion. GeoInformatica, 2000.