Yli-Harja, O, Koivisto, P, Bangham, JA, Cawley, GC ORCID: https://orcid.org/0000-0002-4118-9095, Harvey, RW ORCID: https://orcid.org/0000-0001-9925-8316 and Shmulevich, I (2001) Simplified implementation of the recursive median sieve. Signal Processing, 81 (7). pp. 1565-1570. ISSN 0165-1684
Full text not available from this repository. (Request a copy)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.
Item Type: | Article |
---|---|
Faculty \ School: | Faculty of Science > School of Computing Sciences |
UEA Research Groups: | Faculty of Science > Research Groups > Computational Biology Faculty of Science > Research Groups > Interactive Graphics and Audio Faculty of Science > Research Groups > Data Science and Statistics Faculty of Science > Research Groups > Centre for Ocean and Atmospheric Sciences Faculty of Science > Research Groups > Smart Emerging Technologies |
Depositing User: | Vishal Gautam |
Date Deposited: | 25 Aug 2011 14:59 |
Last Modified: | 22 Apr 2023 23:43 |
URI: | https://ueaeprints.uea.ac.uk/id/eprint/23265 |
DOI: | 10.1016/S0165-1684(01)00054-8 |
Actions (login required)
View Item |