Full search page →

Table of binary operations

Optional · supplementary note 4 of 9 for IP 09 · Morphological Image Processing. Nothing in the main text depends on it; citation numbers refer to the reference list at the bottom of this page.

Navigate: this page and this track: Navigate: this page and this track

The table collects the binary operations of this chapter. Throughout, AA is the input set, BB the structuring element, FF a marker, GG a mask, and BB is assumed to contain its origin.

OperationFormulaWhat it does
Translation(B)z={b+z}(B)_z = \{ b + z \}Moves the SE’s origin to zz
ReflectionB^={−b}\hat{B} = \{ -b \}Rotates the SE by 180°
ComplementAcA^cSwaps foreground and background
ErosionA⊖BA \ominus BKeeps positions where BB fits; shrinks, removes thin parts
DilationA⊕BA \oplus BKeeps positions where B^\hat{B} touches AA; grows, bridges gaps
Opening(A⊖B)⊕B(A \ominus B) \oplus BRemoves specks, thin necks, sharp corners; idempotent
Closing(A⊕B)⊖B(A \oplus B) \ominus BFills small holes and narrow gaps; idempotent
Hit-or-miss(A⊖B1)∩(Ac⊖B2)(A \ominus B_1) \cap (A^c \ominus B_2)Finds an exact foreground/background pattern
BoundaryA−(A⊖B)A - (A \ominus B)One-pixel inner outline
Hole fillingXk=(Xk−1⊕B)∩AcX_k = (X_{k-1} \oplus B) \cap A^cFills the hole that contains the seed
Connected componentXk=(Xk−1⊕B)∩AX_k = (X_{k-1} \oplus B) \cap AExtracts the component that contains the seed
Convex hullunion of iterated HMTsFills concavities
ThinningA−(A⊛B)A - (A \circledast B), over a template sequencePeels pixels to a 1-pixel skeleton, keeps connectivity
ThickeningA∪(A⊛B)A \cup (A \circledast B)Dual of thinning
Skeleton⋃k(A⊖kB)−(A⊖kB)∘B\bigcup_k (A \ominus kB) - (A \ominus kB) \circ BMedial lines; invertible with the index kk
Pruningend-point removal, then conditional regrowthRemoves short spurs
Geodesic dilation(F⊕B)∩G(F \oplus B) \cap GOne step of growth inside a mask
Geodesic erosion(F⊖B)∪G(F \ominus B) \cup GOne step of shrinking above a mask
Reconstruction by dilationDG(k)(F)D_G^{(k)}(F) at stabilityComponents of GG hit by FF
Opening by reconstructionRFD(F⊖nB)R_F^D(F \ominus nB)Removes small objects, keeps others exact
Hole filling (auto)[RIcD(F)]c[R_{I^c}^D(F)]^cFills all holes, no seeds
Border clearingI−RID(F)I - R_I^D(F)Removes border-touching objects

References

  1. R. C. Gonzalez and R. E. Woods, Digital Image Processing, 4th ed., Pearson, 2018, Ch. 9. publisher page
  2. G. Matheron, Random Sets and Integral Geometry, Wiley, 1975. library record
  3. J. Serra, Image Analysis and Mathematical Morphology, Academic Press, 1982. library record
  4. R. M. Haralick, S. R. Sternberg, and X. Zhuang, “Image Analysis Using Mathematical Morphology,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. PAMI-9, pp. 532–550, 1987. doi
  5. P. Soille, Morphological Image Analysis, Springer, 2004. doi
  6. T. Y. Zhang and C. Y. Suen, “A Fast Parallel Algorithm for Thinning Digital Patterns,” Communications of the ACM, vol. 27, pp. 236–239, 1984. doi
  7. L. Vincent, “Morphological Grayscale Reconstruction in Image Analysis: Applications and Efficient Algorithms,” IEEE Trans. Image Processing, vol. 2, pp. 176–201, 1993. doi
  8. P. Maragos, “Pattern Spectrum and Multiscale Shape Representation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 7, pp. 701–716, 1989. doi
  9. E. J. Breen and R. Jones, “Attribute Openings, Thinnings, and Granulometries,” Computer Vision and Image Understanding, vol. 64, no. 3, pp. 377–389, 1996. doi
  10. P. Salembier and M. H. F. Wilkinson, “Connected Operators: A Review of Region-Based Morphological Image Processing Techniques,” IEEE Signal Processing Magazine, vol. 26, no. 6, pp. 136–157, 2009. doi
  11. E. Carlinet and T. Géraud, “A Comparative Review of Component Tree Computation Algorithms,” IEEE Trans. Image Processing, vol. 23, pp. 3885–3895, 2014. doi
  12. S. van der Walt et al., “scikit-image: Image Processing in Python,” PeerJ, 2014. arXiv
  13. R. Mondal, S. Santra, S. S. Mukherjee, and B. Chanda, “Morphological Network: How Far Can We Go with Morphological Neurons?,” BMVC, 2022. arXiv
  14. K. Nogueira, J. Chanussot, M. Dalla Mura, and J. A. dos Santos, “An Introduction to Deep Morphological Networks,” arXiv:1906.01751, 2019. arXiv
  15. R. Hermary, G. Tochon, É. Puybareau, A. Kirszenberg, and J. Angulo, “Learning Grayscale Mathematical Morphology with Smooth Morphological Layers,” Journal of Mathematical Imaging and Vision, vol. 64, pp. 736–753, 2022. doi
  16. A. Kirszenberg, G. Tochon, É. Puybareau, and J. Angulo, “Going Beyond p-convolutions to Learn Grayscale Morphological Operators,” arXiv:2102.10038, 2021. arXiv
  17. S. Shit et al., “clDice — A Novel Topology-Preserving Loss Function for Tubular Structure Segmentation,” CVPR, 2021. arXiv