Share Email Print

Proceedings Paper

Optimal RASF filtering
Author(s): Heikki Huttunen; Pauli Kuosmanen; Jaakko T. Astola
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The recursive approaching signal filter (RASF) calculates the weights for each filtering window position from the difference of the original signal and a prefiltered signal. The original definition suggests the use of an exponential function for calculating the weights, but any nonincreasing function may be used as well. This paper addresses the problem of selecting the optimal one among them via empirical simulations applying the programming paradigm of genetic algorithms for the optimization problem. Furthermore, another modification to the RASF filter class taking advantage of a larger number of observations with smaller time complexity is proposed and thus a novel filter class is presented. The designed optimization scheme for finding the optimal weighting function is applied also to these filters and comparisons with the RASF filter are presented.

Paper Details

Date Published: 25 March 1996
PDF: 12 pages
Proc. SPIE 2662, Nonlinear Image Processing VII, (25 March 1996); doi: 10.1117/12.235827
Show Author Affiliations
Heikki Huttunen, Tampere Univ. of Technology (Finland)
Pauli Kuosmanen, Tampere Univ. of Technology (Finland)
Jaakko T. Astola, Tampere Univ. of Technology (Finland)

Published in SPIE Proceedings Vol. 2662:
Nonlinear Image Processing VII
Edward R. Dougherty; Jaakko T. Astola; Harold G. Longbotham, Editor(s)

© SPIE. Terms of Use
Back to Top