By Topic

Realisation of morphological operations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chen, C.H. ; Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan ; Yang, D.-L.

Multi-input min and max operators are two essential components for dilation and erosion, which are two basic building units for morphological filtering. Many of the more complicated operations of morphological filtering can be decomposed by them. The min or max operator cascades after a bit-serial adder or subtractor is equal to a dilation or erosion operator. In the paper, an efficient algorithm and its implementation architecture for the min/max operation are proposed. The proposed algorithm and architecture can process bit by bit directly for all input signals without using threshold decomposition which requires more complicated hardware design. Any shape and size of the filtering window or structuring element can be realised. For a fixed window size, the shape of window is programmable by changing some input initial conditions. The computation time is independent of, and the hardware complexity is linear to, the window size. This implies that a very high throughput rate can be attained after an initial latency period required to fill up the pipeline. The proposed architecture is modular, regular and of local interconnections; and therefore amenable for VLSI implementation

Published in:

Circuits, Devices and Systems, IEE Proceedings -  (Volume:142 ,  Issue: 6 )