KEY CONCEPTS & TECHNIQUES IN GIS Part 6 docx

MAP ALGEBRA 53 other typically out-of-range value. Upon encountering a NoData cell, map algebra functions react in a well-defined way. Cell values can have two different purposes. They can represent a true quantita- tive value (e.g. elevation or amount of precipitation), or they can represent a class, whose values are then described in an external table. In the latter case, the cell value acts as a pointer to the correct record in the external table. 8.2 Local functions All map algebra functions work one cell at a time. Local functions derive their name from the fact that in the calculation of the output value only input cells with exactly the same coordinate are considered (see Figure 40). The somewhat tedious descrip- tion of the procedure goes as follows. A local map algebra function reads the cell values of cell position (1,1) and applies a certain calculation on these input values. It then writes the result to cell (1,1) in the output layer and proceeds to the second cell in the row, where the whole procedure is repeated, one cell at a time until we get to the last cell in the last row. It is easy to see that this would be very slow if each reading/writing step were to involve the hard disk. With the price of memory coming down, most GIS nowadays are able to process one or two layers (depending on their size) virtually before writ- ing the result to a file or table. The cumbersomeness of the process is mitigated by the fact that no complicated geometric calculations have to be performed (as all cells 21443 22332 22345 12345 11155 Figure 39 Zones of raster cells Albrecht-3572-Ch-08.qxd 7/13/2007 4:16 PM Page 53 54 KEY CONCEPTS AND TECHNIQUES IN GIS 2011 2304 423 11 2 6033 69012 12 6 9 33 6 × 3 = Figure 41 Multiplication of a raster layer by a scalar are of the same size and orientation), and that the calculations themselves can often be executed within the processor itself, which makes it extremely fast. So, although a million cells may be processed, the result of a local operation is often instanta- neous. Compare this to the complexity of overlay operations in the vector world (see Chapter 6)! Local map algebra functions can be arithmetic, trigonometric, exponential, loga- rithmic, statistical or logical in nature. A trivial example would involve only one input layer, where we multiply all cell values by a constant value, say ‘3’. As a result, we could have an elevation layer, where the ratio of horizontal to vertical distances is now exaggerated enough to visually discern terrain features (see Figure 41). One notch up on the ladder of sophistication is the use of a multiplier layer (see Figure 42). Say we have counties with different property tax rates. We could then calculate not just purchase prices but long-term costs by multiplying the costs of Local Figure 40 Local function Albrecht-3572-Ch-08.qxd 7/13/2007 4:16 PM Page 54 MAP ALGEBRA 55 each property by the tax rates. Observe what happens to the cells with no values; NoData times something results in NoData. 8.3 Focal functions Neighborhood or focal functions are the main reason for the success of map alge- bra. Local functions, in a way, are nothing but fancy recoding operations, which could indeed easily be performed in a proper database management system. Focal functions, on the other hand, take into account all cells in a user-defined neighbor- hood. Anybody who ever tried to calculate a cell value in a spreadsheet based on a combination of surrounding cells knows that the query string very quickly becomes really complicated. Again, the procedure is one cell at a time, except that for the calculation of an output cell value, we now look at all cells surrounding the process- ing location of all input layers (see Figure 43). 2011 2304 423 11 2 6033 69012 12 6 9 33 6 12 0 3 3 12 27 0 48 48 12 27 33 12 ×= Figure 42 Multiplying one layer by another one Focal Figure 43 Focal function Albrecht-3572-Ch-08.qxd 7/13/2007 4:16 PM Page 55 56 KEY CONCEPTS AND TECHNIQUES IN GIS By default, the neighborhood is defined to be all eight cells touching the processing cell, plus the processing cell in the middle. As an interesting aside, the first step of a focal function uses only three neighboring cells because cell (1,1) sits in a corner and has no more neighbors. Many GIS allow us to define different neighborhoods, though. We may change the extent (size) of the neighborhood, its shape, or its ker- nel (where in relationship to the neighborhood sits the operating cell?). Just about any function type (arithmetic, trigonometric, exponential, logarithmic, statistical or logical) that we encountered for local functions is also applicable for focal functions. In addition, we have functions that compare cell values within a neighborhood, rather than across multiple input layers. This way, we can determine the average, minimum or maximum value within the neighborhood or calculate the span (range) of values. One of the attractive features of map algebra is its naming conventions. Identifiers such as FocalSum, FocalMean, LocalAND or ZonalMax are more or less self-explanatory, yet this is exactly how all map algebra functions are formed. Actual vendor implementations change a little bit in their semantics (e.g. average versus mean) but stick to the principle. Figure 44 describes a prominent focal function that is the basis for many image processing operations. You are encouraged to work the example, or at least the first row of cells in Figure 44. Remember to include the processing cell in all calcula- tions. We will revisit neighborhood functions in Chapter 9, as the very notion of terrain is a focal one. 2011 2304 4223 311 2 1.8 1.3 1.5 1.5 2.2 2.0 1.8 1.8 2.2 2.0 2.2 2.3 2.0 2.2 2.2 2.5 = Figure 44 Averaging neighborhood function 8.4 Zonal functions Zonal functions are in effect a mixture of local and focal functions. Based on Tobler’s First Law of Geography (see Chapter 10), cells of similar values can be expected to lie next to each other. Hence everything that was said about focal func- tions applies to zonal functions as well. On the other hand, more important than spatial contiguity is the fact that all cells within a zone have the same value and they are treated the same. Zonal functions therefore take on the character of recoding functions that typified local functions. Albrecht-3572-Ch-08.qxd 7/13/2007 4:16 PM Page 56 MAP ALGEBRA 57 The process is a bit more complicated than before. Again, zonal functions work on a cell-by-cell basis. However, the zone now acts as a kind of variable neighbor- hood definition (see Figure 45), and the zonal input layer as a lookup table. A zonal function processes at least two input layers, one so-called zone layer, and one or more value layers. The zones can be (and usually are) but do not have to be contiguous. Zonal Figure 45 Zonal function Figure 46 is an abstract example for a ZonalMax function. Again, as all map alge- bra functions, it starts at cell (1,1), and looks what zonal number it contains. Then it looks at all other cells with the same zonal number and creates a list of their values from the second input layer. Upon determining the maximum value, it writes that value to cell (1,1) in the output layer and proceeds to the next cell. If that next cell has the same zonal number then the output value from the previous step is written to cell (1,2). If the zonal number is different, then a new list of values belonging to all cells of the new zone number is created and its maximum is written to cell (1,2). In practice, the zonal number grids represent classified images or thematic maps, where we run calculations on the value layer based on the cell’s membership to one class or another. 8.5 Global functions Global functions differ from the rest in that many of the arithmetic or statistical operations do not make sense if applied globally (they would result in the same value for all cells of the output grid). Instead, global functions determine the spatial relationship between cells of interest – or in other words, the distance between cells. Albrecht-3572-Ch-08.qxd 7/13/2007 4:16 PM Page 57 58 KEY CONCEPTS AND TECHNIQUES IN GIS There are two types of global or distance function, Euclidean and weighted. The for- mer is a straightforward geometric calculation, while the latter involves a second input layer that encodes a cost or friction surface. With global functions, it is fairly easy to implement the most complicated vector GIS operations: Thiessen polygons, corridors and location–allocation. 8.6 Map algebra scripts One of the most convincing arguments for map algebra was Tomlin’s use of map algebra scripts, a concatenation of functions that represents a complete GIS analysis workflow or even a dynamic model. While Tomlin just used simple sequences, authors like Kirby and Pazner (1990), Wesseling and van Deursen (1995) and Pullar (2003) developed temporal constructs that mimic classic programming languages augmented by spatial expressions. A simple example is the following script, which models the spread of a pollutant from a point source: For i = 1 to 100 plume = buffer(plume)* 1/ i One of the interesting characteristics of most raster-based programs (particularly image processing packages) is that the target file can be overwritten in a program- ming loop. This saves disk space but of course prevents the analysis of intermediate steps. Scripts are also the mechanism behind the raster-based terrain modeling oper- ations discussed in Chapter 9. 2211 2331 23 11 22 1234 5678 1234 5555 5588 5787 85 88 55 = Zone grid Value grid Figure 46 Value grids as spatial lookup tables Albrecht-3572-Ch-08.qxd 7/13/2007 4:16 PM Page 58 All GIS functionality discussed so far assumed the world to be flat. This is, of course, utterly unrealistic but GIS has succeeded in getting away with this deficiency surprisingly well. Since 3-D representations are commonplace in modern CAD soft- ware, the obvious question is why has GIS not followed suit? The answer lies in the distinction between mere data representation that is common to CAD and vector GIS, on the one hand, and the spatial reasoning capacity that is unique to GIS. In general, we can distinguish between three different ways to represent the third dimension (see Figure 47). One is the use of true three-dimensional coordinates to construct what in CAD is called a wire frame model. The second uses the same coordinates but constructs a mesh of triangles to drape a surface going through all the points. Applied to relatively small areas but at high precision, this data structure is often used in civil engineering applications. The last uses raster cells and records for each cell an elevation value as the pertinent attribute. The image of the raster surface in Figure 47 indicates a fourth representation, the use of contour lines. They are a filter on the former, leaving only values at certain intervals, which are then connected by a polyline. As we have seen earlier, the way we organize data directly determines what kind of questions we can ask of the data. The wire frame model is up to now the most limited of 3-D GIS models, serving mostly rendering functions similar to those of architectural software packages. 9 Terrain Modeling 3-D wire frame Raster surface Snow depth Tin Figure 47 Three ways to represent the third dimension Albrecht-3572-Ch-09.qxd 7/13/2007 5:09 PM Page 59 60 KEY CONCEPTS AND TECHNIQUES IN GIS 9.1 Triangulated irregular networks (TINs) While the wire frame data at least in theory allows for a truly three-dimensional rep- resentation (i.e., multiple objects intersecting with each other in all three dimen- sions), triangulated irregular networks or TINs are used for surfaces only. This may look like a limitation but it is not because none of the readily available off-the-shelf GIS have extended their analytical capacities to the third dimension. TINs are func- tionally a hybrid between the precise point representations typical for vector data and the field view of raster data; as a matter of fact, we could interpret them as an agglomeration of tiny fields, each represented by a triangular area. The triangles sat- isfy the Delaunay criterion, which ensures that no node lies within the interior of any of the circumcircles of the triangles (see Figure 48). This assures that the minimum interior angle of all of the triangles is maximized and long, thin triangles are avoided. In the process of calculating the best fitting triangles between all the points that make up a given surface, the GIS determines and stores slope and aspect of each. This is useful for two reasons. For one, this information is used in the render- ing of 3-D surfaces and speeds up the process of displaying intricately shaded ter- rain. Second, it makes it easy to calculate volumes of irregularly shaped bodies – a task of particular pertinence in civil engineering. G F E D C A B Figure 48 Construction of a TIN TINs and raster-based elevation models are often contrasted as incorporating the classic difference between raster and vector GIS – the former being simple but either imprecise or huge; the latter being complicated, precise and very efficient. In prac- tice, the precision of TINs is a function of how precise the original measurement was – which can be surprisingly poor in the third dimension. Also, most useful TINs consist of millions of points, either because of how they were derived from raster Albrecht-3572-Ch-09.qxd 7/13/2007 5:09 PM Page 60 TERRAIN MODELING 61 datasets, or because the surfaces used for civil engineering are so varied and have to reflect many sharp edges that we would not encounter in natural settings. The main difference then boils down to TINs being used (as the name implies) where we have irregularly spaced measurements, and raster-based elevation models being regular. 9.2 Visibility analysis Viewshed analysis was originally a classical raster GIS function, typically applied to forest clear cuts in an attempt to determine which areas are visible from a road and should hence be left to avoid the wrath of environmentalists (Bettinger and Sessions 2003) (see Figure 49). Figure 49 Viewshed When cellphone usage took off in the 1990s, providers looked for tools that would help them to maximize coverage and minimize efforts for optimal placement of cell- phone towers. The challenge for these companies was twofold. On the one hand they had to provide nationwide coverage as fast as possible and digital elevation models (see next section) are the obvious choice for that. On the other hand, the majority of customers are located in cities with a very different and impeding topography, which is better represented by TINs that are derived from high-resolution imagery. Cellphone signals travel the same way as light does, and more important are obstructed in a similar way. In a raster environment, we are hence looking at a repeated zonal buffer operation. Due to the different data structure, the algorithms for a TIN work very differently; they are based on the same computational geome- try that film studios now use for rendering. Albrecht-3572-Ch-09.qxd 7/13/2007 5:09 PM Page 61 62 KEY CONCEPTS AND TECHNIQUES IN GIS 9.3 Digital elevation and terrain models Raster-based digital elevation models (DEMs) are by far the most common basis for dealing with the third dimension. As a matter of fact, many people have difficulties conceptualizing a raster attribute as anything but elevation. This is especially true for digital elevation models that cover larger areas. There are two reasons for this. For one, automated data capture for large areas tends to involve remote sensing methods that result in raster datasets. As important, however, is the fact that map algebra offers a plethora of analytical methods that require nothing but elevation and result in an astounding array of derivatives. In Chapter 8, we saw how focal or neighborhood operations are used to analyze the combined spatial and attribute relationship between locations. The first set of focal operations transforms a DEM to a digital terrain model or DTM. The differ- ence between the two is that the latter stores, in addition to mere elevation, two important derivatives – slope and aspect (see Figure 50). Slope is the ratio of eleva- tion difference between the higher neighbors and the lower neighbors, and horizon- tal distance between those neighbors. It is usually calculated based on the 8-neighborhood, which in turn defines the distance as twice the cell width in the cardinal directions, and √2 times the former distance for the diagonals. Once we know the slope at each cell location, it is another simple focal operation to compare all neighbors and determine in what direction the surface slopes; this is called aspect. Given that both operations are fairly simple, and that processing power of modern computers is sufficient to calculate slope and aspect efficiently, DTMs are decreasing in importance. Aspect Slope 36% 20° 14° 8.5° 2.9° 1.1° 25% 15% 5% 0 45 90 135 180 225 270 315 2% Figure 50 Derivation of slope and aspect Albrecht-3572-Ch-09.qxd 7/13/2007 5:09 PM Page 62 [...]... hydrological modeling deserve extra mention As can be seen from these four sections, all we needed in the beginning was a DEM Each of the maps was a direct result of applying one operation or script to its predecessor It is therefore fairly straightforward to write a rather longish script that creates all the 64 KEY CONCEPTS AND TECHNIQUES IN GIS intermediate files and derives a flood forecast model in one go... understanding of the phenomenon, say based on a long history of similar observations, is good The following set of methods cover both approaches, although the underlying commonality is a scarcity of data All spatial interpolation techniques discussed here aim at creating surfaces from point data It is important to recognize that most applications are not in terrain modeling but that the surfaces are intended...TERRAIN MODELING 63 9.4 Hydrological modeling Slope and aspect are the cornerstones of hydrological modeling The underlying principle is fairly simple – and sometimes the application of out-of-the-box hydrological GIS functions is a bit simplistic The idea is that once we know slope and aspect, we have a fairly good idea in what direction a drop of water would run off once it hits the surface Clearly, in. .. point of view of how many cells it receives from, and into which cell it passes its accumulated flow We are virtually draining the terrain, and as a result see where streams would flow (Wilson & Gallant 2000) As mentioned above, this simple perspective works best in ‘well-behaving’ terrain, where there is a discernable slope and the land cover is not too variable Under those conditions the resulting... allow estimates of any kind of continuous variable, such as pollution, crime or mineral resources All model-based interpolation methods assume Tobler’s (1970) First Law of Geography, which basically means that everything is related to everything else, but things that are closer in space (i.e., neighbors) are also closer with respect to their attribute values There are many interpolation methods and... discussed in this chapter are, however, just as applicable to artificial surfaces, where the third dimension represents an attribute value such as property value or air pollution These kinds of surfaces are typically interpolated from sparse measurements The following chapter will cover spatial interpolation techniques and more 10 Spatial Statistics This chapter consists of two distinct parts because... provides only a hint at all the models that can be developed and linked with each other For example, based on a comparison of satellite images, we can develop models of urban sprawl and impervious surfaces These can then be linked with the runoff model above to develop true simulation models, possibly linked with real-time readings of precipitation All of the above are true terrain modeling applications... applicable only in either barren terrain or on totally saturated soils On the other hand, all these complications can be (and are) addressed by more complicated map algebra scripts that combine infiltration and runoff models To get back to the basic idea, once we know into which neighboring cell a drop of water would flow, we can derive a flow direction map for the whole study area, which in turn becomes... of input values (local versus global methods) and the characteristics of the resulting surface If the surface goes through the values of known locations, then we label a method as exact Otherwise we refer to it as a smooth interpolator, because the resulting surface avoids ruggedness around measured locations The most common of these methods are inverse distance weighting (IDW), polynomials and splines... is not too variable Under those conditions the resulting runoff calculation is surprisingly accurate; and with everincreasing precision of DEM data, a range of national and international organizations is currently developing sophisticated hydrological models The work at the University of Texas’ Center for Research in Water Resources is fairly representative for these endeavors; their efforts to provide . 4: 16 PM Page 55 56 KEY CONCEPTS AND TECHNIQUES IN GIS By default, the neighborhood is defined to be all eight cells touching the processing cell, plus the processing cell in the middle. As an interesting. raster cells Albrecht-3572-Ch-08.qxd 7/13/2007 4: 16 PM Page 53 54 KEY CONCEPTS AND TECHNIQUES IN GIS 2011 2304 423 11 2 60 33 69 012 12 6 9 33 6 × 3 = Figure 41 Multiplication of a raster layer. rather longish script that creates all the Albrecht-3572-Ch-09.qxd 7/13/2007 5:09 PM Page 63 64 KEY CONCEPTS AND TECHNIQUES IN GIS intermediate files and derives a flood forecast model in one go