An fast and efficient algorithm for spline filters

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Filtration is very important for surface texture characterization. Spline filters that include linear and robust filters are recommended by ISO/TS 16610-22 and 32. In this paper, a general algorithm for both the linear and the robust spline filters is presented. The main advantage of the proposed algorithm is its ability to produce different types of filters only by choosing different M-estimators as shown in this note. This proposed algorithm relies on the Cholesky decomposition technique with an improved memory management procedure. Experimental and simulated results show that the proposed algorithm is fast, efficient and stable.

Original languageEnglish
Title of host publicationICAC 2014 - Proceedings of the 20th International Conference on Automation and Computing: Future Automation, Computing and Manufacturing
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages237-242
Number of pages6
ISBN (Electronic)9781909522022
DOIs
Publication statusPublished - 24 Oct 2014
Event20th International Conference on Automation and Computing - Cranfield, United Kingdom
Duration: 12 Sep 201413 Sep 2014
Conference number: 20

Conference

Conference20th International Conference on Automation and Computing
Abbreviated titleICAC 2014
CountryUnited Kingdom
CityCranfield
Period12/09/1413/09/14

Fingerprint Dive into the research topics of 'An fast and efficient algorithm for spline filters'. Together they form a unique fingerprint.

  • Cite this

    Zeng, W., Jiang, X., Lou, S., & Scott, P. J. (2014). An fast and efficient algorithm for spline filters. In ICAC 2014 - Proceedings of the 20th International Conference on Automation and Computing: Future Automation, Computing and Manufacturing (pp. 237-242). [6935493] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IConAC.2014.6935493