z-logo
open-access-imgOpen Access
Fast Algorithms for Binary Dilation and Erosion Using Run‐Length Encoding
Author(s) -
Kim WookJoong,
Kim SeongDae,
Kim Kyuheon
Publication year - 2005
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.05.0205.0013
Subject(s) - dilation (metric space) , binary number , algorithm , encoding (memory) , computer science , erosion , pixel , representation (politics) , binary image , image (mathematics) , mathematics , image processing , artificial intelligence , arithmetic , geometry , geology , paleontology , politics , political science , law
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here