2011
DOI: 10.1007/s10208-011-9104-6
|View full text |Cite
|
Sign up to set email alerts
|

Normal Multi-scale Transforms for Curves

Abstract: Extending upon Daubechies et al. (Constr. Approx. 20:399-463, 2004) and Runborg (Multiscale Methods in Science and Engineering, pp. 205-224, 2005), we provide the theoretical analysis of normal multi-scale transforms for curves with general linear predictor S, and a more flexible choice of normal directions. The main parameters influencing the asymptotic properties (convergence, decay estimates for detail coefficients, smoothness of normal re-parametrization) of this transform are the smoothness of the curve,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 19 publications
0
4
0
Order By: Relevance
“…Similar conditions also appear in the convergence analysis of nonlinear subdivision schemes for manifold-valued data in [47,48]. In the context of nonlinear subdivision schemes, even more severe restrictions such as 'almost equally spaced data' are frequently required [26]. This imposes additional conditions on the second order differences to make the data almost lie on a 'line'.…”
Section: Convergencementioning
confidence: 83%
See 1 more Smart Citation
“…Similar conditions also appear in the convergence analysis of nonlinear subdivision schemes for manifold-valued data in [47,48]. In the context of nonlinear subdivision schemes, even more severe restrictions such as 'almost equally spaced data' are frequently required [26]. This imposes additional conditions on the second order differences to make the data almost lie on a 'line'.…”
Section: Convergencementioning
confidence: 83%
“…Then we can apply Remark 4.5 and conclude that the minimizer y * of J fulfills y * − f 2 ≤ ε < π 16 . By (26) we obtain…”
Section: Convergencementioning
confidence: 97%
“…This means that the data has to be locally nearby which does not mean that circular data components are (globally) restricted to certain sectors -the data in these components my wrap around. Similar restrictions on the nearness of data and even more severe restrictions requiring almost equidistant-data have been imposed in the analysis of nonlinear subdivision schemes; see, e.g., [46,82,84]. As it is also pointed out in these references, the analysis is qualitative in the sense that empirically convergence is observed for a significantly wider range of input data.…”
Section: Convergence Analysismentioning
confidence: 83%
“…As already pointed out, such restrictions on the nearness of data are typical for the analysis of algorithms of nonlinear data in general; cf. [6,46,82,84]. We note that d Ω ∞ (f ) depends on the chosen covering and that we suppress this dependence in the notation.…”
Section: Convergence Analysismentioning
confidence: 99%