Neighborhood Operations

Objectives of Lecture:

  1. Move from Buffers to Neighborhoods
  2. Connect from Surfaces to Neighborhoods
  3. Overview of neighborhood combinations (similarity to overlay operations)




A buffer spreads a category (zone) outwards to grab more space. This transformation makes a new map for use in other overlay analysis.

Buffers are the simplest kind of neighborhood operation, focused on neighborhoods defined by Euclidean distance. The attribute is simply moved outward - it dominates its neighbors. This can be extended to other treatment of attributes.


Surfaces have properties (discussed last lecture : notably slope [gradient & aspect] etc.) that are estimated from neighboring values. This process is a special case of neighborhood operations as well.

Chapter 7 presents a scheme for these operations, using the same groupings of procedures found in overlay operations.

First (geometric part)
, assemble the neighboring values [note problems on edge of coverage...]

(near neighbors = `immediate' + `focal' ~ `incremental') `extended' is next chapter...

Options: [1 & 2 are pretty much the same, though Tomlin (ArcGrid) separates them.

  1. `immediate neighbors' in grid ['roving window', 3X3 `kernel', etc.]
  2. fixed radius of Euclidean distance ('Focal') [with variants, like nested holes, etc.]
  3. adjacent objects [topologically connected in vector, eg. next subway stop]

Then (attribute combination), produce an output value by applying a rule that uses the neighboring values.

Examples in textbook (Overheads):

Various filters in practical use

The rules can be grouped by combination method and by level of measurement:
Examples of operations on near neighbors
Level of Measurement Dominance Contributory Interaction
Nominal Buffer
Drop-line aggregation (dissolve)
Voting tabulation
majority filter, diversity, etc.
Edge detectors,
Explicit combination
Ordinal (at least) Max/min of neighbors; (example to count palm trees) Percentile Profile, drainage
Continuous (aspatial)

Max/min neighbor (population density)

(example: Minimum Flying Height: from a max in cell)

Sum/average ; (a population density example using TOTAL; description) Edge detectors
Continuous attribute with horizontal measures
- Slope Maximum slope Best fit plane  
- Distance weighting Smoothing, filters an example of distance filter (Watts Barr; Amazon)

Autocorrelation;

hillshading (example) [plus behind the scenes AML to accomplish this...]

- Splines: (see below) Amazon precipitation; (an animated gif)


Examples of operations on near neighbors. Empty cells seem not to occur in practice.


Of course these operations are sensitive to error: DesMoines flooding, description.


Some additional depth on the surface modelling [Group was at Army Corps of Engineers CERL, then at University of Illinois; Helena seems to be at North Carolina State now...] The page has moved, and most of the movies, but the links are mostly dead (and point back to Illinois!):


Index from Here: | Next Lecture | Schedule of Lectures | Labs and Due Dates | How to reach us
Version of 29 October 2003