doi:10.1016/S0165-1684(01)00054-8
Copyright © 2001 Elsevier Science B.V. All rights reserved.
Fast communication
Simplified implementation of the recursive median sieve
References and further reading may be available for this article. To view references and further reading you must
purchase this article.
O. Yli-Harja
,
, a, P. Koivistoa, J. A. Banghamb, G. Cawleyb, R. Harveyb and I. Shmulevicha
a Signal Processing Laboratory, Tampere University of Technology, P.O. Box 553, 33101, Tampere, Finland
b School of Information Systems, University of East Anglia, Norwich NR4 7TJ, UK
Received 25 February 1999;
revised 24 November 2000.
Available online 9 August 2001.
Abstract
In this paper we introduce a simplified implementation of the 1D recursive median sieve. The sieve is a multiscale data analysis method based on iterative application of recursive median filters of increasing window length. We show that this system can be implemented by applying only 3-point median operations, due to the introduction of do not care vertices to the positive Boolean function corresponding to the recursive median filter. This realisation leads to simplified implementation of the sieve structure.
Author Keywords: Recursive median filter; Datasieve
Fig. 1. The standard implementation of the recursive median sieve (2) for the three first stages.
Fig. 2. The simplified implementation of the recursive median sieve (5) for s stages.
Fig. 3. In the simplified implementation (5) most of the chip area would be consumed by the delay lines (for large s). This requires a triangular-shaped portion of the chip. By folding, we can convert it into a rectangular module with a very compact floorplan.
Corresponding author. Tel: +358-50-5388-007; fax: +358-3-365-2919; email: yliharja@cs.tut.fi