Binary morphological operations using single and multiple structuring elements are implemented using look-up table (LUT) driven templates. Many complex operations can be implemented in one pipeline processing cycle for 33 regions of support and in four or five cycles for 55 regions of support. The basis representation of the operations is used to specify the required templates.
|Number of pages||6|
|Journal||IEEE Transactions on Pattern Analysis and Machine Intelligence|
|Publication status||Published - 1 Jan 1994|
- Binary morphology
- morphological basis decomposition
- parallel processing
- template matching