This paper describes an original stream implementation of serially composed morphological filters using approximated flat polygons. It strictly respects a sequential data access. Results are obtained with minimal latency while operating within minimal memory space; even for very large neighborhoods. This is interesting for serially composed advanced filters, such as Alternating Sequential Filters or granulometries. We show how the dedicated implementation on an FPGA allows obtaining a previously unequaled performance, opening an opportunity to use these operators in time-critical, high-end applications.
展开▼
