On the coupling of decimation operator with subdivision schemes for multi-scale analysis

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Subdivision schemes [5, 11] are powerful tools for the fast generation of refined sequences ultimately representing curves or surfaces. Coupled with decimation operators, they generate multi-scale transforms largely used in signal/image processing [1, 3] that generalize the multi-resolution analysis/wavelet framework [8]. The flexibility of subdivision schemes (a subdivision scheme can be non-stationary, non-homogeneous, position-dependent, interpolating, approximating, non-linear..) (e.g. [3]) is balanced, as a counterpart, by the fact that the construction of suitable consistent decimation operators is not direct and easy. In this paper, we first propose a generic approach for the construction of decimation operators consistent with a given linear subdivision. A study of the so-called prediction error within the multi-scale framework is then performed and a condition on the subdivision mask to ensure a fast decay of this error is established. Finally, the cases of homogeneous Lagrange interpolatory subdivision, spline subdivision, subdivision related to Daubechies scaling functions (and wavelets) and some recently developed non stationary non interpolating schemes are revisited.

Cite

CITATION STYLE

APA

Kui, Z., Baccou, J., & Liandrat, J. (2017). On the coupling of decimation operator with subdivision schemes for multi-scale analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10521 LNCS, pp. 162–185). Springer Verlag. https://doi.org/10.1007/978-3-319-67885-6_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free