DOCSLIB.ORG

Mathematical Morphology a Non Exhaustive Overview

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Mathematical Morphology a Non Exhaustive Overview Mathematical Morphology a non exhaustive overview Adrien Bousseau Mathematical Morphology • Shape oriented operations, that “ simplify image data, preserving their essential shape characteristics and eliminating irrelevancies” [Haralick87] Mathematical Morphology 2 Overview • Basic morphological operators • More complex operations • Conclusion and References Mathematical Morphology 3 Overview • Basic morphological operators – Binary – Grayscale – Color – Structuring element • More complex operations • Conclusion and References Mathematical Morphology 4 Basic operators: binary • Dilation , erosion by a structuring element Mathematical Morphology 5 Basic operators: binary • Opening ° : remove capes, isthmus and islands smaller than the structuring element Mathematical Morphology 6 Basic operators: binary • Closing ° : fill gulfs, channels and lakes smaller than the structuring element Mathematical Morphology 7 Basic operators: binary • Sequencial filter: open-close or close-open Mathematical Morphology 8 Overview • Basic morphological operators – Binary – Grayscale – Color – Structuring element • More complex operations • Conclusion and References Mathematical Morphology 9 Basic operator: grayscale • Dilation : max over the structuring element Mathematical Morphology 10 Basic operator: grayscale • Erosion : min over the structuring element Mathematical Morphology 11 Basic operator: grayscale • Opening ° : remove light features smaller than the structuring element Mathematical Morphology 12 Basic operator: grayscale • Closing ° : remove dark features smaller than the structuring element Mathematical Morphology 13 Basic operator: grayscale • Sequential filter (open-close or close-open): remove both light and dark features Mathematical Morphology 14 Overview • Basic morphological operators – Binary – Grayscale – Color – Structuring element • More complex operations • Conclusion and References Mathematical Morphology 15 Color images • Process each channel separately: color ghosting with basic operators Mathematical Morphology 16 Color images • Process each channel separately: color ghosting unnoticeable with sequential operators opening Mathematical Morphology 17 Color images • Several ordering strategy Mathematical Morphology 18 Overview • Basic morphological operators – Binary – Grayscale – Color – Structuring element • More complex operations • Conclusion and References Mathematical Morphology 19 Structuring element • Usually, flat element (binary) • Grayscale element: fuzzy morphology Mathematical Morphology 20 Structuring element • Shape has an impact! Mathematical Morphology 21 Structuring element • Choose the structuring element according to the image structure Mathematical Morphology 22 Structuring element • Choose the structuring element according to the image structure Mathematical Morphology 23 Overview • Basic morphological operators • More complex operations – Reconstruction operators – Top hat, sharpening, distance, thinning, segmentation... • Conclusion and References Mathematical Morphology 24 Reconstruction operators • Remove features smaller than the structuring element, without altering the shape • Reconstruct connected components from the preserved features Mathematical Morphology 25 Reconstruction operators: binary • Opening by reconstruction: – Erosion: f'(0) = f – Iterative reconstruction: f'(t+1) = min(f'(t),I) until stability Mathematical Morphology 26 Reconstruction operators: binary • Closing by reconstruction: – Dilation: f'(0) = f – Iterative reconstruction: f'(t+1) = max(f'(t),I) until stability Mathematical Morphology 27 Reconstruction operators: grayscale • Opening by reconstruction: remove unconnected light features Mathematical Morphology 28 Reconstruction operators: grayscale • Closing by reconstruction: remove unconnected dark features Mathematical Morphology 29 Reconstruction operators: grayscale • Sequential filter by reconstruction: open-close Mathematical Morphology 30 Overview • Basic morphological operators • More complex operations – Reconstruction operators – Top hat, sharpening, distance, thinning, segmentation... • Conclusion and References Mathematical Morphology 31 Top Hat • White top-hat: f-opening(f) Extract light features Mathematical Morphology 32 Top Hat • Black top-hat: closing(f)-f Extract dark features Mathematical Morphology 33 Edge sharpening • Toggle mapping f f f (f+f)/2 Mathematical Morphology 34 Edge sharpening • Toggle mapping Mathematical Morphology 35 Distance function • Distance from binary elements Mathematical Morphology 36 Thinning • Binary (or grayscale ?) skeleton Mathematical Morphology 37 Segmentation • Watershed: – Image = heightfield – Flood the image from its minima – Lake junctions give the segmentation Mathematical Morphology 38 Segmentation • Watershed: hierarchical results Mathematical Morphology 39 Overview • Basic morphological operators • More complex operations • Conclusion and References Mathematical Morphology 40 Conclusion • Powerful toolbox for many image analysis tasks • Not famous because not useful? • Not used because not famous? • Based on a whole mathematical theory • But can be very practical (maybe too much?) • French! Mathematical Morphology 41 References • Pierre Soille, 2003: Morphological Image Analysis, Principles and Applications. (Practical approach) • Jean Serra and Luc Vincent, 1992: An Overview of Morphological Filtering. (Mathematical approach) Mathematical Morphology 42.
Load more

Recommended publications
  • Linguistic Interpretation of Mathematical Morphology
    Eureka-2013. Fourth International Workshop Proceedings Linguistic Interpretation of Mathematical Morphology Agustina Bouchet1,2, Gustavo Meschino3, Marcel Brun1, Rafael Espin Andrade4, Virginia Ballarin1 1 Universidad Nacional de Mar de Plata, Mar de Plata, Argentina. 2 CONICET, Mar de Plata, Argentina. 3 Universidad Nacional de Mar de Plata, Mar de Plata, Argentina. 4 ISPJAE, Universidad Técnica de La Habana, Cuba. [email protected], [email protected], [email protected], [email protected], [email protected] Abstract strains imposed by t-norms and s-norms, which are by themselves also conjunctions and disjunctions. Mathematical Morphology is a theory based on geometry, By replacing t-norm and s-norm by conjunction and algebra, topology and set theory, with strong application disjunction, respectively, we obtain the dilation and ero- to digital image processing. This theory is characterized sion operators for the Compensatory Fuzzy Mathematical by two basic operators: dilation and erosion. In this work Morphology (CMM), called compensatory dilation and we redefine these operators based on compensatory fuzzy compensatory erosion, respectively. Two different im- logic using a linguistic definition, compatible with previ- plementations of the CMM were presented at this moment ous definitions of Fuzzy Mathematical Morphology. A [12,21]. comparison to previous definitions is presented, assessing In this work new operators based on the definition of robustness against noise. the CMM are presented, but replacing the supreme and infimum by logical operators, which allow for a linguistic Keywords: Fuzzy Logic, Compensatory Fuzzy Logic, interpretation of their meaning. We call the New Com- Mathematical Morphology, Fuzzy Mathematical Mor- pensatory Morphological Operators.
    [Show full text]
  • Lecture 5: Binary Morphology
    Lecture 5: Binary Morphology c Bryan S. Morse, Brigham Young University, 1998–2000 Last modified on January 15, 2000 at 3:00 PM Contents 5.1 What is Mathematical Morphology? ................................. 1 5.2 Image Regions as Sets ......................................... 1 5.3 Basic Binary Operations ........................................ 2 5.3.1 Dilation ............................................. 2 5.3.2 Erosion ............................................. 2 5.3.3 Duality of Dilation and Erosion ................................. 3 5.4 Some Examples of Using Dilation and Erosion . .......................... 3 5.5 Proving Properties of Mathematical Morphology .......................... 3 5.6 Hit-and-Miss .............................................. 4 5.7 Opening and Closing .......................................... 4 5.7.1 Opening ............................................. 4 5.7.2 Closing ............................................. 5 5.7.3 Properties of Opening and Closing ............................... 5 5.7.4 Applications of Opening and Closing .............................. 5 Reading SH&B, 11.1–11.3 Castleman, 18.7.1–18.7.4 5.1 What is Mathematical Morphology? “Morphology” can literally be taken to mean “doing things to shapes”. “Mathematical morphology” then, by exten- sion, means using mathematical principals to do things to shapes. 5.2 Image Regions as Sets The basis of mathematical morphology is the description of image regions as sets. For a binary image, we can consider the “on” (1) pixels to all comprise a set of values from the “universe” of pixels in the image. Throughout our discussion of mathematical morphology (or just “morphology”), when we refer to an image A, we mean the set of “on” (1) pixels in that image. The “off” (0) pixels are thus the set compliment of the set of on pixels. By Ac, we mean the compliment of A,or the off (0) pixels.
    [Show full text]
  • Hit-Or-Miss Transform
    Hit-or-miss transform • Used to extract pixels with specific neighbourhood configurations from an image • Grey scale extension exist • Uses two structure elements B1 and B2 to find a given foreground and background configuration, respectively C HMT B X={x∣B1x⊆X ,B2x⊆X } • Example: 1 Morphological Image Processing Lecture 22 (page 1) 9.4 The hit-or-miss transformation Illustration... Morphological Image Processing Lecture 22 (page 2) Objective is to find a disjoint region (set) in an image • If B denotes the set composed of X and its background, the• match/hit (or set of matches/hits) of B in A,is A B =(A X) [Ac (W X)] ¯∗ ª ∩ ª − Generalized notation: B =(B1,B2) • Set formed from elements of B associated with B1: • an object Set formed from elements of B associated with B2: • the corresponding background [Preceeding discussion: B1 = X and B2 =(W X)] − More general definition: • c A B =(A B1) [A B2] ¯∗ ª ∩ ª A B contains all the origin points at which, simulta- • ¯∗ c neously, B1 found a hit in A and B2 found a hit in A Hit-or-miss transform C HMT B X={x∣B1x⊆X ,B2x⊆X } • Can be written in terms of an intersection of two erosions: HMT X= X∩ X c B B1 B2 2 Hit-or-miss transform • Simple example usages - locate: – Isolated foreground pixels • no neighbouring foreground pixels – Foreground endpoints • one or zero neighbouring foreground pixels – Multiple foreground points • pixels having more than two neighbouring foreground pixels – Foreground contour points • pixels having at least one neighbouring background pixel 3 Hit-or-miss transform example • Locating 4-connected endpoints SEs for 4-connected endpoints Resulting Hit-or-miss transform 4 Hit-or-miss opening • Objective: keep all points that fit the SE.
    [Show full text]
  • Introduction to Mathematical Morphology
    COMPUTER VISION, GRAPHICS, AND IMAGE PROCESSING 35, 283-305 (1986) Introduction to Mathematical Morphology JEAN SERRA E. N. S. M. de Paris, Paris, France Received October 6,1983; revised March 20,1986 1. BACKGROUND As we saw in the foreword, there are several ways of approaching the description of phenomena which spread in space, and which exhibit a certain spatial structure. One such approach is to consider them as objects, i.e., as subsets of their space of definition. The method which derives from this point of view is. called mathematical morphology [l, 21. In order to define mathematical morphology, we first require some background definitions. Consider an arbitrary space (or set) E. The “objects” of this :space are the subsets X c E; therefore, the family that we have to handle theoretically is the set 0 (E) of all the subsets X of E. The set p(E) is incomparably less arbitrary than E itself; indeed it is constructured to be a Boolean algebra [3], that is: (i) p(E) is a complete lattice, i.e., is provided with a partial-ordering relation, called inclusion, and denoted by “ c .” Moreover every (finite or not) family of members Xi E p(E) has a least upper bound (their union C/Xi) and a greatest lower bound (their intersection f7 X,) which both belong to p(E); (ii) The lattice p(E) is distributiue, i.e., xu(Ynz)=(XuY)n(xuZ) VX,Y,ZE b(E) and is complemented, i.e., there exist a greatest set (E itself) and a smallest set 0 (the empty set) such that every X E p(E) possesses a complement Xc defined by the relationships: XUXC=E and xn xc= 0.
    [Show full text]
  • M-Idempotent and Self-Dual Morphological Filters ا
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 34, NO. 4, APRIL 2012 805 Short Papers___________________________________________________________________________________________________ M-Idempotent and Self-Dual and morphological filters (opening and closing, alternating filters, Morphological Filters alternating sequential filters (ASF)). The quest for self-dual and/or idempotent operators has been the focus of many investigators. We refer to some important work Nidhal Bouaynaya, Member, IEEE, in the area in chronological order. A morphological operator that is Mohammed Charif-Chefchaouni, and idempotent and self-dual has been proposed in [28] by using the Dan Schonfeld, Fellow, IEEE notion of the middle element. The middle element, however, can only be obtained through repeated (possibly infinite) iterations. Meyer and Serra [19] established conditions for the idempotence of Abstract—In this paper, we present a comprehensive analysis of self-dual and the class of the contrast mappings. Heijmans [8] proposed a m-idempotent operators. We refer to an operator as m-idempotent if it converges general method for the construction of morphological operators after m iterations. We focus on an important special case of the general theory of that are self-dual, but not necessarily idempotent. Heijmans and lattice morphology: spatially variant morphology, which captures the geometrical Ronse [10] derived conditions for the idempotence of the self-dual interpretation of spatially variant structuring elements. We demonstrate that every annular operator, in which case it will be called an annular filter. increasing self-dual morphological operator can be viewed as a morphological An alternative framework for morphological image processing that center. Necessary and sufficient conditions for the idempotence of morphological operators are characterized in terms of their kernel representation.
    [Show full text]
  • CALL for PAPERS IEEE Journal of Selected Topics In
    CALL FOR PAPERS IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing Special Issue on “Mathematical Morphology in Remote Sensing and Geoscience” Historically, mathematical morphology was the first consistent non-linear image analysis theory, which from the very start included not only theoretical results but also many practical aspects. Mathematical morphology is capable of handling the most varied image types, in a way that is often subtle yet efficient. It can also be used to process general graphs, surfaces, implicit and explicit volumes, manifolds, time or spectral series, in both deterministic and stochastic contexts. In the last five years, connected signal representations and connected operators have emerged as tools for segmentation and filtering, leading to extremely versatile techniques for solving problems in a variety of domains including information science, geoscience, and image and signal analysis and processing. The application of mathematical morphology in processing and analysis of remotely sensed spatial data acquired at multi-spatial-spectral-temporal scales and by-products such as Digital Elevation Model (DEM) and thematic information in map forms has shown significant success in the last two decades. From data acquisition to the level of making theme-specific predictions, there exists several phases that include feature extraction (information retrieval), information analysis/characterization, information reasoning, spatio-temporal modelling and visualization. Relatively, numerous approaches/frameworks/schemes/ algorithms are available to address information retrieval when compare to those approaches available to address the rest of the topics. With the availability of data across various spatial/spectral/temporal resolutions, besides information extraction, other topics like pattern retrieval, pattern analysis, spatial reasoning, and simulation and modeling of spatiotemporal behaviors of several terrestrial phenomena and processes also need to be given emphasis.
    [Show full text]
  • Morphological Image Compression Using Skeletons
    Morphological Image Compression using Skeletons Nimrod Peleg Update: March 2008 What is Mathematical Morphology ? “... a theory for analysis of spatial structures which was initiated by George Matheron and Jean Serra. It is called Morphology since it aims at the analyzing the shape and the forms of the objects. It is Mathematical in the sense that the analysis is based on set theory, topology, lattice, random functions, etc. “ (Serra and Soille, 1994). Basic Operation: Dilation • Dilation: replacing every pixel with the maximum value of its neighborhood determined by the structure element (SE) X B x b|, x X b B Original SE Dilation Dilation demonstration Original Figure Dilated Image With Circle SE Dilation example Dilation (Israel Map, circle SE): Basic Operation: Erosion • Erosion: A Dual operation - replacing every pixel with the minimum value of its neighborhood determined by the SE C XBXB C Original SE Erosion Erosion demonstration Original Figure Eroded Image With Circle SE Erosion example Erosion (Lena, circle SE): Original B&W Lena Eroded Lena, SE radius = 4 Composed Operations: Opening • Opening: Erosion and than Dilation‎ removes positive peaks narrower than the SE XBXBB () Original SE Opening Opening demonstration Original Figure Opened Image With Circle SE Opening example Opening (Lena, circle SE): Original B&W Lena Opened Lena, SE radius = 4 Composed Operations: Closing • Closing: Dilation and than Erosion removes negative peaks narrower than the SE XBXBB () Original SE Closing Closing demonstration Original Figure Closed Image With Circle SE Closing example • Closing (Lena, circle SE): Original B&W Lena Closed Lena, SE radius = 4 Cleaning “white” noise Opening & Closing Cleaning “black” noise Closing & Opening Conditioned dilation Y ()()XXBY • Example: Original Figure Opened Figure By Circle SE Conditioned Dilated Figure Opening By Reconstruction Rec( mask , kernel ) lim( mask ( kernel )) n n • Open by rec.
    [Show full text]
  • Imagemap Simplification Using Mathematical Morphology
    Jalal Amini Imagemap simplification using mathematical morphology M.R.Saradjian ** J. Amini , * Department of Surveying Engineering, Faculty of Engineering *,** Tehran University, Tehran, IRAN. * Department of Research, National Cartographic Center (N.C.C) Tehran, IRAN. [email protected] KEY WORDS: Morphology, Photogrammetry, Remote sensing, Segmentation, Simplification, Thinning. ABSTRACT For a variety of mapping applications, images are the most important primary data sources. In photogrammetry and remote sensing, particular procedures are used for image and map data integration in order to perform change detection and automatic object extraction. The recognition of an object in an image is a complex task that involves a broad range of techniques. In general, three steps are used in this study. The first step is segmentation to object regions of interest. In this step, regions which may contain unknown objects, have to be detected. The second step focuses on the extraction of suitable features and then extraction of objects. The main purpose of feature extraction is to reduce data by means of measuring certain features that distinguish the input patterns. The final step is classification. It assigns a label to an object based on the information provided by its descriptors. At the end of segmentation stage, the images are too still complex. So it is necessary to simplify image for further processes. In this paper, investigation is made on the mathematical morphology operators for simplification of a gray-scale image or imagemap. Then an structure element, ()L 4 , is applied on binary images to extract the skeletonized image. In this stage, there will remain lots of skeletal legs in the resultant image.
    [Show full text]
  • Topics in Mathematical Morphology for Multivariate Images Santiago Velasco-Forero
    Topics in mathematical morphology for multivariate images Santiago Velasco-Forero To cite this version: Santiago Velasco-Forero. Topics in mathematical morphology for multivariate images. General Mathematics [math.GM]. Ecole Nationale Supérieure des Mines de Paris, 2012. English. NNT : 2012ENMP0086. pastel-00820581 HAL Id: pastel-00820581 https://pastel.archives-ouvertes.fr/pastel-00820581 Submitted on 6 May 2013 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. !"#$!$%$&'(#&#)!(")(#&($&$()*"+,+-!(# École doctorale nO432 : Sciences des Métiers de l’Ingénieur Doctorat ParisTech THÈSE pour obtenir le grade de docteur délivré par l’École nationale supérieure des mines de Paris Spécialité « Morphologie Mathématique » présentée et soutenue publiquement par Santiago Velasco-Forero le 14 juin 2012 Contributions en morphologie mathématique pour l’analyse d’images multivariées Directeur de thèse : Jesús ANGULO ! Jury M. Dominique JEULIN, Professeur, CMM-MS, Mines ParisTech Président " M. Jos B.T.M. ROERDINK, Professeur, University of Groningen Rapporteur M. Pierre SOILLE, Directeur de recherche, Joint Research Centre of the European Commission Rapporteur # M. Jón Atli BENEDIKTSSON, Professeur, University of Iceland Examinateur M. Fernand MEYER, Directeur de recherche, CMM, Mines ParisTech Examinateur $ M. Jean SERRA, Professeur émérite, ESIEE, Université Paris-Est Examinateur M.
    [Show full text]
  • Computer Vision – A
    CS4495 Computer Vision – A. Bobick Morphology CS 4495 Computer Vision Binary images and Morphology Aaron Bobick School of Interactive Computing CS4495 Computer Vision – A. Bobick Morphology Administrivia • PS7 – read about it on Piazza • PS5 – grades are out. • Final – Dec 9 • Study guide will be out by Thursday hopefully sooner. CS4495 Computer Vision – A. Bobick Morphology Binary Image Analysis Operations that produce or process binary images, typically 0’s and 1’s • 0 represents background • 1 represents foreground 00010010001000 00011110001000 00010010001000 Slides: Linda Shapiro CS4495 Computer Vision – A. Bobick Morphology Binary Image Analysis Used in a number of practical applications • Part inspection • Manufacturing • Document processing CS4495 Computer Vision – A. Bobick Morphology What kinds of operations? • Separate objects from background and from one another • Aggregate pixels for each object • Compute features for each object CS4495 Computer Vision – A. Bobick Morphology Example: Red blood cell image • Many blood cells are separate objects • Many touch – bad! • Salt and pepper noise from thresholding • How useable is this data? CS4495 Computer Vision – A. Bobick Morphology Results of analysis • 63 separate objects detected • Single cells have area about 50 • Noise spots • Gobs of cells CS4495 Computer Vision – A. Bobick Morphology Useful Operations • Thresholding a gray-scale image • Determining good thresholds • Connected components analysis • Binary mathematical morphology • All sorts of feature extractors, statistics (area, centroid, circularity, …) CS4495 Computer Vision – A. Bobick Morphology Thresholding • Background is black • Healthy cherry is bright • Bruise is medium dark • Histogram shows two cherry regions (black background has been removed) Pixel counts Pixel 0 Grayscale values 255 CS4495 Computer Vision – A. Bobick Morphology Histogram-Directed Thresholding • How can we use a histogram to separate an image into 2 (or several) different regions? Is there a single clear threshold? 2? 3? CS4495 Computer Vision – A.
    [Show full text]
  • Morphological Operations on Matrix-Valued Images
    Morphological Operations on Matrix-Valued Images Bernhard Burgeth, Martin Welk, Christian Feddern, and Joachim Weickert Mathematical Image Analysis Group Faculty of Mathematics and Computer Science, Bldg. 27 Saarland University, 66041 Saarbruc¨ ken, Germany burgeth,welk,feddern,weickert @mia.uni-saarland.de f g http://www.mia.uni-saarland.de Abstract. The output of modern imaging techniques such as diffusion tensor MRI or the physical measurement of anisotropic behaviour in materials such as the stress-tensor consists of tensor-valued data. Hence adequate image processing methods for shape analysis, skeletonisation, denoising and segmentation are in demand. The goal of this paper is to extend the morphological operations of dilation, erosion, opening and closing to the matrix-valued setting. We show that naive approaches such as componentwise application of scalar morphological operations are unsatisfactory, since they violate elementary requirements such as invariance under rotation. This lead us to study an analytic and a geo- metric alternative which are rotation invariant. Both methods introduce novel non-component-wise definitions of a supremum and an infimum of a finite set of matrices. The resulting morphological operations incorpo- rate information from all matrix channels simultaneously and preserve positive definiteness of the matrix field. Their properties and their per- formance are illustrated by experiments on diffusion tensor MRI data. Keywords: mathematical morphology, dilation, erosion, matrix-valued imaging, DT-MRI 1 Introduction Modern data and image processing encompasses more and more the analysis and processing of matrix-valued data. For instance, diffusion tensor magnetic reso- nance imaging (DT-MRI), a novel medical image acquisition technique, measures the diffusion properties of water molecules in tissue.
    [Show full text]
  • Mathematical Morphology: a Tool for Automated GIS Data Acquisition from Scanned Thematic Maps
    Mathematical Morphology: A Tool for Automated GIs Data ~cquisitionfrom Scanned Thematic Maps Marc M. Ansoult and Pierre J. Soille Unit of Agricultural Engineering, Universite Catholique de Louvain, Place Croix du Sud, 3, 8-1348 Louvain-la-Neuve, BeIgium Jean A. Loodts Eurosense Technologies N.V., Ne~erslaan,54, B-1810 Wemmel, Belgium ABSTRACT:Over several years, the demand for digital data has grown as geographical information systems were im- plemented. Because of the cost of database creation, data acquisition should unquestionably be automated as much as possible. Today, scanning devices produce a huge amount of data that still needs complex processing. This paper proposes an original approach using image processing tools coming from Mathematical Morphology theory to acquire GIs data from scanned thematic maps. These tools are used in order to obtain a segmentation prior to radiometric analysis. To illustrate the methodology, a subset of the Belgian soil map is treated. INTRODUCTION tures characterize the Belgian soil map (Tavernier & Marechal, URING THE LAST FIFTEEN YEARS, dramatic growth in the use 1958): Dof geographical information systems (GIs) occurred in many More than 200 classes are offset printed using 12 fundamental disciplines. This technology provides multipurpose land infor- colors. mation systems as a means of dealing with the land records Black border lines delimit thematic colored areas. modernization problem. Natural resources modeling and man- Text labeling lays inside some areas. agement also benefit greatly from this technology by integrating Presence of a background gray colored topographic overlay. Typical features inside some areas like black and colored patterns a tremendous amount of data.
    [Show full text]