1983
DOI: 10.1016/0734-189x(83)90026-9
|View full text |Cite
|
Sign up to set email alerts
|

Image reconstruction by parametric cubic convolution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
141
0
4

Year Published

1999
1999
2017
2017

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 311 publications
(147 citation statements)
references
References 5 publications
2
141
0
4
Order By: Relevance
“…Terrain correction is performed using the USGS 1-arc second National Elevation Dataset (NED) (Gesch et al, 2002) to improve geolocation accuracy. The selection of cubic convolution as a resampling strategy was based largely on the superior spatial accuracy it provides over nearest neighbor resampling (Shilen 1979;Park and Schowengerdt, 1982). This is of special concern when stacking multiple dates across many path/rows, as is the case with NLCD 2001.…”
Section: Preprocessingmentioning
confidence: 99%
“…Terrain correction is performed using the USGS 1-arc second National Elevation Dataset (NED) (Gesch et al, 2002) to improve geolocation accuracy. The selection of cubic convolution as a resampling strategy was based largely on the superior spatial accuracy it provides over nearest neighbor resampling (Shilen 1979;Park and Schowengerdt, 1982). This is of special concern when stacking multiple dates across many path/rows, as is the case with NLCD 2001.…”
Section: Preprocessingmentioning
confidence: 99%
“…Specifically (18) Proof: A basic application of Stirling's formula, , provides . Taking the logarithm of in (17), we readily obtain (18) after some manipulations which involve and .…”
Section: )mentioning
confidence: 99%
“…Others observed that what we will call "approximation order" improves quality [15]- [17]. An example is that of Keys' cubic kernel which has a free parameter; its optimization turns out to be the one that provides the highest approximation order [18]. In order to provide computationally efficient algorithms, these kernels were chosen to be piecewise-polynomial and of short support.…”
Section: Introductionmentioning
confidence: 99%
“…We took particular care in the interpolation algorithm to avoid creating some spurious lensing signal or introducing additional non-Gaussianities. We found that a parametric cubic interpolation scheme (Park & Schowengerdt 1983) fitted reasonably well. In addition, to avoid any loss of power due to the interpolation, we overpixellized twice the underlying unlensed temperature and deflection field.…”
Section: Lensed Cmb Temperature Mapmentioning
confidence: 80%