Upload
beckybirdie
View
230
Download
0
Embed Size (px)
Citation preview
8/8/2019 Please Rea1
1/90
Please read:
A personal appeal fromWikipedia founder Jimmy
Wales
Mathematical morphology
From Wikipedia, the free encyclopedia
A shape (in blue) and its morphological dilation (in green) and erosion (in yellow) by
a diamond-shape structuring element.
Mathematical morphology (MM) is a theory and technique for the analysis and processing of geometricalstructures, based on set theory,lattice theory,topology, and random functions. MM is most commonly
applied to digital images, but it can be employed as well ongraphs,surface meshes,solids, and many other
spatial structures.
Topological and geometricalcontinuous-space concepts such as size, shape, convexity, connectivity,
andgeodesic distance, can be characterized by MM on both continuous anddiscrete spaces. MM is also
the foundation of morphological image processing, which consists of a set of operators that transform
images according to the above characterizations.
MM was originally developed forbinary images, and was later extended tograyscalefunctions and images.
The subsequent generalization tocomplete latticesis widely accepted today as MM's theoretical foundation.
http://wikimediafoundation.org/wiki/Special:LandingCheck?landing_page=WMFJA1&language=en&country=IN&utm_source=2010_JA1_Banner2_button_EN1&utm_medium=sitenotice&utm_campaign=20101115JA01http://wikimediafoundation.org/wiki/Special:LandingCheck?landing_page=WMFJA1&language=en&country=IN&utm_source=2010_JA1_Banner2_button_EN1&utm_medium=sitenotice&utm_campaign=20101115JA01http://wikimediafoundation.org/wiki/Special:LandingCheck?landing_page=WMFJA1&language=en&country=IN&utm_source=2010_JA1_Banner2_button_EN1&utm_medium=sitenotice&utm_campaign=20101115JA01http://wikimediafoundation.org/wiki/Special:LandingCheck?landing_page=WMFJA1&language=en&country=IN&utm_source=2010_JA1_Banner2_button_EN1&utm_medium=sitenotice&utm_campaign=20101115JA01http://en.wikipedia.org/wiki/Set_theoryhttp://en.wikipedia.org/wiki/Set_theoryhttp://en.wikipedia.org/wiki/Lattice_theoryhttp://en.wikipedia.org/wiki/Topologyhttp://en.wikipedia.org/wiki/Topologyhttp://en.wikipedia.org/wiki/Topologyhttp://en.wikipedia.org/wiki/Random_functionhttp://en.wikipedia.org/wiki/Digital_imagehttp://en.wikipedia.org/wiki/Graphhttp://en.wikipedia.org/wiki/Graphhttp://en.wikipedia.org/wiki/Graphhttp://en.wikipedia.org/wiki/Polygon_meshhttp://en.wikipedia.org/wiki/Solid_geometryhttp://en.wikipedia.org/wiki/Solid_geometryhttp://en.wikipedia.org/wiki/Topologyhttp://en.wikipedia.org/wiki/Geometryhttp://en.wikipedia.org/wiki/Continuumhttp://en.wikipedia.org/wiki/Continuumhttp://en.wikipedia.org/wiki/Sizehttp://en.wikipedia.org/wiki/Shapehttp://en.wikipedia.org/wiki/Convex_sethttp://en.wikipedia.org/wiki/Connectednesshttp://en.wikipedia.org/wiki/Geodesic_distancehttp://en.wikipedia.org/wiki/Geodesic_distancehttp://en.wikipedia.org/wiki/Discrete_spacehttp://en.wikipedia.org/wiki/Discrete_spacehttp://en.wikipedia.org/wiki/Discrete_spacehttp://en.wikipedia.org/wiki/Binary_imagehttp://en.wikipedia.org/wiki/Binary_imagehttp://en.wikipedia.org/wiki/Binary_imagehttp://en.wikipedia.org/wiki/Grayscalehttp://en.wikipedia.org/wiki/Grayscalehttp://en.wikipedia.org/wiki/Functionhttp://en.wikipedia.org/wiki/Functionhttp://en.wikipedia.org/wiki/Complete_latticehttp://en.wikipedia.org/wiki/Complete_latticehttp://en.wikipedia.org/wiki/File:DilationErosion.pnghttp://en.wikipedia.org/wiki/File:DilationErosion.pnghttp://en.wikipedia.org/wiki/Mathematical_morphologyhttp://wikimediafoundation.org/wiki/Special:LandingCheck?landing_page=WMFJA1&language=en&country=IN&utm_source=2010_JA1_Banner2_button_EN1&utm_medium=sitenotice&utm_campaign=20101115JA01http://wikimediafoundation.org/wiki/Special:LandingCheck?landing_page=WMFJA1&language=en&country=IN&utm_source=2010_JA1_Banner2_button_EN1&utm_medium=sitenotice&utm_campaign=20101115JA01http://wikimediafoundation.org/wiki/Special:LandingCheck?landing_page=WMFJA1&language=en&country=IN&utm_source=2010_JA1_Banner2_button_EN1&utm_medium=sitenotice&utm_campaign=20101115JA01http://en.wikipedia.org/wiki/Set_theoryhttp://en.wikipedia.org/wiki/Lattice_theoryhttp://en.wikipedia.org/wiki/Topologyhttp://en.wikipedia.org/wiki/Random_functionhttp://en.wikipedia.org/wiki/Digital_imagehttp://en.wikipedia.org/wiki/Graphhttp://en.wikipedia.org/wiki/Polygon_meshhttp://en.wikipedia.org/wiki/Solid_geometryhttp://en.wikipedia.org/wiki/Topologyhttp://en.wikipedia.org/wiki/Geometryhttp://en.wikipedia.org/wiki/Continuumhttp://en.wikipedia.org/wiki/Sizehttp://en.wikipedia.org/wiki/Shapehttp://en.wikipedia.org/wiki/Convex_sethttp://en.wikipedia.org/wiki/Connectednesshttp://en.wikipedia.org/wiki/Geodesic_distancehttp://en.wikipedia.org/wiki/Discrete_spacehttp://en.wikipedia.org/wiki/Binary_imagehttp://en.wikipedia.org/wiki/Grayscalehttp://en.wikipedia.org/wiki/Functionhttp://en.wikipedia.org/wiki/Complete_lattice8/8/2019 Please Rea1
2/90
Contents
[hide]
1 History
1.1 References
2 Binary morphology
2.1 Structuring element
2.2 Basic operators
2.2.1 Erosion
2.2.2 Dilation
2.2.3 Opening
2.2.4 Closing
2.2.5 Properties of the basic
operators
2.3 Other operators and tools
3 Grayscale morphology
3.1 Flat structuring functions
3.2 Other operators and tools
4 Mathematical morphology on complete lattices
4.1 Adjunctions (Dilation and Erosion)
4.2 Opening and Closing
4.3 Particular cases
5 References
6 External links
[edit]History
Mathematical Morphology was born in 1964 from the collaborative work ofGeorges MatheronandJean
Serra, at the cole des Mines de Paris,France. Matheron supervised thePhDthesis of Serra, devoted to
the quantification of mineral characteristics from thin cross sections, and this work resulted in a novel
practical approach, as well as theoretical advancements inintegral geometry and topology.
In 1968, the Centre de Morphologie Mathmatiquewas founded by the cole des Mines de Paris
in Fontainebleau, France, lead by Matheron and Serra.
http://en.wikipedia.org/wiki/Mathematical_morphologyhttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=1http://en.wikipedia.org/wiki/Georges_Matheronhttp://en.wikipedia.org/wiki/Georges_Matheronhttp://en.wikipedia.org/wiki/Georges_Matheronhttp://en.wikipedia.org/wiki/Jean_Serrahttp://en.wikipedia.org/wiki/Jean_Serrahttp://en.wikipedia.org/wiki/Jean_Serrahttp://en.wikipedia.org/wiki/Jean_Serrahttp://en.wikipedia.org/wiki/%C3%89cole_des_Mines_de_Parishttp://en.wikipedia.org/wiki/%C3%89cole_des_Mines_de_Parishttp://en.wikipedia.org/wiki/Francehttp://en.wikipedia.org/wiki/Francehttp://en.wikipedia.org/wiki/PhDhttp://en.wikipedia.org/wiki/PhDhttp://en.wikipedia.org/wiki/Thesishttp://en.wikipedia.org/wiki/Cross_section_(geometry)http://en.wikipedia.org/wiki/Integral_geometryhttp://en.wikipedia.org/wiki/Integral_geometryhttp://en.wikipedia.org/wiki/Topologyhttp://en.wikipedia.org/wiki/Centre_de_Morphologie_Math%C3%A9matiquehttp://en.wikipedia.org/wiki/Centre_de_Morphologie_Math%C3%A9matiquehttp://en.wikipedia.org/wiki/Fontainebleauhttp://en.wikipedia.org/wiki/Fontainebleauhttp://en.wikipedia.org/wiki/Mathematical_morphologyhttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=1http://en.wikipedia.org/wiki/Georges_Matheronhttp://en.wikipedia.org/wiki/Jean_Serrahttp://en.wikipedia.org/wiki/Jean_Serrahttp://en.wikipedia.org/wiki/%C3%89cole_des_Mines_de_Parishttp://en.wikipedia.org/wiki/Francehttp://en.wikipedia.org/wiki/PhDhttp://en.wikipedia.org/wiki/Thesishttp://en.wikipedia.org/wiki/Cross_section_(geometry)http://en.wikipedia.org/wiki/Integral_geometryhttp://en.wikipedia.org/wiki/Topologyhttp://en.wikipedia.org/wiki/Centre_de_Morphologie_Math%C3%A9matiquehttp://en.wikipedia.org/wiki/Fontainebleau8/8/2019 Please Rea1
3/90
During the rest of the 1960's and most of the 1970's, MM dealt essentially with binary images, treated
as sets, and generated a large number ofbinary operators and techniques:Hit-or-miss
transform,dilation, erosion,opening,closing,granulometry, thinning,skeletonization,ultimate
erosion,conditional bisector, and others. A random approach was also developed, based on novel image
models. Most of the work in that period was developed in Fontainebleau.
From mid-1970's to mid-1980's, MM was generalized to grayscale functions andimages as well. Besides
extending the main concepts (such as dilation, erosion, etc...) to functions, this generalization yielded new
operators, such as morphological gradients, top-hat transformand theWatershed(MM's
mainsegmentationapproach).
In the 1980's and 1990's, MM gained a wider recognition, as research centers in several countries began to
adopt and investigate the method. MM started to be applied to a large number of imaging problems and
applications.
In 1986, Jean Serra further generalized MM, this time to a theoretical framework based on complete
lattices. This generalization brought flexibility to the theory, enabling its application to a much larger number
of structures, including color images, video, graphs,meshes, etc... At the same time, Matheron and Serra
also formulated a theory for morphological filtering, based on the new lattice framework.
The 1990's and 2000's also saw further theoretical advancements, including the concepts
ofconnectionsandlevelings.
In 1993, the first International Symposium on Mathematical Morphology (ISMM) took place
in Barcelona, Spain. Since then, ISMMs are organized every 2-3 years, each time in a different part of the
world: Fontainebleau,France (1994);Atlanta,USA (1996);Amsterdam,Netherlands(1998); Palo
Alto,CA, USA (2000); Sydney, Australia (2002);Paris,France (2004);Rio de Janeiro, Brazil (2007);
andGroningen, Netherlands(2009).
[edit]References
"Introduction" by Pierre Soille, in (Serra et al. (Eds.) 1994), pgs. 1-4.
"Appendix A: The 'Centre de Morphologie Mathmatique', an overview" by
Jean Serra, in (Serra et al. (Eds.) 1994), pgs. 369-374.
"Foreword" in (Ronse et al. (Eds.) 2005)
[edit]Binary morphology
In binary morphology, an image is viewed as a subset of anEuclidean space or the integer grid ,
for some dimension d.
[edit]Structuring element
http://en.wikipedia.org/wiki/Binary_imagehttp://en.wikipedia.org/wiki/Binary_imagehttp://en.wikipedia.org/wiki/Set_(mathematics)http://en.wikipedia.org/wiki/Binary_operatorhttp://en.wikipedia.org/wiki/Binary_operatorhttp://en.wikipedia.org/wiki/Hit-or-miss_transformhttp://en.wikipedia.org/wiki/Hit-or-miss_transformhttp://en.wikipedia.org/wiki/Hit-or-miss_transformhttp://en.wikipedia.org/wiki/Dilationhttp://en.wikipedia.org/wiki/Dilationhttp://en.wikipedia.org/wiki/Erosion_(morphology)http://en.wikipedia.org/wiki/Opening_(morphology)http://en.wikipedia.org/wiki/Opening_(morphology)http://en.wikipedia.org/wiki/Closing_(morphology)http://en.wikipedia.org/wiki/Closing_(morphology)http://en.wikipedia.org/wiki/Granulometry_(morphology)http://en.wikipedia.org/wiki/Granulometry_(morphology)http://en.wikipedia.org/wiki/Topological_skeletonhttp://en.wikipedia.org/wiki/Topological_skeletonhttp://en.wikipedia.org/wiki/Topological_skeletonhttp://en.wikipedia.org/w/index.php?title=Ultimate_erosion&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Ultimate_erosion&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Conditional_bisector&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Conditional_bisector&action=edit&redlink=1http://en.wikipedia.org/wiki/Grayscalehttp://en.wikipedia.org/wiki/Imagehttp://en.wikipedia.org/wiki/Imagehttp://en.wikipedia.org/wiki/Morphological_Gradienthttp://en.wikipedia.org/wiki/Top-hat_transformhttp://en.wikipedia.org/wiki/Top-hat_transformhttp://en.wikipedia.org/wiki/Watershed_(algorithm)http://en.wikipedia.org/wiki/Watershed_(algorithm)http://en.wikipedia.org/wiki/Watershed_(algorithm)http://en.wikipedia.org/wiki/Segmentationhttp://en.wikipedia.org/wiki/Segmentationhttp://en.wikipedia.org/wiki/Segmentationhttp://en.wikipedia.org/wiki/Complete_latticehttp://en.wikipedia.org/wiki/Complete_latticehttp://en.wikipedia.org/wiki/Graphhttp://en.wikipedia.org/wiki/Meshhttp://en.wikipedia.org/wiki/Meshhttp://en.wikipedia.org/wiki/Meshhttp://en.wikipedia.org/wiki/Filter_(mathematics)http://en.wikipedia.org/w/index.php?title=Connection_(morphology)&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Connection_(morphology)&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Connection_(morphology)&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Leveling_(morphology)&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Leveling_(morphology)&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Leveling_(morphology)&action=edit&redlink=1http://en.wikipedia.org/wiki/Barcelonahttp://en.wikipedia.org/wiki/Spainhttp://en.wikipedia.org/wiki/Spainhttp://en.wikipedia.org/wiki/Fontainebleauhttp://en.wikipedia.org/wiki/Fontainebleauhttp://en.wikipedia.org/wiki/Francehttp://en.wikipedia.org/wiki/Francehttp://en.wikipedia.org/wiki/Atlantahttp://en.wikipedia.org/wiki/Atlantahttp://en.wikipedia.org/wiki/United_States_of_Americahttp://en.wikipedia.org/wiki/United_States_of_Americahttp://en.wikipedia.org/wiki/Amsterdamhttp://en.wikipedia.org/wiki/Amsterdamhttp://en.wikipedia.org/wiki/Netherlandshttp://en.wikipedia.org/wiki/Netherlandshttp://en.wikipedia.org/wiki/Netherlandshttp://en.wikipedia.org/wiki/Palo_Altohttp://en.wikipedia.org/wiki/Palo_Altohttp://en.wikipedia.org/wiki/Palo_Altohttp://en.wikipedia.org/wiki/Californiahttp://en.wikipedia.org/wiki/United_States_of_Americahttp://en.wikipedia.org/wiki/Sydneyhttp://en.wikipedia.org/wiki/Australiahttp://en.wikipedia.org/wiki/Parishttp://en.wikipedia.org/wiki/Parishttp://en.wikipedia.org/wiki/Francehttp://en.wikipedia.org/wiki/Francehttp://en.wikipedia.org/wiki/Rio_de_Janeirohttp://en.wikipedia.org/wiki/Rio_de_Janeirohttp://en.wikipedia.org/wiki/Brazilhttp://en.wikipedia.org/wiki/Groningen_(city)http://en.wikipedia.org/wiki/Groningen_(city)http://en.wikipedia.org/wiki/Netherlandshttp://en.wikipedia.org/wiki/Netherlandshttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=2http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=3http://en.wikipedia.org/wiki/Subsethttp://en.wikipedia.org/wiki/Euclidean_spacehttp://en.wikipedia.org/wiki/Euclidean_spacehttp://en.wikipedia.org/wiki/Euclidean_spacehttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=4http://en.wikipedia.org/wiki/Structuring_elementhttp://en.wikipedia.org/wiki/Binary_imagehttp://en.wikipedia.org/wiki/Set_(mathematics)http://en.wikipedia.org/wiki/Binary_operatorhttp://en.wikipedia.org/wiki/Hit-or-miss_transformhttp://en.wikipedia.org/wiki/Hit-or-miss_transformhttp://en.wikipedia.org/wiki/Dilationhttp://en.wikipedia.org/wiki/Erosion_(morphology)http://en.wikipedia.org/wiki/Opening_(morphology)http://en.wikipedia.org/wiki/Closing_(morphology)http://en.wikipedia.org/wiki/Granulometry_(morphology)http://en.wikipedia.org/wiki/Topological_skeletonhttp://en.wikipedia.org/w/index.php?title=Ultimate_erosion&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Ultimate_erosion&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Conditional_bisector&action=edit&redlink=1http://en.wikipedia.org/wiki/Grayscalehttp://en.wikipedia.org/wiki/Imagehttp://en.wikipedia.org/wiki/Morphological_Gradienthttp://en.wikipedia.org/wiki/Top-hat_transformhttp://en.wikipedia.org/wiki/Watershed_(algorithm)http://en.wikipedia.org/wiki/Segmentationhttp://en.wikipedia.org/wiki/Complete_latticehttp://en.wikipedia.org/wiki/Complete_latticehttp://en.wikipedia.org/wiki/Graphhttp://en.wikipedia.org/wiki/Meshhttp://en.wikipedia.org/wiki/Filter_(mathematics)http://en.wikipedia.org/w/index.php?title=Connection_(morphology)&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Leveling_(morphology)&action=edit&redlink=1http://en.wikipedia.org/wiki/Barcelonahttp://en.wikipedia.org/wiki/Spainhttp://en.wikipedia.org/wiki/Fontainebleauhttp://en.wikipedia.org/wiki/Francehttp://en.wikipedia.org/wiki/Atlantahttp://en.wikipedia.org/wiki/United_States_of_Americahttp://en.wikipedia.org/wiki/Amsterdamhttp://en.wikipedia.org/wiki/Netherlandshttp://en.wikipedia.org/wiki/Palo_Altohttp://en.wikipedia.org/wiki/Palo_Altohttp://en.wikipedia.org/wiki/Californiahttp://en.wikipedia.org/wiki/United_States_of_Americahttp://en.wikipedia.org/wiki/Sydneyhttp://en.wikipedia.org/wiki/Australiahttp://en.wikipedia.org/wiki/Parishttp://en.wikipedia.org/wiki/Francehttp://en.wikipedia.org/wiki/Rio_de_Janeirohttp://en.wikipedia.org/wiki/Brazilhttp://en.wikipedia.org/wiki/Groningen_(city)http://en.wikipedia.org/wiki/Netherlandshttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=2http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=3http://en.wikipedia.org/wiki/Subsethttp://en.wikipedia.org/wiki/Euclidean_spacehttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=4http://en.wikipedia.org/wiki/Structuring_element8/8/2019 Please Rea1
4/90
The basic idea in binary morphology is to probe an image with a simple, pre-defined shape, drawing
conclusions on how this shape fits or misses the shapes in the image. This simple "probe" is
calledstructuring element, and is itself a binary image (i.e., a subset of the space or grid).
Here are some examples of widely used structuring elements (denoted by B):
Let ; B is an open disk of radius r, centered at the origin.
Let ; B is a 3x3 square, that is, B={(-1,-1), (-1,0), (-1,1), (0,-1),
(0,0), (0,1), (1,-1), (1,0), (1,1)}.
Let ; B is the "cross" given by: B={(-1,0), (0,-1), (0,0), (0,1),
(1,0)}.
[edit]Basic operatorsThe basic operations are shift-invariant (translation invariant) operators strongly related to Minkowski
addition.
Let Ebe a Euclidean space or an integer grid, andA a binary image in E.
[edit]Erosion
The erosion of the dark-blue square by a disk, resulting in the light-blue square.
The erosion of the binary imageA by the structuring element B is defined by:
,
where Bz is the translation ofB by the vector z,
i.e., , .
When the structuring element B has a center (e.g., B is a disk or a
square), and this center is located on the origin ofE, then the erosion
ofAby B can be understood as the locus of points reached by the center
http://en.wikipedia.org/wiki/Structuring_elementhttp://en.wikipedia.org/wiki/Structuring_elementhttp://en.wikipedia.org/wiki/Structuring_elementhttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=5http://en.wikipedia.org/wiki/Translational_invariancehttp://en.wikipedia.org/wiki/Translational_invariancehttp://en.wikipedia.org/wiki/Minkowski_additionhttp://en.wikipedia.org/wiki/Minkowski_additionhttp://en.wikipedia.org/wiki/Minkowski_additionhttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=6http://en.wikipedia.org/wiki/Erosion_(morphology)http://en.wikipedia.org/wiki/File:Erosion.pnghttp://en.wikipedia.org/wiki/File:Erosion.pnghttp://en.wikipedia.org/wiki/Structuring_elementhttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=5http://en.wikipedia.org/wiki/Translational_invariancehttp://en.wikipedia.org/wiki/Minkowski_additionhttp://en.wikipedia.org/wiki/Minkowski_additionhttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=6http://en.wikipedia.org/wiki/Erosion_(morphology)8/8/2019 Please Rea1
5/90
ofB when B moves insideA. For example, the erosion of a square of
side 10, centered at the origin, by a disc of radius 2, also centered at the
origin, is a square of side 6 centered at the origin.
The erosion ofA by B is also given by the
expression: .
Example application: Assume we have received a fax of a dark
photocopy. Everything looks like it was written with a pen that is
bleeding. Erosion process will allow thicker lines to get skinny and detect
the hole inside the letter "o".
[edit]Dilation
The dilation of the dark-blue square by a disk, resulting in the light-blue
square with rounded corners.
The dilation ofA by the structuring element B is defined by:
.
The dilation is commutative, also given
by: .
IfB has a center on the origin, as before, then the dilation
ofA by B can be understood as thelocusof the points covered
by B when the center ofB moves insideA. In the above example,
the dilation of the square of side 10 by the disk of radius 2 is a
http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=7http://en.wikipedia.org/wiki/Dilation_(morphology)http://en.wikipedia.org/wiki/Locus_(mathematics)http://en.wikipedia.org/wiki/Locus_(mathematics)http://en.wikipedia.org/wiki/Locus_(mathematics)http://en.wikipedia.org/wiki/File:Dilation.pnghttp://en.wikipedia.org/wiki/File:Dilation.pnghttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=7http://en.wikipedia.org/wiki/Dilation_(morphology)http://en.wikipedia.org/wiki/Locus_(mathematics)8/8/2019 Please Rea1
6/90
square of side 14, with rounded corners, centered at the origin. The
radius of the rounded corners is 2.
The dilation can also be obtained
by: ,
where Bs denotes thesymmetric ofB, that
is, .
Example application: Dilation is the opposite of the erosion. Figures
that are very lightly drawn get thick when "dilated". Easiest way to
describe it is to imagine the same fax/text is written with a thicker
pen.
[edit]Opening
The opening of the dark-blue square by a disk, resulting in the light-
blue square with round corners.
The opening ofA by B is obtained by the erosion ofA by B,
followed by dilation of the resulting image by B:
.
The opening is also given by , which
means that it is the locus of translations of the structuring
element B inside the imageA. In the case of the square of
radius 10, and a disc of radius 2 as the structuring element,
the opening is a square of radius 10 with rounded corners,
where the corner radius is 2.
http://en.wikipedia.org/wiki/Rotational_symmetryhttp://en.wikipedia.org/wiki/Rotational_symmetryhttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=8http://en.wikipedia.org/wiki/Opening_(morphology)http://en.wikipedia.org/wiki/File:Opening.pnghttp://en.wikipedia.org/wiki/File:Opening.pnghttp://en.wikipedia.org/wiki/Rotational_symmetryhttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=8http://en.wikipedia.org/wiki/Opening_(morphology)8/8/2019 Please Rea1
7/90
Example application: Let's assume someone has written a
note on a non-soaking paper that writing looks like it is
growing tiny hairy roots all over. Opening essentially removes
the outer tiny "hairline" leaks and restores the text. The side
effect is that it rounds off things. The sharp edges start to
disappear.
[edit]Closing
The closing of the dark-blue shape (union of two squares) by a
disk, resulting in the union of the dark-blue shape and the light-
blue areas.
The closing ofA by B is obtained by the dilation ofA by B,
followed by erosion of the resulting structure by B:
.
The closing can also be obtained
by , whereXc denotes
the complement ofXrelative to E(that
is, ). The above means
that the closing is the complement of the locus of
translations of the symmetric of the structuring element
outside the imageA.
[edit]Properties of the basic operators
Here are some properties of the basic binary
morphological operators (dilation, erosion, opening and
closing):
http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=9http://en.wikipedia.org/wiki/Closing_(morphology)http://en.wikipedia.org/wiki/Complement_(set_theory)http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=10http://en.wikipedia.org/wiki/File:Closing.pnghttp://en.wikipedia.org/wiki/File:Closing.pnghttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=9http://en.wikipedia.org/wiki/Closing_(morphology)http://en.wikipedia.org/wiki/Complement_(set_theory)http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=108/8/2019 Please Rea1
8/90
They are translation invariant.
They are increasing, that is, if ,
then ,
and , etc.
The dilation iscommutative.
If the origin ofEbelongs to the structuring
element B,
then
.
The dilation isassociative,
i.e., .
Moreover, the erosion
satisfies
.
Erosion and dilation satisfy the
duality .
Opening and closing satisfy the
duality .
The dilation isdistributive overset union
The erosion isdistributive overset intersection
The dilation is apseudo-inverse of the erosion, and
vice-versa, in the following
sense: if and only
if .
Opening and closing are idempotent.
Opening is anti-extensive, i.e., ,
whereas the closing is extensive,
i.e., .[edit]Other operators and tools
http://en.wikipedia.org/wiki/Translational_invariancehttp://en.wikipedia.org/wiki/Increasinghttp://en.wikipedia.org/wiki/Increasinghttp://en.wikipedia.org/wiki/Commutativehttp://en.wikipedia.org/wiki/Commutativehttp://en.wikipedia.org/wiki/Associativehttp://en.wikipedia.org/wiki/Associativehttp://en.wikipedia.org/wiki/Associativehttp://en.wikipedia.org/wiki/Distributivehttp://en.wikipedia.org/wiki/Distributivehttp://en.wikipedia.org/wiki/Set_unionhttp://en.wikipedia.org/wiki/Set_unionhttp://en.wikipedia.org/wiki/Distributivehttp://en.wikipedia.org/wiki/Distributivehttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Pseudo-inversehttp://en.wikipedia.org/wiki/Pseudo-inversehttp://en.wikipedia.org/wiki/Idempotenthttp://en.wikipedia.org/w/index.php?title=Anti-extensive&action=edit&redlink=1http://en.wikipedia.org/wiki/Extensivehttp://en.wikipedia.org/wiki/Extensivehttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=11http://en.wikipedia.org/wiki/Translational_invariancehttp://en.wikipedia.org/wiki/Increasinghttp://en.wikipedia.org/wiki/Commutativehttp://en.wikipedia.org/wiki/Associativehttp://en.wikipedia.org/wiki/Distributivehttp://en.wikipedia.org/wiki/Set_unionhttp://en.wikipedia.org/wiki/Distributivehttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Pseudo-inversehttp://en.wikipedia.org/wiki/Idempotenthttp://en.wikipedia.org/w/index.php?title=Anti-extensive&action=edit&redlink=1http://en.wikipedia.org/wiki/Extensivehttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=118/8/2019 Please Rea1
9/90
Hit-or-miss transform
Morphological skeleton
Filtering by reconstruction
Ultimate erosions andconditional bisectors
Granulometry
Geodesic distance functions
[edit]Grayscale morphology
Cardiac MRI image
Watershed of the gradient of the cardiac image
Ingrayscalemorphology, images
arefunctionsmapping a Euclidean space or
grid Einto , where is the set
http://en.wikipedia.org/wiki/Hit-or-miss_transformhttp://en.wikipedia.org/wiki/Morphological_skeletonhttp://en.wikipedia.org/w/index.php?title=Filtering_by_reconstruction&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Ultimate_erosions&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Conditional_bisector&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Conditional_bisector&action=edit&redlink=1http://en.wikipedia.org/wiki/Granulometry_(morphology)http://en.wikipedia.org/w/index.php?title=Geodesic_distance_function&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=12http://en.wikipedia.org/wiki/Grayscalehttp://en.wikipedia.org/wiki/Grayscalehttp://en.wikipedia.org/wiki/Grayscalehttp://en.wikipedia.org/wiki/Grayscalehttp://en.wikipedia.org/wiki/Function_(mathematics)http://en.wikipedia.org/wiki/Function_(mathematics)http://en.wikipedia.org/wiki/Function_(mathematics)http://en.wikipedia.org/wiki/Euclidean_spacehttp://en.wikipedia.org/wiki/File:Watershed_of_gradient_of_MRI_heart_image_.pnghttp://en.wikipedia.org/wiki/File:Watershed_of_gradient_of_MRI_heart_image_.pnghttp://en.wikipedia.org/wiki/File:Heart_MRI_image.pnghttp://en.wikipedia.org/wiki/File:Heart_MRI_image.pnghttp://en.wikipedia.org/wiki/Hit-or-miss_transformhttp://en.wikipedia.org/wiki/Morphological_skeletonhttp://en.wikipedia.org/w/index.php?title=Filtering_by_reconstruction&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Ultimate_erosions&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Conditional_bisector&action=edit&redlink=1http://en.wikipedia.org/wiki/Granulometry_(morphology)http://en.wikipedia.org/w/index.php?title=Geodesic_distance_function&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=12http://en.wikipedia.org/wiki/Grayscalehttp://en.wikipedia.org/wiki/Grayscalehttp://en.wikipedia.org/wiki/Function_(mathematics)http://en.wikipedia.org/wiki/Euclidean_space8/8/2019 Please Rea1
10/90
ofreals, is an element larger than any real number,
and is an element smaller than any real number.
Grayscale structuring elements are also functions of the
same format, called "structuring functions".
Denoting an image by f(x) and the structuring function
by b(x), the grayscale dilation offby b is given by
,
where "sup" denotes thesupremum.
Similarly, the erosion offby b is given by
,
where "inf" denotes theinfimum.
Just like in binary morphology, the opening
and closing are given respectively by
, and
.[edit]Flat structuring
functions
It is common to use flat
structuring elements in
morphological applications. Flat
structuring functions are
functions b(x) in the form
,
where .
In this case, the dilation
and erosion are greatly
simplified, and given
respectively by
http://en.wikipedia.org/wiki/Real_numbershttp://en.wikipedia.org/wiki/Real_numbershttp://en.wikipedia.org/wiki/Real_numbershttp://en.wikipedia.org/wiki/Supremumhttp://en.wikipedia.org/wiki/Supremumhttp://en.wikipedia.org/wiki/Supremumhttp://en.wikipedia.org/wiki/Infimumhttp://en.wikipedia.org/wiki/Infimumhttp://en.wikipedia.org/wiki/Infimumhttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=13http://en.wikipedia.org/wiki/Real_numbershttp://en.wikipedia.org/wiki/Supremumhttp://en.wikipedia.org/wiki/Infimumhttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=138/8/2019 Please Rea1
11/90
8/8/2019 Please Rea1
12/90
morphological
operators
depend only on
the relative
ordering
ofpixel values,
regardless their
numerical
values, and
therefore are
especially
suited to the
processing
ofbinary
images and gra
yscale
images whosel
ight transfer
functionis not
known.
[edit]Other
operators
and tools
Morphologi
cal
Gradients
Top-hat
transform
Watershed
algorithm
By combining
these operators
one can obtain
algorithms for
many image
processingtasks, such
http://en.wikipedia.org/wiki/Pixelhttp://en.wikipedia.org/wiki/Pixelhttp://en.wikipedia.org/wiki/Binary_imageshttp://en.wikipedia.org/wiki/Binary_imageshttp://en.wikipedia.org/wiki/Binary_imageshttp://en.wikipedia.org/wiki/Grayscale_imageshttp://en.wikipedia.org/wiki/Grayscale_imageshttp://en.wikipedia.org/wiki/Grayscale_imageshttp://en.wikipedia.org/w/index.php?title=Light_transfer_function&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Light_transfer_function&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Light_transfer_function&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Light_transfer_function&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Light_transfer_function&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=14http://en.wikipedia.org/wiki/Morphological_Gradienthttp://en.wikipedia.org/wiki/Morphological_Gradienthttp://en.wikipedia.org/wiki/Morphological_Gradienthttp://en.wikipedia.org/wiki/Morphological_Gradienthttp://en.wikipedia.org/wiki/Top-hat_transformhttp://en.wikipedia.org/wiki/Top-hat_transformhttp://en.wikipedia.org/wiki/Top-hat_transformhttp://en.wikipedia.org/wiki/Watershed_(algorithm)http://en.wikipedia.org/wiki/Watershed_(algorithm)http://en.wikipedia.org/wiki/Pixelhttp://en.wikipedia.org/wiki/Binary_imageshttp://en.wikipedia.org/wiki/Binary_imageshttp://en.wikipedia.org/wiki/Grayscale_imageshttp://en.wikipedia.org/wiki/Grayscale_imageshttp://en.wikipedia.org/wiki/Grayscale_imageshttp://en.wikipedia.org/w/index.php?title=Light_transfer_function&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Light_transfer_function&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Light_transfer_function&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=14http://en.wikipedia.org/wiki/Morphological_Gradienthttp://en.wikipedia.org/wiki/Morphological_Gradienthttp://en.wikipedia.org/wiki/Morphological_Gradienthttp://en.wikipedia.org/wiki/Top-hat_transformhttp://en.wikipedia.org/wiki/Top-hat_transformhttp://en.wikipedia.org/wiki/Watershed_(algorithm)http://en.wikipedia.org/wiki/Watershed_(algorithm)8/8/2019 Please Rea1
13/90
as feature
detection, imag
e
segmentation,i
mage
sharpening,im
age filtering,
andclassificatio
n.
[edit]Mathematicalmorphologyon complete lattices
Complete
lattices areparti
ally ordered
sets, where
every subsethas
aninfimumand
a supremum. In
particular, it
contains a least
element and
a greatest
element (also
denoted
"universe").
[edit]Adjunc
tions
(Dilation
and
Erosion)
http://en.wikipedia.org/wiki/Feature_extractionhttp://en.wikipedia.org/wiki/Feature_extractionhttp://en.wikipedia.org/wiki/Segmentation_(image_processing)http://en.wikipedia.org/wiki/Segmentation_(image_processing)http://en.wikipedia.org/wiki/Segmentation_(image_processing)http://en.wikipedia.org/wiki/Unsharp_maskinghttp://en.wikipedia.org/wiki/Unsharp_maskinghttp://en.wikipedia.org/wiki/Unsharp_maskinghttp://en.wikipedia.org/wiki/Unsharp_maskinghttp://en.wikipedia.org/wiki/Filter_(signal_processing)http://en.wikipedia.org/wiki/Filter_(signal_processing)http://en.wikipedia.org/wiki/Filter_(signal_processing)http://en.wikipedia.org/wiki/Statistical_classificationhttp://en.wikipedia.org/wiki/Statistical_classificationhttp://en.wikipedia.org/wiki/Statistical_classificationhttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=15http://en.wikipedia.org/wiki/Complete_latticehttp://en.wikipedia.org/wiki/Complete_latticehttp://en.wikipedia.org/wiki/Complete_latticehttp://en.wikipedia.org/wiki/Complete_latticehttp://en.wikipedia.org/wiki/Partially_ordered_sethttp://en.wikipedia.org/wiki/Partially_ordered_sethttp://en.wikipedia.org/wiki/Partially_ordered_sethttp://en.wikipedia.org/wiki/Partially_ordered_sethttp://en.wikipedia.org/wiki/Partially_ordered_sethttp://en.wikipedia.org/wiki/Infimumhttp://en.wikipedia.org/wiki/Infimumhttp://en.wikipedia.org/wiki/Infimumhttp://en.wikipedia.org/wiki/Supremumhttp://en.wikipedia.org/wiki/Least_elementhttp://en.wikipedia.org/wiki/Least_elementhttp://en.wikipedia.org/wiki/Greatest_elementhttp://en.wikipedia.org/wiki/Greatest_elementhttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=16http://en.wikipedia.org/wiki/Feature_extractionhttp://en.wikipedia.org/wiki/Feature_extractionhttp://en.wikipedia.org/wiki/Segmentation_(image_processing)http://en.wikipedia.org/wiki/Segmentation_(image_processing)http://en.wikipedia.org/wiki/Segmentation_(image_processing)http://en.wikipedia.org/wiki/Unsharp_maskinghttp://en.wikipedia.org/wiki/Unsharp_maskinghttp://en.wikipedia.org/wiki/Unsharp_maskinghttp://en.wikipedia.org/wiki/Filter_(signal_processing)http://en.wikipedia.org/wiki/Filter_(signal_processing)http://en.wikipedia.org/wiki/Statistical_classificationhttp://en.wikipedia.org/wiki/Statistical_classificationhttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=15http://en.wikipedia.org/wiki/Complete_latticehttp://en.wikipedia.org/wiki/Complete_latticehttp://en.wikipedia.org/wiki/Complete_latticehttp://en.wikipedia.org/wiki/Complete_latticehttp://en.wikipedia.org/wiki/Partially_ordered_sethttp://en.wikipedia.org/wiki/Partially_ordered_sethttp://en.wikipedia.org/wiki/Partially_ordered_sethttp://en.wikipedia.org/wiki/Infimumhttp://en.wikipedia.org/wiki/Supremumhttp://en.wikipedia.org/wiki/Least_elementhttp://en.wikipedia.org/wiki/Least_elementhttp://en.wikipedia.org/wiki/Greatest_elementhttp://en.wikipedia.org/wiki/Greatest_elementhttp://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=168/8/2019 Please Rea1
14/90
Let be
a complete
lattice, with
infimum andminimum
symbolized
by and ,
respectively. Its
universe and
least element
are symbolized
by Uand ,
respectively.
Moreover,
let {Xi} be a
collection of
elements
from L.
A dilation is any
operator
that distributes
over the
supremum, and
preserves the
least element.
I.e.:
,
.
8/8/2019 Please Rea1
15/90
An erosion is
any
operator
that distributes
over the
infimum, and
preserves the
universe. I.e.:
,
.
Dilations and
erosions
form Galois
connections.
That is, for all
dilation there
is one and only
one erosion
that satisfies
for
all
.
Similarly,
for all
erosion
there is
one and
http://en.wikipedia.org/wiki/Galois_connectionhttp://en.wikipedia.org/wiki/Galois_connectionhttp://en.wikipedia.org/wiki/Galois_connectionhttp://en.wikipedia.org/wiki/Galois_connection8/8/2019 Please Rea1
16/90
only one
dilation
satisfying
the above
connectio
n.
Furtherm
ore, if two
operators
satisfy the
connectio
n,
then mu
st be a
dilation,
and an
erosion.
Pairs of
erosions
and
dilations
satisfying
the above
connectio
n are
called
"adjunctio
ns", and
the
erosion is
said to be
the
adjoint
erosion of
the
dilation,
and vice-
versa.
8/8/2019 Please Rea1
17/90
[edit]Op
ening
and
Closin
g
For all
adjunctio
n ,
the
morpholo
gical
opening
and
morpholo
gical
closing
are
defined
as
follows:
, and
.
T
he
m
o
r
p
h
o
l
o
http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=17http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=178/8/2019 Please Rea1
18/90
g
ic
a
l
o
p
e
n
i
n
g
a
n
d
cl
o
si
n
g
a
re
p
a
rt
ic
u
l
a
r
c
a
s
e
s
o
f
a
http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=18/8/2019 Please Rea1
19/90
l
g
e
b
r
a
ic
o
p
e
n
i
n
g
(
o
r
si
m
p
lyo
p
e
n
i
n
g
)
a
n
d
a
l
g
e
b
r
http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_opening&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=18/8/2019 Please Rea1
20/90
a
ic
cl
o
si
n
g
(
o
r
si
m
p
ly
cl
o
si
n
g
).
Al
g
e
b
r
a
ic
o
p
e
n
i
n
g
s
a
r
http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=1http://en.wikipedia.org/w/index.php?title=Algebraic_closing&action=edit&redlink=18/8/2019 Please Rea1
21/90
e
o
p
e
r
a
t
o
r
s
i
n
L
t
h
a
t
a
r
e
id
e
m
p
o
t
e
n
t,
i
n
c
r
e
a
si
n
8/8/2019 Please Rea1
22/90
g
,
a
n
d
a
n
ti
-
e
x
t
e
n
si
v
e
.
A
l
ge
b
r
a
ic
cl
o
si
n
g
s
a
r
e
o
p
e
8/8/2019 Please Rea1
23/90
r
a
t
o
r
s
i
n
L
t
h
a
t
a
r
e
i
d
e
m
po
t
e
n
t,
i
n
c
r
e
a
si
n
g
,
a
n
8/8/2019 Please Rea1
24/90
d
e
x
t
e
n
si
v
e
.
[
e
d
it
]
P
a
r
t
i
c
u
l
a
r
c
a
s
es
B
i
n
a
r
y
m
o
http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=18http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=18http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=18http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=18http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=188/8/2019 Please Rea1
25/90
r
p
h
o
l
o
g
y
is
a
p
a
rt
ic
u
l
a
r
c
a
se
o
f
l
a
tt
ic
e
m
o
r
p
h
o
l
o
g
8/8/2019 Please Rea1
26/90
y
,
w
h
e
r
e
L
is
t
h
e
p
o
w
e
r
s
e
t
of
E
(
E
u
cl
i
d
e
a
n
s
p
a
c
e
o
http://en.wikipedia.org/wiki/Power_sethttp://en.wikipedia.org/wiki/Power_sethttp://en.wikipedia.org/wiki/Power_sethttp://en.wikipedia.org/wiki/Power_sethttp://en.wikipedia.org/wiki/Power_sethttp://en.wikipedia.org/wiki/Power_sethttp://en.wikipedia.org/wiki/Power_sethttp://en.wikipedia.org/wiki/Power_sethttp://en.wikipedia.org/wiki/Power_sethttp://en.wikipedia.org/wiki/Power_sethttp://en.wikipedia.org/wiki/Power_set8/8/2019 Please Rea1
27/90
r
g
ri
d
),
t
h
a
t
is
,
L
is
t
h
e
s
e
t
o
fa
ll
s
u
b
s
e
t
s
o
f
E
,
a
n
d
8/8/2019 Please Rea1
28/90
is
t
h
e
s
e
t
i
n
cl
u
si
o
n
.
I
n
t
h
is
ca
s
e
,
t
h
e
i
n
fi
m
u
m
i
s
s
e
http://en.wikipedia.org/wiki/Set_inclusionhttp://en.wikipedia.org/wiki/Set_inclusionhttp://en.wikipedia.org/wiki/Set_inclusionhttp://en.wikipedia.org/wiki/Set_inclusionhttp://en.wikipedia.org/wiki/Set_inclusionhttp://en.wikipedia.org/wiki/Set_inclusionhttp://en.wikipedia.org/wiki/Set_inclusionhttp://en.wikipedia.org/wiki/Set_inclusionhttp://en.wikipedia.org/wiki/Set_inclusionhttp://en.wikipedia.org/wiki/Set_inclusionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_inclusionhttp://en.wikipedia.org/wiki/Set_inclusionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersection8/8/2019 Please Rea1
29/90
t
i
n
t
e
r
s
e
c
ti
o
n
,
a
n
d
t
h
e
s
up
r
e
m
u
m
i
s
s
e
t
u
n
i
o
n
.
http://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_unionhttp://en.wikipedia.org/wiki/Set_unionhttp://en.wikipedia.org/wiki/Set_unionhttp://en.wikipedia.org/wiki/Set_unionhttp://en.wikipedia.org/wiki/Set_unionhttp://en.wikipedia.org/wiki/Set_unionhttp://en.wikipedia.org/wiki/Set_unionhttp://en.wikipedia.org/wiki/Set_unionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_intersectionhttp://en.wikipedia.org/wiki/Set_unionhttp://en.wikipedia.org/wiki/Set_union8/8/2019 Please Rea1
30/90
S
i
m
il
a
rl
y
,
g
r
a
y
s
c
a
l
e
m
o
r
ph
o
l
o
g
y
is
a
n
o
t
h
e
r
p
a
rt
8/8/2019 Please Rea1
31/90
ic
u
l
a
r
c
a
s
e
,
w
h
e
r
e
L
is
t
h
e
se
t
o
f
f
u
n
c
ti
o
n
s
m
a
p
p
i
8/8/2019 Please Rea1
32/90
n
g
E
i
n
t
o
,
a
n
d
,
,
a
n
d
,
a
r
e
t
h
e
p
o
i
n
t-
w
is
e
o
r
8/8/2019 Please Rea1
33/90
d
e
r,
s
u
p
r
e
m
u
m
,
a
n
d
i
n
fi
m
u
m,
r
e
s
p
e
c
ti
v
e
ly
.
T
h
a
t
is
8/8/2019 Please Rea1
34/90
8/8/2019 Please Rea1
35/90
t
h
e
i
n
fi
m
u
m
is
g
iv
e
n
b
y
;a
n
d
t
h
e
s
u
p
r
e
m
u
m
is
8/8/2019 Please Rea1
36/90
g
iv
e
n
b
y
.
[
e
d
it]
Refere
nces
I
m
a
g
eA
n
a
l
y
s
i
sa
http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=19http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=19http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=19http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=19http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=198/8/2019 Please Rea1
37/90
n
d
M
a
t
h
e
m
a
ti
c
a
l
M
o
r
p
h
o
l
og
y
b
y
J
e
a
n
S
e
rr
a
,
I
S
B
N
http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/01263724038/8/2019 Please Rea1
38/90
0
1
2
6
3
7
2
4
0
3
(
1
9
8
2
)
I
m
a
g
e
A
n
a
l
y
s
i
sa
n
d
M
a
t
h
em
http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/0126372403http://en.wikipedia.org/wiki/Special:BookSources/01263724038/8/2019 Please Rea1
39/90
8/8/2019 Please Rea1
40/90
n
c
e
s
b
y
J
e
a
n
S
e
rr
a
,
I
S
B
N
0
-1
2
-
6
3
7
2
4
1
-
1
(
1
9
8
8
)
http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/0126372411http://en.wikipedia.org/wiki/Special:BookSources/01263724118/8/2019 Please Rea1
41/90
A
n
I
n
tr
o
d
u
c
ti
o
n
t
o
M
o
r
p
h
o
lo
g
i
c
a
l
I
m
a
g
e
P
r
o
c
e
s
8/8/2019 Please Rea1
42/90
s
i
n
g
b
y
E
d
w
a
r
d
R
.
D
o
u
g
h
e
rty
,
I
S
B
N
0
-
8
1
9
4
-
0
8
4
5
http://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845X8/8/2019 Please Rea1
43/90
-
X
(
1
9
9
2
)
M
o
r
p
h
o
l
o
g
i
c
a
l
I
m
a
g
e
A
n
al
y
s
i
s
;
P
rin
http://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845Xhttp://en.wikipedia.org/wiki/Special:BookSources/081940845X8/8/2019 Please Rea1
44/90
c
i
p
l
e
s
a
n
d
A
p
p
li
c
a
ti
o
n
s
b
yP
i
e
rr
e
S
o
ill
e
,
I
S
B
N
3
5
4
http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/35406567158/8/2019 Please Rea1
45/90
0
-
6
5
6
7
1
-
5
(
1
9
9
9
),
2
n
d
e
d
itio
n
(
2
0
0
3
)
M
a
t
h
e
m
a
tic
http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/3540656715http://en.wikipedia.org/wiki/Special:BookSources/35406567158/8/2019 Please Rea1
46/90
a
l
M
o
r
p
h
o
l
o
g
y
a
n
d
it
s
A
p
p
lic
a
ti
o
n
t
o
S
i
g
n
a
l
P
r
o
c
8/8/2019 Please Rea1
47/90
e
s
s
i
n
g
,
J
.
S
e
rr
a
a
n
d
P
h
.
S
al
e
m
b
i
e
r
(
E
d
s
.)
,
p
r
o
c
8/8/2019 Please Rea1
48/90
e
e
d
i
n
g
s
o
f
t
h
e
1st
i
n
t
e
r
n
ati
o
n
a
l
s
y
m
p
o
si
u
m
o
n
m
8/8/2019 Please Rea1
49/90
8/8/2019 Please Rea1
50/90
3
-
2
7
1
-
7
(
1
9
9
3
)
M
a
t
h
e
m
a
ti
c
a
l
M
o
r
p
ho
l
o
g
y
a
n
dIt
http://en.wikipedia.org/wiki/Special:BookSources/8476532717http://en.wikipedia.org/wiki/Special:BookSources/8476532717http://en.wikipedia.org/wiki/Special:BookSources/8476532717http://en.wikipedia.org/wiki/Special:BookSources/8476532717http://en.wikipedia.org/wiki/Special:BookSources/8476532717http://en.wikipedia.org/wiki/Special:BookSources/8476532717http://en.wikipedia.org/wiki/Special:BookSources/8476532717http://en.wikipedia.org/wiki/Special:BookSources/8476532717http://en.wikipedia.org/wiki/Special:BookSources/8476532717http://en.wikipedia.org/wiki/Special:BookSources/84765327178/8/2019 Please Rea1
51/90
s
A
p
p
li
c
a
ti
o
n
s
t
o
I
m
a
g
e
P
r
oc
e
s
s
i
n
g
,
J
.
S
e
rr
a
a
n
d
8/8/2019 Please Rea1
52/90
P
.
S
o
ill
e
(
E
d
s
.)
,
p
r
o
c
e
e
d
i
ng
s
o
f
t
h
e
2
nd
i
n
t
e
r
n
a
ti
8/8/2019 Please Rea1
53/90
o
n
a
l
s
y
m
p
o
si
u
m
o
n
m
a
t
h
e
ma
ti
c
a
l
m
o
r
p
h
o
l
o
g
y
(I
S
8/8/2019 Please Rea1
54/90
M
M
'
9
3
),
I
S
B
N
0
-
7
9
2
3
-
3
0
9
3-
5
(
1
9
9
4
)
M
a
t
h
e
m
a
tic
http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/0792330935http://en.wikipedia.org/wiki/Special:BookSources/07923309358/8/2019 Please Rea1
55/90
a
l
M
o
r
p
h
o
l
o
g
y
a
n
d
it
s
A
p
p
lic
a
ti
o
n
s
t
o
I
m
a
g
e
a
n
d
S
8/8/2019 Please Rea1
56/90
i
g
n
a
l
P
r
o
c
e
s
s
i
n
g
,
H
e
n
k
J.
A
.
M
.
H
e
ij
m
a
n
s
a
n
d
J
o
8/8/2019 Please Rea1
57/90
s
B
.
T
.
M
.
R
o
e
r
d
i
n
k
(
E
d
s
.)
,p
r
o
c
e
e
d
i
n
g
s
o
f
t
h
e
4t
8/8/2019 Please Rea1
58/90
h
i
n
t
e
r
n
a
ti
o
n
a
l
s
y
m
p
o
si
u
m
o
n
m
a
t
h
e
m
a
ti
c
a
l
m
o
r
8/8/2019 Please Rea1
59/90
p
h
o
l
o
g
y
(I
S
M
M
'
9
8
),
I
S
B
N
0
-7
9
2
3
-
5
1
3
3
-
9
(
1
9
9
8
)
http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/0792351339http://en.wikipedia.org/wiki/Special:BookSources/07923513398/8/2019 Please Rea1
60/90
M
a
t
h
e
m
a
ti
c
a
l
M
o
r
p
h
o
l
o
g
y:
4
0
Y
e
a
r
s
O
n
,
C
h
ri
s
ti
a
8/8/2019 Please Rea1
61/90
n
R
o
n
s
e
,
L
a
u
r
e
n
t
N
a
j
m
a
n
,a
n
d
E
ti
e
n
n
e
D
e
c
e
n
ci
r
8/8/2019 Please Rea1
62/90
e
(
E
d
s
.)
,
I
S
B
N
1
-
4
0
2
0
-
3
4
42
-
3
(
2
0
0
5
)
M
a
t
h
e
m
ati
http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/1402034423http://en.wikipedia.org/wiki/Special:BookSources/14020344238/8/2019 Please Rea1
63/90
c
a
l
M
o
r
p
h
o
l
o
g
y
a
n
d
it
s
A
p
pli
c
a
ti
o
n
s
t
o
S
i
g
n
a
l
a
n
8/8/2019 Please Rea1
64/90
d
I
m
a
g
e
P
r
o
c
e
s
s
i
n
g
,
G
e
r
al
d
J
.
F
.
B
a
n
o
n
,
J
u
n
i
o
8/8/2019 Please Rea1
65/90
r
B
a
rr
e
r
a
,
U
li
s
s
e
s
M
.
B
r
a
g
a-
N
e
t
o
(
E
d
s
.)
,
p
r
o
c
e
e
8/8/2019 Please Rea1
66/90
d
i
n
g
s
o
f
t
h
e
8t
h
i
n
t
e
r
n
a
ti
on
a
l
s
y
m
p
o
si
u
m
o
n
m
a
t
8/8/2019 Please Rea1
67/90
h
e
m
a
ti
c
a
l
m
o
r
p
h
o
l
o
g
y
(I
S
MM
'
0
7
),
I
S
B
N
9
7
8
-
8
5
-
1
http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/97885170003248/8/2019 Please Rea1
68/90
7
-
0
0
0
3
2
-
4
(
2
0
0
7
)
[
e
d
it
]
External
links
O
n
li
n
e
c
http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=20http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=20http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=20http://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/wiki/Special:BookSources/9788517000324http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=20http://en.wikipedia.org/w/index.php?title=Mathematical_morphology&action=edit§ion=20http://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htm8/8/2019 Please Rea1
69/90
o
u
r
s
e
o
n
m
a
t
h
e
m
a
ti
c
a
l
m
o
rp
h
o
l
o
g
y
,
b
y
J
e
a
n
S
e
rr
http://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htmhttp://cmm.ensmp.fr/~serra/cours/index.htm8/8/2019 Please Rea1
70/90
a
(i
n
E
n
g
li
s
h
,
F
r
e
n
c
h
,
a
n
d
Sp
a
n
is
h
)
C
en
t
e
r
o
f
M
at
http://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.html8/8/2019 Please Rea1
71/90
h
e
m
a
ti
c
a
l
M
o
r
p
h
o
l
o
g
y
,
P
ari
s
S
c
h
o
o
l
o
f
M
i
n
e
s
His
http://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/index_eng.htmlhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdf8/8/2019 Please Rea1
72/90
t
o
r
y
o
f
M
a
t
h
e
m
a
ti
c
a
l
M
o
r
ph
o
l
o
g
y
,
b
y
G
e
o
r
g
e
s
M
http://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdfhttp://cmm.ensmp.fr/~serra/pdf/birth_of_mm.pdf8/8/2019 Please Rea1
73/90
a
t
h
e
r
o
n
a
n
d
J
e
a
n
S
e
rr
a
M
o
r
p
h
o
l
o
g
y
Di
g
e
s
t,
a
n
ew
http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/8/8/2019 Please Rea1
74/90
sl
e
tt
e
r
o
n
m
a
t
h
e
m
a
ti
c
a
l
m
o
rp
h
o
l
o
g
y
,
b
y
P
i
e
rr
e
S
o
http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/http://mdigest.jrc.ec.europa.eu/8/8/2019 Please Rea1
75/90
ill
e
L
ec
t
u
r
e
s
o
n
I
m
a
g
e
P
r
o
c
e
s
si
n
g
:
A
co
ll
e
c
ti
o
n
of
http://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processing8/8/2019 Please Rea1
76/90
1
8
l
e
c
t
u
r
e
s
i
n
p
d
f
f
o
r
m
a
tfr
o
m
V
a
n
d
e
r
b
ilt
U
n
iv
e
r
http://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processing8/8/2019 Please Rea1
77/90
si
t
y
.
L
e
c
t
u
r
e
s
1
6
-
1
8
a
r
e
on
M
a
t
h
e
m
a
ti
c
a
l
M
o
r
p
h
http://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp://www.archive.org/details/Lectures_on_Image_Processinghttp: