Multi-input min and max operators are two essential components forndilation and erosion, which are two basic building units fornmorphological filtering. Many of the more complicated operations ofnmorphological filtering can be decomposed by them. The min or maxnoperator cascades after a bit-serial adder or subtractor is equal to andilation or erosion operator. In the paper, an efficient algorithm andnits implementation architecture for the min/max operation are proposed.nThe proposed algorithm and architecture can process bit by bit directlynfor all input signals without using threshold decomposition whichnrequires more complicated hardware design. Any shape and size of thenfiltering window or structuring element can be realised. For a fixednwindow size, the shape of window is programmable by changing some inputninitial conditions. The computation time is independent of, and thenhardware complexity is linear to, the window size. This implies that anvery high throughput rate can be attained after an initial latencynperiod required to fill up the pipeline. The proposed architecture isnmodular, regular and of local interconnections; and therefore amenablenfor VLSI implementation
展开▼
