Local cubic splines on non-uniform grids and real-time computation of wavelet transform
Averbuch, A., Neittaanmäki, P., Shefi, E., & Zheludev, V. (2017). Local cubic splines on non-uniform grids and real-time computation of wavelet transform. Advances in Computational Mathematics, 43(4), 733-758. https://doi.org/10.1007/s10444-016-9504-x
Published inAdvances in Computational Mathematics
© Springer Science+Business Media New York 2016. This is a final draft version of an article whose final and definitive form has been published by Springer. Published in this repository with the kind permission of the publisher.
In this paper, local cubic quasi-interpolating splines on non-uniform grids are described. The splines are designed by fast computational algorithms that utilize the relation between splines and cubic interpolation polynomials. These splines provide an efficient tool for real-time signal processing. As an input, the splines use either clean or noised arbitrarily-spaced samples. Formulas for the spline’s extrapolation beyond the sampling interval are established. Sharp estimations of the approximation errors are presented. The capability to adapt the grid to the structure of an object and to have minimal requirements to the operating memory are of great advantages for offline processing of signals and multidimensional data arrays. The designed splines serve as a source for generating real-time wavelet transforms to apply to signals in scenarios where the signal’s samples subsequently arrive one after the other at random times. The wavelet transforms are executed by six-tap weighted moving averages of the signal’s samples without delay. On arrival of new samples, only a couple of adjacent transform coefficients are updated in a way that no boundary effects arise. ...
PublisherSpringer New York LLC
Publication in research information system
MetadataShow full item record
Showing items with similar title or keywords.
Averbuch, Amir; Zheludev, Valery; Neittaanmäki, Pekka; Koren, Jenny (Springer, 2010)This paper presents robust algorithms to deconvolve discrete noised signals and images. The idea behind the algorithms is to solve the convolution equation separately in different frequency bands. This is achieved by using ...
Averbuch, Amir; Neittaanmäki, Pekka; Shabat, Gil; Zheludev, Valery (Yokohama Publishers, 2016)We present theory and algorithms for fast explicit computations of uni- and multi-dimensional periodic splines of arbitrary order at triadic rational points and of splines of even order at diadic rational points. The ...
Averbuch, Amir; Neittaanmäki, Pekka; Zheludev, Valery; Salhov, Moshe; Hauser, Jonathan (Elsevier, 2021)The paper presents a new algorithm for the image inpainting problem. The algorithm uses a recently designed versatile library of quasi-analytic complex-valued wavelet packets (qWPs) which originate from polynomial splines ...
Non-uniform displacement and strain between the soleus and gastrocnemius subtendons of rat Achilles tendon Finni Juutinen, Taija; Bernabei, Michel; Baan, Guus C.; Noort, Wendy; Tijs, Chris; Maas, Huub (Wiley-Blackwell Publishing Ltd., 2018)Achilles tendon (AT) comprises of 3 subtendons arising from the soleus (SOL) and the lateral (LG) and medial (MG) heads of the gastrocnemius muscle. While recent human studies show differential displacement within AT, these ...
Surrogate-assisted evolutionary biobjective optimization for objectives with non-uniform latencies Chugh, Tinkle; Allmendinger, Richard; Ojalehto, Vesa; Miettinen, Kaisa (Association for Computing Machinery (ACM), 2018)We consider multiobjective optimization problems where objective functions have different (or heterogeneous) evaluation times or latencies. This is of great relevance for (computationally) expensive multiobjective optimization ...