Fast algorithms for binary dilation and erosion using run-length encoding

Cited 9 time in webofscience Cited 0 time in scopus
  • Hit : 300
  • Download : 0
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.
Publisher
ELECTRONICS TELECOMMUNICATIONS RESEARCH INST
Issue Date
2005-12
Language
English
Article Type
Article
Keywords

IMAGES

Citation

ETRI JOURNAL, v.27, pp.814 - 817

ISSN
1225-6463
URI
http://hdl.handle.net/10203/88676
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 9 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0