ETRI Journal

  • 제27권6호
  • /
  • Pages.814-817
  • /
  • 2005
  • /
  • 1225-6463(pISSN)
  • /
  • 2233-7326(eISSN)
한국전자통신연구원 (Electronics and Telecommunications Research Institute)
권호 표지

Fast Algorithms for Binary Dilation and Erosion Using Run-Length Encoding

  • 투고 : 2005.02.16
  • 발행 : 2005.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Fast binary dilation and erosion algorithms using run-length encoding (RLE) are proposed. RLE is an alternative way of representing a binary image using a run, which is a sequence of '1' pixels. First, we derive the run-based representation of dilation and erosion and then present the full steps of the proposed algorithms in detail.

키워드

참고문헌

  1. Computer Vision, Graphics, and Image Proc. v.41 no.1 A New Chain-Coding Algorithm for Binary Images Using Run-Length Codes Kim, S.;Lee, J.;Kim, J.
  2. Pattern Recognition Letter v.9 no.3 Erosion and Dilation of Binary Images by Arbitrary Structuring Elements Using Interval Coding Piper, L.;Tang, J.Y.
  3. Pattern Recognition Letters v.18 no.4 Residuals + Directional Gaps = Skeletons Cardoner, R.;Thomas, F.
  4. Int’l J. Pattern Recognition and Artificial Intelligence v.11 no.6 Efficient Morphological Set Transformations on Line Drawings Cardoner, R.;Thomas, F.
  5. ETRI J. v.21 no.4 An Application of Canonical Correlation Analysis Technique to Land Cover Classification of LANDSAT Images Lee, Jong-Hun;Park, Min-Ho;Kim, Yong-Il