Fast Binary Dilation/Erosion Algorithm Using Reference Points

Author

Cheng, Xinyu

Author_Institution

Coll. of Comput. Sci. & Inf. Technol., Guizhou Univ., Guiyang

Volume

2

fYear

2009

fDate

30-31 May 2009

Firstpage

87

Lastpage

90

Abstract

A new method of fast binary image dilation/erosion operation called RPI is proposed in this paper. Without the regularity of structure elements or pixel processing sequence, dilation/erosion operation can be carried out by looking up a precomputed increments table with this algorithm. The definition of reference points set and coding method for fast looking up the combination status, including its algorithm framework, are given. Compared with KSD algorithm, the average performance of RPI algorithm is a little h. However, RPI algorithm becomes more effective in the worst case and is more suitable for real-time image processing.

Keywords

edge detection; image coding; mathematical morphology; KSD algorithm; RPI algorithm; binary image contour dilation/erosion algorithm; edge detection; image coding method; mathematical morphology; pixel processing sequence; precomputed increments table; real-time image processing; reference point set; structure element regularity; Computer networks; Economic indicators; Educational institutions; Filtering; Image coding; Image edge detection; Image processing; Information technology; Morphology; Pixel; Image processing; erosion/dilation; fast algorithm; mathematical morphology;

fLanguage

English

Publisher

ieee

Conference_Titel

Networking and Digital Society, 2009. ICNDS '09. International Conference on

Conference_Location

Guiyang, Guizhou

Print_ISBN

978-0-7695-3635-4

Type

conf

DOI

10.1109/ICNDS.2009.102

Filename

5116691