By Topic

A fast algorithm to compute band-limited interpolation from unevenly spaced sampled data using K-nearest neighbor search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lidicky, L. ; IRCTR, Delft Univ. of Technol., Netherlands ; Hoogeboom, P.

This paper presents an algorithm that performs one or two-dimensional interpolation under certain conditions. It is optimized for speed by means of taking advantage of some special cases, which occur in SAR signal processing. In SAR processing, one needs to interpolate data from non-uniformly sampled grid into a uniformly sampled one. Coordinates of non-uniform points are related to coordinates of uniform points via a known transformation. Further, it is assumed that the non-uniform sampling points are located on lines in parallel to one of the coordinates on a two-dimensional plane.

Published in:

Radar, 2006 IEEE Conference on

Date of Conference:

24-27 April 2006