Approximation and compression of scattered data by meshless multiscale decompositions
Applied and Computational Harmonic Analysis(2008)
摘要
We introduce a class of multiscale decompositions for scattered discrete data, motivated by sensor network applications. A specific feature of these decompositions is that they do not rely on any type of mesh or connectivity between the data points. The decomposition is based on a thinning procedure that organizes the points in a multiscale hierarchy and on a local prediction operator based on least-square polynomial fitting. We prove that the resulting multiscale coefficients obey the same decay properties as classical wavelet coefficients when the analyzed function has some local smoothness properties. This yields compression capabilities that we illustrate by numerical experiments.
更多查看译文
关键词
sensor network,least square
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要