2007
DOI: 10.1109/lgrs.2007.895961
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Interpolation of SAR Images for Coregistration in SAR Interferometry

Abstract: An efficient polynomial interpolation method is proposed to reduce the computational burden of the coregistration of synthetic aperture radar images in interferometric processing. The method can be viewed as an application of the Farrow interpolator technique and requires a series of 2-D fast Fourier transforms (FFTs). Mainly, it has two advantages relative to the usual coregistration procedure. First, it does not require to compute or store in memory any kernel sample. Second, it involves less floating-point … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2007
2007
2018
2018

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 14 publications
0
9
0
Order By: Relevance
“…The relationship between the numerical accuracy and the computational burden has already been analyzed in [6]. For the numerical example in this paper (P = 10, B = 0.82/T ), figure 3 shows the number flops per interpolated point for the proposed and the conventional methods.…”
Section: Computational Burden Versus Accuracymentioning
confidence: 96%
See 2 more Smart Citations
“…The relationship between the numerical accuracy and the computational burden has already been analyzed in [6]. For the numerical example in this paper (P = 10, B = 0.82/T ), figure 3 shows the number flops per interpolated point for the proposed and the conventional methods.…”
Section: Computational Burden Versus Accuracymentioning
confidence: 96%
“…The Farrow interpolator in [4] has been recently applied to this interpolation problem in [5], [6]. When compared with the conventional interpolation method in (1), this technique eliminates the need to compute or store any set of functional weights g p (u), and exhibits a smaller computational burden.…”
Section: Interpolation Of One-dimensional Signals By Means Of Thementioning
confidence: 99%
See 1 more Smart Citation
“…The approach can be finally useful for interferometric coregistration applications [18,19,55] and also to quickly forming 3D SAR images [56].…”
Section: Conclusion and Future Developmentsmentioning
confidence: 99%
“…If a 2D space-domain interpolator is used, a conservative estimate for the interpolation proportionality factor is ¹ int = M r ¢ M ® =10, where M r and M ® are the number of neighbour samples used for the range and angle interpolation, respectively. The advantage of this kind of approache is that the ¹ int does not increase with increasing image sizes, like is the case if interpolators requiring FFTs are used (e.g., Farrow 2D [62], data upsampling + low-order interpolator). Fig.…”
Section: F Computational Burden and Memory Consumptionmentioning
confidence: 99%