The Journal of the Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회논문지)

The Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회)
권호 표지
DOI QR코드

DOI QR Code

Proposal of Image Segmentation Technique using Persistent Homology

지속적 호몰로지를 이용한 이미지 세그멘테이션 기법 제안

  • Hahn, Hee Il (Dept Information and Communications Eng. Hankuk University of Foreign Studies)
  • 한희일 (한국외국어대학교 정보통신공학과)
  • Received : 2017.01.03
  • Accepted : 2018.02.09
  • Published : 2018.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

This paper proposes a robust technique of image segmentation, which can be obtained if the topological persistence of each connected component is used as the feature vector for the graph-based image segmentation. The topological persistence of the components, which are obtained from the super-level set of the image, is computed from the morse function which is associated with the gray-level or color value of each pixel of the image. The procedure for the components to be born and be merged with the other components is presented in terms of zero-dimensional homology group. Extensive experiments are conducted with a variety of images to show the more correct image segmentation can be obtained by merging the components of small persistence into the adjacent components of large persistence.

본 논문에서는 이미지에서 검출된 각 연결성분들의 위상적 지속구간 정보를 그래프 기반 이미지 세그멘테이션에 결합하여 보다 안정적인 이미지 세그멘테이션 기법을 제안한다. 이미지의 밝기 또는 색상정보 등을 이용하여 모스 함수를 정의하고 이의 레벨세트로부터 각 연결성분의 위상적 지속구간을 구한다. 각 연결성분이 생성되고 긴 지속구간을 갖는 연결성분에 적절히 병합되는 과정을 영 차원 호몰로지 군의 관점에서 설명한다. 다양한 특성을 갖는 이미지들에 대하여 짧은 지속구간을 갖는 연결성분들을 지속구간이 긴 인근 성분에 적절히 병합시키는 과정을 통하여 보다 안정적인 이미지 세그멘테이션 결과들 얻을 수 있음을 실험으로 확인한다.

Keywords

References

  1. A. Garcia-Garcia, S. Orts-Escolano, S.O. Oprea, V. Villena-Martinetz, and J. Garcia-Rodriguez, "A review on deep learning techniques applied to semantic segmentation," arXiv:1704.06857v1[cs.CV] 22, Apr. 2017.
  2. H. Edelsbrunner, D. Letscher and A. Zomorodian, "Topological persistence and simplification," Discrete Computational Geometry 28, pp. 511-533, 2002. DOI: 10.1007/s00454-002-2885-2
  3. A. Zomorodian and G.Carlsson, "Computing persistent homology," Discrete Computational Geometry, Vol. 33, Issue 2, pp. 249-274, 2005. https://doi.org/10.1007/s00454-004-1146-y
  4. F. Chazal, L. Guibas, S. Oudot, and P. Skraba, "Persistence-based clustering in riemannian manifolds," Technical report, https://hal.inria.fr/inria-00389390/document, 2009.
  5. J.W. Milnor, Morse theory, Princeton university press, 1963.
  6. V. Kurlin, "A fast persistence-based segmentation of noisy 2D clouds with provable guarantees," Pattern Recognition Letters 83, pp. 3-12, 2016. DOI: https://doi.org/10.1016/j.patrec.2015.11.025.
  7. P. Felzenszwalb and D. Huttenlocher, "Efficient graph-based image segmentation," International Journal of Computer Vision, Vol. 59, No. 2, pp. 167-181, September 2004 DOI: https://doi.org/10.1023/B:VISI.0000022288.19776.77
  8. H. Edelsbrunner, and J. Harer, "Persistent homology-a survey," In Twenty Years After, AMS, 2007.
  9. R. Bandara, "Image segmentation using unsupervised watershed algorithm with an over-segmentation reduction technique,", https://www.codeproject.com/Articles/751744/Image-Segmentation-using-Unsupervised-Watershed-Al
  10. D. Comaniciu and P. Meer, "Mean shift: a robust approach toward feature space analysis," IEEE Trans. Pattern Analysis and Machine analysis, Vol. 24, No. 5, May, 2002. DOI: 10.1109/34.1000236
  11. H. Ying and J. Song, "Recognition Model of Road Signs Using Image Segmentation Algorithm," The Journal of The Institute of Internet, Broadcasting and Communication (JIIBC), Vol. 13, No. 2, pp. 233-237, April, 2013. DOI: https://doi.org/10.7236/JIIBC.2013.13.2.233.