2011
DOI: 10.1007/bf03549534
|View full text |Cite
|
Sign up to set email alerts
|

Geometric Sampling of Infinite Dimensional Signals

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2015
2015

Publication Types

Select...
2
1

Relationship

3
0

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 31 publications
0
2
0
Order By: Relevance
“…More precisely, to construct a thick triangulation of a manifold, one chooses its vertices according to a (metric) sampling density given by its curvature. This is, by now, a subject explored (and exploited) in detail -see [71], [81], [85], [104], [88], [86], [101], [102].…”
Section: Computer Graphicsmentioning
confidence: 99%
“…More precisely, to construct a thick triangulation of a manifold, one chooses its vertices according to a (metric) sampling density given by its curvature. This is, by now, a subject explored (and exploited) in detail -see [71], [81], [85], [104], [88], [86], [101], [102].…”
Section: Computer Graphicsmentioning
confidence: 99%
“…Recently, driven mainly by what has become by now a common practice amongst the image processing community, namely to regard images as Riemannian manifolds embedded in higher dimensional spaces (usually R n or S n ) -see e.g. [22], [70], [64], [27], [55] -a geometric approach to sampling and its implications has emerged [26], [56], [57], [52].…”
Section: Introductionmentioning
confidence: 99%