完整搜尋頁面 →

二值運算一覽表

選讀・IP 09・形態學影像處理 的補充資料(第 4/9 則)。主線不依賴這則補充;引用編號對應本頁底部的參考文獻。

導覽:本頁與本系列: 導覽:本頁與本系列

下表整理本章的二值運算。AA 為輸入集合、BB 為結構元素、FF 為標記、GG 為遮罩,並假設 BB 包含原點。

運算公式作用
平移(B)z={b+z}(B)_z = \{ b + z \}把結構元素原點移到 zz
反射B^={−b}\hat{B} = \{ -b \}結構元素旋轉 180°
補集AcA^c前景與背景互換
侵蝕A⊖BA \ominus B保留 BB 放得進去的位置;縮小、去除細部
膨脹A⊕BA \oplus B保留 B^\hat{B} 碰得到 AA 的位置;變大、接起縫隙
開運算(A⊖B)⊕B(A \ominus B) \oplus B去除斑點、細頸、尖角;冪等
閉運算(A⊕B)⊖B(A \oplus B) \ominus B補上小洞與窄縫;冪等
擊中擊不中(A⊖B1)∩(Ac⊖B2)(A \ominus B_1) \cap (A^c \ominus B_2)找出精確的前景/背景圖樣
邊界A−(A⊖B)A - (A \ominus B)一個像素寬的內輪廓
填洞Xk=(Xk−1⊕B)∩AcX_k = (X_{k-1} \oplus B) \cap A^c填滿含種子的那個洞
連通元件Xk=(Xk−1⊕B)∩AX_k = (X_{k-1} \oplus B) \cap A擷取含種子的元件
凸包反覆 HMT 的聯集填平凹陷
細化A−(A⊛B)A - (A \circledast B),套用一串模板剝成一個像素寬的骨架,保持連通
粗化A∪(A⊛B)A \cup (A \circledast B)細化的對偶
骨架⋃k(A⊖kB)−(A⊖kB)∘B\bigcup_k (A \ominus kB) - (A \ominus kB) \circ B中央線;配合索引 kk 可還原
修剪移除端點,再條件式長回去除短雜枝
測地膨脹(F⊕B)∩G(F \oplus B) \cap G在遮罩內長大一步
測地侵蝕(F⊖B)∪G(F \ominus B) \cup G在遮罩之上縮小一步
以膨脹重建穩定時的 DG(k)(F)D_G^{(k)}(F)GG 中被 FF 碰到的元件
以重建做開運算RFD(F⊖nB)R_F^D(F \ominus nB)移除小物件,其他物件保持原樣
自動填洞[RIcD(F)]c[R_{I^c}^D(F)]^c不需種子就填滿所有洞
清除邊界物件I−RID(F)I - R_I^D(F)移除碰到邊界的物件

參考文獻

  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